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

Fixed submission:
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
Count=0
for t in a:
    Sum=0
    for i in range(m):
        Sum+=t[i]*b[i]
    if Sum+c>0:
        Count+=1
print(Count)

Buggy submission (verdict: Runtime Error):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
Count=0
for t in a:
    for i in range(m):
        Sum+=t[i]*b[i]
    if Sum+c>0:
        Count+=1
    Sum=0
print(Count)

Buggy submission (verdict: Runtime Error):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
Count=0
for t in a:
    for i in range(m):
        Sum+=t[i]*b[i]
    if Sum+c>0:
        Count+=1
    Sum=0
print(Count)

Buggy submission (verdict: Runtime Error):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
Count=0
for i in range(n):
    a=list(map(int,input().split()))
    for j in range(m):
        Sum+=a[j]*b[j]
    if Sum+c>0:
        Count+=1
    Sum=0
print(Count)

Buggy submission (verdict: Runtime Error):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
Count=0
for i in range(n):
    a=list(map(int,input().split()))
    for j in range(m):
        Sum+=a[j]*b[j]
    if Sum>-1*c:
        Count+=1
    Sum=0
print(Count)

Buggy submission (verdict: Runtime Error):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
Count=0
for i in range(n):
    a=list(map(int,input().split()))
    for j in range(m):
        Sum+=a[j]*b[j]
    if Sum>-1*c:
        Count+=1
    Sum=0
print(Count)

Buggy submission (verdict: Runtime Error):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
Count=0
for i in range(n):
    a=list(map(int,input().split()))
    for j in range(m):
        Sum+=a[j]*b[j]
    if Sum>-1*c:
        Count+=1
    Sum=0
print(Count)
Problem p03212 (python)

Fixed submission:
from itertools import product
n=int(input())
tmp=2
ans=0
Flag=True
while Flag:
    tmp+=1
    iterator=product(range(3),repeat=tmp)
    for idxs in iterator:
        num=''.join(map(str,idxs))
        num753=str(num).replace('0', '3').replace('1', '5').replace('2', '7')
        if '7' in num753 and '5' in num753 and '3' in num753:
            if int(num753)<=n:
                ans+=1
            else:
                Flag=False
                break
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
tmp=2
ans=0
Flag=True
while Flag:
    tmp+=1
    iterator=product(range(3),repeat=tmp)
    for idxs in iterator:
        num=''.join(map(str,idxs))
        num753=str(num).replace('0', '3').replace('1', '5').replace('2', '7')
        if '7' in num753 and '5' in num753 and '3' in num753:
            if int(num753)<=n:
                ans+=1
            else:
                Flag=False
                break
print(ans)
Problem p03238 (python)

Fixed submission:
n=int(input())
if n==1:
  print("Hello World")
else:
  a,b=[int(input()) for i in range(2)]
  print(a+b)

Buggy submission (verdict: Runtime Error):
n=int(input())
xyh=[list(map(int,input().split())) for _ in range(n)]
xyh=sorted(xyh, key=lambda x:x[2], reverse=True)

for xi in range(101):
    for yi in range(101):
        hi=0
        flag=True
        for i in range(n):
            x=xyh[i][0]
            y=xyh[i][1]
            h=xyh[i][2]
            if i==0:
                hi=abs(xi-x)+abs(yi-y)+h
            if max(hi-abs(xi-x)-abs(yi-y),0)!=h:
                flag=False
        if flag:
            print(xi, yi, hi)
            break
    else:
        continue
    break

Buggy submission (verdict: Runtime Error):
N,T=map(int,input().split())
cost=1000
for _ in range(N):
    c,t=map(int,input().split())
    if t<=T:
        if cost>=c:
            cost=c
if cost<=1000:
    print(cost)
else:print("TLE")

Buggy submission (verdict: Runtime Error):
N,T=map(int,input().split())
cost=1000
for _ in range(N):
    c,t=map(int,input().split())
    if t<=T:
        if cost>c:
            cost=c
if cost>1000:
    print(cost)
else:print("TLE")

Buggy submission (verdict: Runtime Error):
n=int(input())
if n==1:
  print("Hello World")
else:
  a,b=[int(input()), for i in range(2)]
  print(a+b)
Problem p03289 (python)

Fixed submission:
s=input()
ans="AC"
cnt1=0
cnt2=0
cnt3=0
for i in range(len(s)):
    if i==0:
        if s[i]!="A":
            ans="WA"
    if i==1:
        cnt1+=s[i].isupper()*1
    if i>=2:
        if i==len(s)-1:
            if s[i]=="C":
                ans="WA"
            elif s[i].isupper()*1>0:
                ans="WA"
        elif s[i]=="C":
            cnt2+=1
        else:
            cnt3+=s[i].isupper()*1
if cnt1!=0 or cnt2!=1 or cnt3!=0:
    ans="WA"
print(ans)

Buggy submission (verdict: Runtime Error):
s=input()
ans="AC"
cnt1=0
cnt2=0
cnt3=0
for i in range(len(s)):
    if i==0:
        if s[i]!="A":
            ans="WA"
    if i==1:
        cnt1+=s[i].isupper()*1
    if i>=2:
        if i==len(s)-1:
            if s[i]=="C":
                ans="WA"
        elif s[i]=="C":
            cnt2+=1
        else:
            cnt3+=s[i].isupper()*1
if cnt1!=0 or cnt2!=1 or cnt!=0:
    ans="WA"
print(ans)
Problem p03337 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
print(max(a+b,a-b,a*b)
Problem p03455 (python)

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

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

Fixed submission:
print("2018/01/"+input()[-2:])

Buggy submission (verdict: Runtime Error):
x=input()
x[3]=8
print(x)
Problem p03474 (python)

Fixed submission:
a,b=map(int,input().split())
s=input()
ans="Yes"
front=""
back=""
if s.count("-")!=1:
    ans="No"
else:front,back=s.split("-")
if len(front)!=a or len(back)!=b:
    ans="No"
print(ans)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=input()
ans="Yes"
if s.count("-")!=1:
    ans="No"
else:front,back=s.split("-")
if len(front)!=a or len(back)!=b:
    ans="No"
print(ans)
Problem p03555 (python)

Fixed submission:
A=input()
B=input()
if A[0]==B[2] and A[1]==B[1] and A[2]==B[0]:
  print("YES")
else:print("NO")

Buggy submission (verdict: Runtime Error):
A=input()
B=input()
if A[0]=B[2] and A[1]=B[1] and A[2]=B[0]:
  print("YES")
else:print("NO")
Problem p03563 (python)

Fixed submission:
r,g=[int(input()) for i in range(2)]
print(g*2-r)

Buggy submission (verdict: Runtime Error):
r,g=[int(input()) for i range(2)]
print(g*2-r)
Problem p03565 (python)

Fixed submission:
s=list(input())
t=list(input())
ans=[0 for _ in range(len(s))]
for i in range(len(s)-len(t)+1):
    cnt=0
    for j in range(len(t)):
        if s[i+j]=='?' or s[i+j]==t[j]:
            cnt+=1
    if cnt==len(t):
        ans[i]=i+1
mark=ans.index(max(ans))
if sum(ans)!=0:
    for j in range(len(s)):
        if mark<=j and j<mark+len(t):
            s[j]=t[j-mark]
        elif s[j]=='?':
            s[j]='a'
    print(''.join(s))
else:print("UNRESTORABLE")

Buggy submission (verdict: Runtime Error):
s=list(input())
t=list(input())
ans=[0 for _ in range(len(s))]
for i in range(len(s)-len(t)+1):
    cnt=0
    for j in range(len(t)):
        if s[i+j]=='?' or s[i+j]==t[j]:
            cnt+=1
    if cnt==len(t):
        ans[i]=i
mark=ans.index(max(ans))
if sum(ans)!=0:
    for j in range(len(s)):
        if mark<=j and j<=mark+len(t):
            s[j]=t[j-mark]
        elif s[j]=='?':
            s[j]='a'
    print(''.join(s))
else:print("UNRESTORABLE")
Problem p03577 (python)

Fixed submission:
x=input()
print(x[:-8])

Buggy submission (verdict: Runtime Error):
n=int(input())
dp=input().split()
m=int(input())
tp=input().split()
d=dict()

ans="YES"

for di in dp:
    if di in d:
        d[di]+=1
    else:
        d[di]=1

for ti in tp:
    if ti not in dp or d[ti]==0:
        ans="NO"
        break
    else:
        d[ti]-=1
print(ans)
Problem p03578 (python)

Fixed submission:
import collections
n=int(input())
dp=collections.Counter(int(x) for x in input().split())
m=int(input())
tp=collections.Counter(int(x) for x in input().split())
ans="YES"
for k,v in tp.items():
    if dp[k]<v:
        ans="NO"
        break
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
dp=list(map(int,input().split()))
m=int(input())
tp=list(map(int,input().split()))
d=dict()

ans="YES"

for di in dp:
    if di in d:
        d[di]+=1
    else:
        d[di]=1

for ti in tp:
    if d[ti]==0:
        ans="NO"
        break
    else:
        d[ti]-=1
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
dp=list(map(int,input().split()))
m=int(input())
tp=list(map(int,input().split()))
d=dict()

ans="YES"

for di in dp:
    if di in d:
        d[di]+=1
    else:
        d[di]=1

for ti in tp:
    if d[ti]==0:
        ans="No"
        break
    else:
        d[ti]-=1
print(ans)
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):
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
  print("A")
else print("B")
Problem p03633 (python)

Fixed submission:
def gcd(x, y):
    if y == 0:
        return x
    else:
        return gcd(y, x%y)
def lcm(x, y):
    return (x * y) // gcd(x, y)
n=int(input())
tmp1=int(input())
ans=tmp1
for i in range(n-1):
    tmp2=int(input())
    ans=lcm(tmp1,tmp2)
    tmp1=ans
print(ans)

Buggy submission (verdict: Runtime Error):
import math
def lcm(x, y):
    return (x * y) // math.gcd(x, y)
n=int(input())
ans=1
tmp1=int(input())
for i in range(n-1):
    tmp2=int(input())
    ans=lcm(tmp1,tmp2)
    tmp1=ans
print(ans)
Problem p03773 (python)

Fixed submission:
a,b=map(int,input().split())
if a+b < 24:print(a+b)
else : print(abs(24-a-b))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a+b < 24:
print(a+b)
else : print(24-a-b)
Problem p03796 (python)

Fixed submission:
import math
N=int(input())
print(math.factorial(N)%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
N=int(input())
print(math.factorial(N)%(10**9+7)
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=map(int,input().split())
print(map(A*B,C*D))
Problem p03919 (python)

Fixed submission:
h,w=map(int,input().split())
s=[input().split() for _ in range(h)]
for i in range(h):
    for j in range(w):
        if s[i][j]=="snuke":
            print(chr(ord("A")+j)+str(i+1))

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
s=[input().split() for _ in range(w)]
for i in range(w):
    for j in range(h):
        if s[i][j]=="snuke":
            print(chr(ord("A")+j)+str(i+1))

Buggy submission (verdict: Runtime Error):
h,w=map(int,input().split())
s=[input().split() for _ in range(w)]
for i in range(w):
    for j in range(h):
        if s[i][j]=="snuke":
            print(chr(ord("A")+j)+str(i+1))
Problem p02747 (python)

Fixed submission:
# coding: utf-8
import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from heapq import heappop,heappush
import time
import os
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
#############################################
s=input()
ans="Yes"
for a in range(0,len(s),2):
  if len(s)-1==a or (not s[a:a+2]=="hi"):
  	ans="No"
print(ans)

Buggy submission (verdict: Runtime Error):
s=input()
ans="Yes"
for a in range((len(s)//2)*2,2):
  if not s[a:a+2]=="hi"
  ans="No"
print(ans)

Buggy submission (verdict: Runtime Error):
s=input()
ans="Yes"
for a in range((len(s)//2)*2,2):
  if not s[a:a++2]=="hi"
  ans="No"
print(ans)
Problem p02765 (python)

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

Buggy submission (verdict: Runtime Error):
print(R-100*(10-N))
Problem p02804 (python)

Fixed submission:
# coding: utf-8
import re
import math
from copy import deepcopy
import fractions
import random
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="number"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True

fac=fac_list(10**5+100,mod)
def C(n,r):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod

 
#main
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
ans=0
if(K>=2):
    for a in range(0,N):
        ans+=C(a,K-1)*(A[a])
        ans%=mod
    for a in range(0,N):
        len=N-1-a
        ans-=C(len,K-1)*(A[a])
        ans%=mod
print(ans)

Buggy submission (verdict: Runtime Error):
6 3
10 10 10 -10 -10 -10
Problem p02994 (python)

Fixed submission:
import math
import re
import time

N,L=map(int,input().split())

total=(L-1)*N+((1+N)/2)*N
mn=1e9
ans=1e9
for a in range(N):
    l=L+(a+1)-1
    if abs(l)<mn:
        mn=min([mn,abs(l)])
        ans=l
print(int(total-ans))

Buggy submission (verdict: Runtime Error):
import math
import re
import time

N,L=map(int,input().split())

total=(L-1)*N+((1+N)/2)*N
mn=1e9
for a in range(N):
    l=L+(a+1)-1
    total2+=l
    mn=min([mn,abs(l)])
#print("{} - {} = {}".format(total,mn,int(total-mn)))
print(int(total-mn))
Problem p02995 (python)

Fixed submission:
# coding: utf-8
import time
import re
import math
import fractions
 
def main():
    A,B,C,D=map(int,input().split())
    N=B-A+1
    sc=hoge(A,C)-A+1
    if sc<=N:
        ccount=(N+C-sc)//C
    else:
       ccount=0
 
    sd=hoge(A,D)-A+1
    if sd<=N:
        dcount=(N+D-sd)//D
    else:
       dcount=0
 
    CD=C * D // fractions.gcd(C, D)
    scd=hoge(A,CD)-A+1
    if scd<=N:
        cdcount=(N+CD-scd)//CD
    else:
       cdcount=0
    print(N-(ccount+dcount-cdcount))
 
 
def hoge(a,b):
    if a%b==0:
        return (a//b)*b
    else:
        #print("({} // {} +1)*{} {}".format(a,b,b,(a//b+1)*b))
        return (a//b+1)*b
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#"YNeos"[True::2]
#A=list(map(int,input().split()))
#A,B,C=map(int,input().split())
#n=int(input())
# global n,A,s,memo,mx,mn,L,B

Buggy submission (verdict: Runtime Error):
# coding: utf-8
import time
import re
import math

def main():
    A,B,C,D=map(int,input().split())
    N=B-A+1
    sc=hoge(A,C)-A+1
    if sc<=N:
        ccount=math.floor((N+C-sc)/C)
    else:
       ccount=0

    sd=hoge(A,D)-A+1
    if sd<=N:
        dcount=math.floor((N+D-sd)/D)
    else:
       dcount=0

    CD=C * D / math.gcd(C, D)
    scd=hoge(A,CD)-A+1
    if scd<=N:
        cdcount=math.floor((N+CD-scd)/CD)
    else:
       cdcount=0
    print(N-(ccount+dcount-cdcount))


def hoge(a,b):
    return math.ceil(a/b)*b
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#"YNeos"[True::2]
#A=list(map(int,input().split()))
#A,B,C=map(int,input().split())
#n=int(input())
# global n,A,s,memo,mx,mn,L,B
Problem p03001 (python)

Fixed submission:
# coding: utf-8
import time
import re
import math

def main():
    w,h,x,y=map(int,input().split())
    f=0
    if w/2==x and h/2==y:
        f=1
    print("{} {}".format(w*h/2,f))
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#"YNeos"[True::2]
#A=list(map(int,input().split()))
#n=int(input())
# global n,A,s,memo,mx,mn,L,B

Buggy submission (verdict: Runtime Error):
# coding: utf-8
import time
import re
import math
 
def main():
    N,K=map(int,input().split())
    A=list(map(int,input().split()))
    count=0
    for l in range(N):
        start=0
        for r in range(l,N):
            start+=A[r]
            if start>=K:
                
                count+=N-r
                break
    print(count)
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#"YNeos"[True::2]
#A=list(map(int,input().split()))
#n=int(input())
# global n,A,s,memo,mx,mn,L,B
Problem p03023 (python)

Fixed submission:
# coding: utf-8
import os
import time
import re
import math
 
N=int(input())
print(180*(N-2))

Buggy submission (verdict: Runtime Error):
# coding: utf-8
import os
import time
import re
import math
 
N=input()
print(180*(N-2))

Buggy submission (verdict: Runtime Error):
# coding: utf-8
import os
import time
import re
import math

s=input()
print(180*(N-2))

Buggy submission (verdict: Runtime Error):
# coding: utf-8
import os
import time
import re
import math

N=int(input())
print(180*(N-2)
Problem p03078 (python)

Fixed submission:
import math
xyzk = list(map(int,input().split()))
abc = [list(map(int,input().split())) for a in range(3)]
ab=[]
for a in abc[0]:
    for b in abc[1]:
        ab.append(a+b)
ab.sort()
ab.reverse()
abc[2].sort()
abc[2].reverse()
abc2=[]
for c in range(len(abc[2])):
    for a in range(min([math.ceil(xyzk[3]/(c+1)),len(ab)])):
        abc2.append(abc[2][c]+ab[a])
abc2.sort()
abc2.reverse()
for a in range(xyzk[3]):
    print(abc2[a])

Buggy submission (verdict: Runtime Error):
import math
xyzk = list(map(int,input().split()))
abc = [list(map(int,input().split())) for a in range(3)]
ab=[]
for a in abc[0]:
    for b in abc[1]:
        ab.append(a+b)
ab.sort()
ab.reverse()
abc[2].sort()
abc[2].reverse()
abc2=[]
for c in range(len(abc[2])):
    for a in range(min([xyzk[3]/(c+1),len(ab)])):
        abc2.append(abc[2][c]+ab[a])
abc2.sort()
abc2.reverse()
for a in range(xyzk[3]):
    print(abc2[a])

Buggy submission (verdict: Runtime Error):
import math
xyzk = list(map(int,input().split()))
abc = [list(map(int,input().split())) for a in range(3)]
ab=[]
for a in abc[0]:
    for b in abc[1]:
        ab.append(a+b)
ab.sort()
ab.reverse()
abc[2].sort()
abc[2].reverse()
abc2=[]
for c in range(abc[2]):
    for a in range(min([xyzk[3]/(c+1),len(ab)])):
        abc2.append(abc[2][c]+ab[a])
abc2.sort()
abc2.reverse()
for a in range(xyzk[3]):
    print(abc2[a])

Buggy submission (verdict: Runtime Error):
import math
xyzk = list(map(int,input().split()))
abc = [list(map(int,input().split())) for a in range(3)]
ab=[]
for a in abc[0]:
    for b in abc[1]:
        ab.append(a+b)
ab.sort()
ab.reverse()
abc[2].sort()
abc[2].reverse()
abc2=[]
for c in range(abc[2]):
    for a in range(min([xyzk[3]/(c+1),len(ab)])):
        abc2.append(abc[2][b]+ab[a])
abc2.sort()
abc2.reverse()
for a in range(xyzk[3]):
    print(abc2[a])
Problem p03079 (python)

Fixed submission:
hen=set(list(map(int,input().split())))
if len(hen)==1:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
s=input()
r=s.count("R")
b=s.count("B")
if r>b:print("Yes")
else:print("No")
Problem p03080 (python)

Fixed submission:
n=int(input())
s=input()
r=s.count("R")
b=s.count("B")
if r>b:print("Yes")
else:print("No")

Buggy submission (verdict: Runtime Error):
n=int(input())
s=input()
r=s.count("R")
b=s.count("B")
if:r>b:print("Yes")
else:print("No")