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

Fixed submission:
N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Buggy submission (verdict: Runtime Error):
N = [int(i) for i in input().split]
A = [int(i) for i in input().split]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Buggy submission (verdict: Runtime Error):
N = list[int(i) for i in input().split]
A = list[int(i) for i in input().split]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')

Buggy submission (verdict: Runtime Error):
N = list[int(i) for i in input().split]
A = list[int(i) for i in input().split]
if all([i%2==1 for i in A]):
    print('APPROVED')
else:
    even = [i for i in A if i%2==0]
    print(even)
    even = [0 if i%3==0 or i%5==0 else 1 for i in even]
    if max(even)==1:
        print('DENIED')
    else:
        print('APPROVED')
Problem p03125 (python)

Fixed submission:
a,b=(int(x) for x in input().split())
if b%a==0:
    print(a+b)
else:
    print(b-a)

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

if b%a==0:
    print(a+b)
else:
    print(b-a)
Problem p02900 (python)

Fixed submission:
import fractions
import itertools

# nの約数をすべて求める
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

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

# 最大公約数gcd
gcd = fractions.gcd(A,B)
# 公約数=最大公倍数gcdの約数
cd = make_divisors(gcd)
cd = sorted(cd)

# 小さいものから1つずつ
ans = set()
for x in cd:    
    if len(ans) == 0:
        # 集合が空なら
        ans.add(x)
    else:
        # 集合のどの要素ともxが互いに素なら，追加
        if all([fractions.gcd(x,y)==1 for y in ans]):
            ans.add(x)

#print(ans)
print(len(ans))

Buggy submission (verdict: Runtime Error):
import fractions
import itertools
import math

# nの約数をすべて求める
def make_divisors(n):
    divisors = {}
    #for i in range(1, int(n**0.5)+1):
    for i in itertools.takewhile(lambda i: i**2<=n, itertools.count(1)):
        if n % i == 0:
            divisors.add(i)
            if i != n // i:
                divisors.add(n//i)
    
    return divisors

# 素因数分解
# 素因数とその指数をペアにして配列で返す
def factorize(n):
    # 素因数の候補
    # i=2,...,floor(sqrt(n)) つまりi**2<=nになるまで
    remainder = n
    ret = {}
    for i in itertools.takewhile(lambda i: i**2<=n, itertools.count(2)):
        # 現在の余りをiで割れるだけ割る
        if remainder % i:
            continue
        else:
            # 割れるなら，割れる回数と余りを求める
            p = 0
            while remainder % i == 0:
                remainder //= i
                p += 1

            ret.add((i,p))

    # 2以上の余りが残っていれば，追加
    if remainder > 1: ret.add((remainder,1))

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

# 答えの集合は1or素数で構成されるとして良い (a*b,a>1,b>1となる要素があれば，aも公約数だから，a*bをaに置き換えても最適解になるから)
# つまり，A,Bをそれぞれ素因数分解し，共通の素因数の数を数えればよい
# これは，gcd(A,B)の素因数の数と同じ
gcd = fractions.gcd(A,B)
divs = factorize(gcd)
print(len(divs) + 1) # + 1は"1"の数
Problem p03206 (python)

Fixed submission:
D = input()
dic = {'22':'Christmas Eve Eve Eve', '23':'Christmas Eve Eve', '24':'Christmas Eve', '25':'Christmas'}
print(dic[str(D)])

Buggy submission (verdict: Runtime Error):
D = input
msg = 'Christmas'
ev = ' Eve'
dic = {'22':msg+ev*3, '23':msg+ev*2, '24':msg+ev, '25':msg}
print(dic[str(D)])
Problem p02767 (python)

Fixed submission:
from statistics import mean
N = int(input())
X = input().split()
for i in range(len(X)):
    X[i] = int(X[i])
goal = round(mean(X)) 
sum = 0
for i in range(len(X)):
    sum += (X[i] - goal) ** 2
print(sum)

Buggy submission (verdict: Runtime Error):
N = int(input())
X = [int(x) for x in input().split()]
result = []
sum = 0
goal = round(mean(X))
for i in range(len(X)):
    sum += (X[i] - goal) ** 2
print(sum)
Problem p02911 (python)

Fixed submission:
import numpy as np
N , K ,Q = map(int, input().split())
initializer_list = [0] * N
for _ in range(Q):
    i = int(input())-1
    initializer_list[i] += 1
    

[print('Yes') if (Q - initializer_list[i] < K) else print('No')  for i in range(N)]

Buggy submission (verdict: Runtime Error):

import numpy as np
N , K ,Q = map(int, input().split())
s = []
for i in range(Q):
    s.append(int(input())-1)
initializer_list = np.full(N,K)
for i in range(len(s)):
    for j in range(len(initializer_list)):
        if j == s[i]:
            pass
        else:
            initializer_list[j] -= 1
for i in range(len(initializer_list)):
    if initializer_list[i] > 0:
        print('Yes')
    else:
        print('No')
Problem p03001 (python)

Fixed submission:
w,h,x,y = map(int,input().split())
flag = 0
if ((x/w) ==0.5) and ((y/h) == 0.5):
  flag = 1
print((w*h)/2,flag)

Buggy submission (verdict: Runtime Error):
w,h,x,y = map(int,int.split())
flag = 0
if (x/W)==(y/W):
  flag = 1
print((w*h)/2,flag)
Problem p03029 (python)

Fixed submission:
a, b = map(int, input().split()) 
print((3*a + b) // 2)

Buggy submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

Buggy submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
print(sorted(rest))
cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

Buggy submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
print(sorted(rest))
cities = cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

Buggy submission (verdict: Runtime Error):
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
print(sorted(rest))
cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])
Problem p03071 (python)

Fixed submission:
import itertools
num = list(map(int, input().split()))
result = 0
tmp_1 = 0
tmp  =0
tmp_2 = 0
if num[0] == num[1]:
    tmp  = num[0] +  num[0]
else:
    tmp = num[0] + num[1]
    tmp_1 = num[0] + num[0] -1
    tmp_2 = num[1] + num[1] -1
print(max(tmp,tmp_1,tmp_2))

Buggy submission (verdict: Runtime Error):
N = int(input())
num = list(map(int, input().split()))
tmp = 0
state_tmp = 0
result = 1
#i番目を比べる
for i in range(N):
    if i != 0 and 1<= num[i] <= 200:
        for j in range(N):
            if num[j] <= num[i]:
                state_tmp +=1
        if state_tmp ==  N and tmp <= num[i]:
                result +=1
        tmp = num[i]
        state_tmp = 0
    else:
        tmp = num[i]
    
print(result)
Problem p02772 (python)

Fixed submission:
import sys
N = int(input())
A = [int(i) for i in input().split()]
for i in A:
  if i%2 == 0 and (not i%3 == 0 and not i % 5 == 0):
    print("DENIED")
    sys.exit()
  else :
    continue
print("APPROVED")

Buggy submission (verdict: Runtime Error):
N=input();print('DENIED'if any([x%2==0 and(x%3andx%5)for x in map(int,input().split())])else'APPROVED')

Buggy submission (verdict: Runtime Error):
N=int(input())
print('DENIED' if any([x%2==0 and (x%3 and x%5) for x in int(input().split())]) else 'APPROVED')

Buggy submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split()))(A1,A2...AN)
t=0
for i in b:
	if x % 2 ==0 and x % 3 != 0 and x % 5 != 0:
		t=t+1
if t>0:
	print('DENIED')
else:
	print('APPROVED')

Buggy submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split()))(A1,A2...AN)
t=0
for i in A:
	if x % 2 ==0 and x % 3 != 0 and x % 5 != 0:
		t=t+1
if t>0:
	print('DENIED')
else:
	print('APPROVED')
Problem p02778 (python)

Fixed submission:
A = input()
B = len(A)
print("x"*B)

Buggy submission (verdict: Runtime Error):
A = input()
B = len(A)
print(x*B)
Problem p02784 (python)

Fixed submission:
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
B = max(0,N-sum(A))
if B > 0:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
A.sort(reverse = True)
B = max(0,N-(A[0]+A[1]))
if B > 0:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
A.sort(reverse = True)
B = max(0,H-(A[0]+A[1]))
if B > 0:
    print("No")
else:
    print("Yes")
Problem p02789 (python)

Fixed submission:
A,B = map(int,input().split())
if A == B :
    print ("Yes")
else :
    print ("No")

Buggy submission (verdict: Runtime Error):
N,M = map(int,input().split())
if N = M:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a, b = map(int,input().split())
A = list(str(a)*b,), B = list(str(b)*a)
C = max(len(A),len(B))
for i in range(C)
  if A[i] > B[i]:
  　　　　print(str(B))
         break
  elif B[i] > A[i]:
         print(str(A))
         break

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A == B :
    print "Yes"
else :
    print "No"

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A = B :
    print "Yes"
else :
    print "No"
Problem p02801 (python)

Fixed submission:
C = input()
print(chr(ord(C)+1) )

Buggy submission (verdict: Runtime Error):
C = input()
print(chr(ord(C)+1)
Problem p02811 (python)

Fixed submission:
K,X =[int(i)for i in input().split()]
if 500*K >=X:
  print("Yes")
else :
  print("No")

Buggy submission (verdict: Runtime Error):
K,X =[int(i)for i in input().split()]
if 500K >=X:
  print("Yes")
else :
  print("No")
Problem p02818 (python)

Fixed submission:
a, b, k = map(int, input().split())
print(max(0, a - k), max(0, b - max(0, k - a)))

Buggy submission (verdict: Runtime Error):
A,B,K = map(int,input().split())
if A > 100000000000 or B > 100000000000 or K > 100000000000:
    A = 0
    B = 0
else:
    C = max(0,A-K)
    B = max(0,(A+ B) - K)
print(C,B)

Buggy submission (verdict: Runtime Error):
A,B,K = map(int,input().split())
if A >= 1000000000000 or B >= 1000000000000 or K >= 1000000000000:
    A = 0
    B = 0
else:
    C = max(0,A-K)
    B = max(0,(A+ B) - K)
print(C,B)

Buggy submission (verdict: Runtime Error):
A,B,K = map(int,input().split())
if A or B or K >= 100000000000
  A = 0 B = 0 
for _ in range(K):
  if A >= 1:
    A -= 1
  elif B >= 1:
    B -= 1
  else:
    break
print(A,B)
Problem p02830 (python)

Fixed submission:
N = int(input())
S,T = input().split()
S = list(S)
T = list(T)
q = ''
for u in S :
  for d in T:
    q += u
    q += d
    T.remove(T[0])
    break
print(q)

Buggy submission (verdict: Runtime Error):
N = int(input())
S,T = input().split()
q = None
for u in S :
  for d in T:
    q += u
    q += d
    break
print(q)
Problem p02848 (python)

Fixed submission:
N = int(input())
S = input()
A = ''
for i in range(len(S)):
    if ord(S[i])+N <= 90:
        A += chr(ord(S[i])+N)
    
    else:
        A += chr(ord(S[i])+N-26)
        
print(A)

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()
A = []
for i in range(S):
  if chr(ord(S[i])+N) <= 90:
    A.append(ord(S[i]+N)
  else :
    A.append(ord(S[i]+N-26)
Problem p02898 (python)

Fixed submission:
N,K =map(int,input().split())
height = [int(i) for i in input().split()]
A = 0
for u in height:
  if u >= K:
    A += 1
print(A)

Buggy submission (verdict: Runtime Error):
N,K =map(int,input().split())
height = [for i in input().split()]
A = 0
for u in height:
  if u >= K:
    A += 1
print(A)
Problem p02910 (python)

Fixed submission:
S = list(input())
for s in range(len(S)):
  if s % 2 == 0:
    if S[s] == "L":
      print("No")
      break
  else:
    if S[s] == "R":
      print("No")
      break
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
S = list(input())
for s in len(S):
  if s % 2 == 1:
    if S[s] == "L":
      print("No")
      break
  else:
    if S[s] == "R":
      print("No")
      break
else:
  print("Yes")
Problem p02922 (python)

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

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

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

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
if B>A:
    print(B//A +1)
elif B = 1:    
    print(0)
else:
    print(1)
Problem p02945 (python)

Fixed submission:
A,B=map(int,input().split())
if A + B >= A - B:
    if A + B>=A * B:
        print(A + B)
    else :
        print(A * B)
else :
    if A - B >= A * B:
        print(A - B)
    else:
        print(A * B)

Buggy submission (verdict: Runtime Error):
A,B=map(int,input())
if A + B >= A - B:
    if A + B>=A * B:
        print(A + B)
    else :
        print(A * B)
else :
    if A - B >= A * B:
        print(A - B)
    else:
        print(A * B)
Problem p02946 (python)

Fixed submission:
K,X = map(int,input().split())
A = X-K+1
B = X + K
for i in range(A,B):
    print(i)

Buggy submission (verdict: Runtime Error):
K,X = map(int,input().split())
A = X-K+1
B = X + K
for i in range(A,B)
    print(i)
Problem p02952 (python)

Fixed submission:
N =int(input())
if N >=10 and N<=99:
  print(9)
elif N >=100 and N<=999:
  print(N-90)
elif N >= 1000 and N<= 9999:
  print(9 + 900)
elif N >= 10000 and N<= 99999:
  print(N-90-9000)
elif N == 100000:
  print(9 + 900 + 90000)
else:
  print(N)

Buggy submission (verdict: Runtime Error):
N =int(input())
if N >=10 and N<=99:
  print(9)
elif N >=100 and N<=999:
  print(N-90)
elif N >= 1000 and N<= 9999:
  print(900)
elif N >= 10000 and N<= 99999:
  print(N-90-9000)
elif N = 100000:
  print(9 + 900 + 90000)
else:
  print(N)
Problem p02957 (python)

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

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

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
if (a + b)%2 = 0:
    print((a+b)/2)
else:
    print("impossible")
Problem p02981 (python)

Fixed submission:
N,A,B = map(int,input().split())
if N*A>=B:
    print(B)
else:
    print(N*A)

Buggy submission (verdict: Runtime Error):
N,A,B = map(int,input().split)
if N*A>=B:
    print(N*A)
else:
    print(B)
Problem p03085 (python)

Fixed submission:
b = input()
c = {"A":"T","C":"G" ,"T":"A","G":"C"}
print(c[b])

Buggy submission (verdict: Runtime Error):
b = input()
c = {"A":T,"C":G}
print(c[b])
Problem p03101 (python)

Fixed submission:
H,W =map(int,input().split())
h,w =map(int,input().split())
print(H*W-h*W-w*H+h*w)

Buggy submission (verdict: Runtime Error):
H,W =map(int,input().split())
h,m =map(int,input().split())
print(H*W-h*W-w*H+h*W)

Buggy submission (verdict: Runtime Error):
H,W =map(int,input().split())
h,m =map(int,input().split())
print(H*W-h*W-w*H+h*W)

Buggy submission (verdict: Runtime Error):
H,W =map(int,input().split())
h,m =map(int,input(),split())
print(H*W-h*W-w*H+h*W)
Problem p03109 (python)

Fixed submission:
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) == 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
  print("TBD")

Buggy submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
print("TBD")

Buggy submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019,int(B) <=4,int(C)<=30:
  print("Heisei")
else:
print("TBD")

Buggy submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019,int(B) <=4,int(C)<=30:
  print("Heisei")
else int(A)>=2019:
print("TBD")

Buggy submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019,int(B) <=4,int(C)<=30:
  print("Heisei")
elif int(A)>=2019:
print("TBD")

Buggy submission (verdict: Runtime Error):
A,B,C = map(str,input().split())
if A <= 2018:
  print("Heisei")
elif B <=3:
  print("Heisei")
elif C <=29:
  print("Heisei")
else:
  print("TBG")
Problem p03125 (python)

Fixed submission:
A,B = map(int,input().split())
if round(B%A) == 0:
  print(A + B)
else:
  print(B-A)

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
if round(A % B) = 0:
  print(A + B)
else:
  print(A-B)

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A % B = 0:
  print(A + B)
else:
  print(A-B)
Problem p03145 (python)

Fixed submission:
A=list(map(int,input().split()))
A.sort()
print(round(A[0]*A[1]/2))

Buggy submission (verdict: Runtime Error):
A=list(map(int,input().split()))
A = A.sort()
print(A[1]*A[2]/2)

Buggy submission (verdict: Runtime Error):
A=list(map(int,input().split()))
A = A.sort
print(A[1]*A[2]/2)
Problem p03238 (python)

Fixed submission:
A = int(input())
if A == 1:
  print("Hello World")
if A == 2:
  B = int(input())
  C = int(input())
  print(B + C)

Buggy submission (verdict: Runtime Error):
A = input()
if A = 1:
  print("Hello world")
if A = 2:
  B = int(input())
  C = int(input())
  print(A+B)
Problem p02812 (python)

Fixed submission:
n=input();s=input()
print(s.count('ABC'))

Buggy submission (verdict: Runtime Error):
n=input();s=input()
print(s.count('ABC')
Problem p02898 (python)

Fixed submission:
i=input;n,k=i().split();l=[int(_) for _ in i().split()];c=0
for _ in l:
  if _>=int(k):
    c+=1
print(c)

Buggy submission (verdict: Runtime Error):
i=input;s=split;n,k=i().s();l=[int(_) for _ in i().s()];c=0
for _ in l:
  if _>int(~-k):
    c+=1
print(c)
Problem p02780 (python)

Fixed submission:
def main():    
    n, k = map(int, input().split())
    p = list(map(int, input().split()))
    s = sum(p[:k])
    maxs = s
    for i in range(n-k):
        s = s - p[i] + p[i+k]
        if s > maxs:
            maxs = s
    ans = (maxs+k)/2
    print(ans)
main()

Buggy submission (verdict: Runtime Error):
nk = list(map(int, input().split()))
p = list(map(int, input().split()))
n = nk[0]
k = nk[1]
s = []
e = []
for i in range(n):
    s.append(sum(p[:i+1]))

for i in range(n-k):
    e.append(s[i+k]-s[i])

ans = (max(e)+k)/2

Buggy submission (verdict: Runtime Error):
nk = list(map(int, input().split()))
p = list(map(int, input().split()))
n = nk[0]
k = nk[1]
maxnum = 0
for i in range(n-k):
    if p[i+k] >= p[i]:
        maxnum = i+k

ans = (sum(p
Problem p03455 (python)

Fixed submission:
a, b = map(int, input().split())
if a*b%2 == 1:
    print("Odd")
else:
    print("Even")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a*b%2 == 1:
    print("Odd")
elif a*b%2 == 0:
    print("Even")
Problem p02765 (python)

Fixed submission:
input_data = input().split()
 
N = int(input_data[0])
R = int(input_data[1])
 
if N >= 10 :
  print(R)
else:
  print(R+100*(10-N))

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

N = int[0]
R = int[1]

if N >=10 :
  print(R)
else:
  print(100*(10-N))
Problem p02783 (python)

Fixed submission:
import math

H,A = map(int,input().split())
f, i = math.modf(H/A)

if not H <= 10^4 and H >= 1:
  False
if not A <= 10^4 and H >= 1:
  False

if f == 0:
  print(int(i))
if f != 0:
  print(int(i+1))

Buggy submission (verdict: Runtime Error):
H,A = (int(x) for x input().split())

if not H <= 10^4 && H >= 1:
  return False
if not A <= 10^4 && H >= 1:
  return False

int count = 0
while H >= 0:
  count=+
  H = H - A

print(count)
Problem p02765 (python)

Fixed submission:
line = list(map(int,input().split()))
if line[0] >= 10:
  print(line[1])
else:
  print(line[1] + (100 * (10 - line[0])))

Buggy submission (verdict: Runtime Error):
line = list(map(int,input().split()))
if line[0] >= 10:
  print(line[1])
else:
  print(line[1] + (100 * (10 - line[0]))
Problem p02765 (python)

Fixed submission:
N, R = map(int, input().split())
if N>10: N=10
print(R+(100*(10-N)))

Buggy submission (verdict: Runtime Error):
N, R = map(int, input().split())
print(R+(100*(10-K)))
Problem p02768 (python)

Fixed submission:
MOD = 1000000007

n, a, b = map(int, input().split())

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def xgcd(a, b):
	x0, y0, x1, y1 = 1, 0, 0, 1
	while b != 0:
		q, a, b = a // b, b, a % b
		x0, x1 = x1, x0 - q * x1
		y0, y1 = y1, y0 - q * y1
	return a, x0, y0

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def modinv(a, m):
	g, x, y = xgcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def combination(n, r):
	ans = 1
	for i in range(n - r + 1, n + 1):
		ans *= i
		ans %= MOD
	for i in range(1, r + 1):
		ans *= modinv(i, MOD)
		ans %= MOD
	return ans

ans = 0
ans += pow(2, n, MOD) - 1
ans += MOD - combination(n, a)
ans += MOD - combination(n, b)
ans %= MOD

print(ans)

Buggy submission (verdict: Runtime Error):
MOD = 1000000007

n, a, b = map(int, input().split())

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def xgcd(a, b):
	x0, y0, x1, y1 = 1, 0, 0, 1
	while b != 0:
		q, a, b = a // b, b, a % b
		x0, x1 = x1, x0 - q * x1
		y0, y1 = y1, y0 - q * y1
	return a, x0, y0

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def modinv(a, m):
	g, x, y = xgcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def combination(n, r):
	ans = 1
	for i in range(n - r + 1, n + 1):
		ans *= i
		ans %= MOD
	for i in range(1, r + 1):
		ans *= modinv(i, MOD)
		ans %= MOD
	return ans

ans = 0
ans += pow(2, n, MOD)
 - 1
ans += MOD - combination(n, a)
ans += MOD - combination(n, b)
ans %= MOD

print(ans)
Problem p03997 (python)

Fixed submission:
print (input() + input()) * input() / 2

Buggy submission (verdict: Runtime Error):
a, b, h = map(int, raw_input().split())
print (a + b) * h / 2
Problem p02765 (python)

Fixed submission:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-N)
  print(ans)

Buggy submission (verdict: Runtime Error):
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-k)
  print(ans)

Buggy submission (verdict: Runtime Error):
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]
ans = 0

if N  >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-k)
  print(ans)

Buggy submission (verdict: Runtime Error):
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]
ans = 0

if N  <= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-k)
  print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
R = int(input())
ans = 0

if N < 10:
  ans = R + 100*(10-N)
  print(ans)
else:
  ans = R
  print(R)

Buggy submission (verdict: Runtime Error):
N = input()
R = input()
ans = 0

if N < 10:
  ans = R + 100*(10-N)
  print(ans)
else:
  ans = R
  print(R)