Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#y,m,d=map(int,input().split())
#a,b=map(int,input().split())
#n=int(input())
#a=int(input())
#b=int(input())
#s=list(input())
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
#b=list(map(int,input().split()))
#b=list(map(int,input().split()))
#a=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#a=[list(input().split())for _ in range(n)]
#a=[int(input())for _ in range(n)]
a=list(map(int,input().split(())))
total=sum(a)
if 22<=total:
    print('bust')
else:
    print('win')

Fixed submission:
#y,m,d=map(int,input().split())
#a,b=map(int,input().split())
#n=int(input())
#a=int(input())
#b=int(input())
#s=list(input())
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
#b=list(map(int,input().split()))
#b=list(map(int,input().split()))
#a=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#a=[list(input().split())for _ in range(n)]
#a=[int(input())for _ in range(n)]
a=list(map(int,input().split()))
total=sum(a)
if 22<=total:
    print('bust')
else:
    print('win')
Buggy python submission (verdict: Runtime Error):
n=int(input())
import math
ans=[]
for i in range(1,int(math.sqrt(n))):
    if n%i==0:
        tmp=n//i
        ans.append(abs(i-1)+abs(tmp-1))
print(min(ans))



Fixed submission:
#a,b=map(int,input().split())
n=int(input())
import math
ans=[]
for i in range(1,int(math.sqrt(n))+1):
    if n%i==0:
        dis=abs(i-1)+abs(n//i-1)
        ans.append(dis)
print(min(ans))
Buggy python submission (verdict: Runtime Error):
n=int(input())
p=[]
total=0
for i in range(n,0,-1):
    p.append(i)
p.reverse()
for i in range(1,n):
    total+=i%p[i]
print(total)



Fixed submission:
a,b,x=map(int,input().split())
import math
ab=a*b
s=x/a
h=(ab-s)*2/a
if ab/2<=s:
    print(math.degrees(math.atan2(h,a)))
else:
    w=s*2/b
    print(math.degrees(math.atan2(b,w)))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
#n,k=map(int,input().split())
#H=list(map(int,input().split()))
print(max(a-2*b),0)

Fixed submission:
#n=int(input())
a,b=map(int,input().split())
#n,k=map(int,input().split())
#H=list(map(int,input().split()))
c=a-2*b
print(max(c,0))
Buggy python submission (verdict: Runtime Error):
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#S=input()
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
h=list(map(int,input().split()))
#v=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
#s=[input()for _ in range(n)]
h.reverse()
cnt=0
ans=[]
for i in range(n-1):
    if h[i]<=h[i+1]:
        cnt+=1
    else:
        ans.append(cnt)
        cnt=0
print(max(max(ans),0))

Fixed submission:
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#S=input()
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
h=list(map(int,input().split()))
#v=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
#s=[input()for _ in range(n)]
h.reverse()
cnt=0
ans=0
for i in range(1,n):
    if h[i-1]<=h[i]:
        cnt+=1
    else:
        cnt=0
    ans=max(ans,cnt)
print(ans)

Buggy python submission (verdict: Runtime Error):
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#S=input()
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
h=list(map(int,input().split()))
#v=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
#s=[input()for _ in range(n)]
h.reverse()
cnt=0
ans=[]
for i in range(n-1):
    if h[i]<=h[i+1]:
        cnt+=1
    else:
        ans.append(cnt)
        cnt=0
print(max(ans))

Fixed submission:
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#S=input()
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
h=list(map(int,input().split()))
#v=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
#s=[input()for _ in range(n)]
h.reverse()
cnt=0
ans=0
for i in range(1,n):
    if h[i-1]<=h[i]:
        cnt+=1
    else:
        cnt=0
    ans=max(ans,cnt)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
p=[]
total=0
for i in range(n,0,-1):
    p.append(i)
p.reverse()
for i in range(1,n):
    total+=i%p[i]
print(total)



Fixed submission:
n=int(input())
print(n*(n-1)//2)
Buggy python submission (verdict: Time Limit Exceeded):
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#g=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
s=[list(input())for _ in range(n)]
#h=list(map(int,input().split()))
#b=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
#s=[input()for _ in range(n)]
import copy
ans=[]
for i in range(n):
    s[i].sort()
    tmp="".join(s[i])
    ans.append(tmp)
ans_set=copy.deepcopy(ans)
ans_set=list(set(ans))
cnt=0
for i in range(len(ans_set)):
    ans_cnt=ans.count(ans_set[i])
    cnt+=(ans_cnt*(ans_cnt-1))//2
print(cnt)

Fixed submission:
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#g=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
s=[list(input())for _ in range(n)]
#h=list(map(int,input().split()))
#b=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
#s=[input()for _ in range(n)]
ans=[]
dic={}
cnt=0
#文字列をソートする
for i in range(n):
    s[i].sort()
    tmp="".join(s[i])
    ans.append(tmp)

#同じ文字列があるかを調べ、その数を数える
for i in range(n):
    if not ans[i]  in dic:
        dic[ans[i]]=1
    else:
        dic[ans[i]]+=1

for val in dic.values():
    cnt+=val*(val-1)//2
print(cnt)
Buggy python submission (verdict: Runtime Error):
n=int(input())
#A=list(map(int,input().split()))
#b=list(map(int,input().split()))
#s=[input() for _ in range(n)]
ans=0
for i in range(1,n+1):
        if len(str(i))=1:
                ans+=1
print(ans)



Fixed submission:
n=int(input())
#A=list(map(int,input().split()))
#b=list(map(int,input().split()))
#s=[input() for _ in range(n)]
ans=0
for i in range(1,n+1):
        if len(str(i))%2==1:
                ans+=1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#g=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#a=[int(input()) for _ in range(k)]
h=list(map(int,input().split()))
#b=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#m=[list(map(int,input().split()))for _ in range(n)]
#p=[list(input().split())for _ in range(h)]
#a=[input()for _ in range(n)]
for i in range(1,n):
    left=max(h[:i])-1
    if h[i]<left:
        print("No")
        exit()
print("Yes")


Fixed submission:
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#g=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#a=[int(input()) for _ in range(k)]
h=list(map(int,input().split()))
#b=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#m=[list(map(int,input().split()))for _ in range(n)]
#p=[list(input().split())for _ in range(h)]
#a=[input()for _ in range(n)]
tmp=h[0]
for i in range(1,n):
    if tmp<h[i]:
        tmp=h[i]
        tmp-=1
    if h[i]<tmp:
        print("No")
        exit()
print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
#n,d=map(int,input().split())
n=int(input())
a=list(int(input())for _ in range(n))
#print("-----------")
for i in range(n):
        tmp=a[i]
        a[i]=0
        print(max(a))
        a[i]=tmp


Fixed submission:
import copy
#n,d=map(int,input().split())
n=int(input())
a=list(int(input())for _ in range(n))
A=copy.deepcopy(a)
A.sort(reverse=True)
#print("-----------")
for i in range(n):
        if a[i]!=A[0]:
                print(A[0])
        else:
                print(A[1])
Buggy python submission (verdict: Runtime Error):
n,d=map(int,input().split())
x=[list(map(int,input().split()))]
ans=0
for i in range(n-1):
    for j in range(1,n-i):
        l=0
        for k in range(d):
            l+=(x[i][k]-x[i+j][k])**2
        l=l**0.5
        if l.is_integer()==True:
            ans+=1
print(ans)

Fixed submission:
n,d=map(int,input().split())
x=[list(map(int,input().split()))for _ in range(n)]
ans=0
for i in range(n-1):
    for j in range(1,n-i):
        l=0
        for k in range(d):
            l+=(x[i][k]-x[i+j][k])**2
        l=l**0.5
        if l.is_integer()==True:
            ans+=1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
ans=[]
for i in range(a,b):
    for j in range(i+1,b+1):
        z=i*j
        ans.append(z%2019)
print(min(ans))

Fixed submission:
L,R=map(int,input().split())
ans=[]
R=min(R,L+2019)
for i in range(L,R):
    for j in range(i+1,R+1):
        ans.append(i*j%2019)
print(min(ans))
Buggy python submission (verdict: Runtime Error):
n,x=map(int,input().split())
L=list(map(int,input().split()))
p=0
ans=1
for i in range(n):
        p+=L[i]
        ans+=1 if p<=x else continue
print(ans)

Fixed submission:
import bisect
n,x=map(int,input().split())
L=list(map(int,input().split()))
a=[0]*(n+1)
for i in range(1,n+1):
    a[i]=a[i-1]+L[i-1]
for i in range(n+1):
    if x==a[i]:
        print(bisect.bisect_right(a,x))
        exit()
print(bisect.bisect_left(a,x))
Buggy python submission (verdict: Runtime Error):
n=int(input())
x=[0]*n
y=[0]*n
for i in range(n):
        x[i],y[i]=list(map(int,input().split()))
diff=[[0,0]for i in range(n-1)]
for i in range(n-1):
        diff[i][0]=x[i+1]-x[i]
        diff[i][1]=y[i+1]-y[i]
ans=[]
for i in range(n-1):
        ans.append(diff.count(diff[i]))
print(n-max(ans))


Fixed submission:
import sys
N = int(input())
arr = []

for i in range(N):
    arr.append(list(map(int, input().split())))

if N == 1:
    print(1)
    sys.exit()

d = {}

for i in range(N):
    for j in range(N):
        if i != j:
            x = arr[i][0] - arr[j][0]
            y = arr[i][1] - arr[j][1]
            if (x, y) in list(d.keys()):
                d[(x, y)] += 1
            else:
                d[(x, y)] = 1

print(N - max(list(d.values())))
Buggy python submission (verdict: Runtime Error):
n=int(input())
w=list(map(int,input().split()))
ans=[]
total=sum(w)
for i in range(n):
    diff=abs(total-w[:i])
    ans.append(diff)
print(min(ans))



Fixed submission:
n=int(input())
w=list(map(int,input().split()))
ans=[]
total=sum(w)
for i in range(n):
    diff=total-sum(w[:i])
    ans.append(abs(diff-sum(w[:i])))
print(min(ans))
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
L=[]
R=[]
for i in range(m):
    l,r=map(int,input().split())
    L[i],R[i]=l,r
print(abs(max(L)-min(R)+1)


Fixed submission:
n,m=map(int,input().split())
L=[0]*m
R=[0]*m
for i in range(m):
    l,r=map(int,input().split())
    L[i],R[i]=l,r
ans=min(R)-max(L)+1
print(max(ans,0))
Buggy python submission (verdict: Time Limit Exceeded):
r,g,b,n=list(map(int,input().split()))
cnt=0
for i in range(n+1):
        for j in range(n+1):
                z=n-(i*r+j*g)
                if 0<=z and z%b==0:
                        #print(i,j,z)
                        cnt+=1
print(cnt)

#101


Fixed submission:
r,g,b,n=list(map(int,input().split()))
cnt=0
for i in range(n+1):
        for j in range(n+1):
                z=n-(i*r+j*g)
                if 0<=z and z%b==0:
                        #print(i,j,z)
                        cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
import math
n=int(input())
A=list(map(int,input().split()))
L=[0]*(n+1)
R=[0]*(n+1)
for i in range(n):
    L[i+1]=math.gcd(L[i],A[i])
for i in range(n,0,-1):
    R[i-1]=math.gcd(R[i],A[i-1])
ans=[]
for k in range(n):
    ans.append(math.gcd(L[k],R[k+1]))
print(max(ans))


Fixed submission:
n=int(input())
A=list(map(int,input().split()))
L=[0]*(n+1)
R=[0]*(n+1)
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
for i in range(n):
    L[i+1]=gcd(L[i],A[i])
for i in range(n,0,-1):
    R[i-1]=gcd(R[i],A[i-1])
ans=[]
for k in range(n):
    ans.append(gcd(L[k],R[k+1]))
print(max(ans))
Buggy python submission (verdict: Runtime Error):
A=list(int(input())for i in range(5))
com=0
num=-1
for i in range(5):
    if A[i]%10==0:
        continue
    else:
        rem=10-A[i]%10
    if com<rem:
        com=rem
        num=i
        tmp=A[i]
if len(A)!=0:
    A[num]=0
ans=0
for a in A:
    if a==0:
        continue
    if a%10==0:
        ans+=a
    else:
        ans+=(a//10+1)*10
ans+=tmp
print(ans)


Fixed submission:
A=list(int(input())for i in range(5))
ans=0
num=0
com=0
for a in A:
    if a%10==0:
        ans+=a
    else:
        tmp=10-a%10
        ans+=(a//10+1)*10
        if com<tmp:
            com=tmp
            num=a
if num==0:
    print(ans)
else:
    ans-=(num//10+1)*10
    ans+=num
    print(ans)

Buggy python submission (verdict: Runtime Error):
A=list(int(input())for i in range(5))
com=0
for i in range(5):
    if A[i]%10==0:
        continue
    else:
        rem=10-A[i]%10
    if com<rem:
        com=rem
        num=i
        tmp=A[i]
A[num]=0
ans=0
for a in A:
    if a==0:
        continue
    if a%10==0:
        ans+=a
    else:
        ans+=(a//10+1)*10
ans+=tmp
print(ans)


Fixed submission:
A=list(int(input())for i in range(5))
ans=0
num=0
com=0
for a in A:
    if a%10==0:
        ans+=a
    else:
        tmp=10-a%10
        ans+=(a//10+1)*10
        if com<tmp:
            com=tmp
            num=a
if num==0:
    print(ans)
else:
    ans-=(num//10+1)*10
    ans+=num
    print(ans)

Buggy python submission (verdict: Runtime Error):
A=list(int(input())for i in range(5))
com=0
for i in range(5):
    if A[i]%10==0:
        continue
    rem=10-A[i]%10
    if com<rem:
        com=rem
        num=i
        tmp=A[i]
A[num]=0
ans=0
for a in A:
    if a==0:
        continue
    if a%10==0:
        ans+=a
    else:
        ans+=(a//10+1)*10
ans+=tmp
print(ans)


Fixed submission:
A=list(int(input())for i in range(5))
ans=0
num=0
com=0
for a in A:
    if a%10==0:
        ans+=a
    else:
        tmp=10-a%10
        ans+=(a//10+1)*10
        if com<tmp:
            com=tmp
            num=a
if num==0:
    print(ans)
else:
    ans-=(num//10+1)*10
    ans+=num
    print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
A=[int(input())for i in range(5)]
if n%min(A)==0 print(n//min(A)+4) else print((n//min(A)+5)


Fixed submission:
n=int(input())
A=[int(input())for i in range(5)]
if n%min(A)==0:
    print(n//min(A)+4)
else:
    print(n//min(A)+5)

Buggy python submission (verdict: Runtime Error):
n=int(input())
A=[int(input())for i in range(5)]
if n//min(A)==0 print(n//min(A)+4) else print((n//min(A)+5)


Fixed submission:
n=int(input())
A=[int(input())for i in range(5)]
if n%min(A)==0:
    print(n//min(A)+4)
else:
    print(n//min(A)+5)
Buggy python submission (verdict: Runtime Error):
s=input()
ans=0
cnt=[]
for i in s:
    if i=="A" or i=="C" or i=="G" or i=="T":
        ans+=1
    else:
        cnt.append(ans)
        ans=0
print(max(cnt))


Fixed submission:
s=list(input())
n=len(s)
ans=0
tmp=-10
cnt=[0]*20
for i in range(n):
    if s[i]=="A" or s[i]=="C" or s[i]=="G" or s[i]=="T":
        cnt[i]=1
for i in cnt:
    if i==1:
        ans+=1
    else:
        if tmp<ans:
            tmp=ans
            ans=0
if tmp==-10:
    print(ams)
else:
    print(tmp)
Buggy python submission (verdict: Runtime Error):
n=int(input())
B=list(map(int,input().split()))
flag=True
ans=[]
while flag and len(B):
    for i in range(len(B)-1,-1,-1):
        if B[i]==i+1:
            del B[i]
            ans.append(i+1)
            break
    else:
        flag=False
        break
if not flag:
    print(-1)
else:
    for anse in ans[::-1]
        print(anse)


Fixed submission:
n=int(input())
B=list(map(int,input().split()))
flag=True
ans=[]
while flag and len(B):
    for i in range(len(B)-1,-1,-1):
        if B[i]==i+1:
            del B[i]
            ans.append(i+1)
            break
    else:
        flag=False
        break
if not flag:
    print(-1)
else:
    for i in range(len(ans)-1,-1,-1):
        print(ans[i])
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=[]
if m==1:
    print(0)
    exit()
if n==1:
    print(max(a)-min(a))
    exit()
for i in range(m-1):
    ans.append(abs(a[i+1]-a[i]))
total=0
ans.sort(reverse=True)
for i in range(n-1):
    total+=ans[i]
print(sum(ans)-total)

Fixed submission:
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=[]
if m==1:
    print(0)
    exit()
if n==1:
    print(max(a)-min(a))
    exit()
for i in range(m-1):
    ans.append(abs(a[i+1]-a[i]))
total=0
ans.sort(reverse=True)
if len(ans)<=n:
    print(0)
    exit()
for i in range(n-1):
    total+=ans[i]
print(sum(ans)-total)

Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=[]
if m==1:
    print(0)
    exit()
for i in range(m-1):
    ans.append(abs(a[i+1]-a[i]))
total=0
ans.sort(reverse=True)
for i in range(n-1):
    total+=ans[i]
print(sum(ans)-total)


Fixed submission:
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=[]
if m==1:
    print(0)
    exit()
if n==1:
    print(max(a)-min(a))
    exit()
for i in range(m-1):
    ans.append(abs(a[i+1]-a[i]))
total=0
ans.sort(reverse=True)
if len(ans)<=n:
    print(0)
    exit()
for i in range(n-1):
    total+=ans[i]
print(sum(ans)-total)
Buggy python submission (verdict: Runtime Error):
n=int(input())
cnt=[0]*300
cnt[n-1]=1
i=1
while True:
    if n%2==0:
        n//=2
    else:
        n=3*n+1
    i+=1
    if cnt[n-1]==1:
        print(i)
        exit()
    cnt[n-1]=1


Fixed submission:
n=int(input())
a=[n]
while True:
    if n%2==0:
        n//=2
    else:
        n=3*n+1
    if n in a:
        print(len(a)+1)
        exit()
    a.append(n)
Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
def lcm(a,b):
    return a*b//gcd(a,b)
n,m=map(int,input().split())
s=list(input())
t=list(input())
L=lcm(n,m)
text=["0"]*L
judge=True
for i in range(n):
    text[i*(L//n)]=s[i]
for j in range(m):
    if text[j*(L//m)]!="0":
        if text[j*(L//m)]!=t[j]:
            judge=False
print(L) if judge else print(-1)
#print(len(text))


Fixed submission:
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
n,m=map(int,input().split())
s=list(input())
t=list(input())
g=gcd(n,m)
a=n//g
b=m//g
judge=True
for i in range(g):
    if s[a*i]!=t[b*i]:
        judge=False
        break
print(g*a*b) if judge else print(-1)
#print(len(text))

Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
def lcm(a,b):
    return a*b//gcd(a,b)
n,m=map(int,input().split())
max_num=max(n,m)
s=list(input())
t=list(input())
L=lcm(n,m)
text=["0"]*(L*max_num)
judge=True
for i in range(n):
    text[i*(L//n)]=s[i]
for j in range(m):
    if text[j*(L//m)]!="0" and text[j*(L//m)]!=t[j]:
        judge=False
print(L) if judge else print(-1)
#print(len(text))


Fixed submission:
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
n,m=map(int,input().split())
s=list(input())
t=list(input())
g=gcd(n,m)
a=n//g
b=m//g
judge=True
for i in range(g):
    if s[a*i]!=t[b*i]:
        judge=False
        break
print(g*a*b) if judge else print(-1)
#print(len(text))
Buggy python submission (verdict: Runtime Error):
n=list(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)


Fixed submission:
n=int(input())
if n==1:
    print("Hello World")
else:
    a=input()
    b=input()
    print(int(a)+int(b))
Buggy python submission (verdict: Runtime Error):
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<string>
#include<vector>
using namespace std;
int main(){
    int N;
    cin>>N;
    for(int i=111;i<=999;i+=111){
        if(N<=i){
            cout<<i<<endl;
            return 0;
        }
    }
}

Fixed submission:
n=list(input())
temp=""
temp=temp.join(map(str,n))
temp=int(temp)
if n[0]==n[1]==n[2]:
    temp=""
    temp=temp.join(map(str,n))
    temp=int(temp)
    print(temp)
else:
    a=n[0]*3
    a=int(a)
    b=(str(int(n[0])+1))*3
    b=int(b)
    if a<temp:
        print(b)
    else:
        print(a)

Buggy python submission (verdict: Runtime Error):
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<string>
#include<vector>
using namespace std;
int main(){
    int N;
    cin>>N;
    for(int i=100;i<=999;i+111){
        if(N<=i){
            cout<<i<<endl;
            return 0;
        }
    }
    return 0;
}


Fixed submission:
n=list(input())
temp=""
temp=temp.join(map(str,n))
temp=int(temp)
if n[0]==n[1]==n[2]:
    temp=""
    temp=temp.join(map(str,n))
    temp=int(temp)
    print(temp)
else:
    a=n[0]*3
    a=int(a)
    b=(str(int(n[0])+1))*3
    b=int(b)
    if a<temp:
        print(b)
    else:
        print(a)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
ans=[]
ans.append(a)
ans.append(b)
ans.append(c)
ans.sort(reverse=True)
temp=""
temp+=ans[0]
temp+=ans[1]
print(int(temp)+ans[2])


Fixed submission:
a,b,c=map(int,input().split())
ans=[]
ans.append(a)
ans.append(b)
ans.append(c)
ans.sort(reverse=True)
temp=""
temp+=str(ans[0])
temp+=str(ans[1])
print(int(temp)+ans[2])
Buggy python submission (verdict: Runtime Error):
//============================================================================
// Name        : HelloWorld.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include<algorithm>
using namespace std;

int main() {
	int n,m,x,y;
	int X[1000],Y[1000];
	cin>>n>>m>>x>>y;
	for(int i=0;i<n;i++){
		cin>>X[i];
	}
	for(int j=0;j<m;j++){
		cin>>Y[j];

	}
	int X_max=-1000;
	int Y_min=1000;
	for(int i=0;i<n;i++){
		if(X_max<X[i]){
			X_max=X[i];
		}
	}
	for(int j=0;j<m;j++){
		if(Y[j]<Y_min){
			Y_min=Y[j];
		}
	}

	for(int k=x;k<y;k++){
		if(X_max<=k && k<=Y_min){
			cout<<"No War"<<endl;
			return 0;
		}

	}
	cout<<"War"<<endl;



}


Fixed submission:
n,m,x,y=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a_max=max(a)
b_min=min(b)
for i in range(x+1,y+1):
    if a_max<i and i<=b_min:
        print("No War")
        exit()
print("War")
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n<105:
    print(0)
elif 105<=n and n<135:
    print(1)
elif 135=n and n<175:
    print(2)
elif 175<=n and n<189:
    print(3)
else:
    print(4)

    

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