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:
import sys, 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 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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

Submission status: Accepted

Solution code:
import sys

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


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    S=readline().strip()
    if S=="ABC":
        print("ARC")
    else:
        print("ABC")
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    # S = int(input())
    S = input()
    # A = list(map(int, input().split(' ')))
    
    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:
line = input()
if line=="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:
S = input()
ans = 'ABC' if S == 'ARC' else 'ARC'

print(ans)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
if(s[1]=='B'):
  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
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input() #sys.stdin.readlineは最後が改行
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    if(S=="ABC"):
        print("ARC")
    else:
        print("ABC")
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    S =     _in[0]   # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    s = 'ABC' if S=='ARC' else 'ARC'
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(s)

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

Submission status: Accepted

Solution code:
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

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

#処理内容
def main():
	S = input()
	if S == "ABC":
		print("ARC")
	else:
		print("ABC")
	




if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
MOD = 10 ** 9 + 7
INF = 10 ** 11
import sys
sys.setrecursionlimit(100000000)

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

Submission status: Accepted

Solution code:
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))

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

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

s = ns()
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:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

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

if __name__ =='__main__':
    main()

Submission status: Accepted

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

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=='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:
# A - A?C

S = input()

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    s=STR()
    if s=='ARC':
        print('ABC')
    else:
        print('ARC')
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def Int():
    return int(input())
def Ints():
    return map(int,input().split())
def IntList():
    return list(Ints())
def IntMat(N):
    return [IntList() for i in range(N)]

s = input()

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

Submission status: Accepted

Solution code:
import sys
import os
import math
import bisect
import collections
import itertools

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    s = iss()
    print('ABC' if s != 'ABC' else 'ARC')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()


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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

s = ns()

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

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)


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

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

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

Submission status: Accepted

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

@author: Kanaru Sato
"""

s = input()

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

Submission status: Accepted

Solution code:
import sys


sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():

    S = input()
    if S == "ARC": return "ABC"
    return "ARC"



if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    s = S()
    if s == 'ABC':
        print('ARC')
        return
    print('ABC')

main()

Submission status: Accepted

Solution code:
s = input()
if s[1] == 'R':
  print('ABC')
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, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

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

Submission status: Accepted

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

Submission status: Accepted

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

s = readline().rstrip().decode()
if s[1] == 'B':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import sys
input=lambda: sys.stdin.readline().rstrip()
S=input()
if S=="ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit

setrecursionlimit(10 ** 7)

s = stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
# import sys
# input = sys.stdin.readline
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:
# -*- coding: utf-8 -*-
s = input()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
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()))

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 statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    S = input()
    print('ARC' if S == 'ABC' else 'ABC')
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def input():
    return stdin.readline()[:-1]

def main():
    from builtins import int, map
    S = input()
    if S == 'ABC':
        print("ARC")
    else:
        print("ABC")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353



S = sys.stdin.buffer.readline().decode().rstrip()
if S=='ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
"""
じょえチャンネルおもしろいよ～～～
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S =map(int, input().split(""))
if S = "ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Runtime Error

Solution code:
S =map(int, input().split())
if S = "ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
H = list(map(int, input().split()))
AB = [sorted(list(map(int,input().split())))for i in range(M)]
AB.sort()
good = [True]*N
j = 0
for i in range(N):
    if not good[i]:
        continue
    while j < M:
        a,b = AB[j]
        if a+1 == i:
            if H[i] > H[b-1]:
                good[b-1] = False
            else:
                good[i] = False
            j +=1
        else:
            break
#print(good)
print(good.count(True))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
n,k = map(int, input().split())
num = []

for i in range(k):
  d = int(input())
  num += list(map(int, input().split()))

Q = list(set(num))
print(n-len(Q))

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
num=[]

for i in range(k):
  d=int(input())
  num+=list(map(int,input().split()))

Q=list( set (num))
print(n-len(Q))

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
num=[]

for i in range(k):
  d=int(input())
  num+=list(map(int,input().split()))

Q=list(set(num))
print(n-len(Q))

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
H = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(M)]
 
ans = 0
for i in range(1, N+1):
  # ノードi(=1,...,N)と結合しているノードを全て求め、connectに格納
  connect = []
  for j in range(M):
    if i in l[j]:
      if i == l[j][0]: connect.append(l[j][1])
      else: connect.append(l[j][0])
  
  # ノードiの標高が、結合している任意のノードの標高より高いなら ans += 1
  n = 0
  for c in connect:
    if H[i-1] > H[c-1]: n += 1
  if n == len(connect): ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
a、b  =  map（int、input（）。split（））
印刷（a  *  b）

Submission status: Runtime Error

Solution code:
#include <iostream>
2 using namespace std;
3 int main(){
4 string s;
5 cin >> s;
6 if(s == "ABC"){
7 cout << "ARC" << endl;
8 }else{
9 cout << "ABC" << endl;
10 }
11 }

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# ABC が開催された次の週には ARC が開催され、ARC が行われた次の週には ABC が開催
# 先週開催されたコンテストを表す文字列Sが与えられる
# 制約: S は ABC または ARC
# S = 'ABC'

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

Submission status: Runtime Error

Solution code:
# コンテスト名の要求
S =　input()
 
# 入力されたコンテストではないものを出力
if S == "ABC":
    print("ARC")
elif S == "ARC":
    print("ABC")
else:
    print("入力内容が正しくありません。")

Submission status: Runtime Error

Solution code:
# コンテスト名の要求
S =　input()
 
# 入力されたコンテストではないものを出力
if S == "ABC":
    print("ARC")
elif S == "ARC":
    print("ABC")

Submission status: Runtime Error

Solution code:
# コンテスト名の取得
S =　input()
 
# 入力されたコンテストではないものを出力
if S == "ABC":
  print("ARC")
elif　S == "ARC":
  print("ABC")

Submission status: Runtime Error

Solution code:
# コンテスト名の要求
S =　input()

# 入力されたコンテストではないものを出力
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
print(f"A{["B", "R"][input()[1] == "B"]}C")

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
for okashi_number in range(k):
	di = int(input())
	D = map(int,input().split())
	for x in range(di)
		A[[x]-1] = 1

for i in range(N):
	if A[i] == 0:
	print(A[i])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (int)(n); i++)
const ld pi=3.14159265358979323846;
 
int main() {
    string s;
    cin>>s;
    if (s=="ABC"){
        cout<<"ARC"<<endl;
    }
    else{
        cout<<"ABC"<<endl;
    }
}

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input('ABC、ARCのどちらかを入力してください：')

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()

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

Submission status: Runtime Error

Solution code:
    s = raw_input()
    # a, b = s.split(' ')
    # a, b = int(a), int(b)


    def mul(s):
        if s != "ARC" or s != "ABC":
            return None
        return {"ARC":"ABC","ABC":"ARC"}[s]

    print mul(s)

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
h = list(map(int, input().split()))
p = [False] + [True]*n
A = []
B = []
for i in range(m):
    a, b = map(int,input().split())
    A.append(a)
    B.append(b)

for i in range(m):
    if h[A[i] - 1] > h[B[i] - 1]:
        p[B[i]] = False
    if h[A[i] - 1] < h[B[i] - 1]:
        p[A[i]] = False
    else:
        p[A[i]] = False
        p[B[i]] = False

ans = [i for i in range(n + 1) if p[i]]

print(len(ans))

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
m = [True]*n

for i in range(k):
    d = int(input())
    a = (list(map(int, input().split())))
    for j in a:
        m[j-1] = False
        
ans = [i for i in range(n) if m[i]]
print(len(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, M = list(map(int, input().split()))

H = list(map(int, input().split()))

ans = [1]*N

for i in range(M):
    A, B = list(map(int, input().split()))
    if H[A-1] > H[B-1]:
        ans[B-1] = 0
    elif H[A-1] < H[B-1]:
        ans[A-1] = 0
    else:
        ans[A-1] = 0
        ans[B-1] = 0

print(sum(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print {'ABC':'ARC', 'ARC', 'ABC'}[raw_input()]

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x,y = map(int, input().split())
count = 0

if y >= 2*x and y <= 4*x and y % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
list_a=[]
for d in range(k):
  d=int(input())
  a=list(map(int,input().split()))
  list_a.extend(a)
ans=0
for i in range(1,n): 
 if list_a.count(i)==0:
      ans+=1
print(ans)