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

Fixed submission:
import fractions

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

a = (n[0] * n[1]) // fractions.gcd(n[0], n[1])
print(a)

Buggy submission (verdict: Runtime Error):
import math

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

a = (n[0] * n[1]) // math.gcd(n[0], n[1])

print(a)

Buggy submission (verdict: Runtime Error):
import math

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

a = (n[0] * n[1]) // math.gcd(n[0], n[1])

Buggy submission (verdict: Runtime Error):
import math

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

a = (n[0] * n[1]) // math.gcd(n[0], n[1])
Problem p02682 (python)

Fixed submission:
A, B, C, K = [int(i) for i in input().split(" ")]
N = [A, B, C]
for i in range(len(N)):
    K -= N[i]
    if K == 0:
        if i == 0:
            N[i+1] = 0
            N[i+2] = 0
        elif i == 1:
            N[i+1] = 0
        break
    elif K < 0:
        if i == 0:
            N[i+1] = 0
            N[i+2] = 0
        elif i == 1:
            N[i+1] = 0
        N[i] += K
        break
print(1 * N[0] -1 * N[2])

Buggy submission (verdict: Runtime Error):
A, B, C, K = [int(i) for i in input().split(" ")]
N = [A, B, C]
# print("N:", N)
for i in N:
    K -= i
    if K == 0:
        # print("i:", i)
        # print("K:", K)
        if i == 0:
            N[i+1] = 0
            N[i+2] = 0
        elif i == 1:
            N[i+1] = 0
        break
    elif K < 0:
        # print("i:", i)
        # print("K:", K)
        if i == 0:
            N[i+1] = 0
            N[i+2] = 0
        elif i == 1:
            N[i+1] = 0
        N[i-1] += K
        break
# print("N:", N)
print(1 * N[0] -1 * N[2])
Problem p02860 (python)

Fixed submission:
n = int(input())
s = str(input())
if n % 2 == 1:
  print('No')
else:
  numT = n // 2
  if s[0:numT] == s[numT:n]:
    print('Yes')
  else:
    print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()
if len(s) % 2 != 0:
  print('No')
else:
  l = len(s) // 2
  if s[:l] == s[l:]:
    print('Yes')
  else:
    pring('No')
Problem p02933 (python)

Fixed submission:
a = int(input())
if a < 3200:
  print("red")
else:
  print(input())

Buggy submission (verdict: Runtime Error):
a = int(input())
if a < 3200:
  print("red")
else:
  ptint(input())

Buggy submission (verdict: Runtime Error):
a = input()
if a<3200:
  print("red")
else:
  print(input())

Buggy submission (verdict: Runtime Error):
a = int(input())
if(a<3200){
  print("red")
}else{
  print(input())
}
Problem p02693 (python)

Fixed submission:
K = int(input())
A,B = map(int,input().split())

for i in range(A,B+1):
    if i%K==0:
        print("OK")
        exit()
print("NG")

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

for i in range(A,B+1):
    if i%K==0:
        print("OK")
        break
else:
print("NO")
Problem p02847 (python)

Fixed submission:
S = input()

DAY = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

print(7-DAY.index(S))

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

DAY = ["SUN","MON","TUE","WED","THU","FRY","SAT"]

print(7-DAY.index(S))
Problem p02699 (python)

Fixed submission:
S, W = map(int, input().split())

if(W >= S):
    print("unsafe")
else:
    print("safe")

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

data = []

count = 0
for i in range(len(S)):
    for j in range(i+4, min(i+9,len(S)+1)):
        if(int(S[i:j]) % 2019 == 0):
            count += 1
            data.append([i,j])

for i in range(len(data) - 1):
    if(data[i][1] == data[i+1][0]):
        count += 1

print(count)

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

data = []

count = 0
for i in range(len(S)):
    for j in range(i+4, min(i+7,len(S)+1)):
        if(int(S[i:j]) % 2019 == 0):
            count += 1
            data.append([i,j])

for i in range(len(data) - 1):
    if(data[i][1] == data[i+1][0]):
        count += 1

print(count)
Problem p02735 (python)

Fixed submission:
import queue

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

s = [list(input()) for _ in range(H)]

ini = 0
if s[0][0] == '#':
    ini = 1

dist = [[ini for _ in range(W)] for _ in range(H)]
start = (0,0)

qq = queue.Queue()

for i in range(H):
    for j in range(W):
        tgt = []
        if j == 0:
            pass
        else:
            if s[i][j-1] == '.' and s[i][j] == '#':
                tgt.append(dist[i][j-1] + 1)

            else:
                tgt.append(dist[i][j-1])

        if i == 0:
            pass
        else:
            if s[i-1][j] == '.' and s[i][j] == "#":
                tgt.append(dist[i-1][j] + 1)
            else:
                tgt.append(dist[i-1][j])
        if i + j == 0:
            continue
        dist[i][j] = min(tgt)

print(dist[H-1][W-1])

Buggy submission (verdict: Runtime Error):
import queue

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

s = [list(map(int, input().split())) for _ in range(H)]

ini = 0
if s[0][0] == '#':
    ini = 1

dist = [[ini for _ in range(W)] for _ in range(H)]
start = (0,0)

qq = queue.Queue()

for i in range(H):
    for j in range(W):
        tgt = []
        if j == 0:
            pass
        else:
            if s[i][j-1] == '.' and s[i][j] == '#':
                tgt.append(dist[i][j-1] + 1)

            else:
                tgt.append(dist[i][j-1])

        if i == 0:
            pass
        else:
            if s[i-1][j] == '.' and s[i][j] == "#":
                tgt.append(dist[i-1][j] + 1)
            else:
                tgt.append(dist[i-1][j])
        if i + j == 0:
            continue
        dist[i][j] = min(tgt)

print(dist[H-1][W-1])
Problem p02832 (python)

Fixed submission:
n = int(input())
a = list(map(int , input().split()))
# count = 0 if 1 in a else -1
# i = 1
# while i in a:
#   ind = a.index(i)
#   count += ind
#   a = a[ind + 1:]
#   i += 1
# print(count)

ans = []
i = 1
for j in range(n):
  if i == a[j]:
    i += 1
    ans.append(i)

print(n - len(ans) if 1 in a else -1)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int , input().split()))
count = 0 if 1 in a else -1
i = 1
ind = 0
while i in a:
  ind = a[ind + 1:].index(i)
  count += ind
  i += 1
print(count)
Problem p03723 (python)

Fixed submission:
a , b , c = map(int, input().split())
count = 0
if a == 1 and b == 1 and c == 1:
  pass
elif a == b and a == c:
  count = -1
else:
  while a % 2 == 0 and b % 2 == 0 and c % 2 == 0:
    a_copy = a
    b_copy = b
    c_copy = c
    a = int(b_copy / 2 + c_copy / 2)
    b = int(a_copy / 2 + c_copy / 2)
    c = int(b_copy / 2 + a_copy / 2)
    count += 1
  
print(count)

Buggy submission (verdict: Runtime Error):
a , b , c = map(int, input().split())
count = 0
if a == 1 and b == 1 and c == 1:
  break
elif a == b and a == c:
  count = -1
else:
  while a % 2 == 0 and b % 2 == 0 and c % 2 == 0:
    a_copy = a
    b_copy = b
    c_copy = c
    a = int(b_copy / 2 + c_copy / 2)
    b = int(a_copy / 2 + c_copy / 2)
    c = int(b_copy / 2 + a_copy / 2)
    count += 1
  
print(count)
Problem p02627 (python)

Fixed submission:
a = input()
if(a == a.upper()):
    print("A")
else:
    print("a")

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
b = np.bitwise_xor.reduce(a)
c = np.bitwise_xor(a, b)
print(*c, sep=" ")

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
b = np.bitwise_xor.reduce(a)
c = np.bitwise_xor(a, 0)
print(*c, sep=" ")

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
# b = np.bitwise_xor.reduce(a)
c = np.bitwise_xor(a, 0)
print(*c, sep=" ")

# for n in range(N):
#     print(np.bitwise_xor.reduce(a) ^ a[n])

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
b = np.bitwise_xor.reduce(a)
# c = np.bitwise_xor(a, b)
# print(*c, sep=" ")

# for n in range(N):
#     print(np.bitwise_xor.reduce(a) ^ a[n])

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
b = np.bitwise_xor.reduce(a)
c = np.bitwise_xor(a, b)
print(*c, sep=" ")

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
b = np.bitwise_xor.reduce(a)
for n in range(N):
    print(b ^ a[n])
Problem p02699 (python)

Fixed submission:
seep, wolf = map(int, input().rstrip().split())
 
if seep > wolf:
  print('safe')
else:
  print('unsafe')

Buggy submission (verdict: Runtime Error):
seep, wolf = map(int, input().rstrip())

if seep > wolf:
  print('safe')
else:
  print('unsafe')
Problem p02723 (python)

Fixed submission:
string = input()
if string[2] == string[3] and string[4] == string[5]:
	print('Yes')
else:
  	print('No')

Buggy submission (verdict: Runtime Error):
money = int(input())
 
happy = 0
 
happy += int((money / 500) * 1000)
 
money -= (money / 500) * 500
 
happy += int((money / 5) * 5)
 
print(happy)
Problem p02596 (python)

Fixed submission:
k = int(input())

def solve():
    if 7%k == 0:
        return 1
    val = 7
    for i in range(2, k + 1):
        val = val*10 + 7
        val = val%k
        if val == 0:
            return i

    return -1

print(solve())

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

if k%2 == 0:
    print(-1)
    exit()
elif k == 1:
    print(1)
    exit()
elif k == 11:
    print(2)
    exit()
elif k == 101:
    print(4)
    exit()
elif 1001%k == 0:
    print(6)
    exit()
elif 10001%k == 0:
    print(8)
    exit()
elif 100001%k == 0:
    print(10)
    exit()
elif 1000001%k == 0:
    print(12)
    exit()
elif 10000001%k == 0:
    print(14)
    exit()
elif 100000001%k == 0:
    print(16)
    exit()
elif 1000000001%k == 0:
    print(18)
    exit()
elif 10000000001%k == 0:
    print(20)
    exit()
k = int(input())

if k%2 == 0:
    print(-1)
    exit()
elif k == 1:
    print(1)
    exit()
elif k == 11:
    print(2)
    exit()
elif k == 101:
    print(4)
    exit()
elif 1001%k == 0:
    print(6)
    exit()
elif 10001%k == 0:
    print(8)
    exit()
elif 100001%k == 0:
    print(10)
    exit()
elif 1000001%k == 0:
    print(12)
    exit()
elif 10000001%k == 0:
    print(14)
    exit()
elif 100000001%k == 0:
    print(16)
    exit()
elif 1000000001%k == 0:
    print(18)
    exit()
elif 10000000001%k == 0:
    print(20)
    exit()
elif 100000000001%k == 0:
    print(22)
    exit()
elif 1000000000001%k == 0:
    print(24)
    exit()
elif 10000000000001%k == 0:
    print(26)
    exit()
else:
    print(k-1)
Problem p02819 (python)

Fixed submission:
X = int(input())
i = int(X**0.5)

while i >= 2:
    if X % i == 0:
        X += 1
        i = int(X**0.5)
    else:
        i -= 1
        
print(X)

Buggy submission (verdict: Runtime Error):
X = int(input())
i = int(n**0.5)

while i >= 2:
    if X % i == 0:
        X += 1
        i = int(X**0.5)
    else:
        i -= 1
        
print(X)

Buggy submission (verdict: Runtime Error):
X = int(input())
i = int(n**0.5)

while i >= 2:
    if X % i == 0:
        X += 1
        i = int(X**0.5)
    else:
        i -= 1
        
print(X)
Problem p02831 (python)

Fixed submission:
import math

A, B =map(int, input().split())

print(int(A*B / math.gcd(A, B)))

Buggy submission (verdict: Runtime Error):
import math

A, B =map(int, input().split())

print(A*B / gcd(A, B))
Problem p02627 (python)

Fixed submission:
input_line = input()

if input_line.isupper() == True:
  print("A")
else:
  print("a")

Buggy submission (verdict: Runtime Error):
import sys

input_list = sys.stdin.readlines()

count = 1
get_count = 0
get_value_count = 0
for i in input_list:
  get_values = i.split()
  if count == 1:
    get_value_count = int(get_values[0])
    get_count = int(get_values[1])
  else:
    if get_value_count == 1:
      print(get_values[0])
    else:
      get_values.sort()
      count_value = 1
      p = 0
      for c in get_values:
        if count_value > get_count:
          print(str(p))
        else:
          p = p + int(c)
        count_value = count_value + 1
  count = count + 1
Problem p02595 (python)

Fixed submission:
n,d = map(int,input().split(" "))
d *= d
c = 0
for i in range(n):
  a,b =map(int,input().split(" "))
  if(a**2 + b**2 <= d):
    c += 1
print(c)

Buggy submission (verdict: Runtime Error):
n,d = map(int,input(),split(" "))
d *= d
c = 0
for i in range(n):
  a,b =map(int,input().split(" "))
  if(a**2 + b**2 == d):
    c += 1
print(c)

Buggy submission (verdict: Runtime Error):
n,d=int(input()),int(input())
c = 0
d *= d
for i in range(n):
  a,b=int(input()),int(input())
  if(a**2+b**2==d):
    c+=1
print(c)
Problem p02688 (python)

Fixed submission:
[n,k] = map(int, input().split())
SET = set()
for i in range(k):
  d = int(input())
  tmp = set(map(int, input().split()))
  SET = (SET|tmp)
print(n-int(len(SET)))

Buggy submission (verdict: Runtime Error):
[n,k] = map(int, input().split())
SET = set()
for i in range(k):
	d = int(input())
    tmp = set(map(int, input().split()))
    SET = (SET|tmp)

print(n-int(len(SET)))
Problem p02951 (python)

Fixed submission:
nums = input().split()

a = int (nums[0])
b = int (nums[1])
c = int (nums[2])

nokori = a - b

s = c-nokori


if s < 0 :
	s = 0

print (s)

Buggy submission (verdict: Runtime Error):
import sys

a = int(input())

cnt = 0

for i in range(1,10):
	cnt += 1
	if i == a :
		print (cnt)
		sys.exit()
if a < 100 :
	print (cnt)
	sys.exit()
for j in range(100,1000):
	cnt += 1
	if j == a :
		print (cnt)
		sys.exit()
        
if a < 10000 :
	print (cnt)
	sys.exit()
for k in range(10000,100000):
	cnt += 1
	if k == a :
		print (cnt)
		sys.exit()
if a == 100000 :
	print (cnt)
	sys.exit()

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

cnt = 0

for i in range(1,10):
	cnt += 1
	if i < a :
		print (cnt)
		exit()

for j in range(100,1000):
	cnt += 1
	if i < a :
		print (cnt)
		exit()

for k in range(10000,100000):
	cnt += 1
	if i < a :
		print (cnt)
		exit()
Problem p02629 (python)

Fixed submission:
import string

# 1千兆 + 1
N = int(input())
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase

x = N - 1
ans = []
# while True:
#     mod = x % 26
#     ans = [ mod ] + ans
#     x = x // 26
#     if x <= 0:
#         if ans[0] == 0:
#             ans = [0] + ans
#         break

# print(ans)
# print("".join([ letters[v] for v in ans ]))

while True:
    mod = x % 26
    div = x // 26
    
    ans.append(mod)
    if div == 0:
        break
    x = div - 1

ans = ans[::-1]
# print(ans)
print("".join([ letters[v] for v in ans ]))

Buggy submission (verdict: Runtime Error):
import string

# 1千兆 + 1
N = int(input())
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase

x = N
ans = []
# while True:
#     x -= 1
#     mod = x % 26
#     ans = [ mod ] + ans
#     x = x // 26
#     if x <= 0:
#         break

# print(ans)
# print("".join([ letters[v] for v in ans ]))

while True:
    x -= 1
    mod = x % 26
    # div = x // 26
    x = x // 26
    
    ans.append(mod)
    if div == 0:
        break

ans = ans[::-1]
print("".join([ letters[v] for v in ans ]))

Buggy submission (verdict: Runtime Error):
import string

# 1千兆 + 1
N = int(input())
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase

x = N - 1
ans = []
# while True:
#     x -= 1
#     mod = x % 26
#     ans = [ mod ] + ans
#     x = x // 26
#     if x <= 0:
#         break

# print(ans)
# print("".join([ letters[v] for v in ans ]))

while True:
    x -= 1
    mod = x % 26
    # div = x // 26
    x = x // 26
    
    ans.append(mod)
    if div == 0:
        break

ans = ans[::-1]
print("".join([ letters[v] for v in ans ]))

Buggy submission (verdict: Runtime Error):
import string

# 1千兆 + 1
N = int(input())
n_digits = len(str(1000000000000001))
map_letters = { i:v for i,v in enumerate(string.ascii_lowercase)}

x = N - 1
ans = []
for d in range(n_digits):
    if x == 0:
        break
    mod = x % 26
    ans = [ mod ] + ans
    x = x // 26

fa = []
for i in range(len(ans)-1):
    fa.append(ans[i]-1)
fa.append(ans[-1])
print(
    ''.join(map(lambda d: map_letters[d], fa))
)

Buggy submission (verdict: Runtime Error):
import string

# 1千兆 + 1
N = int(input())
n_digits = len(str(1000000000000001))
map_letters = { i+1:v for i,v in enumerate(string.ascii_lowercase)}

x = N
ans = []
for d in range(n_digits):
    if x == 0:
        break
    mod = x % 26
    ans = [ mod ] + ans
    x = x // 26

print(
    ''.join(map(lambda d: map_letters[d], ans))
)
Problem p02859 (python)

Fixed submission:
import sys


def main():
    r = int(input())
    print(r**2)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
import math


def validate(r):
    return int(r)


def main(args):
    r = validate(args[1])
    print(r**2)


if __name__ == '__main__':
    main(sys.argv)
Problem p02860 (python)

Fixed submission:
import sys


def main(n: int, s: str):
    if n % 2 != 0:
        print('No')
        return

    p = int(n / 2)
    if s[:p] == s[p:]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    args = [input() for i in range(2)]
    main(int(args[0]), args[1])

Buggy submission (verdict: Runtime Error):
import sys


def main(n: int, s: str):
    if n//2 != 0:
        print('No')

    if s[0:n/2] == s[n/2:]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    args = [input() for i in range(2)]
    main(int(args[0]), args[1])
Problem p02707 (python)

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

C = collections.Counter(A)
#print(C)

for i in range(N):
  #print(A.count(i+1))
  print(C[i+1])

Buggy submission (verdict: Runtime Error):
N = input()
a = input().split()
list_i = [int(b) for b in a]

#print(N)
#print(list_i)

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

Buggy submission (verdict: Runtime Error):
N = input()
a = input().split()
list_i = [int(b) for b in a]

print(N)
print(list_i)

for i in range(N):
  print(list_i.count(i+1))
Problem p02597 (python)

Fixed submission:
num = int(input())
wr = str(input())

r_num = wr.count("R")
i_counts = [r_num]
rw_count = r_num
wr_count = 0
for i in range(num):
  if wr[i] == "W":
    wr_count += 1
  else:
    rw_count -= 1
  i_count = max(wr_count, rw_count)
  i_counts.append(i_count)

ans = min(i_counts)

print(ans)

Buggy submission (verdict: Runtime Error):
num = int(input())
wr = str(input())

i_counts = []
r_num = wr.count("R")

for i in range(r_num):
  w_counts = 0
  r_counts = 0
  for j in range(num):
    if i > j and wr[j] == "W":
      w_counts += 1
    elif i < j and wr[j] == "R":
      r_counts += 1
  i_count = max(w_counts, r_counts)
  i_counts.append(i_count)

ans = min(i_counts)
print(ans)
Problem p02834 (python)

Fixed submission:
from collections import deque
n, u, v = map(int, input().split())
u-=1; v-=1;
a = []; b = [];
dist = [[] for i in range(n)]
for i in range(n-1):
    a, b = map(int, input().split())
    a -= 1; b -= 1
    dist[a].append(b)
    dist[b].append(a)

def bfs(u):
    d = [-1]*n
    stack = deque([u])
    d[u] = 0
    while len(stack)!=0:
        s = stack.popleft()
        for t in dist[s]:
            if d[t]==-1:
                d[t] = d[s]+1
                stack.append(t)
    return d

A = bfs(v)
T = bfs(u)
ans=0
for i in range(n):
    if A[i]>T[i]:
        ans = max(A[i]-1, ans)
print(ans)

Buggy submission (verdict: Runtime Error):
from collections import deque
n, u, v = map(int, input().split())
u-=1; v-=1;
a = []; b = [];
dist = [[] for i in range(n)]
for i in range(n-1):
    a, b = map(int, input().split())
    a -= 1; b -= 1
    dist[a].append(b)
    dist[b].append(a)

def bfs(u):
    d = [-1]*n
    stack = deque([u])
    d[u] = 0
    while len(stack)!=0:
        s = stack.popleft()
        for t in dist[s]:
            if d[t]==-1:
                d[t] = d[s]+1
                stack.append(t)
    return d

A = bfs(v)
T = bfs(u)
ans=0
for i in range(n):
    if A[i]>d[i]:
        ans = max(A[i]-1, ans)
print(ans)
Problem p03804 (python)

Fixed submission:
# -*- coding: utf-8 -*-
N, M = map(int, input().split())
A = []
B = []

for i in range(N):
    A.append(input())
for i in range(M):
    B.append(input())

for i in range(N - M + 1):
    offset = 0
    while offset + M <= N:
        pos = A[i][offset:].find(B[0])        
        if -1 == pos:
            break
        offset += pos
        for j in range(1,M):
            if 0 != A[i+j][offset:].find(B[j]):
                offset += 1
                break
        else:
            print('Yes')
            exit()
else:
    print('No')

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N, M = map(int, input().split())
A = []
B = []

for i in range(N):
    A.append(input())
for i in range(M):
    B.append(input())

for i in range(N):
    offset = 0
    while offset + M <= N:
        pos = A[i][offset:].find(B[0])        
        if -1 == pos:
            break
        offset += pos
        for j in range(1,M):
            if 0 != A[i+j][offset:].find(B[j]):
                offset += 1
                break
        else:
            print('Yes')
            exit()
else:
    print('No')
Problem p02859 (python)

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

Buggy submission (verdict: Runtime Error):
r = int(input())
print r*r

Buggy submission (verdict: Runtime Error):
r = int(input())
return r * r

Buggy submission (verdict: Runtime Error):
r = int(str.input())
return r * r
Problem p02594 (python)

Fixed submission:
n=int(input())

if n>=30:
	print("Yes")

else:
	print("No")

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

if n>=30:
	print("Yes)

else:
	print("No")
Problem p02622 (python)

Fixed submission:
s,t = input(), input()

S = list(s)
T = list(t)

N = len(s) - 1
i = 0
counter = 0

while N + 1 != i:
    if S[i] != T[i]:
        S[i] = T[i]
        counter += 1
    i += 1

print(counter)

Buggy submission (verdict: Runtime Error):
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S] - 1
i = 0

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
    i += 1

print(i + 1)

Buggy submission (verdict: Runtime Error):
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
    i += 1

Buggy submission (verdict: Runtime Error):
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
    i += 1

Buggy submission (verdict: Runtime Error):
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
        i += 1

Buggy submission (verdict: Runtime Error):
L = map(str, input())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
        i += 1

Buggy submission (verdict: Runtime Error):
rows = int(input())
L = [input() for i in range(rows)]

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
        i += 1

Buggy submission (verdict: Runtime Error):
L = list(input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
        i += 1

Buggy submission (verdict: Runtime Error):
s = input()
S = list(S)
T = list(input())
N = len(s)
i = 1

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
        i += 1
Problem p02859 (python)

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

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

Buggy submission (verdict: Runtime Error):
r = input()
ans = rˆ2
print(ans)
Problem p02933 (python)

Fixed submission:
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print("red")

Buggy submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())
print('{:.16g}'.format(1/sum(1/x for x in a)))

Buggy submission (verdict: Runtime Error):
n = int(input())
numbers = []
i = 0
while i <= n:
  numbers.append(int(input()))
  i += 1

j = 0
s = 0
while n >= j:
  s += 1/numbers[j]
  i += 1

print(1/s)