Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N,P = map(int, input().split())

count = 1
ans = 0

if N > 1000001:
    print(1)
    exit()

while True:

    if count**N > P:
        break

    if P % count**N == 0:
        ans = count

    count += 1
 
print(ans)

Fixed submission:
N,P = map(int, input().split())

count = 1
ans = 0

if N == 1:
    print(P)
    exit()

if N > 1000001:
    print(1)
    exit()

while True:

    if count**N > P:
        break

    if P % count**N == 0:
        ans = count

    count += 1
 
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N,P = map(int, input().split())

count = 1
ans = 0

if N > 1000001:
    print(1)
    exit

while True:
    
    if count**N > P:
        break

    if P % count**N == 0:
        ans = count

    count += 1
 
print(ans)

Fixed submission:
N,P = map(int, input().split())

count = 1
ans = 0

if N == 1:
    print(P)
    exit()

if N > 1000001:
    print(1)
    exit()

while True:

    if count**N > P:
        break

    if P % count**N == 0:
        ans = count

    count += 1
 
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N,P = map(int, input().split())

count = 1
ans = 0

while True:
    if count**N > P:
        break

    if P % count**N == 0:
        ans = count

    count += 1
 
print(ans)


Fixed submission:
N,P = map(int, input().split())

count = 1
ans = 0

if N == 1:
    print(P)
    exit()

if N > 1000001:
    print(1)
    exit()

while True:

    if count**N > P:
        break

    if P % count**N == 0:
        ans = count

    count += 1
 
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
S = input()

flag = True

count = 0

while flag:
    M = S
    S = S.replace("BW", "WB", 1)
    if M == S:
        flag = False
    else:
        count += 1

print(count)

Fixed submission:
S = input()

count = 0

BC = 0

for i in range(len(S)):
    S1 = S[i:i+1]
    if S1 == "B":
        BC += 1
    
    if BC > 0 and S1 == "W":
        count += BC

print(count)
Buggy python submission (verdict: Runtime Error):
a, b = (int(i) for i in input().split()) 

list=[]
 
for i in range(a):
    list.append(int(input()))

new_list = sorted(list)

sabun = None

for i in range(len(new_list)-1):

    if i+b == len(new_list):
        break

    bbb = new_list[i+b-1] - new_list[i]

    if sabun == None:
        sabun = bbb
        continue

    if sabun > bbb:
        sabun = bbb
    
print(sabun)

Fixed submission:
n = int(input())

if n == 25:
    print("Christmas")

if n == 24:
    print("Christmas Eve")

if n == 23:
    print("Christmas Eve Eve")

if n == 22:
    print("Christmas Eve Eve Eve")
Buggy python submission (verdict: Runtime Error):
a, b = (int(i) for i in input().split()) 

list=[]
 
for i in range(a):
    list.append(int(input()))

new_list = sorted(list)

sabun = None

for i in range(len(new_list)-1):

    if b - i < 1:
        break

#    if i+b-1 > len(new_list):
#        break

    bbb = new_list[i+b-1] - new_list[i]

    if sabun == None:
        sabun = bbb
        continue

    if sabun > bbb:
        sabun = bbb
    
print(sabun)

Fixed submission:
a, b = (int(i) for i in input().split()) 

list=[]
 
for i in range(a):
    list.append(int(input()))

new_list = sorted(list)

sabun = None

for i in range(len(new_list)):

    bbb = new_list[i+b-1] - new_list[i]

    if sabun == None:
        sabun = bbb
        continue

    if sabun > bbb:
        sabun = bbb

    if i+b == len(new_list):
        break
    
print(sabun)

Buggy python submission (verdict: Runtime Error):
a, b = (int(i) for i in input().split()) 

list=[]
 
for i in range(a):
    list.append(int(input()))

new_list = sorted(list)

sabun = None

for i in range(len(new_list)):

    if b - i < 1:
        break

    bbb = new_list[i+b-1] - new_list[i]

    if sabun == None:
        sabun = bbb
        continue

    if sabun > bbb:
        sabun = bbb
    
print(sabun)

Fixed submission:
a, b = (int(i) for i in input().split()) 

list=[]
 
for i in range(a):
    list.append(int(input()))

new_list = sorted(list)

sabun = None

for i in range(len(new_list)):

    bbb = new_list[i+b-1] - new_list[i]

    if sabun == None:
        sabun = bbb
        continue

    if sabun > bbb:
        sabun = bbb

    if i+b == len(new_list):
        break
    
print(sabun)

Buggy python submission (verdict: Runtime Error):
a, b = (int(i) for i in input().split()) 

list=[]
 
for i in range(a):
    list.append(int(input()))

new_list = sorted(list)

sabun = None

for i in range(len(new_list)):

    if b - i < 1:
        break

    bbb = new_list[i+b-1] - new_list[i]

    if sabun == None:
        sabun = bbb
        continue

    if sabun > bbb:
        sabun = bbb
    
print(sabun)

Fixed submission:
a, b = (int(i) for i in input().split()) 

list=[]
 
for i in range(a):
    list.append(int(input()))

new_list = sorted(list)

sabun = None

for i in range(len(new_list)):

    bbb = new_list[i+b-1] - new_list[i]

    if sabun == None:
        sabun = bbb
        continue

    if sabun > bbb:
        sabun = bbb

    if i+b == len(new_list):
        break
    
print(sabun)
Buggy python submission (verdict: Runtime Error):
a, b = (int(i) for i in input().split()) 

pan = "P"

for i in range(a):
    pan = "B" + pan + "P" + pan + "B"

count = 0

for i in range(b):
    if "P" == pan[i]:
        count += 1

print(count)

Fixed submission:
N, X = map(int, input().split())

a, p = [1], [1]
for i in range(N):
    a.append(a[i] * 2 + 3)
    p.append(p[i] * 2 + 1)

def f(N, X):
    if N == 0:
        return 0 if X <= 0 else 1
    elif X <= 1 + a[N-1]:
        return f(N-1, X-1)
    else:
        return p[N-1] + 1 + f(N-1, X-2-a[N-1])


print(f(N,X))
Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())

count = 0

for i in range(x+1):
    y = str(i)

    hako = []
    for k in range(10):
        hako.append(0)

    for j in range(len(y)):
        if y[j] == '0':
            hako[0] += 1
        if y[j] == '1':
            hako[1] += 1
        if y[j] == '2':
            hako[2] += 1
        if y[j] == '3':
            hako[3] += 1
        if y[j] == '4':
            hako[4] += 1
        if y[j] == '5':
            hako[5] += 1
        if y[j] == '6':
            hako[6] += 1
        if y[j] == '7':
            hako[7] += 1
        if y[j] == '8':
            hako[8] += 1
        if y[j] == '9':
            hako[9] += 1

    if hako[0] >= 1 or hako[1] >= 1 or hako[2] >= 1 or hako[4] >= 1 or hako[6] >= 1 or hako[8] >= 1 or hako[9] >= 1:
        continue

    if hako[3] >= 1 and hako[5] >= 1 and hako[7] >= 1:
        count += 1

print(count)

Fixed submission:
N = int(input())

def dfs(s): # 文字列 s で始まる七五三数の個数
    if int(s) > N:
        return 0
    ret = 0
    flag = True
    for c in '753':
        if s.count(c) == 0:
            flag = False
    if flag:
        ret = 1
    for c in '753':
        ret += dfs(s + c)
    return ret

print(dfs("0"))
Buggy python submission (verdict: Runtime Error):
N = int(input())

XYHA = []

for i in range(N):
    x,y,h = map(int,input().split())
    if h == 0:
        N -= 1
        continue
    XYHA.append([x,y,h])

for i in range(101):
    for j in range(101):
        HC = XYHA[0][2] + abs(XYHA[0][0] - i) + abs(XYHA[0][1] - j)

        for k in range(1, N):
            H = XYHA[k][2] + (XYHA[k][0] - i) + abs(XYHA[k][1] - j)

            if HC != H:
                break

            if k == N - 1:
                print(i,j,HC)
                exit()
print(0,0,0)

Fixed submission:
n = int(input())

if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())

    print(a + b)
Buggy python submission (verdict: Runtime Error):
n, k = [int(i) for i in input().split()]
ds = []
As = []
for i in range(2*k):
    ds.append(int(input()))
    As += [int(j) for j in input().split()]
 
 
print(n-len(set(As)))

Fixed submission:
n, k = [int(i) for i in input().split()]
ds = []
As = []
for i in range(k):
    ds.append(int(input()))
    As += [int(j) for j in input().split()]
 
 
print(n-len(set(As)))

Buggy python submission (verdict: Runtime Error):
n, k = [int(i) for i in input().split()]
ds = []
As = ()
for i in range(2*k):
    ds.append(int(input()))
    As += set([int(j) for j in input().split()])


print(n-len(As))

Fixed submission:
n, k = [int(i) for i in input().split()]
ds = []
As = []
for i in range(k):
    ds.append(int(input()))
    As += [int(j) for j in input().split()]
 
 
print(n-len(set(As)))
Buggy python submission (verdict: Runtime Error):
 dic = {"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(dic[str(input())])

Fixed submission:
inp = str(input())

dic = { "SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3, "FRI":2, "SAT":1}
print(dic.get(inp))
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
sat = 0

for i in a:
  sat += b[i]
  pre = i
  if pre + 1 == i:
    sat += c[pre]

print(sat)  

Fixed submission:
N = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
sat = 0

pre = -1
for i in a:
  sat += b[i-1]
  #print(b[i-1])
  if pre + 1 == i:
    sat += c[pre-1]
    #print("c", c[pre-1])
  pre = i
print(sat)
Buggy python submission (verdict: Runtime Error):
from sys import stdin

a = list(map(char, input().split()))
b = list(map(char, input().split()))

def rot(a,b):
  if a[0] == b[2]:
    if a[1]==b[1]:
      if a[2]==b[0]:
        return 'YES'
  return 'NO'

print(rot(a,b))

Fixed submission:
from sys import stdin

a = list(input())
b = list(input())

def rot(a,b):
  if a[0] == b[2]:
    if a[1]==b[1]:
      if a[2]==b[0]:
        return 'YES'
  return 'NO'

print(rot(a,b))

Buggy python submission (verdict: Runtime Error):
from sys import stdin

a = list(map(char, input().split()))
b = list(map(char, input().split()))

def rot(a,b):
  if a[0] == b[2]:
    if a[1]==b[1]:
      if a[2]==b[0]:
        return 'YES'
  return 'NO'

rot(a,b)

Fixed submission:
from sys import stdin

a = list(input())
b = list(input())

def rot(a,b):
  if a[0] == b[2]:
    if a[1]==b[1]:
      if a[2]==b[0]:
        return 'YES'
  return 'NO'

print(rot(a,b))

Buggy python submission (verdict: Runtime Error):
a = {int(s) for s in input().split()}
b = {int(s) for s in input().split()}

c = 0
for i in range(3):
  if a[i] == b[2-i]:
    c += 1
  else:
    print('NO')
    break
    
if c == 2:
	print('YES')
      


Fixed submission:
from sys import stdin

a = list(input())
b = list(input())

def rot(a,b):
  if a[0] == b[2]:
    if a[1]==b[1]:
      if a[2]==b[0]:
        return 'YES'
  return 'NO'

print(rot(a,b))
Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

K = int(input())

sum = 0

for a in range(1, K+1):
    for b in range(1, K+1):
        for c in range(1, K+1):
            sum += gcd(a,b,c)

print(sum)


Fixed submission:
import math
from functools import reduce
import time

K = int(input())

def gcd(*numbers):
    return reduce(math.gcd, numbers)

sum = 0

for a in range(1, K+1):
    for b in range(a, K+1):
        for c in range(b, K+1):
            G = gcd(a,b,c)
            if a == b and b == c:
                sum += G
            elif a == b or b == c:
                sum += G*3
            else:
                sum += G*6

print(sum)
Buggy python submission (verdict: Runtime Error):
S = input()
if S[0] == S[1] and S[1] == S[2]:
  print('No')
else
  print('Yes')


Fixed submission:
S = input()
if S[0] == S[1] and S[1] == S[2]:
  print('No\n')
else:
  print('Yes\n')

Buggy python submission (verdict: Runtime Error):
if S[0] == S[1] == S[2]:
  print('No')
else
  print('Yes')

Fixed submission:
S = input()
if S[0] == S[1] and S[1] == S[2]:
  print('No\n')
else:
  print('Yes\n')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    print(A.count(i+1))

Fixed submission:
import collections
N = int(input())
A = list(map(int, input().split()))

c = collections.Counter(A)

for i in range(N):
    print(c[i+1])
Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

x = 0
n = int(input())+1

for i in range(1,n):
    for j in range(1, n):
        for k in range(1, n):
            x += int(gcd(i,j,k))
print(x)

Fixed submission:
from math import gcd

x = 0
n = int(input())+1
 
for i in range(1,n):
    for j in range(1, n):
        for k in range(1, n):
            x += gcd(gcd(i,j), k)
 
print(x)

Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

x = 0
n = int(input())+1

for i in range(1,n):
    for j in range(1, n):
        for k in range(1, n):
            x += gcd(i,j,k)

print(x)

Fixed submission:
from math import gcd

x = 0
n = int(input())+1
 
for i in range(1,n):
    for j in range(1, n):
        for k in range(1, n):
            x += gcd(gcd(i,j), k)
 
print(x)
Buggy python submission (verdict: Runtime Error):
n = int(input())
while n % 111 != 0:
    x = n+1
    n += 1
print(x)

Fixed submission:
n = int(input())
if n % 111 == 0:
    x = n
while n % 111 != 0:
    x = n+1
    n += 1

print(x)
Buggy python submission (verdict: Time Limit Exceeded):
x = 1
y = []
for i in range(1, int(input())+1):
    x = x * i
    y.append(x)
print(max(y)%((10**9)+7))


Fixed submission:
x = 1
for i in range(1, int(input())+1):
    x = x * i
    x = x % (10**9 + 7)
print(x)
Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
x = int(input())
y = int(input())
z = 0
for i in range(n):
  if i >= k:
    z += y
  else:
    z += x
    
 print(z)

Fixed submission:
n = int(input())
k = int(input())
x = int(input())
y = int(input())
z = 0
for i in range(n):
    if i >= k:
        z += y
    else:
        z += x

print(z)
Buggy python submission (verdict: Runtime Error):
N = int(input())
As = [int(n) for n in input().split()]
# len(As) = N
# Ai = 身長
c = 0
for i, ai in enumerate(As):
    # i + ai = 最低これだけ先が無いとダメ
    j0 = i + ai
    if j0 >= N-1:
        continue
    j = 1
    l = N - j0 - 1
    while l > 0:
        if j == As[j0+j]:
            c += 1
        j+=1
        l-=1
print(c)

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

Buggy python submission (verdict: Runtime Error):
import numpy 
x = int(input())
max = 10**9+1
flag = False
for i in range(1,max):
    if x%i == 0:
        for j in range(-i,i+1): 
            if (numpy.power(i-j,5) - numpy.power(j,5)) == x:
                print(str(i-j)+" "+str(j))
                flag = True
                break
    if flag:
        break

Fixed submission:
s = input()

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

Buggy python submission (verdict: Runtime Error):
x = int(input())
max = 10**9+1
flag = False
for i in range(1,max):
    if x%i == 0:
        for j in range(-i-1,i+1):
            tmp = (i-j)**5 - j**5
            if tmp == x:
                print(str(i-j)+" "+str(j))
                flag = True
                break
    if flag:
        break

Fixed submission:
s = input()

if s == "ABC":
    print("ARC")
else:
    print("ABC")
Buggy python submission (verdict: Runtime Error):
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
print(ret)


Fixed submission:
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in itertools.combinations(range(l,r+1,1),2):
        ret = min(ret,(i[0]*i[1])%2019)
    print(ret)

Buggy python submission (verdict: Runtime Error):
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:

    ret = 2020
    for i in itertools.combinations(range(l,r+1,1),2):
        ret = min(ret,(i[0]*i[1])%2019)
        print(i,ret)
print(ret)


Fixed submission:
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in itertools.combinations(range(l,r+1,1),2):
        ret = min(ret,(i[0]*i[1])%2019)
    print(ret)

Buggy python submission (verdict: Runtime Error):
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    import itertools
    ret = 2020
    for i in itertools.combinations(list(range(l,r+1,1)),2):
        ret = min(ret,(i[0]*i[1])%2019)
       #print(i,ret)

print(ret)


Fixed submission:
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in itertools.combinations(range(l,r+1,1),2):
        ret = min(ret,(i[0]*i[1])%2019)
    print(ret)

Buggy python submission (verdict: Runtime Error):
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in range(l,r+1,1):
        for j in range(l,r+1,1):
            if i == j:
                continue
            ret = min(ret,(i*j)%2019)
print(ret)


Fixed submission:
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in itertools.combinations(range(l,r+1,1),2):
        ret = min(ret,(i[0]*i[1])%2019)
    print(ret)

Buggy python submission (verdict: Runtime Error):
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in range(l,r+1,1):
        for j in range(l,r+1,1):
            ret = min(ret,(i*j)%2019)

print(ret)


Fixed submission:
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in itertools.combinations(range(l,r+1,1),2):
        ret = min(ret,(i[0]*i[1])%2019)
    print(ret)

Buggy python submission (verdict: Runtime Error):
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in range(l,r+1,1):
        for j in range(l,r+1,1):
            ret = min(ret,i*j%2019)

print(ret)


Fixed submission:
import itertools
l,r = map(int,input().split(" "))

if r-l > 2019:
    print(0)
else:
    ret = 2020
    for i in itertools.combinations(range(l,r+1,1),2):
        ret = min(ret,(i[0]*i[1])%2019)
    print(ret)
Buggy python submission (verdict: Runtime Error):
import math 
a,b,c,d = map(int,input().split(" "))
count = 0

u = b - a + 1

cd = c * d // math.gcd(c, d)

c_num = b//c - (a-1)//c
d_num = b//d - (a-1)//d
cd_num = b//cd - (a-1)//cd

print(u - (c_num + d_num - cd_num))


Fixed submission:
from fractions import gcd
 
def main():
    a,b,c,d = map(int,input().split(" "))
    n = b - a + 1
    cdiv = b//c - (a-1)//c
    ddiv = b//d - (a-1)//d
    cddiv = b//(c * d // gcd(c, d))  - (a-1)//(c * d // gcd(c, d))
    print(n - cdiv -ddiv + cddiv)
 
if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
import numpy

n,m = map(int,input().split(" "))
gates = []
for i in range(m):
    gates.append(list(map(int,input().split(" "))))

result = numpy.ones(n)

for card in gates:

    result[:(card[0])-1] = 0
    result[card[1]:] = 0

print(sum(result == 1))

Fixed submission:


n,m = map(int,input().split(" "))
gates = []
for i in range(m):
    gates.append(list(map(int,input().split(" "))))

result = [1, n]

for card in gates:
    if result[0] < card[0]:
        result[0] = card[0]
    if result[1] > card[1]:
        result[1] = card[1]

tmp = result[1] - result[0] + 1 
if tmp >= 0:
    print(tmp)
else:
    print(0)
Buggy python submission (verdict: Time Limit Exceeded):
import heapq

n,m = map(int,input().split(" "))
li = []
heapq.heapify(li)

for i in range(n):
    a,b = map(int,input().split(" "))
    for j in range(b):
        heapq.heappush(li,a)

result = 0
for i in range(m):
    result += heapq.heappop(li)
print(result)

Fixed submission:


n,m = map(int,input().split(" "))
li = []

for i in range(n):
    a,b = map(int,input().split(" "))
    li.append((a,b))

li.sort()

result = 0
count = 0
flag = False
for i in range(m):
    for j in range(li[i][1]):
        result += li[i][0]
        count += 1
        if count == m:
            flag = True
            break
    if flag:
        break
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
import heapq

n,m = map(int,input().split(" "))
li = []
heapq.heapify(li)

for i in range(n):
    a,b = map(int,input().split(" "))
    for j in range(b):
        heapq.heappush(li,a)

result = 0
for i in range(m):
    result += heapq.heappop(li)
print(result)

Fixed submission:


n,m = map(int,input().split(" "))
li = []

for i in range(n):
    a,b = map(int,input().split(" "))
    li.append((a,b))

li.sort()

result = 0
count = 0
flag = False
for i in range(m):
    for j in range(li[i][1]):
        result += li[i][0]
        count += 1
        if count == m:
            flag = True
            break
    if flag:
        break
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    string = input()
    lists = list(string)
    original_len = len(lists)
    for i in range(int(len(lists))):
        pre = 2
        for j, now in enumerate(lists):
            if(int(pre) < 2 and int(pre) != int(now)):
                del lists[j]
                del lists[j-1]
                #print(j, lists)
                break
            pre = lists[j]
    print(original_len - len(lists))
if __name__ == "__main__":
    main()



Fixed submission:
def main():
    string = input()
    lists = list(string)
    original_len = len(lists)
    zero = lists.count('0')
    one = lists.count('1')
    print(min(zero,one)*2)
if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
import numpy
n = input()
a =[int(e) for e in input().split(" ")]

a_n = numpy.array(a)
count = 0

for kk in range(10000):
    TF = a_n%2==0
    if any(TF):
        tmp = 0
        tmp_i = 0
        for i,j in enumerate(TF):       
            if j:
                if tmp <= a_n[i]:
                    tmp = a_n[i]
                    tmp_i = i
        a_n = a_n * 3
        a_n[tmp_i] = a_n[tmp_i]/6
        count += 1
    else:
        break
print(count)
 
             

Fixed submission:
n = input()
a =[int(e) for e in input().split(" ")]

count = 0
for i in a:
    tmp = i
    for j in range(10000):
        if tmp%2 == 0:
            tmp /=2
            count += 1
        else:
            break

print(count)
Buggy python submission (verdict: Runtime Error):
str = input();
if　str=="ABC":
  print("ARC")
elif str=="ARC":
  print("ABC")


Fixed submission:
val = input()
if val=="ABC":
  print("ARC")
elif val=="ARC":
  print("ABC")

Buggy python submission (verdict: Runtime Error):
s=input()
if s =='ABC' :print('ARC')
else if s=='ARC':print('ABC')


Fixed submission:
s=input()
if s =='ABC' :print('ARC')
elif s=='ARC':print('ABC')

Buggy python submission (verdict: Runtime Error):
s=input()
if s =='ABC' :
  print('ARC')
else if s=='ARC':
  prinr('ABC')

Fixed submission:
s=input()
if s =='ABC' :print('ARC')
elif s=='ARC':print('ABC')