Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02706 (python)

Fixed submission:
NM = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]

N = NM[0]
M = NM[1]

if N >= sum(A):
  print(N-sum(A))
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
NM = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]

N = NM[0]
M = NM[1]

if NM >= sum(A):
  print(NM-sum(A))
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
NM = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]

N = NM[0]
M = NM[1]

if NM => sum(A):
  print(NM-sum(A))
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
NM = [int(i) for i in input().split(" ")]
A = [int(i) for i in input().split(" ")]

N = NM[0]
M = NM[1]

if NM => sum(A):
  print(NM-sum(A))
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
NM = [int(i) for i in input().split()]
A = [int(i) fot i in input().split()]

N = NM[0]
M = NM[1]

if NM => sum(A):
  print(NM-sum(A))
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
NM = [int(i) for i in input().split(" ")]
A = [int(i) fot i in input().split(" ")]

N = NM[0]
M = NM[1]

if NM => sum(A):
  print(NM-sum(A))
else:
  print(-1)
Problem p03436 (python)

Fixed submission:
from collections import deque
#入力
h,w = map(int, input().split())
w = w + 2
maze = [list('#' * (w))]
for i in range(h):
    maze.append(list('#' + input() + '#')) #迷路の読み込み
maze.append(list('#' * (w)))
h = h + 2
                
distance = [[float('inf')] * w for i in range(h)] #まずは無限大の距離と仮定

que = deque() #座標と距離を保存
que.append((1,1,0)) #スタートの座標と距離を入力

move = [(1,0),(-1,0),(0,1),(0,-1)]

while que:
    i,j,k = que.popleft() #先頭を取得
    for di,dj in move:
        if maze[i+di][j+dj] == '.' and distance[i+di][j+dj] > k+1:
            #迷路の道で，今までの距離が今出した距離より長いなら
            distance[i+di][j+dj] = k+1 #より短い今の距離に更新し
            que.append((i+di,j+dj,k+1)) #queの末尾に追加

#初期の道のカウント
road = 0
for i in range(h):
    for j in range(w):
        if maze[i][j] == '.':
            road = road + 1

if distance[h-2][w-2] != float('inf'):
    minimum_distance = distance[h-2][w-2]
else:
    minimum_distance = road

print(road - minimum_distance - 1)

Buggy submission (verdict: Runtime Error):
from collections import deque
#入力
h,w = map(int, input().split())
w = w + 2
maze = [list('#' * (w))]
for i in range(h):
    maze.append(list('#' + input() + '#')) #迷路の読み込み
maze.append(list('#' * (w)))
h = h + 2
                
distance = [[float('inf')] * w for i in range(h)] #まずは無限大の距離と仮定

que = deque() #座標と距離を保存
que.append((1,1,0)) #スタートの座標と距離を入力

while que:
    i,j,k = que.popleft() #先頭を取得
    for di,dj in move:
        if maze[i+di][j+dj] == '.' and distance[i+di][j+dj] > k+1:
            #迷路の道で，今までの距離が今出した距離より長いなら
            distance[i+di][j+dj] = k+1 #より短い今の距離に更新し
            que.append((i+di,j+dj,k+1)) #queの末尾に追加

#初期の道のカウント
road = 0
for i in range(h):
    for j in range(w):
        if maze[i][j] == '.':
            road = road + 1

if distance[h-2][w-2] != float('inf'):
    minimum_distance = distance[h-2][w-2]
else:
    minimum_distance = road

print(road - minimum_distance - 1)

Buggy submission (verdict: Runtime Error):
from collections import deque
#入力
h,w = map(int, input().split())
w = w + 2
maze = [list('#' * (w))]
for i in range(h):
    maze.append(list('#' + input() + '#')) #迷路の読み込み
maze.append(list('#' * (w)))
h = h + 2
                
distance = [[float('inf')] * w for i in range(h)] #まずは無限大の距離と仮定

que = deque() #座標と距離を保存
que.append((1,1,0)) #スタートの座標と距離を入力

while que:
    i,j,k = que.popleft() #先頭を取得
    for di,dj in move:
        if maze[i+di][j+dj] == '.' and distance[i+di][j+dj] > k+1:
            #迷路の道で，今までの距離が今出した距離より長いなら
            distance[i+di][j+dj] = k+1 #より短い今の距離に更新し
            que.append((i+di,j+dj,k+1)) #queの末尾に追加

minimum_distance = distance[h-2][w-2]

#初期の道のカウント
road = 0
for i in range(h):
    for j in range(w):
        if maze[i][j] == '.':
            road = road + 1

print(road - minimum_distance - 1)
Problem p03565 (python)

Fixed submission:
#入力
S_prime = str(input())
T = str(input())
ans = []

if len(S_prime) >= len(T):
    times = len(S_prime) - len(T) + 1
    for i in range(times):
        count = 0
        for j in range(len(T)):
            if S_prime[i+j] == '?':
                count = count + 1
            elif S_prime[i+j] != T[j]:
                continue
            else:
                count = count + 1
            
        if count == len(T):
            S = S_prime[:i] + T + S_prime[(i+len(T)):]
            S = S.replace('?', 'a')
            ans.append(S)


if len(ans) != 0:
    print(min(ans))
else:
    print('UNRESTORABLE')

Buggy submission (verdict: Runtime Error):
#入力
S_prime = str(input())
T = str(input())
ans = []

if len(S_prime) >= len(T):
    times = len(S_prime) - len(T) + 1
    for i in range(times):
        count = 0
        for j in range(len(T)):
            if S_prime[i+j] == '?':
                count = count + 1
            elif S_prime[i+j] != T[j]:
                continue
            else:
                count = count + 1
            
        if count == len(T):
            S_prime = S_prime[:i] + T + S_prime[(i+len(T)+1):]
            S = S_prime.replace('?', 'a')
            ans.append(S)


if len(ans) != 0:
    print(min(ans))
else:
    print('UNRESTORABLE')
Problem p02705 (python)

Fixed submission:
r=int(input())#入力を受け取る
ans = r*2*3.14
print(ans)

Buggy submission (verdict: Runtime Error):
r=input()#入力を受け取る
ans = r*2*3.14
print(ans)
Problem p02841 (python)

Fixed submission:
M1, D1 = [int(_) for _ in input().split(" ")]
M2, D2 = [int(_) for _ in input().split(" ")]
if M1 == M2:
    print (0)
else:
    print (1)

Buggy submission (verdict: Runtime Error):
N = int(input())
X = input()
M = {X[0:3]:1}
result = {}

for i in range(3,N):
    i = X[i]
    keys = M.keys()
    for j in tuple(keys):
        if (j, i) in result:
            continue
        M[j[0]+j[1]+i] = 1
        M[j[0]+j[2]+i] = 1
        M[j[1]+j[2]+i] = 1
        result[(j,i)] = True

print (len(M))
Problem p02843 (python)

Fixed submission:
X = int(input())

V = (100, 101, 102, 103, 104, 105)
#V = (3, 4, 8, 11)
Memo = [0] * (X+1)

if X < min(V):
    print (0)
    exit()

for i in range(len(V)):
    if V[i] > X:
      continue
    Memo[V[i]] = 1
    for j in range(1, X+1):
        if j - V[i] > 0:
            Memo[j] |= Memo[j-V[i]]

print (Memo[X])
#print (Memo)

Buggy submission (verdict: Runtime Error):
X = int(input())

V = (100, 101, 102, 103, 104, 105)
#V = (3, 4, 8, 11)
Memo = [0] * (X+1)

if X < min(V):
    print (0)
    exit()

for i in range(len(V)):
    Memo[V[i]] = 1
    for j in range(1, X+1):
        if j - V[i] > 0:
            Memo[j] |= Memo[j-V[i]]

print (Memo[X])
#print (Memo)
Problem p02844 (python)

Fixed submission:
N = int(input())
X = input()
#X = "196341362415710923461093419237419237417234162348162390471092374190237410982374901"*300
#N = len(X)
M = { }
A = set()
A.add(X[0]+X[1])
for i in range(2, N) :
    i = X[i]
    for j in tuple(A):
        M[j + i] = 1
        A.add(j[0]+i)
        A.add(j[1]+i)

    if len(M) == 1000:
        break
print(len(M))

Buggy submission (verdict: Runtime Error):
N = int(input())
X = input()
M = {X[0:3]:1}
result = {}

for i in range(3,N):
    i = X[i]
    keys = M.keys()
    for j in tuple(keys):
        if (j, i) in result:
            continue
        M[j[0]+j[1]+i] = 1
        M[j[0]+j[2]+i] = 1
        M[j[1]+j[2]+i] = 1
        result[(j,i)] = True
	if len(M) == 729:
      break
print (len(M))
Problem p03005 (python)

Fixed submission:
N, K = [int(_) for _ in raw_input().split(" ")]
if K == 1:
  print 0
else:
  print (N - K)

Buggy submission (verdict: Runtime Error):
N, L = [int(_) for _ in raw_input()]
if L == 1:
  print 0
else:
  print N - L
Problem p03006 (python)

Fixed submission:
N = int(raw_input())
ret = ()

for i in range(N):
  ret += (tuple([int(_) for _ in raw_input().split(" ")]),)

t = [[0]*N for _ in range(N)]
d = {}
for i in range(N):
  for j in range(i+1, N):    
    x = ret[i][0] - ret[j][0]
    y = ret[i][1] - ret[j][1]
    if not (x,y) in d:
      d[(x,y)] = []
    if not (-x, -y) in d:
      d[(-x, -y)] = []

    d[(x,y)] += [(i,j)]
    d[(-x,-y)] += [(j, i)]

d = [(len(d[_]), _, d[_]) for  _ in d]
if len(d) == 0:
  print 1
  exit()
d.sort(reverse=True)
d = d[0][2]
ans = [1] * N
current = d[0]
count = 0
while(len(d) > 0):
  count += 1
  current = d[0]
  ans[current[0]] = 0
  ans[current[1]] = 0
  d.remove(current)
  t = [current[0], current[1]]
  c1 = t[0]
  c2 = t[1]

  while(len(d) > 0):
    for i in d:
      if i[1] == c1:
        d.remove(i)
        c1 = i[0]
        ans[c1] = 0
        t = [c1] + t
        break
    else:
      break

  while(len(d) > 0):
    for i in d:
      if c2 == i[0]:
        d.remove(i)
        c2 = i[1]
        ans[c2] = 0
        t = t + [c2]
        break
    else:
      break
  
  #print t
print sum(ans) + count

Buggy submission (verdict: Runtime Error):
N = int(raw_input())
ret = ()

for i in range(N):
  ret += (tuple([int(_) for _ in raw_input().split(" ")]),)

t = [[0]*N for _ in range(N)]
d = {}
for i in range(N):
  for j in range(i+1, N):    
    x = ret[i][0] - ret[j][0]
    y = ret[i][1] - ret[j][1]
    if not (x,y) in d:
      d[(x,y)] = []
    if not (-x, -y) in d:
      d[(-x, -y)] = []

    d[(x,y)] += [(i,j)]
    d[(-x,-y)] += [(j, i)]

d = [(len(d[_]), _, d[_]) for  _ in d]
d.sort(reverse=True)
d = d[0][2]
ans = [1] * N
current = d[0]
count = 0
while(len(d) > 0):
  count += 1
  current = d[0]
  ans[current[0]] = 0
  ans[current[1]] = 0
  d.remove(current)
  t = [current[0], current[1]]
  c1 = t[0]
  c2 = t[1]

  while(len(d) > 0):
    for i in d:
      if i[1] == c1:
        d.remove(i)
        c1 = i[0]
        ans[c1] = 0
        t = [c1] + t
        break
    else:
      break

  while(len(d) > 0):
    for i in d:
      if c2 == i[0]:
        d.remove(i)
        c2 = i[1]
        ans[c2] = 0
        t = t + [c2]
        break
    else:
      break
  
  #print t
print sum(ans) + count
Problem p02705 (python)

Fixed submission:
R = int(input())

print(R*3.1415*2)

Buggy submission (verdict: Runtime Error):
r = input()

print("{}".format(2*3.1415*r))
Problem p02817 (python)

Fixed submission:
S, T = (input().split())
#print(S, T)
print(''.join([T, S]))

Buggy submission (verdict: Runtime Error):
S, T = input().split()
print([T, S].join())
Problem p02994 (python)

Fixed submission:
N, L = (int(x) for x in input().split())
#リンゴiの味はL+i-1で与えられる。（i=1~N）
#作る予定のアップルパイの味の総和はN*(L-1) + 1/2*(N+1)*N
#出力はN-1個からアップルパイを作るとき、元の味との差が最小になる味
#味が0に最も近いものを探して、引けばよい。
aji = [L+i for i in range(N)]
#i=1~Nなので注意
#print(aji)
#0に一番近いものを探索
left = 0
while (aji[left] < 0):
    if left < N-1:
        left += 1
    else:
        break
#print(left)
ans = sum(aji) - aji[left]
print(ans)

Buggy submission (verdict: Runtime Error):
N, L = (int(x) for x in input().split())
aji = [L+i for i in range(N)]
left = 0

while (aji[left] < 0):
    left += 1
ans = sum(aji) - aji[left]
print(ans)

Buggy submission (verdict: Runtime Error):
N, L = (int(x) for x in input().split())
#リンゴiの味はL+i-1で与えられる。（i=1~N）
#作る予定のアップルパイの味の総和はN*(L-1) + 1/2*(N+1)*N
#出力はN-1個からアップルパイを作るとき、元の味との差が最小になる味
#味が0に最も近いものを探して、引けばよい。
aji = [L+i for i in range(N)]
#print(aji)
left = 0

while (aji[left] < 0):
    left += 1
#print(left)
ans = sum(aji) - aji[left]
print(ans)
Problem p03067 (python)

Fixed submission:
#coding:utf-8

A, B, C = (int(x) for x in input().split())

if A <= C <= B or B <= C <= A:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
#coding:utf-8

A, B, C = (int(x) for x in input().split())

if A <= C <= B || B <= C <= A:
    print("Yes")
else:
    print("No")
Problem p03068 (python)

Fixed submission:
#coding:utf-8

N = int(input())
S = input()
K = int(input())

base = S[K-1]
new = []

for i in range(N):
    if S[i] != base:
        new.append('*')
    else:
        new.append(base)

ans = ''.join(new)
print(ans)

Buggy submission (verdict: Runtime Error):
#coding:utf-8

N = int(input())
S = input()
K = int(input())

base = S[K]
new = []

for i in range(N):
    if S[i] != base:
        new.append('*')
    else:
        new.append(base)

ans = ''.join(new)
print(ans)
Problem p03101 (python)

Fixed submission:
#coding:utf-8

H, W = input().split()
h, w = input().split()

ans = ( int(H)-int(h) ) * ( int(W)-int(w) )
print(ans)

Buggy submission (verdict: Runtime Error):
#coding:utf-8

H, W = input().split()
h, w = input().split()

for s in [H,W,h,w]:
    s = int(s)
    print(type(s))

ans = (H - h) * (W - w)
print(ans)

Buggy submission (verdict: Runtime Error):
#coding:utf-8

H, W = input().split()
h, w = input().split()

for s in [H,W,h,w]:
    int(s)

ans = (H - h) * (W - w)
print(ans)

Buggy submission (verdict: Runtime Error):
#coding:utf-8

H, W = input().split()
h, w = input().split()

ans = (H - h) * (W - w)
print(ans)
Problem p03478 (python)

Fixed submission:
#coding:utf-8

N, A, B = (int(x) for x in input().split())
ans = 0


for i in range(N+1):
	digit = [int(s) for s in list(str(i))]
	temp = sum(digit)
	if A <= temp <= B:
		ans+= i
		
print(ans)

Buggy submission (verdict: Runtime Error):
#coding:utf-8

N, A, B = input().split()
ans = 0

for i in range(N+1):
	if A <= sum(list([int(x) for x in str(i)])) <= B:
		ans += i
		
print(ans)
Problem p02705 (python)

Fixed submission:
print(int(input())*6.3)

Buggy submission (verdict: Runtime Error):
print(6.283*input())

Buggy submission (verdict: Runtime Error):
doubt a =2＊R＊3，14；
print（a）
Problem p02705 (python)

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

Buggy submission (verdict: Runtime Error):
yasumi = 0
syukudai = 1
nissu = list(map(int,input().split()))
syukudaiNissu = list(map(int,input().split()))
if sum(syukudaiNissu) > nissu[yasumi]:
  print(-1)
  exit()
print(nissu[yasumi] - sum(syukudaiNissu))
Problem p02706 (python)

Fixed submission:
yasumi = 0
syukudai = 1
nissu = list(map(int,input().split()))
syukudaiNissu = list(map(int,input().split()))
if sum(syukudaiNissu) > nissu[yasumi]:
  print(-1)
  exit()
print(nissu[yasumi] - sum(syukudaiNissu))

Buggy submission (verdict: Runtime Error):
yasumi = 0
syukudai = 1
nissu = list(map(int,input().split()))
syukudaiNissu = list(map(int,input().split()))
if sum(syukudaiNissu) > nissu[yasumi]:
  print()-1
print(nissu[yasumi] - sum(syukudaiNissu))
Problem p02741 (python)

Fixed submission:
a = [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]
print(a[int(input())-1])

Buggy submission (verdict: Runtime Error):
a = [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]
print(a[int(inpui())-1])
Problem p02705 (python)

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

Buggy submission (verdict: Runtime Error):
import.math
x= int(input())
y = 2*math.pi*x
print(y)

Buggy submission (verdict: Runtime Error):
import.math
x= int(input())
y = 2*math.pi*x
print(y)

Buggy submission (verdict: Runtime Error):
import.math
x= int(input())
y = 2*math.pi*x
print(y)

Buggy submission (verdict: Runtime Error):
x=input()
y = 2*PI()*x
print(y)
Problem p02706 (python)

Fixed submission:
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, M):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
if x < 0:
    print("-1")
else:
    print(x)

Buggy submission (verdict: Runtime Error):
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, n):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
if x < N:
    print("-1")
else:
    print(x)

Buggy submission (verdict: Runtime Error):
N, M = map(int,input().split())
#M 夏休み期間　M　宿題数
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, n):
    A_sum += A[i]
    # A_sum 宿題全日数
x = N - A_sum
print(x)

Buggy submission (verdict: Runtime Error):
D, n = map(int.input().split())

for i in range(n):
    A[i] = input()
    i += 1
    D_sum += A[i]
    x = D - D_sum
print()
Problem p02706 (python)

Fixed submission:
n, m = [int(num) for num in input().split()]
assments = sum(int(num) for num in input().split())
if n - assments < 0:
    print(-1)
else:
    print(n - assments)

Buggy submission (verdict: Runtime Error):
list = int(input().split())
N = list[0]

list_1 = int(input().split())
M = sum(list_1)

if M-N > 0 :
  print(M-N)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
list = input().split()
N = int(list[0])

list_1 = input().split()
M = int(sum(list_1))

if M-N > 0 :
  print(M-N)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
list = input().split()
N = int(list[0])

list_1 = input().split()
M = int(sum(list_1))

print(M-N)

Buggy submission (verdict: Runtime Error):
list = input().split()
N = int(list[0])

list_1 = input().split()
M = int(list_1.sum())

print(M)
Problem p02705 (python)

Fixed submission:
r = input()
print(int(r) * 2 * 3.14)

Buggy submission (verdict: Runtime Error):
r = input()
print(r*2*3.14)
Problem p02705 (python)

Fixed submission:
R = input()
R = int(R)

print(2*3.14*R)

Buggy submission (verdict: Runtime Error):
R = input()
print(2*3.14*R)

Buggy submission (verdict: Runtime Error):
pi = 3.14

R = input()
print(2*pi*R)
Problem p02772 (python)

Fixed submission:
N = input()
numList = input().split(' ')
for num in numList:
  num = int(num)
  if num % 2 == 0:
    judge1 = num % 3 == 0
    judge2 = num % 5 == 0
    approve = judge1 or judge2
    if not approve:
      print('DENIED')
      exit()
print('APPROVED')

Buggy submission (verdict: Runtime Error):
N = input()
numList = input()


for num in numList:
  if num % 2 == 0:
    judge1 = num % 3 == 0
    judge2 = num % 5 == 0
    approve = judge1 or judge2
    if not approve:
      print('DENIED')
      exit()
print('APPROVED')
Problem p02952 (python)

Fixed submission:
n = input()
count =0
for i in range(1,int(n)+1):
    if len(str(i)) % 2 != 0:
        count +=1 
print(count)

Buggy submission (verdict: Runtime Error):
N = input()

count = 0
for i in range(1,N+1):
  if len(str(i)) % 2 != 0:
    count += 1

print(count)
Problem p03086 (python)

Fixed submission:
S = input()

AGCT = ['A','G','C','T']
AGCT_list = []

i = 0
while i < len(S):
    #print('i=',i)
    if S[i] in AGCT:
        k = 1
        agct_tmp = S[i]
        if i+k < len(S):
            while S[i+k] in AGCT:
                #print('k=', k)
                #print('i+k=',i+k)
                agct_tmp += S[i+k]
                if i+k+1 < len(S):
                    k +=1
                else:
                    break
    
        AGCT_list.append(agct_tmp)
        i = i + k + 1
    else:
        i += 1
if AGCT_list:
    print(max([len(string) for string in AGCT_list]))
else:
    print('0')

Buggy submission (verdict: Runtime Error):
S = input()

AGCT = ['A','G','C','T']
AGCT_list = []

i = 0
while i < len(S):
    #print('i=',i)
    if S[i] in AGCT:
        k = 1
        agct_tmp = S[i]
        while S[i+k] in AGCT:
            #print('k=', k)
            #print('i+k=',i+k)
            agct_tmp += S[i+k]
            if i+k+1 < len(S):
                k +=1
            else:
                break
    
        AGCT_list.append(agct_tmp)
        i = i + k + 1
    else:
        i += 1
if AGCT_list:
    print(max([len(string) for string in AGCT_list]))
else:
    print('0')

Buggy submission (verdict: Runtime Error):
S = input()

AGCT = ['A','G','C','T']
AGCT_list = []

i = 0
while i < len(S):
    print('i=',i)
    if S[i] in AGCT:
        k = 1
        agct_tmp = S[i]
        while S[i+k] in AGCT:
            print('k=', k)
            print('i+k=',i+k)
            agct_tmp += S[i+k]
            if i+k+1 < len(S):
                k +=1
            else:
                break
    
        AGCT_list.append(agct_tmp)
        i = i + k + 1
    else:
        i += 1
if AGCT_list:
    print(max([len(string) for string in AGCT_list]))
else:
    print('0')
Problem p03106 (python)

Fixed submission:
a, b, k = map(int, input().split())
l = []

for i in range(1,min(a,b)+1):
    if a % i == 0 and b % i == 0:
        l.append(i)
        
print(list(reversed(l))[k-1])

Buggy submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
l = []

for i in range(1,n+1):
    if a % i == 0 and b % i == 0:
        l.append(i)
        
print(l[k-1])

Buggy submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
l = []

for i in range(1,n+1):
    if a % i == 0 and b % i == 0:
        l.append(i)
print(l[k-1])
Problem p02784 (python)

Fixed submission:
H,N = map(int,input().split())
A = list(map(int,input().split()))
a = 0
for i in A:
        a+=i
if a>=H:
        print("Yes")
else:
        print("No")

Buggy submission (verdict: Runtime Error):
H,N = map(int,input().split())
a = 0
for i in range(N):
        c = int(input())
        a+=c
if a>=H:
        print("Yes")
else:
        print("No")
Problem p02801 (python)

Fixed submission:
i = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
a = input()
b = i.index(a)
print(i[b+1])

Buggy submission (verdict: Runtime Error):
i = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y']
a = input()
b = i.index(a)
print(i[b+1])
Problem p02811 (python)

Fixed submission:
K,X = map(int,input().split())
if K*500>=X:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
K,X = map(int,input().split)())
if K*500>=X:
    print('Yes')
else:
    print('No')
Problem p02817 (python)

Fixed submission:
S,T = map(str,input().split())
print(T+S)

Buggy submission (verdict: Runtime Error):
S,T = map(input().split())
print(T+S)
Problem p02823 (python)

Fixed submission:
N,A,B = map(int,input().split())
if (B-A)%2==0:
    print(str(int(B-(B+A)//2)))
else:
    if N-B>A-1:
        print(str(int(A+(B-A-1)//2)))
    else:
        print(str(int(N-B+1+(B-A-1)//2)))

Buggy submission (verdict: Runtime Error):
    N,A,B = map(int,input().split())
    if (B-A)%2==0:
        print(str(int(B-(B+A)/2)))
    else:
        if B-A==1:
            if N-A>B-1:
                print(B-1)
            else:
                print(N-A)
        else:
            if N-A>B-1:
                print(A+(A-B)/2)
            else:
                print(B+(B-A)/2)

Buggy submission (verdict: Runtime Error):
N,A,B = map(int,input().split())
if (B-A)%2==0:
    print(str(int(B-(B+A)/2)))
else:
    if B-A==1:
        if N-A>B-1:
            print(B-1)
        else:
            rint(N-A)
    else:
        if N-A>B-1:
            print(A+(A-B)/2)
        else:
            print(B+(B-A)/2)

Buggy submission (verdict: Runtime Error):
N,A,B = map(int,input().split())
if (B-A)%2==0:
    print(str(int(B-(B+A)/2)))
else:
    if B-A==1:
        if N-A>B-1:
            print(B-1)
        else:
            rint(N-A)
    else:
        if N-A>B-1:
            print(A+(A-B)/2)
        else:
            print(B+(B-A)/2)
Problem p02830 (python)

Fixed submission:
N = int(input())
S,T = map(str,input().split())
A = ""
for (i,j) in zip(S,T):
  A+=i
  A+=j
print(A)

Buggy submission (verdict: Runtime Error):
import math
A,B=map(int,input().split())
x=A*B//(math.gcd(A,B))

print(x)

Buggy submission (verdict: Runtime Error):
N = int(input())
S,T = map(input().split())
A = ""
for i in S:
  A+=i
  for j in T:
    A+=j
print(A)

Buggy submission (verdict: Runtime Error):
N = int(input())
S,T = map(input().split())
A = ""
for i in S:
  A+=i
  for j in T:
    A+=j
print(A)

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()
T = input()
A = ''
for i in S:
  A+=i
  for j in T:
    A+=j
print(A)

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()
T = input()
A = ''
for i in S:
  for j in T:
    A+=(i+j)
print(A)
Problem p02705 (python)

Fixed submission:
round = 6.28318530717958623200

 
r = int(input())
print(r*round)

Buggy submission (verdict: Runtime Error):
round = 3.1415
 
r = input()
print(r*2*round)

Buggy submission (verdict: Runtime Error):
round = 3.1415

r = input()
print(r*2*rount)

Buggy submission (verdict: Runtime Error):
num = input()
round = 3.141592653589793

print(num*2*rount)