Problem:


Score : 100 points

Problem Statement

AtCoder Inc. holds a contest every Saturday.

There are two types of contests called ABC and ARC, and just one of them is held at a time.

The company holds these two types of contests alternately: an ARC follows an ABC and vice versa.

Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.

Constraints

S is ABC or ARC.

Input

Input is given from Standard Input in the following format:

S

Output

Print the string representing the type of the contest held this week.

Sample Input 1

ABC

Sample Output 1

ARC

They held an ABC last week, so they will hold an ARC this week.



Sample input:
ABC


Sample output:
ARC

Submission status: Accepted

Solution code:
s = input()
# x = int(input())
# n,m,q = map(int, input().split())
# abcd = [map(int, input().split())for _ in range(q)]

# a = list(map(int, input().split()))


if s == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:

def resolve():
    S = input()
    if S=="ABC":
        print("ARC")
    else:
        print("ABC")

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
print("ABC" if input() == "ARC" else "ARC")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


def main():
    s = input().rstrip()
    print(['ABC', 'ARC'][s == "ABC"])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
if s=="ABC":
 print("ARC")
else:
 print("ABC")

Submission status: Accepted

Solution code:
S=input()


if S=='ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
S =input()
if S =="ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
def main():

    from bisect import bisect_left as bl, bisect_right as br, insort
    import sys,heapq,math
    from collections import defaultdict as dd, deque
    def data(): return sys.stdin.readline().strip()
    def mdata(): return list(map(int, data().split()))
    out = sys.stdout.write
    # sys.setrecursionlimit(100000)
    INF = int(1e9)
    mod = int(1e9)+7

    s=data()
    if s=='ABC':
        print('ARC')
    else:
        print("ABC")



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

S = input()

if S == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
import math
from collections import Counter
x=input()
if x=='ABC':
	print('ARC')
else:
	print('ABC')

Submission status: Accepted

Solution code:
import sys

S=input()

ans="ABC"
if S=="ABC":
    ans="ARC"

print(ans)

Submission status: Accepted

Solution code:
s=input()

if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

s = input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)


def main():
    S = input()
    if S == "ARC":
        print("ABC")
    else:
        print("ARC")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
#def main(S, b):
if __name__ == '__main__':
    #a, b, c, d = map(int, input().split())

    # x = int(input())
    #a, b = map(int, input().split())

    # a = list(map(int, input().split()))

    s = input()

    if (s == "ABC"):
        print("ARC")
    else:
        print("ABC")
    # s = sum(a)

    # flug = 1
    # for i in range(1000):
    #     if (k * i >= a and k * i <= b):
    #         flug = 0
    #         break
    # #print(n * 2 * pi)

    # if (flug == 1):
    #     print("NG")
    # else:
    #     print("OK")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

Submission status: Accepted

Solution code:
s = input().strip()

if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

def main():
    s = input()
    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
if S=="ABC":
    print("ARC")
elif S=="ARC":
    print("ABC")

Submission status: Accepted

Solution code:
s=input()
if s=='ABC':
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:


def main():
    
    S =input()

    if S=="ABC":
        print("ARC")
    else:
        print("ABC")

    return

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = input()

if(a =='ARC'):
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
mod = 10**9+7
import sys
from collections import Counter, defaultdict, deque
from itertools import product, permutations, combinations, combinations_with_replacement
from itertools import accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil,floor
from copy import deepcopy
from heapq import heappop,heappush,heapify
import heapq


# l = ['a', 'a', 'a', 'a', 'b', 'c', 'c']
# c = Counter(l)

# d = defaultdict(int)

sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1

# リストの要素を改行を挟んで表示する
p2D = lambda x: print(*x, sep="\n")
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())

def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

# 入力全てを整数に変換したものの配列を受け取る
# def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI(): return list(map(lambda x:int(x), sys.stdin.readline().split()))
def HI(): return list(map(lambda x:int(x)*(-1), sys.stdin.readline().split()))




s = input()
if s == 'ABC':
	print('ARC')
else:
	print('ABC')

Submission status: Accepted

Solution code:
s = input()
ans = "ABC" if s == "ARC" else "ARC"
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(S: str):
    if S == "ABC":
        print("ARC")
    else:
        print("ABC")
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = input()
if n == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
N = input()
if N =="ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(S: str):
    if S =="ABC":
        print("ARC")
    else:
        print("ABC")
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
if s[1]=="B":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
def main():
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
print('ABC') if s=='ARC' else print('ARC')

Submission status: Accepted

Solution code:

s = input()

print("ABC" if s == "ARC" else "ARC")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(S: str):
    if S == "ARC":
        print("ABC")
    else:
        print("ARC")
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

if s =="ABC":
    print('ARC')
else:
    print("ABC")

Submission status: Accepted

Solution code:
str=input()

if(str=="ABC"):
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    if s=="ABC":print("ARC")
    else:print("ABC")

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
if input() == "ARC":
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
import numpy as np
k = input()
if k == 'ABC':
      print('ARC')
else:
      print('ABC')

Submission status: Accepted

Solution code:
s = input()

if s=='ABC':
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
s = input()
if s == 'ABC': print('ARC')
else: print('ABC')

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi

MOD = 10 ** 9 + 7
INF = 10 ** 18
#
S = input()

print("ABC" if S == "ARC" else "ARC")

Submission status: Accepted

Solution code:
s = input()
if s=='ARC':
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
s = input("")
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
def main():
    if input() == "ABC":
        print("ARC")
    else:
        print("ABC")


main()

Submission status: Accepted

Solution code:

s=input()

if s=="ARC":
    print("ABC")

else:print("ARC")

Submission status: Accepted

Solution code:
n=input()

print("ABC" if n=="ARC" else "ARC")

Submission status: Accepted

Solution code:
import sys
import os

def file_input():
    f = open('../Beginner_Contest_/input.txt', 'r')
    sys.stdin = f

def main():
    #file_input()
    S=input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

    S = input()[:-1]

    if S == "ABC":
        print("ARC")
    else:
        print("ABC")
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s= input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = input()

if S[1]=='B':
  print('ARC')
else:
  print('ABC')

Submission status: Accepted

Solution code:
#!python3.8
# -*- coding: utf-8 -*-
# abc166/abc166_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    S=i2s()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
    return

main()

Submission status: Accepted

Solution code:
N = str(input())
if N == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)

def main():
    S = input()
    print('ARC' if S == 'ABC' else 'ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [[input().split()] for _ in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

s=s0()
if s=="ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
# coding: utf-8
str = input()
if str == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
#a
s = input()

if s == 'ABC':
    print('ARC')
    
else:
    print('ABC')

Submission status: Accepted

Solution code:
s = str(input())

if s == 'ABC':
    print('ARC')
    exit()

print('ABC')

Submission status: Accepted

Solution code:
s = input()

if s == 'ABC':
    print('ARC')
else :
    print('ABC')

Submission status: Accepted

Solution code:
Ss = input().rstrip()

if Ss == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

s = input().strip()

if s == 'ABC':
    print('ARC')
elif s == 'ARC':
    print('ABC')

Submission status: Accepted

Solution code:
def abc166_a():
  s = str(input())
  if s == 'ABC': print('ARC')
  else: print('ABC')

abc166_a()

Submission status: Accepted

Solution code:
def main():
    s = input()
    if s=='ABC':
        print('ARC')
    else:
        print('ABC')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
i = input()
if i == "ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
last = input()
if last == "ARC":
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
import sys
import itertools
import heapq
import numpy as np
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

S=input()
print('ARC' if S=='ABC' else 'ABC')

Submission status: Accepted

Solution code:
A = input()

if A == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
#########行列読み込み ##############################################
"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""
##################################################################
#########入力系####################################################
"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""
##################################################################

#########行列読み込み ##############################################
"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""
##################################################################
#########入力系####################################################
"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""
##################################################################n
s =input()
if s=="ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
x = input()

if x == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

s = S()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
def main():
    s = input()

    if s == 'ABC':
        print('ARC')
        exit()

    print('ABC')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = str(input())
if N == "ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
import itertools
import math
import numpy as np
import fractions
from collections import deque
from itertools import combinations
from functools import reduce
from functools import lru_cache
import bisect
import sys
import math
sys.setrecursionlimit(10**9)

def main():
    x = input()
    abc = "ABC"
    arc = "ARC"

    print(abc if x == arc else arc)

if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = str(input())

print("ABC" if S == "ARC" else "ARC")

Submission status: Accepted

Solution code:
a = input()
if a=='ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
s = str(input())
if s == 'ABC':
  print('ARC')
elif s == 'ARC':
  print('ABC')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


s = str(input())

if s == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
s = input()
r = 'ABC' if s == 'ARC' else 'ARC'
print(r)

Submission status: Accepted

Solution code:
import sys
import itertools
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
S=input()

if S=="ABC":
	print("ARC")
else:
	print("ABC")

Submission status: Accepted

Solution code:
S = input()

if S=="ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
S = str(input()).rstrip()
if S == 'ABC':
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math #math.factorial(n)
from copy import copy, deepcopy
from operator import itemgetter

from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque 
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを使うときはpython3を使う、pypyはダメ
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone

def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds

#mod = 10**9+7
#w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

#N = int(input())
#N, K = map(int, input().split())
#L = [int(input()) for i in range(N)]
#A = list(map(int, input().split()))
#S = [list(map(int, input().split())) for i in range(N)]


S=input()
if S=='ABC':print('ARC')
else: print('ABC')

Submission status: Accepted

Solution code:
n = input()
if n=="ARC":
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
l = input()
if 'R' in l:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:
s = input()
z = ['ARC','ABC']
z.remove(s)
print(z[0])

Submission status: Accepted

Solution code:
s = input()
if s=='ABC':
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
S = input()
if(S[1]=='B'):
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
S=str(input())
print("ABC" if S=="ARC" else "ARC")

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline

S = input().rstrip()

if S[1] == "B":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
print({"ABC": "ARC", "ARC": "ABC"}[input()])

Submission status: Accepted

Solution code:
s=input()
if(s=="ABC"):print("ARC")
else:print("ABC")

Submission status: Accepted

Solution code:
def A():
    S = input()
    if S == 'ARC':
        print('ABC')
    else:
        print('ARC')

A()

Submission status: Accepted

Solution code:
import math

#n = int(input())
#a, b = map(int, input().split())
#a, b, c = map(int, input().split())
#a, b, c, d = map(int, input().split())
#arr - list(map(int, input().split()))
s = input()
if s == 'ABC':
  print('ARC')
else:
  print('ABC')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)


def main():
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
N = str(input())
#S,T = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]

#cnt = 0
#cnt += 1


if N == "ABC":
    
    print("ARC")
else:
    print("ABC")
#print(S,T)
#print(A)
#print('Yes')
#print('No')
#print(cnt)

Submission status: Accepted

Solution code:
def main():
    s = input()
    if s == "ARC":
        print("ABC")
    else:
        print("ARC")
    

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = input()
if n == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
S = input()
if S == "ARC":
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
import sys
import math

S = str(input())

if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
str = input()
if(str == "ABC"):
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
s=input()[1]
print("ABC")if s=="R" else print("ARC")

Submission status: Accepted

Solution code:

K = input()

if (K == "ABC"):
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:

def main():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a= input()
if a == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
def solve():
    S = input()
    if S == "ABC":
        print("ARC")
    else:
        print("ABC")

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
def main():
    s = input()
    a = {'ABC', 'ARC'}
    a.discard(s)

    print(a.pop())


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

Solution code:
S = input()

if(S == "ABC"):
	print("ARC")
else:
	print("ABC")

Submission status: Accepted

Solution code:
s = input()
ans = 'ABC' if s=='ARC' else 'ARC'
print(ans)

Submission status: Accepted

Solution code:
i = input()
if i == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
date=input()
if date=="ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    s = input()
    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

if S == "ABC":
    print("ARC")
elif S == "ARC":
    print("ABC")

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest


def resolve():
    s = input()

    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """ABC"""
        output = """ARC"""
        self.assertIO(input, output)

if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
S = str(input())

if S[1] == 'R':
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
s=input()
if s=="ABC":
 	print("ARC")
else:
	print("ABC")

Submission status: Accepted

Solution code:
s = str(input())

if s=='ABC':
  print('ARC')
else:
  print('ABC')

Submission status: Accepted

Solution code:
# abc166 A

s = input()

if s == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n=input()
if(n=="ABC"):
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
S = input()
if S=='ABC':
  print('ARC')
elif S=='ARC':
  print('ABC')

Submission status: Accepted

Solution code:
s = input()
if(s=="ABC"):
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
a=(input())
if a=='ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
inp=input
li=list
iinp=lambda : int(inp())
ent=lambda : map(int,inp().split())
lient=lambda : [int(i) for i in inp().split()]
li0= lambda x: [0 for i in range(x)]
livalor=lambda valor,x: [valor for i in range(x)]
stent=lambda : [i for i in inp()]
filldp=lambda valor,x,y: [[valor for i in range(y)] for i in range(x)]

s=inp()
if s=='ABC': print("ARC")
else: print("ABC")

Submission status: Accepted

Solution code:
m=input()
print("ARC" if m=="ABC" else "ABC")

Submission status: Accepted

Solution code:
def main():
    s = input()
    if s=="ABC":
        print("ARC")
    else:
        print("ABC")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print('ABC')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import queue
import copy
import math
from collections import deque
import bisect
from decimal import Decimal

# そのまま入力文字列の入力
s = input()

print("ABC") if s == "ARC" else print("ARC")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

S = input()

if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
S = str(input())
print("ARC" if S == "ABC" else "ABC")

Submission status: Accepted

Solution code:
k = input()
if k=="ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys

DEBUG = False

def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep = " "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    c = read(str)
    if c == "ABC":
        print("ARC")
    else:
        print("ABC")
    pass


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = input()

if (S == 'ABC'):
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
n = input()

if n == 'ARC':
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
S = input()
ans = "ARC" if S=="ABC" else "ABC"
print(ans)

Submission status: Accepted

Solution code:
def main():
    import sys
    sys.setrecursionlimit(10**6)
    input = sys.stdin.readline
    S = input().strip()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k=str(input())
if k=='ARC':
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
a = input(str())

if a == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
print("ABC" if input()=="ARC" else "ARC")

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

S = str(input())

if S == "ABC":
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:

def resolve():
    print("ABC" if input()=="ARC" else "ARC")

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
if input() == "ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = input()[: -1]
if S == "ABC": print("ARC")
else: print("ABC")

Submission status: Accepted

Solution code:
# 2020/05/03
# AtCoder Beginner Contest 166 - A

# Input
s = input()

# Calc
if s[1] == 'B':
    ans = 'ARC'
else:
    ans = 'ABC'

# Output
print(ans)

Submission status: Accepted

Solution code:
S=input()
if(S[1]=="R"):
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
def solve():
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s=input()

if s=="ABC":
    print("ARC")
elif s=="ARC":
    print("ABC")

Submission status: Accepted

Solution code:
S = input().strip()

if S == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
#A
s = input()
if s == "ABC":
    print('ARC')
else:
    print('ABC')