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:
#A問題
S = input().split()
if(S[0] == "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:
S=input()
if S[1] == 'B':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

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

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:
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:
S = input()

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

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

Submission status: Accepted

Solution code:
N = input()#文字

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()

ans = ''

if s == 'ABC' :
    ans = 'ARC'
else :
    ans = 'ABC'

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

s = input()

if s == "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:
X = input()

if X == "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()

ans = 'ARC'

if s == 'ARC':
  ans = 'ABC'

print(ans)

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[1] == 'B':
  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:
N = str(input())

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 166: A (2020/05/03)
S = str(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:
s = input()

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
n = stdin.readline().rstrip()
if n == '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:
S = input()
# N = int(input())
# A, B = map(int, input().split(' '))

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

Submission status: Accepted

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


def solve(S: str):
    print('ABC' if S == 'ARC' else '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:
a=input()

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

Submission status: Accepted

Solution code:
import os

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

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun May  3 20:56:26 2020
"""

import sys
#import numpy as np

sys.setrecursionlimit(10 ** 9)
#def input():
#    return sys.stdin.readline()[:-1]
mod = 10**9+7

S = input()

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

Submission status: Accepted

Solution code:
def calc(S):
    if S == 'ABC':
        return 'ARC'
    else:
        return 'ABC'


S = input()
print(calc(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    #H, W = map(int, input().split())
    S = str(input())
    if S == "ABC" :
        print("ARC")
    elif S == "ARC" :
        print("ABC")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

if __name__ == '__main__':
    a = input()
    if a=="ABC":
        print("ARC")
    else:
        print("ABC")

Submission status: Accepted

Solution code:
#input
S = str(input())

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

Submission status: Accepted

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

solution()

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]


S = str(input())
if(S=="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:
s = input()
print('ABC') if s == 'ARC' else print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


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

main()

Submission status: Accepted

Solution code:
import sys

def main():
    S = input()

    if S == 'ABC':
        ans = 'ARC'
    else:
        ans = 'ABC'

    print(ans)
    return

if __name__ == '__main__':
    main()
    sys.exit(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
print(S[0]+("R" if S[1]=="B" else "B")+S[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

# 文字列の入力
s = input()
# 出力
if s == 'ABC':
    print('ARC')
elif s == 'ARC':
    print('ABC')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    # 整数 1 つ
    n = input()
    # 整数複数個
    # a, b, c = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

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

 #   print("n")

resolve()

Submission status: Accepted

Solution code:
def main():
    s = input()
    ans = solve(s)
    print(ans)


def solve(s):
    ans = 'ABC' if s == 'ARC' else 'ARC'
    return ans


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
# = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]

if S =="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:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

d = {'ABC': 'ARC', 'ARC': 'ABC'}

print(d[S])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
#import math
S=input()
#int(input())
#map(int,input().split())
#list(map(int,input().split()))
#[input() for _ in range()]

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

Submission status: Accepted

Solution code:
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools
import fractions

t = stdin.readline().rstrip()
if t == '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 resolve():
    s = input()
    print("ABC" if s == "ARC" else "ARC")


if __name__ == '__main__':
    resolve()

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()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
# A = map(int,input().split())

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

Submission status: Accepted

Solution code:
import sys,math,copy,queue,itertools,bisect,collections
from heapq import *
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(-1,0),(0,1),(0,-1))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S =str(input())

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

Submission status: Accepted

Solution code:
K = input()

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

Submission status: Accepted

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


ans = ''

if s == 'ABC':
    ans = 'ARC'
else:
    ans = 'ABC'

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

s = input().rstrip()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
k = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    S = SI()
    if S=="ARC":
        ans = "ABC"
    else:
        ans = "ARC"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(readline())
def LI(): return list(map(int,readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    s = kwargs["s"]

    if s == 'ABC':
        res = 'ARC'
    else:
        res = 'ABC'

    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    kwargs["s"] = cin[0]
    #kwargs["n"], kwargs["k"] = cin
    #kwargs["n"] = [int(i) for i in cin][0]
    #kwargs["n"], kwargs["k"] = [int(i) for i in cin]

    cout = main(kwargs)
    print(cout)

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

ans = "ABC"

if a == "ABC":
    ans = "ARC"

print(ans)

Submission status: Accepted

Solution code:
def main():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")
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=="ARC":
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()

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

else:
    print("ABC")

Submission status: Accepted

Solution code:
from sys import stdin
S = (stdin.readline().rstrip())
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:
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')
    
else:
    print('ABC')

Submission status: Accepted

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
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
    print(solve(S))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    #test()
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if input()=="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:
print('ABC' if input()=='ARC' else'ARC')

Submission status: Accepted

Solution code:
n = input()

if n[1] == 'B':
  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":
    ans = "ARC"
else:
    ans = "ABC"
print(ans)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
#N, A, B = map(int, input().split())
S = input()

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

#print()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
#import collections
# c = collections.Counter()
#import itertools as it
#import math
#import numpy as np
#import sys 
#sys.exit()
 
s = input()
#k = int(input())
#a, b  = map(int, input().split())
'''
#  = list(map(int, input().split()))
'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
'''
 
#-------------------------------#
 
if s=='ABC':
	print('ARC')
else:
  	print('ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import numpy as np 
import math

S = str(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")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
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:
s = input()
if s=='ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
#     combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def readInt():
    return list(map(int,input().split()))

def main():
    s = input()
    if s[1]=='B':
        print("ARC")
    else:
        print("ABC")
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def main():
    S = read().strip().decode()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
    return

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:
def task(s):
    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')


s = input()
task(s)

Submission status: Accepted

Solution code:
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:
a = input()
if a=="ARC":
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
#! python3

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

main()

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit

setrecursionlimit(10 ** 9)


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


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

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=="ARC":

    print("ABC")

else:
    print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

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 resolve():
    s = input()
    if s == 'ABC':
        print('ARC')

    else:
        print('ABC')
        
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from math import log2,floor,ceil,sqrt
# import bisect
# from collections import deque

Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
 
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')
INF = 10 ** 18
MOD = 10**9+7

st  = ri()
if st == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

Submission status: Accepted

Solution code:
if(input()=="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:
if __name__ == "__main__":
    s = input()
    print("ABC" if s == "ARC" else "ARC")

Submission status: Accepted

Solution code:
import sys

s = sys.stdin.readline().rstrip()
def main():
    print('ABC' if s == 'ARC' else '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=="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:

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:
import sys
input = sys.stdin.readline

#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

s=input().rstrip("\n")
if s=="ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

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


if __name__ == '__main__':
    print(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[1]=="B":
    s="ARC"
else:
    s="ABC"
print(s)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')


main()

Submission status: Accepted

Solution code:
x = str(input())

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

Submission status: Accepted

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