PivotOJ

Snowball Fight

시간 제한: 1000ms메모리 제한: 1024MB출처: ICPC Rocky Mountain Regional 2021BOJ 24760

문제

\textit{Back in my day, we were allowed to have snowball fights during recess. Me and my two friends would split up, build a fort, and stock it with snowballs. When the fighting started, we threw snowballs at each other's forts until there was one left standing. Those were the days.}

There are three forts labelled A, B, and C that appear in a circle: with B to the left of A, C to the left of B, and A to the left of C.

The strengths of the forts are represented as nonnegative integers. If the strength of a fort is 00, then it is just rubble and the person in that fort no longer throws snowballs.

The fight proceeds in rounds. Each round, each person in a non-rubble fort picks a target. Their target is the fort with highest strength, apart from their own. If both possible targets have the same strength, the person chooses the fort on their left as the target. The people then simultaneously throw a single snowball at their chosen target. Each snowball reduces the strength of the target fort by 11. This repeats until there is at most one fort that is not reduced to rubble.

Given the initial strengths of the three forts, you are to determine if there is a fort that is not reduced to rubble and, if so, the remaining strength of that fort.

입력

Input contains a single line containing three integers NAN_A (1NA10181 \leq N_A \leq 10^{18}), which is the initial strength of fort A, NBN_B (1NB10181 \leq N_B \leq 10^{18}), which is the initial strength of fort B, and NCN_C (1NC10181 \leq N_C \leq 10^{18}), which is the initial strength of fort C.

출력

If all forts are reduced to rubble, display Rubble!. Otherwise, display A, B, or C indicating which fort was left standing followed by the remaining strength of that fort.

예제

예제 1

입력
10 3 1
출력
A 3

예제 2

입력
3 2 1
출력
Rubble!

예제 3

입력
2 3 2
출력
C 1

예제 4

입력
100 101 100
출력
A 1

예제 5

입력
100 99 100
출력
Rubble!

예제 6

입력
1000 5000 1000
출력
B 1001

예제 7

입력
2000 1000 1000
출력
C 1

예제 8

입력
1000000000000000 2000000000000000 4000000000000000
출력
B 1

예제 9

입력
1000000000000000 2000000000000000 4000000000000001
출력
Rubble!
코드를 제출하려면 로그인하세요.