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

Fixed submission:
import sys
import numpy as np

def main(inp):
    N,M=map(int,next(inp).split())
    X=np.array(list(map(int,next(inp).split())))
    X=np.sort(X)
        
#     N=inp[0]
#     M=inp[1]    
#     X=np.array(inp[2])
    X=np.sort(X)    
#    print("N",N)
#    print("M",M)
#    print("X",X)
    
    if(N>M): return 0
    if(N==1):
        ans=X[len(X)-1]-X[0]
        return ans
    
    delta=np.empty([M-1],dtype=int)
    
    for i in range(M-1):
        delta[i]=X[i+1]-X[i]
    
#    print(X)
#    print("delta",delta)
    
    
    #delta=np.split(delta,[1,2])
    #print(delta)
    
    splpoint=np.argpartition(np.array(delta),-N+1)[-N+1:]
#     splpoint=np.sort(splpoint)
    
    delta=np.delete(delta,splpoint)
#    print(splpoint)
#    print(delta)    
    
    ans=sum(delta)
        
    return ans

print(main(sys.stdin))

Buggy submission (verdict: Runtime Error):
import sys
import numpy as np

def main(inp):
    N,M=map(int,next(inp).split())
    X=np.array(list(map(int,next(inp).split())))
    X=np.sort(X)
    
#     print(N,M,X)
    
    delta=np.empty([M-1],dtype=int)
    
    for i in range(M-1):
        delta[i]=X[i+1]-X[i]
    
#     print(X)
#     print(delta)
    
    
    #delta=np.split(delta,[1,2])
    #print(delta)
    
    splpoint=np.argpartition(np.array(delta),-N+1)[-N+1:]
    splpoint=np.sort(splpoint)
    for i in range(len(splpoint)):
        splpoint[i]+=1
    
#     delta=np.delete(delta,splpoint)
#     print(delta)    
#     print(splpoint)
    
    spl=np.split(X,splpoint)
#     print(spl)
    
    ans=0
    for i in range(len(spl)):
        ans+=spl[i][len(spl[i])-1]-spl[i][0]
        
    return ans
  
print(main(sys.stdin))
Problem p02771 (python)

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

Buggy submission (verdict: Runtime Error):
if len(set(list(map(int, input())))) == 2:
  print("Yes")
else:
  print("No")
Problem p02777 (python)

Fixed submission:
s, t = input().split()
a, b = map(int, input().split())
u = input()
if s == u:
  print(a - 1, b)
else:
  print(a, b - 1)

Buggy submission (verdict: Runtime Error):
st input().split()
kazu = list(map(int, input().split()))
u = input()
a = {st[0]: kazu[0], st[1]: kazu[1]}
a[u] -= 1
print(a[0], a[1])
Problem p02723 (python)

Fixed submission:
text = input()
if len(text) < 6:
  print("No")
elif text[2] == text[3] and text[4] == text[5]:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
import re

text = input()
if text[2] == text[3] && text[4] == text[5]:
  return "Yes"
else:
  return "No"
Problem p02725 (python)

Fixed submission:
a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
    ans.append(s[i+1]-s[i])
ans.append(a-s[b-1]+s[0])
print(a-max(ans))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
    ans.append(s[i+1]-s[i])
ans.append(a-s[b]+s[0])
print(a-max(ans))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
    ans.append(s[i]-s[i-1])
ans.append(a-s[b]+s[0])
print(sum(ans)-max(ans))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
    ans.append(s[i]-s[i-1])
ans.append(a-s[b]+s[0])
print(a-max(ans))
Problem p02753 (python)

Fixed submission:
a=input()
len=len(a)
a_cnt=0
b_cnt=0
for i in range(len):
    if a[i]=='A':
        a_cnt+=1
    else :
        b_cnt+=1
if a_cnt>0 and b_cnt>0:
    print('Yes')
else :
    print('No')

Buggy submission (verdict: Runtime Error):
a=input()
len=len(a)
a_cnt=0
b_cnt=0
for i in range(len):
    if a[i]='A':
        a_cnt+=1
    else :
        b_cnt+=1
if a_cnt>0 and b_cnt>0:
    print('Yes')
else :
    print('No')
Problem p02759 (python)

Fixed submission:
import math
a=int(input())
print(math.ceil(a/2))

Buggy submission (verdict: Runtime Error):
a1=[map(int(),input().split())]
a2=[map(int(),input().split())]
a3=[map(int(),input().split())]
n=int(input())
b=[input() for i in range(n)]

line1=[]
line2=[]
line3=[]

for num in b:
    if num in a1:
        line1.append(a1.index(num))
    elif num in a2:
        line2.append(a2.index(num))
    elif num in a3:
        line3.append(a3.index(num))
if 0 in line1 and 0 in line2 and 0 in line3 or 1 in line1 and 1 in line2 and 1 in line3 or 2 in line1 and 2 in line2 and 2 in line3 :
    print("Yes")
elif 0 in line1 and 1 in line2 and 2 in line3 or 2 in line1 and 1 in line2 and 0 in line3:
    print("Yes")
elif 0 in line1 and 1 in line1 and 2 in line1 or 0 in line2 and 1 in line2 and 2 in line2 or 0 in line3 and 1 in line3 and 2 in line3:
    print("Yes")
else:
    print("No")
Problem p02766 (python)

Fixed submission:
a,b=map(int,input().split())
count=1
while a>=b:
    a=a/b
    count+=1
print(count)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if b==2:
    a=format(a,'b')
elif b==8:
    a=format(a,'o')
elif b==10:
    a=int(a)
print(len(a))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if b==2:
    a=bin(a)
elif b==8:
    a=oct(a)
elif b==10:
    a=int(a)
print(len(a))
Problem p02771 (python)

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

if a==b and b==c :
    print('No')
elif a==b or a==c or b==c:
    print("Yes")
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())

if a=b and b=c :
    print('No')
elif a=b or a=c or b=c:
    print("Yes")
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())

if a=b and b=c :
    print("Yes")
else:
    print('No')
Problem p02773 (python)

Fixed submission:
import collections
a=int(input())
s=[input()for _ in range(a)]
c=collections.Counter(s)
m=0 
for v in c.values(): 
    m=max(m,v)
ans=[]
for k,v in c.items():
    if m == v:
        ans.append(k)
ans.sort()
for i in ans:
    print(i)

Buggy submission (verdict: Runtime Error):
a=int(input())
s=[input()for _ in range(a)]
c=Counter(s)
m=0 
m=max(m,v)
ans=[]
for k,v in c.items():
    if m == v:
        ans.append(k)
ans.sort()
print(ans)
Problem p02723 (python)

Fixed submission:
S=input()
if S[2]==S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
X=int(input())
tot=int(X/500)
y=X-tot*500
tot=tot*1000 + int(y/5)*5
print(tot)
Problem p02933 (python)

Fixed submission:
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Buggy submission (verdict: Runtime Error):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print(red)
Problem p02935 (python)

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

v.sort(reverse=True)
x = 1
answer = 0
for i in range(N-1):
    x *= 2
    answer += (v[i]/x)

answer += v[N-1]/x
print(answer)

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

v.sorted(reverse=True)
x = 1
answer = 0
for i in range(N-1):
    x *= 2
    answer += (v[i]/x)

answer += v[N-1]/x
print(answer)

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

v.sorted(reverse=True)
x = 1
answer = 0
for i in range(N-1):
    x *= 2
    answer += (v[i]/x)

answer += v[N-1]/x
print(answer)

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

v.sorted(reverse=True)
x = 1
answer = 0
for i in range(n-1):
    x *= 2
    answer += (v[i]/x)

answer += v[N-1]/x
print(answer)
Problem p02954 (python)

Fixed submission:
s = input()

l = len(s)
n = 1
rl = []
for i in range(l-1):
    if s[i] == s[i+1] and i != l-2:
        n += 1
    elif s[i] == s[i+1] and i == l-2:
        n += 1
    else:
        rl.append(n)
        n = 1

rl.append(n)

ans = [0]*l
rl_length = len(rl)//2
position = rl[0]

for i in range(rl_length):
    ans[position-1] += -(-rl[i*2]//2) + rl[i*2+1]//2
    ans[position] += rl[i*2]//2 - (-rl[i*2+1]//2)
    if i != rl_length - 1:
        position += (rl[i*2+1] + rl[i*2+2])

for i in range(l):
    if i == l-1:
        print(ans[l-1])
    else:
        print(ans[i],end=" ")

Buggy submission (verdict: Runtime Error):
s = input()
RRLRL

l = len(s)
n = 1
rl = []
for i in range(l-1):
    if s[i] == s[i+1] and i != l-2:
        n += 1
    elif s[i] == s[i+1] and i == l-2:
        n += 1
    else:
        rl.append(n)
        n = 1

rl.append(n)

ans = [0]*l
rl_length = len(rl)//2
position = rl[0]

for i in range(rl_length):
    ans[position-1] += -(-rl[i*2]//2) + rl[i*2+1]//2
    ans[position] += rl[i*2]//2 - (-rl[i*2+1]//2)
    if i != rl_length - 1:
        position += (rl[i*2+1] + rl[i*2+2])

for i in range(l):
    if i == l-1:
        print(ans[l-1])
    else:
        print(ans[i],end=" ")
Problem p02987 (python)

Fixed submission:
S = input()

count = 0
if S[0] == S[1] and S[2] == S[3]:
    count += 1

if S[0] == S[2] and S[1] == S[3]:
    count += 1

if S[0] == S[3] and S[1] == S[2]:
    count += 1

if count == 1:
    print('Yes')
else:
    print('No')

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

Red = N-K
Blue = K
mod = 1000000007

ans = 1
for i in range(Blue):
    if Red < i:
            ans = 0
    elif i != 0:
        ans = (ans * (Red + 1 - i) * (Blue - i) // ((i + 1) * i))
    else:
        ans = (ans * (Red + 1 - i) // (i + 1))
    print(int(ans) % mod)
Problem p02990 (python)

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

Red = N-K
Blue = K
mod = 1000000007

ans = 1
for i in range(Blue):
    if Red < i:
            ans = 0
    elif i != 0:
        ans = (ans * (Red + 1 - i) * (Blue - i) // ((i + 1) * i))
    else:
        ans = (ans * (Red + 1 - i) // (i + 1))
    print(int(ans) % mod)

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

Red = N-K
Blue = K
mod = 1000000007

ans = 1
for i in range(Blue):
    if Red < i:
            ans = 0
    elif i != 0:
        ans = ans * (Red + 1 - i) * (Blue - i) / ((i + 1) * i)
    else:
        ans = ans * (Red + 1 - i) / (i + 1)
    print(int(ans) % mod)

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

Red = N-K
Blue = K
mod = 1000000007

ans = 1
for i in range(Blue):
    if Red < i:
            ans = 0
    elif i != 0:
        ans = ans * (Red + 1 - i) * (Blue - i) / ((i + 1) * i)
    else:
        ans = ans * (Red + 1 - i) / (i + 1)
    print(int(ans) % mod)
Problem p03013 (python)

Fixed submission:
n,m = map(int,input().split())
a = list(int(input()) for i in range(m))

mod = 1000000007
b = [0]*(m + 1)
if m != 0:
    b[0] = a[0] - 1
    b[m] = n - a[m - 1] - 1
else:
    b[0] = n

for i in range(1,m):
    b[i] = a[i] - a[i-1] - 2

b.sort()
ans = 1
if b[0] == -1:
    ans = 0
else:
    pattern = [0]*(max(b[m]+1,2))
    pattern[0] = 1
    pattern[1] = 1
    for i in range(2,b[m]+1):
        pattern[i] = pattern[i-1] + pattern[i-2]
    for i in range(m + 1):
        ans *= pattern[b[i]]

print(ans % mod)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(int(input()) for i in range(m))

mod = 1000000007
b = [0]*(m + 1)
if m != 0:
    b[0] = a[0] - 1
    b[m] = n - a[m - 1] - 1
else:
    b[0] = n

for i in range(1,m):
    b[i] = a[i] - a[i-1] - 2

b.sort()
ans = 1
if b[0] == -1:
    ans = 0
else:
    pattern = [0]*(b[m]+1)
    pattern[0] = 1
    pattern[1] = 1
    for i in range(2,b[m]+1):
        pattern[i] = pattern[i-1] + pattern[i-2]
    for i in range(m + 1):
        ans *= pattern[b[i]]

print(ans % mod)

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

mod = 1000000007
b = [0]*(m + 1)
if m != 0:
    b[0] = a[0] - 1
    b[m] = n - a[m - 1] - 1
else:
    b[0] = n

for i in range(1,m):
    b[i] = a[i] - a[i-1] - 2

b.sort()
ans = 1
if b[0] == -1:
    ans = 0
else:
    pattern = [0]*(b[m]+1)
    pattern[0] = 1
    pattern[1] = 1
    for i in range(2,b[m]+1):
        pattern[i] = pattern[i-1] + pattern[i-2]
    for i in range(m + 1):
        ans *= pattern[b[i]]

print(ans % mod)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(int(input()) for i in range(m))

mod = 1000000007
b = [0]*(m + 1)

b[0] = a[0] - 1
b[m] = n - a[m - 1] - 1

for i in range(1,m):
    b[i] = a[i] - a[i-1] - 2

b.sort()
ans = 1
if b[0] == -1:
    ans = 0
else:
    pattern = [0]*(b[m]+1)
    pattern[0] = 1
    pattern[1] = 1
    for i in range(2,b[m]+1):
        pattern[i] = pattern[i-1] + pattern[i-2]
    for i in range(m + 1):
        ans *= pattern[b[i]]

print(ans % mod)
Problem p03038 (python)

Fixed submission:
n,m = map(int,input().split())
a = list(map(int,input().split()))
bc = list(list(map(int,input().split())) for i in range(m))

a.sort()
bc.sort(reverse=True,key=lambda x:x[1])
t = 0
for i in range(m):
    for j in range(bc[i][0]):
        if t != n:
            if a[t] < bc[i][1]:
                a[t] = bc[i][1]
                t+=1
            else:
                break
        else:
            break
    else:
        continue
    break

print(sum(a))

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(map(int,input().split()))
bc = list(list(map(int,input().split())) for i in range(m))

a.sort()
bc.sort(reverse=True,key=lambda x:x[1])
t = 0
for i in range(m):
    for j in range(bc[i][0]):
        if a[t] < bc[i][1]:
            a[t] = bc[i][1]
            t+=1
        else:
            break

print(sum(a))

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(map(int,input().split()))
bc = list(list(map(int,input().split())) for i in range(m))

a.sort()
bc.sort(reverse=True,key=lambda x:x[1])
t = 0
for i in range(m):
    for j in range(bc[i][0]):
        if a[t] < bc[i][1]:
            a[t] = bc[i][1]
            t+=1
        else:
            break

print(sum(a))

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(map(int,input().split()))
bc = list(list(map(int,input().split())) for i in range(m))

a.sort()
print(a)
bc.sort(reverse=True,key=lambda x:x[1])
t = 0
for i in range(m):
    for j in range(bc[i][0]):
        if a[t] < bc[i][1]:
            a[t] = bc[i][1]
            t+=1
        else:
            break

print(sum(a))

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(map(int,input().split()))
bc = list(list(map(int,input().split())) for i in range(m))

a.sort()
print(a)
t = 0
for i in range(m):
    if sum(a[t:t+bc[i][0]]) < bc[i][0]*bc[i][1]:
        for j in range(bc[i][0]):
            a[t+j] = bc[i][1]
            print(a)
        a.sort()

print(sum(a))
Problem p03104 (python)

Fixed submission:
a,b = map(int,input().split())

if b - a == 0:
    answer = a
else:
    answer = 0
    if a % 2 == 0:
        first_odd = a
    else:
        first_odd = a+1
    if b % 2 == 0:
        last_even = b-1
    else:
        last_even = b
    odd_even = int((last_even - first_odd + 1) // 2)
    if a % 2 == 1 and b % 2 == 0:
        answer += (odd_even + 1) % 2
        b2 = []
        while b > 0:
            b2.append(b % 2)
            b = int((b-b%2)//2)
        a2 = []
        for i in range(len(b2)):
            a2.append(a % 2)
            a = int((a-a%2)//2)
        for i in range(1,len(b2)):
            if a2[i]+b2[i] == 1:
                answer += 2**i
    elif a % 2 == 1:
        answer += (odd_even + 1) % 2 + a - 1
    elif b % 2 == 0:
        answer += odd_even % 2 + b
    else:
        answer += odd_even % 2

print(answer)

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
123456789012 123456789012
if b - a == 0:
    answer = a
else:
    answer = 0
    if a % 2 == 0:
        first_odd = a
    else:
        first_odd = a+1
    if b % 2 == 0:
        last_even = b-1
    else:
        last_even = b
    odd_even = int((last_even - first_odd + 1) // 2)
    if a % 2 == 1 and b % 2 == 0:
        answer += (odd_even + 1) % 2
        b2 = []
        while b > 0:
            b2.append(b % 2)
            b = int((b-b%2)//2)
        a2 = []
        for i in range(len(b2)):
            a2.append(a % 2)
            a = int((a-a%2)//2)
        for i in range(1,len(b2)):
            if a2[i]+b2[i] == 1:
                answer += 2**i
    elif a % 2 == 1:
        answer += (odd_even + 1) % 2 + a - 1
    elif b % 2 == 0:
        answer += odd_even % 2 + b
    else:
        answer += odd_even % 2

print(answer)
Problem p03127 (python)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))

a.sort()
x = [a[1],a[0],a[1] % a[0]]
for i in range(1,n):
    while x[2] > 0:
        x[0] = x[1]
        x[1] = x[2]
        x[2] = x[0] % x[1]
    if i != n - 1:
        x[0] = a[i+1]
        x[2] = x[0] % x[1]

print(x[1])

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

x = [a[1],a[0],a[1] % a[0]]
a.sort()
for i in range(1,n+1):
    while x[2] > 0:
        x[0] = x[1]
        x[1] = x[2]
        x[2] = x[0] % x[1]
    x[0] = a[i+1]
    x[2] = x[0] % x[1]

print(x[1])
Problem p03137 (python)

Fixed submission:
n,m = map(int,input().split())
x = list(map(int,input().split()))

if n >= m:
    print(0)
else:
    x.sort()
    interval = [0]*(m-1)
    for i in range(m-1):
        interval[i] = x[i+1] - x[i]
    interval.sort(reverse = True)
    answer = x[m-1] - x[0]
    for i in range(min(m,n-1)):
        answer -= interval[i]
    print(answer)

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

x.sort()
interval = [0]*(m-1)

for i in range(m-1):
    interval[i] = x[i+1] - x[i]

interval.sort(reverse = True)

answer = x[m-1] - x[0]
for i in range(n-1):
    answer -= interval[i]

print(answer)
Problem p02723 (python)

Fixed submission:


s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):

K, N = map(int, input().split())
A = list(map(int, input().split()))

diff = K + A[0] - A[-1]

for i in range(N-1):
    diff = max(diff , A[i+1]-A[i])

print(K-diff)
Problem p02725 (python)

Fixed submission:

K, N = map(int, input().split())
A = list(map(int, input().split()))

diff = K + A[0] - A[-1]

for i in range(N-1):
    diff = max(diff , A[i+1]-A[i])

print(K-diff)

Buggy submission (verdict: Runtime Error):

K, N = map(int, input().split())
A = list(map(int, input().split()))

A.remove(0)
A.append(A[0])

max_distance = 0
pre = 0

for i in A:

    if abs(i - pre) > max_distance:
        max_distance = abs(i - pre)
    pre = i



print (K - max_distance)
Problem p02729 (python)

Fixed submission:
from scipy.misc import comb

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

print(comb(N,2, exact=True) + comb(M,2,exact=True))

Buggy submission (verdict: Runtime Error):
from scipy.special import comb

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

print(comb(N,2, exact=True) + comb(M,2,exact=True))
Problem p03207 (python)

Fixed submission:
n = int(input())
p = [int(input()) for i in range(n)]
p.sort()
print(int(p[-1]/2+sum(p[:-1])))

Buggy submission (verdict: Runtime Error):
lst = []
V = 0

N = int(input())
for i in range(N):
    a = int(input())
    lst.append(a)
lst.sort()
l = lst[2]

for f in lst:
    V += f
print(int(V - (l/2)))
Problem p02754 (python)

Fixed submission:
N,A,B=map(int,input().split())
K=A*int(N/(A+B))
amari=N%(A+B)
if (amari>=A):
  i=A
elif (amari<A):
  i=amari
K=K+i
print(K)

Buggy submission (verdict: Runtime Error):
N,A,B=map(int(),input().split())
K=A*int(N/(A+B))
amari=N%(A+B)
i=1
while ((amari-i)>0):
  i=i+1
K=K+i
print(K)

Buggy submission (verdict: Runtime Error):
N,A,B=map(int(),input().split())
K=A*int(N/(A+B))
amari=N%(A+B)
i=1
while ((amari-i)>0):
  i=i+1
K=K+i
Problem p02753 (python)

Fixed submission:
S=input()

if(S[0]==S[1]==S[2]):
    print("No")
else:
    print("Yes")

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

if(S[1]==S[2]==S[3]):
    print("No")
else:
    print("Yes")
Problem p02831 (python)

Fixed submission:
A,B=map(int, input().split()) 
N=max(A,B)
M=min(A,B)
for i in range(0,M):
    if M%(M-i)==0 and N%(M-i)==0:
        Max=M-i
        break
print(A*B//Max)

Buggy submission (verdict: Runtime Error):
A,B=map(int, input().split()) 
N=max(A,B)
M=min(A,B)
for i in range(1,M+1):
    if M%(M-i)==0 and N%(M-i)==0:
        Max=i
        break
print(N*M//Max)
Problem p02723 (python)

Fixed submission:
S = input()
if S[2] == S[3] and S[4] == S[5]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a,b=divmod(int(input()),500)
print(a*1000+(b//5)*5)

Buggy submission (verdict: Runtime Error):
S=int(input())
a=S//500
b=S%500
c=b//5
print(a*1000+c*5)

Buggy submission (verdict: Runtime Error):
S=input()
If S[2]==S[3] and S[4]==S[5]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
S = input()
If S[2]=S[3] and S[4]=S[5]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
S = input()
if S[2] == S[3] and S[4] == S[5]:
  print(Yes)
else:
  print(No)

Buggy submission (verdict: Runtime Error):
S = input()
if S[2] = S[3] and S[4] = S[5]:
  print(Yes)
else:
  print(No)

Buggy submission (verdict: Runtime Error):
S = input()
if S[2] = S[3] and S[4] = S[5]:
  print(Yes)
else if:
  print(No)
Problem p02879 (python)

Fixed submission:
a,b=map(int,input().split())
if a<10 and b<10:
  print(a*b)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
a=int(input())
for x in range(int(a**0.5),0,-1):
	if a%x==0:
     d=int(a//x)
     s=d+x-2
     break
print(s)

Buggy submission (verdict: Runtime Error):
a=int(input())
for x in range(int(a**0.5),0,-1)
	if a%x==0:
    s=a+x-2
    break
print(s)
Problem p02880 (python)

Fixed submission:
a=int(input())
for i in range(1,10):
  if a//i<10:
    if a%i==0:
      print('Yes')
      break
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a=int(input())
for i range(1,10):
  if a//i<10:
    if a%i=0:
      print(Yes)
else:
  print(No)

Buggy submission (verdict: Runtime Error):
a=int(input())
while x<10:
if a%x=0 and a//x<10:
	print('Yes')
    x += 1
else:
  print('No')
Problem p02881 (python)

Fixed submission:
a=int(input())
for x in range(int(a**0.5),0,-1):
  if a%x==0:
    b=int(a//x)
    break
print(b+x-2)

Buggy submission (verdict: Runtime Error):
a=int(input())
for x in range(int(a**0.5),0,-1):
	if a%x==0:
    d=int(a//x)
    break
print(d+x-2)

Buggy submission (verdict: Runtime Error):
a=int(input())
for x in range(int(a**0.5),0,-1):
	if a%x==0:
    d=int(a//x)
    s=d+x-2
    break
print(s)

Buggy submission (verdict: Runtime Error):
a=int(input())
for x in range(int(a**0.5),0,-1):
	if a%x==0:
    d=a//x
    s=d+x-2
    break
print(s)

Buggy submission (verdict: Runtime Error):
a=int(input())
for x in range(int(a**0.5),0,-1)
	if a%x==0:
    d==a//x
    s==d+x-2
    break
print(s)

Buggy submission (verdict: Runtime Error):
a=int(input())
for x in range(a**0.5,0,-1)
	if a%x==0:
    s=a+x-2
    break
print(s)