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

Fixed submission:
def mul(m) : 
      
    # Multiply elements one by one 
    res = 1
    for x in m: 
        res = res * x
        if res == 0:
             return 0 
        if res > 10**18:
             return -1
    return res
 
n = int(input())
a = list(map(int, input().split()))
a.sort()
z = mul(a)
print(z)

Buggy submission (verdict: Runtime Error):
def mult(m):
  s = 1
  for x in m:
    s = s*x
    if s == 0:
      return 0
    if s > 10**18:
      return -1
   return s
n = int(input())
a = list(map(int,input().split()))
a.sort()
z = mult(a)
print(z)

Buggy submission (verdict: Runtime Error):
def mult(m):
  s = 1
  for x in m:
    s = s*x
    if s == 0:
      return 0
    if s > 10**18:
      return -1
   return s
n = int(input())
a = list(map(int,input().split()))
a.sort()
z = mult(a)
print(z)

Buggy submission (verdict: Runtime Error):
def mult(m):
  s = 1
  for x in m:
    s = s*x
    if s == 0:
      return 0
    if s > 10**18:
      return -1
   return s
n = int(input())
a = list(map(int,input.split()))
a.sort()
z = mult(a)
print(z)

Buggy submission (verdict: Runtime Error):
def mult(m):
  s = 1
  for x in m:
    s = s * x
    if s == 0:
      return 0
    if s > 10**18:
      return -1
   return s
n = int(input())
a = list(map(int,input().split()))
a.sort()
z = mult(m)
print(z)

Buggy submission (verdict: Runtime Error):
def mult(m):
  s = 1
  for x in m:
    s = s*x
    if s == 0:
      return 0
    if s > 10**18:
      return -1
   return s
n = int(input())
a = list(map(int,input.split()))
a.sort()
z = mult(m)
print(z)
Problem p02603 (python)

Fixed submission:
n=int(input())
A=list(map(int,input().split()))
money=1000
stock=0
for i in range(n-1):
  if A[i]<A[i+1]:
    stock=money//A[i]
    money-=stock*A[i]
    money+=stock*A[i+1]
print(money)

Buggy submission (verdict: Runtime Error):
n=int(input())
A=list(map(int,input().split()))
money=1000
stock=0
buy=0
flag=0
sell=300
if A[0]==max(A):
  print(money)
else:
  for i in range(n):
    if A[i]>buy and stock>0:
      money+=stock*A[i]
      stock=0
      sell=A[i]
      if sell==max(A[i:n+1]):
        flag=1
    elif A[i]<sell and flag==0 and A[i]==min(A[i:A.index(max(A[i:n+1]))]):
      stock=money//A[i]
      money-=stock*A[i]
      buy=A[i]
      sell=0
  print(money)
Problem p02608 (python)

Fixed submission:
n=int(input())
lst=[0]*10000000
for i in range(1, 101):
  for j in range(1, i+1):
    for k in range(1, j+1):
      temp=i**2+j**2+k**2+i*j+j*k+k*i
      if i==j and j==k:
        lst[temp+1]+=1
      elif i==j and j!=k:
         lst[temp+1]+=3
      elif j==k and k!=i:
         lst[temp+1]+=3
      elif k==i and i!=j:
         lst[temp+1]+=3
      elif i!=j and j!=k and k!=i:
         lst[temp+1]+=6
for p in range(1, n+1):
  print(lst[p+1])

Buggy submission (verdict: Runtime Error):
n=int(input())
lst=[0]*10020
for i in range(1, 45):
  for j in range(1, i+1):
    for k in range(1, j+1):
      temp=i**2+j**2+k**2+i*j+j*k+k*i
      if i==j and j==k:
        lst[temp]+=1
      elif i==j and j!=k:
         lst[temp]+=3
      elif j==k and k!=i:
         lst[temp]+=3
      elif k==i and i!=j:
         lst[temp]+=3
      elif i!=j and j!=k:
         lst[temp]+=6
for p in range(1, n+1):
  print(lst[p])
Problem p02705 (python)

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

Buggy submission (verdict: Runtime Error):
math import
r = int(input())
l＝2 * r * math.pi
print(l)

Buggy submission (verdict: Runtime Error):
math import
r = int(input())
print(2 * r * math.pi)
Problem p02741 (python)

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

Buggy submission (verdict: Runtime Error):
lst = [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]
num = int(input())
print(lst[num])
Problem p02742 (python)

Fixed submission:
import math
s = input().rstrip().split(' ')
height = int(s[0])
width = int(s[1])
area = height * width
if height != 1 and width != 1:
	mass = math.ceil(area / 2)
	print(mass)
else:
	print(1)

Buggy submission (verdict: Runtime Error):
import math
s = input().rstrip().split(' ')
height = int(s[0])
width = int(s[1])
area = height * width
if area % 2 == 0:
	mass = area / 2
    print(mass)
else:
	mass = math.ceil(area / 2)
    print(mass)

Buggy submission (verdict: Runtime Error):
import math
s = input().rstrip().split(' ')
height = int(s[0])
width = int(s[1])
area = height * width
if area / 2 == 0:
	mass = area / 2
    print(mass)
else:
	mass = math.ceil(area / 2)
    print(mass)

Buggy submission (verdict: Runtime Error):
import math
s = input().rstrip().split(' ')
height = int(s[0])
width = int(s[1])
area = height * width
if area / 2 == 0:
	print(area / 2)
else:
	mass = area / 2
    print(mass + 1)
Problem p02761 (python)

Fixed submission:
n,m=map(int,input().split())
S,C=[], []
for i in range(m):
  a,b=map(int,input().split())
  S.append(a)
  C.append(b)
for j in range(10**n):
  if len(str(j))==n and all(str(j)[x-1]==str(y) for x,y in zip(S,C)):
    print(j)
    break;
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
S,C=[], []
for i in range(m):
  a,b=map(int,input().split())
  S.append(a)
  C.append(b)
for j in range(10**n):
  if len(j)==n and all(str(j)[x-1]==str(y) for x,y in zip(S,C)):
    print(j)
    break;
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
S,C=[], []
for i in range(m):
  a,b=map(int,input().split())
  S.append(a)
  C.append(b)
for j in range(10**(n-1)-1, 10**n):
  if all(str(j)[x-1]==str(y) for x,y in zip(S,C)):
    print(j)
    break;
else:
  print(-1)
Problem p02772 (python)

Fixed submission:
num = int(input())
lst = list(map(int,input().split()))
count = 0
counta = 0
for i in range(num):
  if lst[i] % 2 == 0:
    count += 1
    if lst[i] % 3 == 0 or lst[i] % 5 == 0:
      counta += 1
if count == counta:
  print("APPROVED")
else:
  print("DENIED")

Buggy submission (verdict: Runtime Error):
num = int(input())
lst = list(map(int,input().split()))
count = 0
counta == 0
for i in range(num):
  if lst[i] % 2 == 0:
    count += 1
    if lst[i] % 3 == 0 or lst[i] % 5 == 0:
      counta += 1
if count == counta:
  print("APPROVED")
else:
  print("DENIED")
Problem p02801 (python)

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

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

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if 500 * a >= b:
  print("Yes")
else
print("No")
Problem p02848 (python)

Fixed submission:
n = int(input())
moji = str(input())
alphabet = ["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"]
lst = list(moji)
for i in range(len(lst)):
  num = alphabet.index(lst[i])
  if num + n >= 26:
    lst[i] = alphabet[num+n-26]
  else:
    lst[i] = alphabet[num+n]
ans = ""
for j in range(len(lst)):
  ans += lst[j]
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
moji = str(input())
alphabet = ["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"]
lst = list(moji)
for i in range(len(lst)):
  num = alphabet.index(lst[i])
  if i + n > 25:
    lst[i] = alphabet[i+n-26]
  else:
    lst[i] = alphabet[i+n]
ans = ""
for j in range(len(lst)):
  ans += lst[j]
print(ans)
Problem p02909 (python)

Fixed submission:
w=str(input())
print("Sunny" if w=="Rainy" else "Cloudy" if w=="Sunny" else "Rainy")

Buggy submission (verdict: Runtime Error):
w=str(input())
prnt("Sunny" if w=="Rainy" else "Cloudy" if w=="Sunny" else "Rainy")
Problem p02921 (python)

Fixed submission:
s=list(str(input()))
t=list(str(input()))
ans = 0
for i in range(3):
  if s[i]==t[i]:
    ans+=1
print(ans)

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

Buggy submission (verdict: Runtime Error):
s=list(input().split(""))
t=list(input().split(""))
ans = 0
for i in range(3):
  if s[i]==t[i]
  ans+=1
print(ans)
Problem p02993 (python)

Fixed submission:
a, b, c, d = input()
count = 0
if a == b or b == c or c == d:
  count += 1

if count == 1:
  print("Bad")
else:
  print("Good")

Buggy submission (verdict: Runtime Error):
n=str(input())
print("Good" if all([n[j]!=n[j+1] for i in range(3)]) else "Bad")
Problem p03071 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
prnt(max(2*a-1, a+b, 2*b-1))
Problem p03076 (python)

Fixed submission:
import math
lst = []
for i in range(5):
  lst.append(int(input()))
minu = 9
temp = 0
count = 0
for j in range(5):
  if int(str(lst[j])[-1]) < minu and int(str(lst[j])[-1]) > 0:
    minu = int(str(lst[j])[-1])
    temp = lst[j]
    count += 1
if count > 0:
  lst.remove(temp)
else:
  temp = lst[0]
  del lst[0]
time = 0
for k in range(4):
  kari = math.ceil(int(lst[k])/10)
  time += int(kari * 10)
time += temp
print(time)

Buggy submission (verdict: Runtime Error):
import math
lst = []
for i in range(5):
  lst.append(int(input()))
minu = 9
for j in range(5):
  if int(str(lst[j])[-1]) < minu and int(str(lst[j])[-1]) > 0:
    minu = int(str(lst[j])[-1])
    temp = lst[j]
lst.remove(temp)
time = 0
for k in range(4):
  kari = math.ceil(int(lst[k])/10)
  time += int(kari * 10)
time += temp
print(time)

Buggy submission (verdict: Runtime Error):
import math
lst = []
for i in range(5):
  lst.append(int(input()))
minu = 9
for j in range(5):
  if int(str(lst[j])[-1]) < minu and int(str(lst[j])[-1]) > 0:
    minu = int(str(lst[j])[-1])
    temp = lst[j]
lst.remove(temp)
time = 0
for k in range(4):
  kari = math.ceil(int(lst[k])/10)
  time += int(kari * 10)
time += temp
print(time)

Buggy submission (verdict: Runtime Error):
import math
lst = []
for i in range(5):
  lst.append(int(input()))
minu = 9
for j in range(5):
  if int(str(lst[j])[-1]) < minu and int(str(lst[j])[-1]) > 0:
    minu = int(str(lst[j])[-1])
    temp = lst[j]
lst.remove(temp)
time = 0
for k in range(4):
  time += int(math.ceil(lst[k]/10) * 10)
time += temp
print(time)

Buggy submission (verdict: Runtime Error):
import math
lst = []
for i in range(5):
  lst.append(int(input()))
minu = 9
for j in range(5):
  if int(str(lst[j])[-1]) < minu and int(str(lst[j])[-1]) > 0:
    minu = int(str(lst[j])[-1])
    temp = lst[j]
lst.remove(temp)
time = 0
for k in range(4):
  time += math.ceil(lst[k]/10) * 10
time += temp
print(time)

Buggy submission (verdict: Runtime Error):
import math
lst = []
for i in range(5):
  lst.append(int(input()))
minu = 9
temp = 0
for j in range(5):
  if int(str(lst[j])[-1]) < minu and int(str(lst[j])[-1]) > 0:
    minu = int(str(lst[j])[-1])
    temp = lst[j]
lst.remove(temp)
time = 0
for k in range(4):
  time += math.ceil(lst[k]/10) * 10
time += temp
print(time)

Buggy submission (verdict: Runtime Error):
import math
lst = []
for i in range(5):
  lst.append(int(input()))
minu = 9
temp = 0
for j in range(5):
  if int(str(lst[j])[-1]) < minu and int(str(lst[j])[-1]) > 0:
    minu = int(str(lst[j])[-1])
    temp = lst[j]
lst.remove(temp)
time = 0
for k in range(4):
  time += math.ceil(lst[k]/10) * 10
time += temp
print(time)
Problem p03086 (python)

Fixed submission:
moji = str(input())
length = len(moji)
mojilst = list(moji)
ans = 0
temp = []
for i in range(length):
  if str(mojilst[i]) == "A" or str(mojilst[i]) == "G" or str(mojilst[i]) == "C" or str(mojilst[i]) == "T":
    temp.append(str(mojilst[i]))
  else:
    if ans < len(temp):
      ans = len(temp)
    temp = []
if ans < len(temp):
      ans = len(temp)
print(ans)

Buggy submission (verdict: Runtime Error):
moji = str(input())
length = len(moji)
mojilst = list(moji)
ans = 0
temp = []
for i in range(length):
  if str(mojilst[i]) == "A" or str(mojilst[i]) == "G" or str(mojilst[i]) == "C" or str(mojilst[i]) == "T":
    temp.append(str(mojilst[i]))
  else:
    if ans < len(temp):
      ans = len(temp)
    temp = []
    count += 1
if ans < len(temp):
      ans = len(temp)
print(ans)

Buggy submission (verdict: Runtime Error):
moji = str(input())
length = len(moji)
mojilst = list(moji)
ans = 0
temp = []
for i in range(length):
  if str(mojilst[i]) == "A" or str(mojilst[i]) == "G" or str(mojilst[i]) == "C" or str(mojilst[i]) == "T":
    temp.append(str(mojilst[i]))
  else:
    if len(ans) < len(temp):
      ans = len(temp)
    temp = []
print(ans)
Problem p03110 (python)

Fixed submission:
n=int(input())
sum = 0
for i in range(n):
  s = input().rstrip().split(' ')
  a=float(s[0])
  b=str(s[1])
  if b == "JPY":
    sum += int(a)
  else:
    sum += float(a)*380000
print(sum)

Buggy submission (verdict: Runtime Error):
n=int(input())
sum = 0
for i in range(n):
  a,b=map(input().split())
  if b == "JPY":
    sum += int(a)
  else:
    sum += float(a)*380000
print(sum)

Buggy submission (verdict: Runtime Error):
n=int(input())
sum = 0
for i in range(n):
  a,b=map(input().split())
  if b == "JPY":
    sum += int(a)
  else:
    sum += int(a)*380000
print(sum)
Problem p03238 (python)

Fixed submission:
n=int(input())
if n==2:
  a=int(input())
  b=int(input())
  c=a+b
print("Hello World" if n%2==1 else str(c))

Buggy submission (verdict: Runtime Error):
n=int(input())
a=int(input())
b=int(input())
c=a+b
print("Hello World" if n%2==1 else str(c))

Buggy submission (verdict: Runtime Error):
n=int(input())
a=int(input())
b=int(input())
c=a+b
print("Hello World" if n%2==0 else str(c))

Buggy submission (verdict: Runtime Error):
n=int(input())
a=int(input())
b=int(input())
c=a+b
print("Hello World" if n%2==0 else str(c))

Buggy submission (verdict: Runtime Error):
n=int(input())
a=int(input())
b=int(input())
c=a+b
print("Hello World" if n==1 else str(c) if n==2)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=int(input())
b=int(input())
c=a+b
print("Hello World" if n==1 else str(c))

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

Fixed submission:
n=int(input())
if n % 2 == 0:
  temp = int(n/2)
  print(temp ** 2)
else:
  temp = n//2
  print(temp*(temp+1))

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

Buggy submission (verdict: Runtime Error):
n=int(input())
if n % 2 == 0:
  temp = int(n/2)
  print(temp ** 2)
elif:
  temp = n//2
  print(temp*(temp+1))
Problem p03274 (python)

Fixed submission:
n,k=map(int,input().split())
candle=list(map(int,input().split()))
ans=2000000000
for i in range(n-k+1):
  if candle[i]<0 and candle[i+k-1]>0:
    temp=min(abs(candle[i]), candle[i+k-1])*2+max(abs(candle[i]), candle[i+k-1])
  elif candle[i+k-1]<=0:
    temp=abs(candle[i])
  elif candle[i]>=0:
    temp=candle[i+k-1]
  ans=min(temp, ans)
print(ans)

Buggy submission (verdict: Runtime Error):
n,k=map(int,input().split())
candle=list(map(int,input().split()))
ans=2000000000
for i in range(n-k+1):
  if candle[i]<0 and candle[i+k-1]>0:
    temp=min(abs(candle[i]), candle[i+k-1])*2+max(abs(candle[i]), candle[i+k-1])
  elif n==1 and k==1 and candle[k]==0:
    ans=0
  elif candle[i+k-1]<=0:
    temp=abs(candle[i])
  elif candle[i]>=0:
    temp=candle[i+k-1]
  ans=min(temp, ans)
print(ans)

Buggy submission (verdict: Runtime Error):
n,k=map(int,input().split())
candle=list(map(int,input().split()))
com=list(itertools.product(["1","0"], repeat=n))
ans=2000000000
for i in range(n-k):
  if candle[i]<0 and candle[i+k-1]>0:
    temp=min(abs(candle[i]), candle[i+k-1])*2+max(abs(candle[i]), candle[i+k-1])
  else:
    temp=abs(candle[i+k-1]-candle[i])
  ans=min(temp, ans)
print(ans)

Buggy submission (verdict: Runtime Error):
import itertools
import collections
n,k=map(int,input().split())
candle=list(map(int,input().split()))
com=list(itertools.product([1,0], repeat=n))
ans=200000000
for i in range(2**n):
  count=collections.Counter(com[i])
  if count[1]==k:
    begin=0
    end=0
    cnt=0
    temp=0
    print(
    for j in range(n):
      if com[i][j]==1:
        cnt+=1
        if cnt==1:
          start=candle[j]
        elif cnt==k:
          end=candle[j]
          break;
    if start>=0:
      temp=abs(end)
      if temp<ans:
        ans=temp
    if end<=0:
      temp=abs(start)
      if temp<ans:
        ans=temp
    else:
      temp=min(abs(start), end)*2+max(abs(start), end)
      if temp<ans:
        ans=temp
print(ans)
Problem p03308 (python)

Fixed submission:
n=int(input())
lst=list(map(int,input().split()))
print(max(lst)-min(lst))

Buggy submission (verdict: Runtime Error):
n=int(input())
lst=[int(input()) for i in range(n)]
print(max(lst)-min(lst))
Problem p03369 (python)

Fixed submission:
print(700+((str(input()).count("o"))*100))

Buggy submission (verdict: Runtime Error):
print(700+((str(input()).count("o"))*100)
Problem p03408 (python)

Fixed submission:
import collections
n = int(input())
Lista = [str(input()) for i in range(n)]
m = int(input())
Listb = [str(input()) for j in range(m)]
lst = []
for k in range(m):
  if Listb[k] in Lista:
    Lista.remove(Listb[k])
if len(Lista) > 0:
  lst = collections.Counter(Lista)
  print(lst.most_common()[0][1])
elif len(Lista) == 0:
  print(0)

Buggy submission (verdict: Runtime Error):
import collections
n = int(input())
Lista = [str(input()) for i in range(n)]
m = int(input())
Listb = [str(input()) for j in range(m)]
lst = []
for k in range(m):
  if Listb[k] in Lista:
    Lista.remove(Listb[k])
lst = collections.Counter(Lista)
print(lst.most_common()[0][1])
Problem p03415 (python)

Fixed submission:
a=list(input())
b=list(input())
c=list(input())
ans = a[0]+b[1]+c[2]
print(ans)

Buggy submission (verdict: Runtime Error):
a=list(input().split())
b=list(input().split())
c=list(input().split())
ans = a[0]+b[1]+c[2]
print(ans)
Problem p03416 (python)

Fixed submission:
a,b=map(int,input().split())
cnt = 0
for i in range(a,b+1):
  lst = list(str(i))
  lst2 = lst[::-1]
  temp=''.join(lst2)
  if str(i) == temp:
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
cnt = 0
for i in range(a,b+1):
  temp = str(i).sort(reverse=True)
  if str(i) == temp:
    cnt+=1
print(cnt)
Problem p03456 (python)

Fixed submission:
import math
s = input().rstrip().split(' ')
a = int(s[0])
b = int(s[1])
by = 0
sq = 0
if b < 10:
	by = a * 10 + b
elif 10 <= b and b < 100:
	by = a * 100 + b
else:
	by = a * 1000 + b
sq = math.sqrt(by)
res = str(sq)

if res[-1] == "0":
	print("Yes")
else:
	print("No")

Buggy submission (verdict: Runtime Error):
import math
s = input().rstrip().split(' ')
a = int(s[0])
b = int(s[0])
by = 0
sq = 0
if b < 10:
	by = a * 10 + b
elif 10 <= b and b < 100:
	by = a * 100 + b
else:
	by = a * 1000 + b
sq = math.sqrt(by)
if type(sqrt) == int:
	print("Yes")
else:
	print("No")

Buggy submission (verdict: Runtime Error):
import math
s = input().rstrip().split(' ')
a = int(s[0])
b = int(s[0])
by = 0
sq = 0
if b < 10:
	by = a * 10 + b
elif 10 <= b and b < 100:
	by = a * 100 + b
else:
	by = a * 1000 + b
sq = math.sqrt(by)
if type(sqrt) == "int":
	print("Yes")
else:
	print("No")
Problem p03486 (python)

Fixed submission:
a = list(str(input()))
b = list(str(input()))
a.sort()
b.sort(reverse=True)
c = "".join(a)
d = "".join(b)
if c < d:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a = str(input())
b = str(input())
a.sort()
b.sort()
if a < b:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a = str(input())
b = str(input())
a.sort()
b.sort()
if a <= b:
  print("Yes")
else:
  print("No")
Problem p03547 (python)

Fixed submission:
a,b=map(str,input().split())
print("<" if a<b else ">" if a>b else "=")

Buggy submission (verdict: Runtime Error):
a,b=map(str,input.split())
print("<" if a<b else ">" if a>b else "=")
Problem p03563 (python)

Fixed submission:
R = int(input())
G = int(input())
print(2 * G - R)

Buggy submission (verdict: Runtime Error):
R = int(input())
G = int(nput())
print(2 * G - R)
Problem p03573 (python)

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

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

Fixed submission:
moji=list(str(input()))
ans=""
for i in range(len(moji)):
  if i%2==0:
    ans+=moji[i]
print(ans)

Buggy submission (verdict: Runtime Error):
moji=list(str(input()))
ans=""
for i in range(len(moji)):
  if i%2==0:
    ans+=lst[i]
print(ans)
Problem p03673 (python)

Fixed submission:
from collections import deque
n=int(input())
a=list(map(int,input().split()))
b=deque(maxlen=2*10**5)
if n%2==0:
  for i in range(n):
    if i%2==1:
      b.appendleft(a[i])
    else:
      b.append(a[i])
else:
  for j in range(n):
    if j%2==0:
      b.appendleft(a[j])
    else:
      b.append(a[j])
print(*b)

Buggy submission (verdict: Runtime Error):
6
0 6 7 6 7 0
Problem p03679 (python)

Fixed submission:
x,a,b=map(int,input().split())
print("delicious" if a-b>=0 else "safe" if b-a<=x else "dangerous")

Buggy submission (verdict: Runtime Error):
x,a,b=map(nt,input().split())
print("delicious" if a-b>=0 else "safe" if b-a<=x else "dangerous")
Problem p03693 (python)

Fixed submission:
r,g,b=map(int,input().split())
print("YES" if (r*100+g*10+b)%4==0 else "NO")

Buggy submission (verdict: Runtime Error):
r,g,b=map(int,input().split())
print("YES" if (r*100+g10+b)%4==0 else "NO")
Problem p03697 (python)

Fixed submission:
a,b=map(int,input().split())
if a + b <10:
  print(a+b)
else:
  print("error")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a + b <=10:
  rint(a+b)
else:
  print("error")
Problem p03826 (python)

Fixed submission:
a,b,c,d=map(int,input().split())
print(max(a*b, c*d))

Buggy submission (verdict: Runtime Error):
a,b,c,d=,ap(int,input().split())
print(max(a*b, c*d))
Problem p03962 (python)

Fixed submission:
lst=(list(map(str,input().split())))
a=set()
for i in range(3):
  a.add(lst[i])
print(len(a))

Buggy submission (verdict: Runtime Error):
lst(list(map(str,input().split())))
a=set()
for i in range(3):
  a.add(lst[i])
print(len(a))
Problem p03998 (python)

Fixed submission:
a = list(input())
b = list(input())
c = list(input())
moji = a[0]
select = "a"
lengtha = len(a)
lengthb = len(b)
lengthc = len(c)
while True:
  if select == "a":
    if lengtha == 0:
      print("A")
      break;
    else:
      select = a[0]
      del a[0]
      lengtha -= 1
  elif select == "b":
    if lengthb == 0:
      print("B")
      break;
    else:
      select = b[0]
      del b[0]
      lengthb -= 1
  else:
    if lengthc==0:
      print("C")
      break;
    else:
      select = c[0]
      del c[0]
      lengthc -= 1

Buggy submission (verdict: Runtime Error):
a = list(input())
b = list(input())
c = list(input())
moji = a[0]
select = "a"
lengtha = len(a)
lengthb = len(b)
lengthc = len(c)
while True:
  if select == "a":
    select = a[0]
    del a[0]
    lengtha -= 1
    if lengtha == 0:
      print("A")
  elif select == "b":
    select = b[0]
    del b[0]
    lengthb -= 1
    if lengthb == 0:
      print("B")
      break;
  else:
    select = c[0]
    del c[0]
    lengthc -= 1
    if lengthc==0:
      print("C")
      break;
Problem p04043 (python)

Fixed submission:
s = input().rstrip().split(' ')
counta = 0
countb = 0
for i in range(int(len(s))):
	if int(s[i]) == 7:
		counta += 1
	elif int(s[i]) == 5:
		countb += 1
if counta == 1 and countb == 2:
	print('YES')
else:
	print('NO')

Buggy submission (verdict: Runtime Error):
s = input().rstrip().split(' ')
counta = 0
countb = 0
for i in range(len(s)):
	if int(s[i]) == 7:
    	counta += 1
    elif int(s[i]) == 5:
		countb += 1
if counta == 1 and countb == 2:
	print('YES')
else:
	print('NO')