Harryxun/GPT-100-sft-dataset huggingface dataset:
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):
h,w=map(int,input().split())
if (h==1 and w!=1) or (h!=1 and w==1):
    print(1)
else:
    m=h*w
    print((m+2-1)//2)
Problem p02748 (python)

Fixed submission:
A,B,M=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
xyc=[list(map(int,input().split())) for i in range(M)]
ans = []
for i in range(M):
  ans.append(a[xyc[i][0]-1]+b[xyc[i][1]-1]-xyc[i][2])
mi=min(a)+min(b)
print(min(min(ans),mi))

Buggy submission (verdict: Runtime Error):
A,B,M=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
xyc=[list(map(int,input().split())) for i in range(M)]
ans = []
for i in range(M):
  ans.append(a[xyc[i][0]-1]+a[xyc[i][1]-1]-xyc[i][2])
mi=min(a)+min(b)
print(min(min(ans),mi))
Problem p02765 (python)

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

Buggy submission (verdict: Runtime Error):
def framod(n, mod, a=1):
    for i in range(1,n+1):
        a=a * i % mod
    return a

def power(n, r, mod):
    if r == 0: return 1
    if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
    if r%2 == 1:
        return n * power(n, r-1, mod) % mod

def comb(n, k, mod):
    a=framod(n, mod)
    b=framod(k, mod)
    c=framod(n-k, mod)
    return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod
n,a,b=map(int,input().split())
modd = 10**9+7
print(2**n-comb(n,a,modd)-comb(n,b,modd)-1)
Problem p02780 (python)

Fixed submission:
import numpy

n,k = map(int,input().split())
p = list(map(int,input().split()))
q = []
for i in range(n):
    q.append(((((p[i]+1)*p[i])/2)/p[i]))

res = numpy.cumsum(q)
ans = []
ans.append(res[k-1])
for i in range(k,n):
  ans.append(res[i]-res[i-k])
print(max(ans))

Buggy submission (verdict: Runtime Error):
import numpy

n,k = map(int,input().split())
p = list(map(int,input().split()))
q = []
for i in range(n):
    q.append(((((p[i]+1)*p[i])/2)/p[i]))
res = numpy.cumsum(q)
print(q)
ans = []
ans.append(q[k-1])
for i in range(k,n):
  ans.append(res[i]-res[i-k])
print(max(ans))
Problem p02784 (python)

Fixed submission:
h,n=map(int,input().split())
a=list(map(int,input().split()))
a = sorted(a)
if n == 1:
    if a[0] >= h:
        print('Yes')
    else:
        print('No')

elif sum(a) >= h:
    print('Yes')
else:print('No')

Buggy submission (verdict: Runtime Error):
h,n=map(int,input().split())
a=list(map(int,input().split()))
a = sorted(a)
if h == 210 and n ==3:
    print('Yes')
elif a[-1]+a[-2] >= h:
    print('Yes')
else:print('No')
Problem p02789 (python)

Fixed submission:
n,m = map(int,input().split())
if n <= m:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
if n =< m:
  print('Yes')
else:
  print('No')
Problem p02801 (python)

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

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

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

Buggy submission (verdict: Runtime Error):
a,b =int(input())
if a * 500 >= b:
  print('Yes')
else:print('No')
Problem p02817 (python)

Fixed submission:
s,t=input().split()
print(t+s)

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if a <= k:
  print(0,end=' ')
else:
  print(a-k,end=' ')
s = a+b
if s > k:
  print(s-k)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
s,t=map(int,input())
print(t+s)

Buggy submission (verdict: Runtime Error):
s=input()
t=input()
print(t+s)
Problem p02818 (python)

Fixed submission:
a,b,k=map(int,input().split())
if a >= k:
  a -= k
else:
  b=max(b-(k-a),0)
  a=0
print("{} {}".format(a,b))

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
takahasi = k-a
if takahasi < 0:
  print(0,end=' ')
else:
  print(takahasi)
s = a+b
if s - k < 0
  print(0)
else:
  print(s-k)
Problem p02923 (python)

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
ans.append(0)
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    count += 1
    ans.append(count)
  else:
    count=0
print(max(ans))

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

ans = []
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    print(h[i])
    print(h[i+1])
    count+=1
  elif h[i] <= h[i+1]:
    ans.append(count)
    count = 0
  else:
    ans.append(count)
    
print(max(ans))

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

ans = []
count = 0
for i in range(n-1):
  if h[i] >= h[i+1]:
    count+=1
  else:
    ans.append(count)
    count = 0
print(max(ans))

Buggy submission (verdict: Runtime Error):
n = int(input())
h = list(map,int(input().split()))
for i in range(,n-1):
ans = 0
  if h[i] >= h[i+1]:
    ans += count:
  else:
    break
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
h = list(input().split())
for i in range(,n-1):
ans = 0
  if h[i] >= h[i+1]:
    ans += count:
  else:
    break
print(ans)
Problem p02971 (python)

Fixed submission:
n= int(input())
a = [int(input()) for i in range(n)]
b=sorted(a,reverse=True)
for i in range(n):
  if a[i] == b[0]:
    print(b[1])
  else:
    print(b[0])

Buggy submission (verdict: Runtime Error):
n= int(input())
a = [int(input()) for i in range(n)]
b=sorted(a,reverse=True)
for i in range(n):
  if a[i] = b[0]:
    print(b[1])
  else:
    print(b[0])
Problem p03085 (python)

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

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

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
if max(l) >= sum(l)-max(l):
  print('No')
else:
  print('Yes')

Buggy submission (verdict: Runtime Error):
n = int(input())
l = list(map(int,input().split()))w
if max(l) >= sum(l)-max(l):
  print('No')
else:
  print('Yes')
Problem p03206 (python)

Fixed submission:
b={25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"}
print(b[int(input())])

Buggy submission (verdict: Runtime Error):
b=｛25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"｝
print(b[int(input())]

Buggy submission (verdict: Runtime Error):
b=｛25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"｝
print(b[int(input())])

Buggy submission (verdict: Runtime Error):
a=int(input())
b=｛25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"｝
print(b[int(input())])
Problem p03238 (python)

Fixed submission:
n=int(input())
if n==1:print("Hello World")
else:print(int(input())+int(input()))

Buggy submission (verdict: Runtime Error):
n=int(input())
if n==1:print("Hello World")exit()
else:print(int(input())+int(input()))
Problem p03280 (python)

Fixed submission:
a,b=map(int,input().split())
print((a-1)*(b-1))

Buggy submission (verdict: Runtime Error):
s=input()
k=int(input())
if s.count('1') == len(s):
  print(1)
else:
  count = 0
  for i in s:
    if i != '1':
      print(i)
      break
    else:
      count+=1
      if count == k:
        print(1)
        break
Problem p03282 (python)

Fixed submission:
s=input()
k=int(input())
if s.count('1') == len(s):
  print(1)
else:
  count = 0
  for i in s:
    if i != '1':
      print(i)
      break
    else:
      count+=1
      if count == k:
        print(1)
        break

Buggy submission (verdict: Runtime Error):
 s=input()
k=int(input())
if s.count('1') == len(s):
  print(1)
else:
  count = 0
  for i in s:
    if i != '1':
      print(i)
      break
    else:
      count+=1
      if count == k:
        print(1)
        break
Problem p03284 (python)

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

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

Fixed submission:
n =input()
fn = 0
for i in range(len(n)):
  fn += int(n[i])
if int(n) % fn == 0:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n =input()
fn = 0
for i in range(len(n)):
  fn += n[i]
if int(n) % fn == 0:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n =input()
fn = 0
for i in range(len(n)):
  fn += n[i]
if n // fn == 0:
  print('Yes')
else:
  print('No')
Problem p03399 (python)

Fixed submission:
a = [int(input()) for i in range(4)]
print(min(a[0],a[1])+min(a[2],a[3]))

Buggy submission (verdict: Runtime Error):
a = [int(input()) for i in range(4)]
print(min(a[0],a[1])+min(a[2]+a[3]))
Problem p03415 (python)

Fixed submission:
c=[input() for i in range(3)]
for i in range(3):
  print(c[i][i],end='')

Buggy submission (verdict: Runtime Error):
c=[input() for i in range(3)]
for j in range(3):
  print(c[i],end='')
Problem p03502 (python)

Fixed submission:
n=input()
a = []
for i in range(len(n)):
  a.append(int(n[i]))
if int(n) % sum(a) == 0:
  print('Yes')
else:print('No')

Buggy submission (verdict: Runtime Error):
n=input()
a = []
for i in range(len(n)):
  a.append(int(n[i]))
if n % sum(a)== 0:
  print('Yes')
else:print('No')
Problem p03543 (python)

Fixed submission:
s=input()
for i in range(2):
  count=1
  for j in range(i+1,4):
    if s[i] == s[j]:
      count+=1
    else:count=0
    if count >= 3:
      print('Yes')
      exit()
print('No')

Buggy submission (verdict: Runtime Error):
s=input()
for i in range(2):
  count=0
  for j = in range(i+1,4):
    if s[i] == s[j]:
      count+=1
    else:count=0
    if count >= 3:
      print('Yes')
      exit()
print('No')

Buggy submission (verdict: Runtime Error):
a=sorted(input())
for i in range(4)
	if a.count(a[0]) <= 3:
    print('Yes')
    break
print('No')
Problem p03547 (python)

Fixed submission:
a,b=input().split()
if ord(a) > ord(b):print('>')
elif a == b:print('=')
else:print('<')

Buggy submission (verdict: Runtime Error):
a,b=input.split()
if ord(a) > ord(b):print('>')
elif a == b:print('=')
else:print('<')
Problem p03573 (python)

Fixed submission:
a=input().split()
a=sorted(a)
if a.count(a[0]) == 1:print(a[0])
else:print(a[2])

Buggy submission (verdict: Runtime Error):
a=input().list()
a=sorted(a)
print(a[2])
Problem p03605 (python)

Fixed submission:
a=input()
if a[0] == '9' or a[1] == '9':
  print('Yes')
else:print('No')

Buggy submission (verdict: Runtime Error):
a=input()
if a[0] == '9' or a[1] == '9':
  print('Yes')
else:prnit('No')

Buggy submission (verdict: Runtime Error):
n=input()
if a[0] == '9' or a[1] == '9':
  print('Yes')
else:prnit('No')
Problem p03657 (python)

Fixed submission:
a,b=map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
  print('Possible')
else:print('Impossible')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
  print('Possible')
else:print('Impossible')
Problem p03658 (python)

Fixed submission:
a,b=map(int,input().split())
l = list(map(int,input().split()))
l=sorted(l)
l=l[::-1]
sum = 0
for i in range(b):
  sum += l[i]
print(sum)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
l = [list(map(int,input().split())) for i in range(a)]
l=sorted(l)
l=l[::-1]
sum = 0
for i in range(b-1):
  sum += l[i]
print(sum)
Problem p03671 (python)

Fixed submission:
a=sorted(list(map(int,input().split())))
print(a[0]+a[1])

Buggy submission (verdict: Runtime Error):
a=sorted(list(map(int,input().split()))
print(a[0]+a[1])
Problem p03679 (python)

Fixed submission:
x,a,b=map(int,input().split())
if -1*a+b <= 0:
  print('delicious')
elif -1*a+b <= x:
  print('safe')
else:print('dangerous')

Buggy submission (verdict: Runtime Error):
x,a,c=map(int,input().split())
if -1*a+b <= 0:
  print('delicious')
elif -1*a+b <= x:
  print('safe')
else:print('dangerous')
Problem p03777 (python)

Fixed submission:
a,b=input().split()
if a == 'H':print(b)
elif a == 'D' and b == 'H':print('D')
else:print('H')

Buggy submission (verdict: Runtime Error):
a,b=input.split()
if a == 'H':print(b)
elif a == 'D' and b == 'H':print('D')
else:print('H')
Problem p03844 (python)

Fixed submission:
a,op,b=input().split()
if op == "+":print(int(a)+int(b))
else:print(int(a)-int(b))

Buggy submission (verdict: Runtime Error):
a,op,b=input().split()
if op == "+":print(a+b)
else:print(a-b)
Problem p03962 (python)

Fixed submission:
a=set(map(int,input().split()))
print(len(a))

Buggy submission (verdict: Runtime Error):
a=set(list(map,input().split()))
print(len(a))

Buggy submission (verdict: Runtime Error):
a=set(map,input().split())
print(len(a))
Problem p02700 (python)

Fixed submission:
A,B,C,D = map(int, input().split())
print("Yes" if (C-1)//B <= (A-1)//D else "No")

Buggy submission (verdict: Runtime Error):
A,B,C,D = map(int, input())
print("Yes" if C//B <= A//D else "No")
Problem p02705 (python)

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

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
l = [0]*N
for i in range(1,N):
  l[A[i-1]-1] += 1
for i in range(N):
  print(l[i])

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
l = [0]*N
for i in range(1,N):
  l[A[i-1]-1] += 1
for i in range(N):
  print(l[i])

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

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

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

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

Buggy submission (verdict: Runtime Error):
print(int input()*6.3)
Problem p02612 (python)

Fixed submission:
N = int(input())

if N%1000==0:
    print(0)
else:
    print(1000-(N%1000))

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

if N%1000=0:
    print(0)
else:
    print(1000-(N%1000))
Problem p02613 (python)

Fixed submission:
N = int(input())
S = [str(input()) for i in range(N)]

ac = 0
wa = 0
tle = 0
re = 0
for i in S:
    if i=='AC':
        ac+=1
    elif i=='WA':
        wa+=1
    elif i=='TLE':
        tle+=1
    else:
        re+=1
print('AC x '+str(ac))
print('WA x '+str(wa))
print('TLE x '+str(tle))
print('RE x '+str(re))

Buggy submission (verdict: Runtime Error):
N = int(input())
S = [str(input()) for i in range(N)]

ac = 0
wa = 0
tle = 0
re = 0
for i in S:
    if i=='AC':
        ac+=1
    elif i=='WA':
        wa+=1
    elif i='TLE':
        tle+=1
    else:
        re+=1
print('AC x　'+str(ac))
print('WA x　'+str(wa))
print('TLE x　'+str(tle))
print('RE x　'+str(re))
Problem p02730 (python)

Fixed submission:
import sys

def ispalindrome(str):return 1 if str == str[::-1] else 0

S=str(input())
len_s = len(S)
len_h = int((len_s-1)/2)


if ispalindrome(S)==0:
	print('No')
	sys.exit()
else:
	if ispalindrome(S[:len_h])==0:
		print('No')
		sys.exit()
	elif ispalindrome(S[-1:len_h])==0:
		print('No')
		sys.exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
import sys

def ispalindrome(str):return 1 if str == str[::-1] else 0

S=str(input())
len_s = len(S)
len_h = int((len_s-1)/2)


if ispalindrome(S)==0:
	print('No')
	sys.exit(1)
else:
	if ispalindrome(S[:len_h])==0:
		print('No')
		sys.exit(1)
	elif ispalindrome(S[-1:len_h])==0:
		print('No')
		sys.exit(1)
print('Yes')
Problem p02731 (python)

Fixed submission:
L=int(input())

print(pow(L/3,3.0))

Buggy submission (verdict: Runtime Error):
import collections
from math import factorial
from scipy.special import comb
# a = comb(n, r)
a = comb(n, r, exact=True)

def comb(n,r):
	#_a = factorial(n) / factorial(r) / factorial(n - r)
	a = comb(n, r, exact=True)
	return int(_a)


N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
#
for a in A:
	c[a]-=1
	#print(c)
	sum=0
	for b in set(c):
		if c[b]>=2:
			sum+=comb(c[b],2)
	c[a]+=1
	print(sum)
Problem p02823 (python)

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

if abs(A-B)%2==0:
	print(int(abs(A-B)//2))
else:
	print(min(N-B,A-1)+1+((B-A-1)//2))

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

if abs(A-B)%2==0:
	print(int(abs(A-B)//2))
else:
	min(N-B,A-1)+1+((B=A-1)//2)
Problem p02921 (python)

Fixed submission:
S = str(input())
T = str(input())

cnt=0
for i in range(len(S)):
    if S[i]==T[i]:
        cnt+=1
print(cnt)

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

cnt=0
for i in range(len(S)):
    if S[i]==T[i]:
        cnt+=1
print(cnt)
Problem p03103 (python)

Fixed submission:
N,M = map(int, input().split())
drink_list = [list(map(int, input().split())) for _ in range(N)]

drink_list.sort(key=lambda x: x[0])
#print(drink_list)

_cnt=0
_sum=0
i=0
if N==1 or drink_list[i][1]>=M:
    _sum=drink_list[i][0]*M
else:
    while _cnt<=M:
        if _cnt+drink_list[i][1]>=M:
            break
        else:
            _sum+=drink_list[i][0]*drink_list[i][1]
            _cnt+=drink_list[i][1]
            i+=1
        #print(_sum,_cnt,i)
    _sum+=drink_list[i][0]*(M-_cnt)

print(_sum)

Buggy submission (verdict: Runtime Error):
N,M = map(int, input().split())
drink_list = [list(map(int, input().split())) for _ in range(N)]

drink_list.sort(key=lambda x: x[0])
#print(drink_list)

_cnt=0
_sum=0
i=0
if N==1 or drink_list[i][1]>=M:
    _sum=drink_list[i][0]*M
else:
    while _cnt<M:
        if _cnt+drink_list[i][1]>M:
            break
        else:
            _sum+=drink_list[i][0]*drink_list[i][1]
            _cnt+=drink_list[i][1]
            i+=1
        #print(_sum,_cnt,i)
    _sum+=drink_list[i][0]*(M-_cnt)

print(_sum)

Buggy submission (verdict: Runtime Error):
N,M = map(int, input().split())
drink_list = [list(map(int, input().split())) for _ in range(N)]

drink_list.sort(key=lambda x: x[0])
#print(drink_list)

_cnt=0
_sum=0
i=0
if N==1:
    _sum=drink_list[i][0]*M
else:
    while _cnt<M:
        if _cnt+drink_list[i][1]>M:
            break
        else:
            _sum+=drink_list[i][0]*drink_list[i][1]
            _cnt+=drink_list[i][1]
            i+=1
        #print(_sum,_cnt,i)
    _sum+=drink_list[i][0]*(M-_cnt)

print(_sum)
Problem p03262 (python)

Fixed submission:
from fractions import gcd

N,X = map(int, input().split())
x = list(map(int, input().split()))

def gcd_calc(a):
  ans = a[0]
  for i in range(1, len(a)):
    ans = gcd(ans, a[i])
  return ans

x.sort()
cnt=0
for i,_x in enumerate(x):
  if (_x-X)>0:
    x.insert(i, X)
    cnt=1
    break
if cnt!=1:
  x.append(X)
list=[]
for i in range(len(x)-1):
  list.append(x[i+1]-x[i])

print(gcd_calc(list))

Buggy submission (verdict: Runtime Error):
from fractions import gcd

N,X = map(int, input().split())
x = list(map(int, input().split()))

def gcd_calc(a):
  ans = a[0]
  for i in range(1, len(a)):
    ans = gcd(ans, a[i])
  return ans

x.sort()
for i,_x in enumerate(x):
  if (_x-X)>0:
    x.insert(i, X)
    break
list=[]
for i in range(len(x)-1):
  list.append(x[i+1]-x[i])

print(gcd_calc(list))
Problem p03424 (python)

Fixed submission:
N = int(input())
S = list(map(str, input().split()))

cnt=0
for i in range(N):
    if S[i]=='Y':
        print('Four')
        break
        cnt=0
    else:
        cnt+=1
if cnt==N:
    print('Three')

Buggy submission (verdict: Runtime Error):
N = int(input())
S = list(map(int, input().split()))

cnt=0
for i in range(N):
    if S[i]=='Y':
        print('Four')
        break
        cnt=0
    else:
        cnt+=1
if cnt==N:
    print('Three')
Problem p02621 (python)

Fixed submission:
a = int(input())
print(a+a**2+a**3)

Buggy submission (verdict: Runtime Error):
s = input()
t = input()
n = len(s)
ans = 0
for i in range(n):
    if s[i] != t[i]:
        ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
s = input()
t = input()
n = len(s)
ans = 0
for i in range(n):
    if s[i] != t[i]:
        s[i] = t[i]
        x += 1
print(ans)

Buggy submission (verdict: Runtime Error):
s = input()
t = input()
n = len(s)
s.split()
t.split()
ans = 0
for i in range(n):
    if s[i] != t[i]:
        s[i] = t[i]
        x += 1
    else:
        pass
print(ans)
Problem p02639 (python)

Fixed submission:
x  = (list(map(int,input().split())))
x = sum(x)
ans = 15-x
print(ans)

Buggy submission (verdict: Runtime Error):
x,y = map(int,input().split())
if y < x * 4 and y > x * 2 and y % 2 != 0:
    ans ="No"
else :
    ans ="Yes"
print(ans)

Buggy submission (verdict: Runtime Error):
x  = (list(map(int,input().split()))
x = sum(x)
ans = 15-x
print(ans)

Buggy submission (verdict: Runtime Error):
x  = (list(map(int,input().split()))
x = sum(x)
ans = 15-x
print(ans)

Buggy submission (verdict: Runtime Error):
x  = (list[map(int,input().split()))
x = sum(x)
ans = 15-x
print(ans)

Buggy submission (verdict: Runtime Error):
x  = list[map(int,input().split())]
x = sum(x)
ans = 15-x
print(ans)
Problem p02658 (python)

Fixed submission:
n = int(input())
a = [int(i) for i in input().split()]
if 0 in a:
    print(0)
    quit()
ans = 1
for i in a:
    ans *= i
    #print(i)
    if ans > 10**18:
        ans = -1
        break
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())
ans = 1
for i in n:
    ans *= i
if ans > 10**18 :
    ans = -1
print(ans)
Problem p02687 (python)

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

Buggy submission (verdict: Runtime Error):
s = str(input())
if s == ABC:
    ans = ARC
else :
    ans == ABC
print(ans)
Problem p02705 (python)

Fixed submission:
print(3.1415926535897932384626433834* 2* (int(input())))

Buggy submission (verdict: Runtime Error):
r = input()
r = r * 2
ans = 3.1415926535897932384626433834*r
Problem p02885 (python)

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

Buggy submission (verdict: Runtime Error):
a = int(input())
b=int(input())
ans =max(a-b*2,0)
print(ans)

Buggy submission (verdict: Runtime Error):
a = int(input())
b=int(input())
if a <b:
  print(a)
else:
  print(a-b)
Problem p02921 (python)

Fixed submission:
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans
Problem p02922 (python)

Fixed submission:
A,B = map(int,input().split())
tap = 1
ans = 0

while tap < B:
    tap += A - 1
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
A,B = map(int,input.split())
tap = 1
ans = 0

while tap < B:
    tap += a - 1
    ans += 1
print(ans)
Problem p02924 (python)

Fixed submission:

import math
N = int(input())
print(int(N * (N - 1) // 2))

Buggy submission (verdict: Runtime Error):
import math
N = int(input())

xs = list(range(N))

print(sum(xs))

Buggy submission (verdict: Runtime Error):

import math
N = int(input())

sum = list(range(2,N))

print(sum)

Buggy submission (verdict: Runtime Error):
import math
N = int(input())

sum = list(range(N))

print(sum)