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

Fixed submission:
from collections import defaultdict
n = int(input())
A = [int(x) for x in input().split()]
even = A[0::2]
odd = A[1::2]
EC = defaultdict(int)
EC[0] = 0
OC = defaultdict(int)
OC[0] = 0
for e in even:
  EC[e] += 1
for o in odd:
  OC[o] += 1
E = sorted([[v, k] for k, v in EC.items()], reverse=True)
O = sorted([[v, k] for k, v in OC.items()], reverse=True)
if E[0][1] != O[0][1]:
  print(n - E[0][0] - O[0][0])
elif E[1][0] >= O[1][0]:
  print(n - E[1][0] - O[0][0])
else:
  print(n - E[0][0] - O[1][0])

#sample code.

Buggy submission (verdict: Runtime Error):
n=int(input())
v=list(map(int,input().split()))
a=v[0::2]
b=v[1::2]
c=dict()
d=dict()

for i in a:
  if i in c:
    c[i]+=1
  else:
    c[i]=1
for j in b:
  if j in d:
    d[j]+=1
  else:
    d[j]=1

e=sorted([[w,v] for v,w in c.items()],reverse=True)
f=sorted([[w,v] for v,w in d.items()],reverse=True)

if e[0][1]!=f[0][1]:
  print(n-e[0][0]-f[0][0])
elif e[0][0]>f[0][0]:
  print(n-e[0][0]-f[1][0])
elif e[0][0]<f[0][0]:
  print(n-e[1][0]-f[0][0])
elif e[0][0]==f[0][0] and e[0][1]==f[0][1]:
  if e[1][0]>f[1][0]:
    print(n-e[1][0]-f[0][0])
  else:
    print(n-e[0][0]-f[1][0])

Buggy submission (verdict: Runtime Error):
n=int(input())
v=list(map(int,input().split()))
a=v[0::2]
b=v[1::2]
c=dict()
d=dict()

for i in a:
  if i in c:
    c[i]+=1
  else:
    c[i]=1
for j in b:
  if j in d:
    d[j]+=1
  else:
    d[j]=1

e=sorted([[c,v] for v,c in c.items()],reverse=True)
f=sorted([[c,v] for v,c in d.items()],reverse=True)

if e[0][1]!=f[0][1]:
  print(n-e[0][0]-f[0][0])
elif e[0][0]>f[0][0]:
  print(n-e[0][0]-f[1][0])
else:
  print(n-e[1][0]-f[0][0])

Buggy submission (verdict: Runtime Error):
n=int(input())
v=list(map(int,input().split()))
a=v[0::2]
b=v[1::2]
c=dict()
d=dict()

for i in a:
  if i in c:
    c[i]+=1
  else:
    c[i]=1
for j in d:
  if j in d:
    d[j]+=1
  else:
    d[j]=1

e=sorted([[c,v] for v,c in c.items()],reverse=True)
f=sorted([[c,v] for v,c in d.items()],reverse=True)

if e[0][1]!=f[0][1]:
  print(n-e[0][0]-f[0][0])
elif e[0][0]>f[0][0]:
  print(n-e[0][0]-f[1][0])
else:
  print(n-e[1][0]-f[0][0])

Buggy submission (verdict: Runtime Error):
n=int(input())
v=list(map(int,input().split()))
a=[]
b=[]
c=dict()
d=dict()

for i in range(0,n,2):
  a.append(v[i])
  if v[i] in c:
    c[v[i]]+=1
  else:
    c[v[i]]=1
    
for j in range(1,n,2):
  b.appene(v[j])
  if v[i] in d:
    d[v[i]]+=1
  else:
    d[v[i]]=1

c_max=c.pop(c.value(max(c.value())))
c_max2=c.pop(c.value(max(c.value())))
d_max=d.pop(d.value(max(d.value())))
d_max2=d.pop(d.value(max(d.value())))
    
if :
  print(n-c_max-d_max)
else:
  if c_max>d_max:
    print(n-c_max-d_max2)
  else:
    print(n-c_max2-d_max)
Problem p03261 (python)

Fixed submission:
n=int(input())
w=[input() for i in range(n)]
ans="Yes"
if len(set(w))!=n:
  ans="No"
for j in range(1,len(w)):
  if w[j-1][-1]!=w[j][0]:
    ans="No"
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
w=[input() for i in range(w)]
ans="Yes"
for j in range(1,len(w)):
  if w[j-1][len(w[j-1])-1]!=w[j][0]:
    ans="No"
print(ans)
Problem p03273 (python)

Fixed submission:
H, W = map(int, input().split())
a = []
for _ in range(H):
    i = list(input())
    if '#' in i:
        a.append(i)
ans = zip(*[i for i in zip(*a) if '#' in i])
for s in ans:
    print(*s, sep='')
#copy code

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
a=[input() for i in range(h)]

for j in a:
  if '#' not in a:
    a.pop(j)
    h-=1
    
b=[]
c=''

for k in range(w):
  for l in range(h):
    c+=a[l][k]
  b.append(c)

for m in range(w):
  if '#' not in b:
    b.pop(m)
    w-=1
    
d=''

for o in range(h):
  for p in range(w):
    d+=b[p][o]
    print(d)
Problem p03280 (python)

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

Buggy submission (verdict: Runtime Error):
n=int(input())
total=0
for i in range(1,n+1,2):
  ans=0
  for j in range(1,i+1):
    if i%j==0:
      ans+=1
  if ans==8:
    total+=1
print(total)
Problem p03281 (python)

Fixed submission:
n=int(input())
total=0
for i in range(1,n+1,2):
  ans=0
  for j in range(1,i+1):
    if i%j==0:
      ans+=1
  if ans==8:
    total+=1
print(total)

Buggy submission (verdict: Runtime Error):
n=int(input())
ans=0
total=0
for i in range(n+1):
  for j in range(201):
    if i%j==0:
      ans+=1
  if ans==8:
    total+=1
print(total)
Problem p03289 (python)

Fixed submission:
s=input()
ans='WA'
if s[0]=='A':
  if s[2:-1].count('C')==1:
    c=s.index('C')
    if s[1:c].islower() and s[c+1:].islower():
      ans='AC'
print(ans)

Buggy submission (verdict: Runtime Error):
s=input()
ans='WA'
if s[0]=='A':
  if S[2:-1].count('C')==1:
    c=s.index('C')
    if s[1:c].islower() and s[c:].islower:
      ans='AC'
print(ans)
Problem p03292 (python)

Fixed submission:
s=list(map(int,input().split()))
s.sort()
print(s[2]-s[0])

Buggy submission (verdict: Runtime Error):
s=list(map(int,input().split())
s.sort()
print(s[2]-s[0])

Buggy submission (verdict: Runtime Error):
s=list(map(int,input())
s.sort()
print(s[2]-s[0])

Buggy submission (verdict: Runtime Error):
s=list(map(int,input())
s=s.sort()
print(s[1]-s[0])

Buggy submission (verdict: Runtime Error):
s=list(int(input()))
s=s.sorted()
print(s[1]-s[0])
Problem p03293 (python)

Fixed submission:
print("Yes" if input() in input()*2 else "No")
#copy code

Buggy submission (verdict: Runtime Error):
s=str(input())
t=str(input())
ans='No'
if s==t:
  ans='Yes'
for i in range(len(s)):
  s.append(s[0])
  if s==t:
    ans='Yes'
print(ans)
Problem p03296 (python)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
l=[ int(i) for i in range(10000)]
b=set(a)
for j in b:
  l.remove(j)
cnt=0
for i in range(1,n):
  if a[i-1]==a[i]:
    a[i]=l.pop()
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(n-1):
  if a[i]==a[i+1]:
    a[i+1]=a[i]+a[i+2]
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(1,len(a)):
  if a[i-1]=a[i]:
    cnt+=1
print(cnt)
Problem p03308 (python)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
a.sort()
print(a[n-1]-a[0])

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
a.sort()
print(a[n-1]=a[0])
Problem p03331 (python)

Fixed submission:
n=int(input())
ans=n
for i in range(1,n):
  l=[int(j) for j in list(str(i))]
  m=[int(k) for k in list(str(abs(n-i)))]
  if ans>sum(l)+sum(m):
    ans=sum(l)+sum(m)
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
ans=0
for i in range(n//2+1):
  l=[int(j) for j in list(str(i))]
  m=[int(k) for k in list(str(n-i))]
  if ans<sum(j)+sum(m):
    ans=sum(j)+sum(m)
print(ans)
Problem p03337 (python)

Fixed submission:
a,b=map(int,input().split())
s=[a+b,a-b,a*b]
print(max(s))

Buggy submission (verdict: Runtime Error):
n=int(input());s=input();print(max(len(set(s[:i])&set(s[i:]))for i in range(n)))
#copy code
Problem p03338 (python)

Fixed submission:
n=int(input());s=input();print(max(len(set(s[:i])&set(s[i:]))for i in range(n)))
#copy code

Buggy submission (verdict: Runtime Error):
n=int(input())
s=list(input())
a=[]
kind=0
l=[]
for i in s:
  l.append(i)
  for j in l:
    if j in s:
      kind+=1
  a.append(kind)
print(max(kind))
Problem p03352 (python)

Fixed submission:
x=int(input())
n=[]
for i in range(1,32):
  for j in range(2,10):
    if i**j<=x:
      n.append(i**j)
print(max(n))

Buggy submission (verdict: Runtime Error):
x=int(input())
n=[]
for i in range(1,32):
  for j in range(2,10):
    if j**i<x:
      l.append(j**i)
print(max(l))
Problem p03360 (python)

Fixed submission:
n=list(map(int,input().split()))
k=int(input())
n.sort(reverse=True)
print(n[0]*(2**k)+n[1]+n[2])

Buggy submission (verdict: Runtime Error):
n=map(ijnt,input().split())
k=int(input())
n.sort(reverse=True)
print(n[0]*(2**k)+n[1]+n[2])

Buggy submission (verdict: Runtime Error):
n=map(ijnt,input().split())
k=int(input())
n.sort(reverse=True)
print(n[0]*k+n[1]+n[2])
Problem p03363 (python)

Fixed submission:
from collections import Counter
n=int(input())
a = [int(i) for i in input().split()]
b=[0]
s=0
for i in a:
  s+=i
  b.append(s)
c= Counter(b)
ans=0
for i in c:
  ans+=int(c[i]*(c[i]-1)/2)
print(ans)
#copy code

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
cnt=0
n=[]
for i in range(len(a)):
  for j in range(i+1,len(a)):
    if n[i-1]==0:
      continue
    elif sum(a[i:j])==0:
      cnt+=1
print(cnt)
Problem p03385 (python)

Fixed submission:
s=list(input())
if "a" in s:
    if "b" in s:
        if "c" in s:
            print("Yes")
        else:
            print("No")
    else:
        print("No")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=set(input())
S=set(a,b,c)
if s==S:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=list(input())
if a,b,c in n:
    print("Yes")
else:
    print("No")
Problem p03386 (python)

Fixed submission:
A, B, K = map(int,input().split())
ans = []
for i in range(A, B+1)[:K]:
  ans.append(i)
for i in range(A, B+1)[-K:]:
  ans.append(i)
for a in sorted(list(set(ans))):
  print(a)
#copy page

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
l=list(range(a,b+1))
m=sorted(l,reverse=True)
n=[]
for i in range(k):
  if i+1<=len(l):
    n.append(l[i])
    n.append(m[i])
  else:
    break
n=sorted(list(set(n)))
for i in n:
  print(i)

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
l=range(a,b+1)
for i in range(k):
  print(l[i])
Problem p03400 (python)

Fixed submission:
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for i in range(n)]
total=x
for j in a:
  total+=len(range(1,d+1,j))
print(total)

Buggy submission (verdict: Runtime Error):
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for i in range(n)]
total=1
for j in a:
  taotal+=len(range(1,,j))
print(total)
Problem p03415 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
count=0
for i in range(a,b+1):
  i=str(i)
  if i==i[::-1]:
    count+=1
print(count)
Problem p03416 (python)

Fixed submission:
a,b=map(int,input().split())
count=0
for i in range(a,b+1):
  i=str(i)
  if i==i[::-1]:
    count+=1
print(count)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
count=0
for i in range(a,b+1):
  if i==i[::-1]:
    count+=1
print(count)
Problem p03433 (python)

Fixed submission:
n=int(input())
a=int(input())
N=n%500
if N<=a:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
a=int(input())
N=n%500
if N<=a:
    pritnt("Yes")
else:
    peint("No")
Problem p03434 (python)

Fixed submission:
n=input()
a=list(map(int,input().split()))
a.sort(reverse=True)
print(sum(a[::2])-sum(a[1::2]))

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
a.sort()
print(eval("+".join(a[::2]))-eval("+".join(a[1::2])))
Problem p03455 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a*B%2==0:
    print("Even")
else:
    print("Odd")
Problem p03469 (python)

Fixed submission:
s=list(input())
s[3]="8"
S="".join(s)
print(S)

Buggy submission (verdict: Runtime Error):
s=list(input())
s[3]=8
S="".join(s)
print(S)
Problem p03477 (python)

Fixed submission:
a,b,c,d=map(int,input().split())
if a+b==c+d:
    print("Balanced")
elif a+b>c+d:
    print("Left")
elif a+b<c+d:
    print("Right")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().spilt())
if a+b==c+d:
    print("Balanced")
elif a+b>c+d:
    print("Left")
elif a+b<c+d:
    print("Right")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().spilt())
if a+b==c+d:
    print("Balanced")
elif (a+b)>(c+d):
    print("Left")
elif (a+b)<(c+d):
    print("Right")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().spilt())
if a+b==c+d:
    print("Balanced")
elif (a+b)>(c+d):
    print("Left")
else:
    print("Right")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().spilt())
if a+b==c+d:
    print("Balanced")
elif (a+b)>(c+d):
    print("a+b")
else:
    print("c+d")
Problem p03493 (python)

Fixed submission:
s=str(input())
print(s.count("1"))

Buggy submission (verdict: Runtime Error):
input()
n=eval(input().replace(' ','|'))
print(len(bin(n&-n))-3)
#コピペです。

Buggy submission (verdict: Runtime Error):
length = int(input())
a_list = map(int, input().split())

num_list = []
for a in a_list:
    t = a
    num = 0
    while t % 2 == 0:
        num += 1
        t = t / 2
    num_list.append(num)

print(min(num_list))
#こぴぺです。
Problem p03494 (python)

Fixed submission:
length = int(input())
a_list = map(int, input().split())

num_list = []
for a in a_list:
    t = a
    num = 0
    while t % 2 == 0:
        num += 1
        t = t / 2
    num_list.append(num)

print(min(num_list))
#こぴぺです。

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
cnt=0
for _ in range(len(bin(max(a))-2):
  for i in a:
    if a%2==1:
      break
  cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
a=eval("+".join(str(a)))
l=0
while a%2==0:
  l+=1
print(l)
Problem p03502 (python)

Fixed submission:
n=int(input())
s=eval("+".join(str(n)))
if n%s==0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
s=eval("+".join(n))
if n%s==0:
  print("Yes")
else:
  print("No")
Problem p03543 (python)

Fixed submission:
n=list(input())
if n[0]==n[1]==n[2] or n[1]==n[2]==n[3]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n=[input() for i in range(4)]
if n[0]==n[1]==n[2] or n[1]==n[2]==n[3]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N=input().replace(""," ").split()
N=set(N)
if len(N)<=2:
    print("Yes")
elif len(N)>=3
    print("No")

Buggy submission (verdict: Runtime Error):
N=input().replace(""," ").split()
N=set(N)
if len(N)=<2:
    print("Yes")
else:
    print("No")
Problem p03555 (python)

Fixed submission:
a,b,c=map(str,input().replace(""," ").split())
e,f,g=map(str,input().replace(""," ").split())
if a==g and b==f and c==e:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=map(str,input().split())
e,f,g=map(str,input().split())
if a==g and b==f and c==e:
    print("YES")
else:
    print("NO")
Problem p03605 (python)

Fixed submission:
N=map(str,input().replace(""," ").split())
if "9" in N:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N=map(int,input().replace("",",").split())
if 9 in N:
    print("Yes")
else:
    print("No")
Problem p03623 (python)

Fixed submission:
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    print("A")
else:
    print("B")

Buggy submission (verdict: Runtime Error):
s=list(input())
s.sort()
l=[chr(ord("a")+i) for i in range(26)]
n=[]
for j in l:
  if j not in s:
    n.pop(j)
n.sort()
print(n)
Problem p03624 (python)

Fixed submission:
s=list(input())
s.sort()
l=[chr(ord("a")+i) for i in range(26)]
n=[]
for j in l:
  if j not in s:
    n.append(j)
n.sort()
if len(n)==0:
  print("None")
else:
  print(n[0])

Buggy submission (verdict: Runtime Error):
s=list(input())
s.sort()
l=[chr(ord("a")+i) for i in range(26)]
n=[]
for j in l:
  if j not in s:
    n.append(j)
n.sort()
print(n[0])

Buggy submission (verdict: Runtime Error):
s=list(input())
s.sort()
l=[chr(ord("a")+i) for i in range(26)]
n=[]
for j in l:
  if j not in s:
    n.append(j)
n.sort()
print(n[0])
Problem p03632 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
print(max(min(b,d)-max(a,c)),0)
Problem p03636 (python)

Fixed submission:
s=list(input())
s_0=s.pop(0)
s_n=s.pop(len(s)-1)
print(str(s_0)+str(len(s))+str(s_n))

Buggy submission (verdict: Runtime Error):
s=input()
s_0=s.append(0)
s_n=s.append(len(s))
print(s_0+str(len(s))+s_n)
Problem p03644 (python)

Fixed submission:
print(2**(len(bin(int(input())))-3))

Buggy submission (verdict: Runtime Error):
print(2**(len(bin(int(input()))-3))
Problem p03658 (python)

Fixed submission:
n,k=map(int,input().split())
l=list(map(int,input().split()))
l.sort(reverse=True)
s=0
for i in range(k):
    s+=l[i]
print(s)

Buggy submission (verdict: Runtime Error):
n,k=map(int,input().split())
l=list(int(input()))
l.sort(reverse=True)
s=0
for i in range(k):
    s+=l[i]
print(l)
Problem p03680 (python)

Fixed submission:
n=int(input())
a={i+1:int(input()) for i in range(n)}
v=1
for c in range(n):
    v=a[v]
    if v==2:
        print(c+1)
        break
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=[i+1:int(input()) for i in range(n)]
v=1
for c in range(n):
    v=a[v]
    if v==2:
        print(c+1)
        break
else:
    print(-1)
Problem p03693 (python)

Fixed submission:
S=int(input().replace(" ",""))
if S%4==0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
S=map(int,input().replace(" ",""))
if S%4==0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
S=map(int,input().replace(" ",""))
if S%4==0:
    print("YES")
else:
    print("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):
print(["error",A+B],[sum(list(map(int,input().split())))<10])

Buggy submission (verdict: Runtime Error):
print(["error",A+B],[eval(input().split().replace(" ","+"))<10])

Buggy submission (verdict: Runtime Error):
print(["error",eval(input().replace(" ","+"))],[eval(input().replace(" ","+"))<10])

Buggy submission (verdict: Runtime Error):
print(["error",A+B],[eval(input().replace(" ","+"))<10])

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
if A+B<10:
    print(A+B)
else:A+B>=10:
    print("erorr")
Problem p03711 (python)

Fixed submission:
x,y=map(int,input().split())
A=[1,3,5,7,8,10,12]
B=[4,6,9,11]
C=[2]
if x in A:
    if y in A:
        print("Yes")
    else:
        print("No")
elif x in B:
    if y in B:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
H, W = map(int, input().split())
picture = [input() for i in range(H)]
print('#'*(W+2))
for i in range(H):
    print('#' + picture[i] + '#')
print('#'*(W+2))
#コピペです。
Problem p03729 (python)

Fixed submission:
A,B,C=input().split()
if (A[::-1])[0]==B[0] and (B[::-1])[0]==C[0]:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
for i in range(1,b+1):
    if (a*i)%b==c:
        print("YES")
        break
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
print("YES" if any((a*i)%b==c for i in range(1, b+1)) else "NO")
#コピペです。
Problem p03737 (python)

Fixed submission:
A, B, C = input().split()
print(A[0].upper()+B[0].upper()+C[0].upper())

Buggy submission (verdict: Runtime Error):
A,B,C=map(str,input().split())
print(A[0].upper+B[0].upper+C[0].upper)

Buggy submission (verdict: Runtime Error):
A,B,C=input().split()
print(A[0].upper+B[0].upper+C[0].upper)
Problem p03759 (python)

Fixed submission:
abc=list(map(int,input().split()))
abc.sort(reverse=True)
if abc[0]-abc[1]==abc[1]-abc[2]:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
abc=list(map(int,input().split()))
abc.sort(reverce=True)
if a[0]-a[1]=a[1]-a[2]:
    print("YES")
else:
    print("NO")
Problem p03760 (python)

Fixed submission:
o=input()
e=input()
s=""
if len(o)==len(e):
    for i in range(len(o)):
        s+=o[i]
        s+=e[i]
else:
    for j in range(len(e)):
        s+=o[j]
        s+=e[j]
    s+=o[len(e)]
print(s)

Buggy submission (verdict: Runtime Error):
o=input()
e=input()
l=0
if abs(o-e)==0:
    for i in range(len(e)):
        l+=o[i]+e[i]
    print(l)
else:
    for j in range(len(e)):
        l+=o[i]+e[i]
    l+=o[len(e)]
    print(l)
Problem p03773 (python)

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

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
print(eval(A+B))
Problem p03795 (python)

Fixed submission:
N=int(input())
x=int(N*800)
y=int(N//15*200)
print(x-y)

Buggy submission (verdict: Runtime Error):
N=int(input())
x=int(N*800)
y=int(N//15*200)
print(eval(x-y))

Buggy submission (verdict: Runtime Error):
N=int(input())
x=N*800
y=N//15*200
print(eval(x-y))
Problem p03796 (python)

Fixed submission:
n=int(input())
j=1
for i in range(1,n+1):
  j=(j*i)%(10**9+7)
print(j)

Buggy submission (verdict: Runtime Error):
n=int(input())
ans=1
for i in range(1,n+1):
  ans=ans*i
print(ans/(10**9+7))
Problem p03826 (python)

Fixed submission:
A,B,C,D=map(int,input().split())
sone=A*B
stwo=C*D
if sone>stwo:
    print(sone)
elif sone<stwo:
    print(stwo)
elif sone==stwo:
    print(sone)

Buggy submission (verdict: Runtime Error):
n=input()
s=list(input())
x=0
l=[]
for i in s:
    if i=="I":
        x+=1
    elif i=="D":
        x-=1
    l.append(x)
print(max(l))

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,inputa().split())
print(max(a*b,c*d))

Buggy submission (verdict: Runtime Error):
A,B,C,D=map(int,input().split())
sone=A*B
stwo=C*D
if sone>stwo:
    print(sone)
elif sone<stwo:
    print(stwo):
elif sone==stwo:
    print(sone)
Problem p03844 (python)

Fixed submission:
print(eval(input()))

Buggy submission (verdict: Runtime Error):
a,b,c=map(str,input().split())
s="{}{}{}".format(a,b,c)
print(int(s))
Problem p03860 (python)

Fixed submission:
a,b,c=map(str,input().split())
print(a[0]+b[0]+c[0])

Buggy submission (verdict: Runtime Error):
a,b,c=list(input().split())
u=[[a],[b],[c]]
print(a(0)+b(0)+c(0))
Problem p03861 (python)

Fixed submission:
a,b,x=map(int,input().split())
print(b//x-(a-1)//x)
#コピペです。

Buggy submission (verdict: Runtime Error):
x,y,a=map(int,input().split())
s=0
for i in range[x:y]:
    if i%a==0:
        s+=1
print(s)
Problem p03937 (python)

Fixed submission:
h,w=map(int,input().split())
c=0
for i in range(h):
  c+=input().count("#")
print("Possible" if c==h+w-1 else "Impossible")

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
c=0
for i in range(h):
  c+=input().count("#")
print("Possible" if c=h+w-1 else "Impossible")

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
c=0
for i in range(h):
  c+=input().count("#")
print("Possible" if c=h+w-1: "Impossible")

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
c=0
for i in range(h):
  c=input().count("#")
print("Possible" if c=h+w-1: "Impossible")
Problem p03943 (python)

Fixed submission:
abc = list(map(int, input().split()))
abc.sort(reverse = True)
if abc[0] == abc[1] + abc[2]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
A, B, C=map(int(input().split()))
if A+B==C or A+C==B or B+C==A:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
A, B, C=map(int(input().split()))
if (A+B+C)%2==0:
    print("YES")
else:
    print("NO")
Problem p03945 (python)

Fixed submission:
s=list(input())
cnt=0
for i in range(len(s)-1):
  if s[i]!=s[i+1]:
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
s=int(input())
cnt=0
for i in range(len(s)-1):
  if s[i]!=s[i+1]:
    cnt+=1
print(cnt)
Problem p03951 (python)

Fixed submission:
N = int(input())
s = input()
t = input()
ans = 2*N
for i in range(N):
    if s[i:] == t[:N-i]:
        ans -= N - i
        break
print(ans)
#コピペです。

Buggy submission (verdict: Runtime Error):
n=int(input())
s=[input() for i in range(n)]
t=[input() for j in range(n)]
s.reverse()
l=0
for k  in range(n):
    while s[k]==t[k]:
        l+=1
print(l)