Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math

R = (input())
print(2*math.pi*R)

Fixed submission:
import math
R = int(input())
print(2*math.pi*R)

Buggy python submission (verdict: Runtime Error):
import sympy

R = float(input())
round(2*sympy.pi.evalf(1000)*R, 100)

Fixed submission:
import math
R = int(input())
print(2*math.pi*R)

Buggy python submission (verdict: Runtime Error):
import sympy

R = float(input())
2*sympy.pi.evalf(1000)*R

Fixed submission:
import math
R = int(input())
print(2*math.pi*R)

Buggy python submission (verdict: Runtime Error):
import sympy

R = float(input())
round(2*sympy.pi.evalf(100)*R, 3)

Fixed submission:
import math
R = int(input())
print(2*math.pi*R)

Buggy python submission (verdict: Runtime Error):
from mpmath import

R = float(input())
mp.dps = 30
round(2*pi*R, 30)

Fixed submission:
import math
R = int(input())
print(2*math.pi*R)

Buggy python submission (verdict: Runtime Error):
import sympy

R = float(input())
2*sympy.pi.evalf(100)*R

Fixed submission:
import math
R = int(input())
print(2*math.pi*R)

Buggy python submission (verdict: Runtime Error):
import sympy

R = float(input())
2*sympy.pi.evalf(30)*R

Fixed submission:
import math
R = int(input())
print(2*math.pi*R)
Buggy python submission (verdict: Runtime Error):
import sys
N = int(input)

for i in range(len(N)):
    if N[i]==7:
        print('Yes')
        sys.exit()

print('No')

Fixed submission:
N = input()
F = 0

for i in range(3):
    if N[i] == '7':
        F = F + 1

if F >= 1 :
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
import math

K = int(input()) + 1
d = 0

for i in range(1, K):
    for j in range(1, K):
        for k in range(1, K):
            d = gcd(i, j, k) + d
print(d)

Fixed submission:
from math import gcd

K = int(input()) + 1
d = 0

for i in range(1, K):
    for j in range(1, K):
        for k in range(1, K):
            d = gcd(gcd(i, j), k) + d
print(d)

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

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

K = int(input())

a = 1
b = 1
c = 1
d = 0

for i in range(K):
    
    for j in range(K):
        
        for k in range(K):
            d = gcd(gcd(a, b), c) + d
            c = c + 1
            
        
        c = 1
        b = b + 1
    
    b = 1
    a = a + 1
    
print(d)

Fixed submission:
from math import gcd

K = int(input()) + 1
d = 0

for i in range(1, K):
    for j in range(1, K):
        for k in range(1, K):
            d = gcd(gcd(i, j), k) + d
print(d)

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

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

K = int(input())

a = 1
b = 1
c = 1
d = 0

for i in range(K):
    
    for j in range(K):
        
        for k in range(K):
            d = gcd(a, b, c) + d
            c = c + 1
        
        c = 1
        b = b + 1
    
    b = 1
    a = a + 1

print(d)

Fixed submission:
from math import gcd

K = int(input()) + 1
d = 0

for i in range(1, K):
    for j in range(1, K):
        for k in range(1, K):
            d = gcd(gcd(i, j), k) + d
print(d)
Buggy python submission (verdict: Runtime Error):
if S[0:2]=='hi':
    print('Yes')
else:
    print('No')

Fixed submission:
S = input()
S2 = ['hi', 'hihi', 'hihihi', 'hihihihi', 'hihihihihi']

if S in S2:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
input()
l = list(map(int, input().split()))
res = 1
for x in l:
  res *= x
if res > 10**18:
  res = -1
print(res)

Fixed submission:
input()
l = list(map(int, input().split()))
l.sort()
res = 1
for x in l:
  res *= x
  if res > 10**18:
    print(-1)
    exit(0)
print(res)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(a * int(b * 100) // 100)

Fixed submission:
a, b = input().split()
a = int(a)
b = int(b.replace('.', ''))
print(a * b // 100)
Buggy python submission (verdict: Time Limit Exceeded):
line = int(input())
number =7
cnt1 =0
cnt2 =1
if line %2 ==0 or line%5 ==0:
  print(-1)
  cnt1 +=2

while cnt1 ==0:
  if number%line !=0:
    number += 7*10**cnt2
    cnt2 +=1
  else:
    cnt1 +=1
if cnt1 ==1:
  print(cnt2)

Fixed submission:
K = int(input())

t = 7
for i in range(K):
    if t % K == 0:
        print(i + 1)
        break
    t = (t * 10 + 7) % K
else:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
line1 = int(input())



line2 = input()
literal = list(line2)


cnt =0
jud = []
for i in range(line1):
  for s in range(line1):
    for t in range(line1):
      jud = [literal[i],literal[s], literal[t]]
      if (jud[0] !=jud[1]) and (jud[1]!=jud[2]) and (jud[0] !=jud[2]):
        if s -i !=t-s and i<s and s<t:
          cnt +=1
          
print(cnt)
       

    


Fixed submission:
import itertools
N = int(input())
S = input()
#Rc1,Gc1,Bc1
out = S.count('R') * S.count('G') * S.count('B')

RGBs = list(itertools.permutations(['R', 'G', 'B'], 3))

for i in range(1, N):
  for j in range(N-i*2):
    #三つ連続であり、RGBで構成されている
    if (S[j], S[j+i], S[j+i*2]) in RGBs:
      out -= 1
print(out)
Buggy python submission (verdict: Runtime Error):
line = input()
data = line.split()
 
height = int(data[0])
wei = int(data[1])
 
if height %2 ==0:
    print(int(height/2)*wei)
else:
  if wei %2 ==0:
    print(int(height/2)* wei + int(wei/2))
  else:
    print(wei* int(height/2) + int(wei/2)+1)


Fixed submission:
data =[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
line =int(input())

print(data[line -1])
Buggy python submission (verdict: Time Limit Exceeded):
import itertools 

line1 = input().split()
rei =input().split()
den =input().split()
cupon =[list(map(int,input().split())) for i in range(int(line1[2]))]
rei_den =list(itertools.product(rei , den))
sum_rei_den =[0]*len(rei_den)

for i in range(len(rei_den)):
  sum_rei_den[i] = int(rei_den[i][0])+ int(rei_den[i][1])

mi = min(sum_rei_den)

for s in range(int(line1[2])):
  total =int(rei[cupon[s][0]-1]) +int(den[cupon[s][1]-1]) - cupon[s][2]
  if mi > total:
    mi =total
print(mi)

Fixed submission:
import itertools 

line1 = input().split()
rei = input().split()
rei =list(map(int,rei))
den =input().split()
den =list(map(int,den))
cupon =[list(map(int,input().split())) for i in range(int(line1[2]))]

rei_mi = min(rei)
den_mi =min(den)

no_total =rei_mi +den_mi

for s in range(int(line1[2])):
  yes_total =int(rei[cupon[s][0]-1]) +int(den[cupon[s][1]-1]) - cupon[s][2]
  if no_total > yes_total:
    no_total =yes_total
print(no_total)
Buggy python submission (verdict: Runtime Error):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
from functools import cmp_to_key
import itertools
 
N, T = map(int, readline().split())
m = map(int, read().split())
AB0 = []
AB1 = []
for a,b in zip(m,m):
    if a == 0:
        AB0.append(b)
    else:
        AB1.append((a,b))
 
def sort_func(ab0, ab1):
    a0, b0 = ab0
    a1, b1 = ab1
    return a1*(1+b0) - a0*(1+b1)
 
AB0.sort()
AB1.sort(key=cmp_to_key(sort_func))
AB0, AB1
 
def compute_0():
    INF = T + 1
    dp = [INF] * 40
    dp[0] = 0
    for a,b in AB1:
        for n in range(39, -1, -1):
            if dp[n] > T:
                continue
            x = (dp[n] + 1) * (a + 1) + b
            if x < dp[n+1]:
                dp[n+1] = x
    return dp
 
def compute_1():
    return [0] + list(itertools.accumulate(x + 1 for x in AB0))
 
dp0 = compute_0()
dp1 = compute_1()
 
R = len(dp1) - 1
answer = 0
for i,x in enumerate(dp0):
    if x > T:
        break
    while x + dp1[R] > T:
        R -= 1
    value = i + R
    if answer < value:
        answer = value
 
print(answer)

Fixed submission:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
N = int(readline())
m = map(int,read().split())
AB = zip(m,m)
 
graph = [[] for _ in range(N+1)]
for a,b in AB:
    graph[a].append(b)
    graph[b].append(a)
 
dist = [-1] * (N+1)
stack = [1]
dist[1] = 0
while stack:
    v = stack.pop()
    for w in graph[v]:
        if dist[w] == -1:
            dist[w] = dist[v] + 1
            stack.append(w)
 
ev = [i for i,x in enumerate(dist) if x % 2 == 0 and i > 0]
od = [i for i,x in enumerate(dist) if x % 2 == 1 and i > 0]
 
def make_perm(N, ev, od, x0, x1, x2, y0, y1, y2):
    assert len(ev) == x0 + x1 + x2
    assert len(od) == y0 + y1 + y2
    P = [0] * (N+1)
    for i in ev:
        if x0:
            P[i] = (x0 + y0) * 3
            x0 -= 1
            continue
        if x1:
            P[i] = (x1 + y1) * 3 - 2
            x1 -= 1
            continue
        if x2:
            P[i] = (x2 + y2) * 3 - 1
            x2 -= 1
            continue
    for i in od:
        if y0:
            P[i] = (x0 + y0) * 3
            y0 -= 1
            continue
        if y1:
            P[i] = (x1 + y1) * 3 - 2
            y1 -= 1
            continue
        if y2:
            P[i] = (x2 + y2) * 3 - 1
            y2 -= 1
            continue
    return P[1:]
 
def solve(N, ev, od):
    x0 = N // 3
    x1 = (N+2) // 3
    x2 = (N+1) // 3
    perm = [0] * (N+1)
    LE = len(ev)
    LO = len(od)
    if LE <= x0:
        return make_perm(N, ev, od, LE, 0, 0, x0-LE, x1, x2)
    if LO <= x0:
        return make_perm(N, ev, od, x0-LO, x1, x2, LO, 0, 0)
    if LE == x1:
        return make_perm(N, ev, od, 0, x1, 0, x0, 0, x2)
    if LO == x1:
        return make_perm(N, ev, od, x0, 0, x2, 0, x1, 0)
    # どちらも x1 よりたくさんある
    return make_perm(N, ev, od, LE-x1, x1, 0, LO-x2, 0, x2)
 
P = solve(N, ev, od)
print(' '.join(map(str, P)))
Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())

import numpy as np

from_1_a = (A-1)//C +(A-1)//D - (A-1)//np.lcm(C,D)
from_1_b = B//C + B//D - B//np.lcm(C,D)

baisu_c_or_d = from_1_b -from_1_a
among = B -A  +1


print(among - baisu_c_or_d)


Fixed submission:
from fractions import gcd

A, B, C, D = map(int, input().split())
l = C * D // gcd(C, D)
x = (A - 1) - (A - 1) // C - (A - 1) // D + (A - 1) // l
y = B - B // C - B // D + B // l
print(y - x)

Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())

import numpy as np

from_1_a = (A-1)//C +(A-1)//D - (A-1)//np.lcm(C,D)
from_1_b = B//C + B//D - B//np.lcm(C,D)

baisu_c_or_d = from_1_b -from_1_a
among = B -A  +1


print(among - baisu_c_or_d)


Fixed submission:
from fractions import gcd

A, B, C, D = map(int, input().split())
l = C * D // gcd(C, D)
x = (A - 1) - (A - 1) // C - (A - 1) // D + (A - 1) // l
y = B - B // C - B // D + B // l
print(y - x)

Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())

import numpy as np

from_1_a = int((A-1)/C) +int((A-1)/D) - int((A-1)/np.lcm(C,D))
from_1_b = int(B/C) +int(B/D) - int(B/np.lcm(C,D))

baisu_c_or_d = from_1_b -from_1_a
among = B -A  +1

print(among - baisu_c_or_d)

Fixed submission:
from fractions import gcd

A, B, C, D = map(int, input().split())
l = C * D // gcd(C, D)
x = (A - 1) - (A - 1) // C - (A - 1) // D + (A - 1) // l
y = B - B // C - B // D + B // l
print(y - x)

Buggy python submission (verdict: Runtime Error):
line = input().split()
A =int(line[0])
B =int(line[1])
C =int(line[2])
D =int(line[3])

import numpy as np

from_1_a = int((A-1)/C) +int((A-1)/D) - int((A-1)/np.lcm(C,D))
from_1_b = int(B/C) +int(B/D) - int(B/np.lcm(C,D))

baisu_c_or_d = from_1_b -from_1_a
among = B -A  +1

print(among - baisu_c_or_d)


Fixed submission:
from fractions import gcd

A, B, C, D = map(int, input().split())
l = C * D // gcd(C, D)
x = (A - 1) - (A - 1) // C - (A - 1) // D + (A - 1) // l
y = B - B // C - B // D + B // l
print(y - x)

Buggy python submission (verdict: Runtime Error):
line = input().split()
A =int(line[0])
B =int(line[1])
C =int(line[2])
D =int(line[3])

import numpy as np

from_1_a = int((A-1)/C) +int((A-1)/D) - int((A-1)/np.lcm(C,D))
from_1_b = int(B/C) +int(B/D) - int(B/np.lcm(C,D))

baisu_c_or_d = from_1_b -from_1_a
among = B -A  +1

print(among - baisu_c_or_d)


Fixed submission:
from fractions import gcd

A, B, C, D = map(int, input().split())
l = C * D // gcd(C, D)
x = (A - 1) - (A - 1) // C - (A - 1) // D + (A - 1) // l
y = B - B // C - B // D + B // l
print(y - x)
Buggy python submission (verdict: Runtime Error):
data =input()
data = list(data)
deter =""


if len(data) >9 :
  print("NO")
if len(data) >=5 and len(data)<=9:
  if data[0] !="A":
    data.insert(0,"A")
  if data[4] !="A":
    data.insert(4,"A")
  if data[6] !="A":
    data.insert(6,"A")
  if len(data) ==8:
    data.append("A")
  else:
    if data[8] !="A":
      data.insert(8,"A")
 
  for s in range(len(data)):
    deter +=data[s]
   
  if deter =="AKIHABARA":
    print("YES")
  else:
    print("NO")

 
if len(data) <=4:
  print("NO")


Fixed submission:
data =input()
data = list(data)
deter =""
cnt2 =0
cnt =[0]*5
cnt3 =0
for t in range(len(data)):
  if data[t] =="I":
    cnt[0] +=1
  if data[t] =="K":
    cnt[1] +=1
  if data[t] =="H":
    cnt[2] +=1
  if data[t] =="B":
    cnt[3] +=1
  if data[t] =="R":
    cnt[4] +=1
  
if cnt[0] ==1 and cnt[1] ==1 and cnt[2] ==1 and cnt[3] ==1 and cnt[4] ==1:
  cnt2 +=1 

if len(data) >9 or cnt2 ==0 :
  print("NO")
  cnt3 +=1
if len(data) >=5 and len(data)<=9  and cnt2 ==1:
  if data[0] !="A":
    data.insert(0,"A")
  if data[4] !="A":
    data.insert(4,"A")
  if data[6] !="A":
    data.insert(6,"A")
  if len(data) ==8:
    data.append("A")
  else:
    if data[8] !="A":
      data.insert(8,"A")
 
  for s in range(len(data)):
    deter +=data[s]
  
  if deter =="AKIHABARA":
    print("YES")
  else:
    print("NO")

 
if len(data) <=4 and cnt3==0:
  print("NO")

Buggy python submission (verdict: Runtime Error):
data =input()
data = list(data)
deter =""


if len(data) >9 :
  print("NO")
if len(data) >=5 and len(data)<=9:
  if data[0] !="A":
    data.insert(0,"A")
  if data[4] !="A":
    data.insert(4,"A")
  if data[6] !="A":
    data.insert(6,"A")
  if len(data) ==8:
    data.append("A")
  else:
    if data[8] !="A":
      data.insert(8,"A")
 
  for s in range(len(data)):
    deter +=data[s]
   
  if deter =="AKIHABARA":
    print("YES")

 
if len(data) <=4:
  print("NO")


Fixed submission:
data =input()
data = list(data)
deter =""
cnt2 =0
cnt =[0]*5
cnt3 =0
for t in range(len(data)):
  if data[t] =="I":
    cnt[0] +=1
  if data[t] =="K":
    cnt[1] +=1
  if data[t] =="H":
    cnt[2] +=1
  if data[t] =="B":
    cnt[3] +=1
  if data[t] =="R":
    cnt[4] +=1
  
if cnt[0] ==1 and cnt[1] ==1 and cnt[2] ==1 and cnt[3] ==1 and cnt[4] ==1:
  cnt2 +=1 

if len(data) >9 or cnt2 ==0 :
  print("NO")
  cnt3 +=1
if len(data) >=5 and len(data)<=9  and cnt2 ==1:
  if data[0] !="A":
    data.insert(0,"A")
  if data[4] !="A":
    data.insert(4,"A")
  if data[6] !="A":
    data.insert(6,"A")
  if len(data) ==8:
    data.append("A")
  else:
    if data[8] !="A":
      data.insert(8,"A")
 
  for s in range(len(data)):
    deter +=data[s]
  
  if deter =="AKIHABARA":
    print("YES")
  else:
    print("NO")

 
if len(data) <=4 and cnt3==0:
  print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
line = input()
data = line.split()
import math
import itertools
out =0
pair =list(itertools.combinations_with_replacement(range(0,int(data[0])+1), 3))


for i in range(len(pair)):
  if sum(pair[i]) == int(data[1]):
    clear_data =list(pair[i])
    if clear_data[0] <=int(data[0]) or clear_data[1] <=int(data[0]) or clear_data[2] <=int(data[0]):
      if clear_data[0] ==clear_data[1] and clear_data[0] ==clear_data[2] and clear_data[1] ==clear_data[2]:
        out +=1
      elif clear_data[0] !=clear_data[1] and clear_data[0] !=clear_data[2] and clear_data[1] !=clear_data[2]:
        out +=6
      else:
        out +=3

print(out)


Fixed submission:
line = input().split()
k =int(line[0])
s =int(line[1])
data =[0,0,0]
out =0

for i in range(k+1):
  for t in range(i,1+k):
    data[0] =i
    data[1] =t
    data[2] =s-data[1]-data[0]
    
    if data[2] >=0 and data[2] <=k and data[2]>=t :
     
      if data[0] ==data[1] and data[0] ==data[2] and data[1] ==data[2]:
        out +=1
      elif data[0] !=data[1] and data[0] !=data[2] and data[1] !=data[2]:
        out +=6
      else:
        out +=3
print(out)
Buggy python submission (verdict: Runtime Error):
X=input()

if int(X)>=30:
  print('Yes')
  else :
    print('No')

Fixed submission:
X=input()
 
if int(X)>=30:
  print('Yes')
else :
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
K=int(input())
if K%2==0:
	print(-1)
else:
	seven=0
	m=1
	count=0
	while m!=0:
		seven=seven*10+7
		m=seven % K
		count+=1

	print(count)

Fixed submission:
K=int(input())
m=0
count=1
chk=0
for i in range(K):
	m=(m*10+7)%K
	if m==0:
		print(count)
		chk=1
		break
	count+=1

if chk==0:
	print(-1)
Buggy python submission (verdict: Runtime Error):
x = input()
if x >= 30:
    print('Yes')
elif x < 30:
    print('No')

Fixed submission:
x = int(input())
if x >= 30:
    print('Yes')
elif x < 30:
    print('No')
Buggy python submission (verdict: Runtime Error):
import math
N, D = map(int, input().split())
P = [list(map(int, input().split()) for _ in range(N))]

cnt = 0
for i in range(N):
    d = math.sqrt(P[0]**2 + P[1]**2)
    if d <= D:
        cnt += 1

print(cnt)

Fixed submission:
import math
N, D = map(int, input().split())
P = [list(map(int,input().split())) for i in range(N)]

cnt = 0
for i in range(N):
    d = math.sqrt(int(P[i][0])**2 + int(P[i][1])**2)
    if d <= D:
        cnt += 1

print(cnt)

Buggy python submission (verdict: Runtime Error):
import math
N, D = map(int, input().split())
P = [list(map(int, input().split()) for _ in range(N))]

cnt = 0
for i in range(N):
    d = math.sqrt(P[0]**2 + P[1]**2)
    if d <= D:
        cnt += 1

Fixed submission:
import math
N, D = map(int, input().split())
P = [list(map(int,input().split())) for i in range(N)]

cnt = 0
for i in range(N):
    d = math.sqrt(int(P[i][0])**2 + int(P[i][1])**2)
    if d <= D:
        cnt += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
n=int(input())

s=[]
for i in range(n):
    a=input()
    s.append(a)
    
for j in ['AC', 'WA', 'TLE', 'RE']:
    print('{0} × {1}'.format(j,s.count(j)))


Fixed submission:
n=int(input())
a=n%1000
if a==0:
    print(0)
else:
    print(1000-a)

Buggy python submission (verdict: Runtime Error):
n=int(input())

judge_list=[]
for i in range(n):
    a=input()
    judge_list.append(a)

print("AC ×",judge_list.count("AC"))
print("WA ×",judge_list.count("WA"))
print("TLE ×",judge_list.count("TLE"))
print("RE ×",judge_list.count("RE"))

Fixed submission:
n=int(input())
a=n%1000
if a==0:
    print(0)
else:
    print(1000-a)
Buggy python submission (verdict: Runtime Error):
A, B=input().split()
b=float(B)*100
result=int(A)*int(b)
answer=round(result/100,2)
print(int(answer))

Fixed submission:
N=int(input())
s=input().split()
result=1
if '0' in s:
  print(0)
else:
  for i in range (N):
    result=result*int(s[i])
    if result> 10**18:
      print(-1)
      break
    elif i==N-1 and result<=10**18:
      print(result)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
s=input().split()
result=1
for i in range (N):
  result=result*int(s[i])
if result<= 10**18:
  print(result)
else:
  print(-1)
  


Fixed submission:
N=int(input())
s=input().split()
result=1
if '0' in s:
  print(0)
else:
  for i in range (N):
    result=result*int(s[i])
    if result> 10**18:
      print(-1)
      break
    elif i==N-1 and result<=10**18:
      print(result)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
s=input().split()
result=1
for i in range (N):
  result=result*int(s[i])
if result<= 10**18:
  print(result)
else:
  print(-1)
  

Fixed submission:
N=int(input())
s=input().split()
result=1
if '0' in s:
  print(0)
else:
  for i in range (N):
    result=result*int(s[i])
    if result> 10**18:
      print(-1)
      break
    elif i==N-1 and result<=10**18:
      print(result)
Buggy python submission (verdict: Runtime Error):
x = input()
print('A') if isupper(x) else print('a')

Fixed submission:
x = input()
print('A') if x.isupper() else print('a')
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
x = list(map(int, input()))
x.sorted()
o = 0
for i in range(b):
    o = O+x[i]
print(o)


Fixed submission:
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
o = 0
for i in range(b):
    o = o+x[i]
print(o)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
from decimal import Decimal
# input
n = int(input())
a = list(map(int, input().split()))
out = 1
if 0 in a:
    print(0)
    quit()
for i in range(n):
    out = Decimal(out * a[i])
    if out > Decimal(10**18):
        print(-1)
print(out)

Fixed submission:
# -*- coding: utf-8 -*-
from decimal import Decimal
# input
n = int(input())
a = list(map(int, input().split()))
out = 1
if 0 in a:
    print(0)
    quit()
for i in range(n):
    out = Decimal(out * a[i])
    if out > Decimal(10**18):
        print(-1)
        quit()
print(out)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
from decimal import Decimal
# input
n = int(input())
a = list(map(int, input().split()))
out = 1
for i in range(n):
    out = Decimal(out * a[i])
    if out.conut(0) > 0:
        print(out)
        quit()
    elif out > Decimal(10**18):
        print(-1)
        quit()
print(out)


Fixed submission:
# -*- coding: utf-8 -*-
from decimal import Decimal
# input
n = int(input())
a = list(map(int, input().split()))
out = 1
if 0 in a:
    print(0)
    quit()
for i in range(n):
    out = Decimal(out * a[i])
    if out > Decimal(10**18):
        print(-1)
        quit()
print(out)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
out = 1
for i in range(n):
    out = out * a[i]
    if out == 0:
        print(out)
        quit()
    elif out >＝ 10**18:
        print(-1)
        quit()
print(out)
         

Fixed submission:
# -*- coding: utf-8 -*-
from decimal import Decimal
# input
n = int(input())
a = list(map(int, input().split()))
out = 1
if 0 in a:
    print(0)
    quit()
for i in range(n):
    out = Decimal(out * a[i])
    if out > Decimal(10**18):
        print(-1)
        quit()
print(out)
Buggy python submission (verdict: Runtime Error):
k = int(input())
a,b = map(int, input())
print('OK') if b-a+1 >= k else print('NG')

Fixed submission:
k = int(input())
a,b = map(int, input().split())
print('OK') if (a%k ==0 or (b//k)-(a//k) >= 1) else print('NG')
Buggy python submission (verdict: Runtime Error):
a = int(input())
print(3.14１５ * a *a)


Fixed submission:
a = int(input())
print(3.14159265 * a * 2)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(string,input().split())
print(c+' '+a+' '+b)


Fixed submission:
a,b,c = map(str,input().split())
print(c+' '+a+' '+b)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print(c+' '+a+' '+b)


Fixed submission:
a,b,c = map(str,input().split())
print(c+' '+a+' '+b)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print(c a b)

Fixed submission:
a,b,c = map(str,input().split())
print(c+' '+a+' '+b)
Buggy python submission (verdict: Runtime Error):
a = input()
if a = 'AAA' or b = 'BBB':
  print('Yes')
else:
  print('No')

Fixed submission:
a = input()
if a == 'AAA' or a == 'BBB':
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
a,b =map(int,input().split())
if a%B==0:
  print(a/b)
else:
  print(1+(a//b))


Fixed submission:
a, b = map(int, input().split())
if a % b == 0:
    print(a//b)
else:
    print(1+a//b)

Buggy python submission (verdict: Runtime Error):
a,b =map(int,input().split())
if a%B==0:
  print(a/b)
else:
  print(1+a//b)

Fixed submission:
a, b = map(int, input().split())
if a % b == 0:
    print(a//b)
else:
    print(1+a//b)