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

Fixed submission:
S_a = input()
S_b = input()
S_c = input()
a = []
b = []
c = []
for i in range(len(S_a)):
    a.append(S_a[i])
for j in range(len(S_b)):
    b.append(S_b[j])
for k in range(len(S_c)):
    c.append(S_c[k])
l = a
winner = 'A'
while len(l) > 0:
    x = l.pop(0)
    if x == 'a':
        l = a
        winner = 'A'
    elif x == 'b':
        l = b
        winner = 'B'
    else:
        l = c
        winner = 'C'
print(winner)

Buggy submission (verdict: Runtime Error):
S_a = input()
S_b = input()
S_c = input()
a = []
b = []
c = []
for i in range(len(S_a)):
    a.append(S_a[i])
for j in range(len(S_b)):
    b.append(S_b[i])
for k in range(len(S_c)):
    c.append(S_c[i])
l = a
winner = 'A'
wlile len(l) > 0:
    x = l.pop(0)
    if x == 'a':
        l = a
        winner = 'A'
    elif x == 'b':
        l = b
        winner = 'B'
    else:
        l = c
        winner = 'C'
print(winner)
Problem p04000 (python)

Fixed submission:
dx = [-1,-1,-1,0,0,1,1,1,0]
dy = [-1,0,1,-1,1,-1,0,1,0]
H,W,N = map(int,input().split())
from collections import defaultdict, Counter
d = defaultdict(int)
for i in range(N):
    a,b = map(int,input().split())
    for j in range(9):
        A = a + dy[j]
        B = b + dx[j]
        f = 0
        if 2 <= A <= H-1:
            if 2 <= B <= W-1:
                f = 1
        if f == 1:
            d[(A,B)] += 1
s = 0
c = Counter(d.values())
for i in range(1,10):
    s += c[i]
c[0] = (H-2)*(W-2) - s
for i in range(10):
    print(c[i])

Buggy submission (verdict: Runtime Error):
dx = [-1,-1,-1,0,0,1,1,1]
dy = [-1,0,1,-1,1,-1,0,1]
H,W,N = map(int,input().split())
s = []
d = {}
for i in range(N):
    x,y = map(int,input().split())
    if (x,y) not in s:
        d[(x,y)] = 0
        s.append((x,y))
    d[(x,y)] += 1
    for j in range(8):
        X = x + dx[j]
        Y = y + dx[j]
        if (X,Y) not in s:
            d[(x,y)] = 0
            s.append((X,Y))
        d[(X,Y)] += 1
ans = [H*W-len(s),0,0,0,0,0,0,0,0,0]
for (x,y) in s:
    ans[d[(x,y)]] += 1
for i in range(10):
    print(ans[i])
Problem p04001 (python)

Fixed submission:
S = input()
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)

Buggy submission (verdict: Runtime Error):
S = intinput()
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)

Buggy submission (verdict: Runtime Error):
S = int(input())
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)

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

def plus(a,b,c):
    x = a[0:b+1] + c + a[b+1:len(a)]
    return(x)
A = [S]
while len(A) != 2**(len(S)):
    for i in range(len(S)-1):
        for j in range(len(A)):
            x = A[j]
            y = plus(x,i,'+')
            A.append(y)
s = 0
for i in range(len(A)):
    x = A[i]
    p = 0
    q = 0
    for j in range(len(x)):
        if x[j] == '+':
            q = j - 1
            m = x[p:q]
            s += int(m)
            p = j + 1
        elif j == len(x):
            q = len(x)
            m = x[p:q]
            s += int(m)
print(s)
Problem p04013 (python)

Fixed submission:
N, A = map(int,input().split())
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*50+1)] for j in range(N+1)] for k in range(N+1)]
for i in range(N+1):
    dp[i][0][0] = 1
for i in range(1,N+1):
    x = X[i-1]
    for j in range(1,N+1):
        for k in range(N*50+1):
            if k < x:
                dp[i][j][k] = dp[i-1][j][k]
                
            elif j > i:
                dp[i][j][k] = 0
                
            else: 
                dp[i][j][k] += dp[i-1][j][k] + dp[i-1][j-1][k-x]
ans = 0
for i in range(1,N+1):
    ans += dp[N][i][A*i]
print(ans)

Buggy submission (verdict: Runtime Error):
N, A = map(int,input().split())
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*A+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(1,N+1):
    x = X[i-1]
    for j in range(N):
        for k in range(N*M+1):
            if k < x:
                dp[i][j][k] += dp[i-1][j][k]
            elif j > i:
                dp[i][j][k] = 0
            else:
                dp[i][j][k] += dp[i-1][j][k] + dp[i-1][j-1][k-x]
for i in range(1,N+1):
    ans += dp[N][i][N*i]
print(ans)
Problem p04030 (python)

Fixed submission:
s = str(input())
n = len(s)
a = []
for i in range(n):
    if s[i] != 'B':
        a.append(s[i])
    else:
        if len(a) != 0:
            a.pop(-1)
t =''
m = len(a)
for j in range(m):
    t += a[j]
print(t)

Buggy submission (verdict: Runtime Error):
s = str(input())
n = len(s)
a = []
for i in range(n):
    if s[i] != 'B':
        a.append(s[i])
    else:
        if len(s) != 0:
            a.pop(-1)
t =''
m = len(a)
for j in range(m):
    t += a[j]
print(t)
Problem p04031 (python)

Fixed submission:
import math
N = int(input())
a = list(map(int,input().split()))
s = 0
t = 0
for i in range(N):
    s += a[i]
    t += (a[i])**2
a = math.floor(s/N)
if (s/N) - a > 0.5:
    a += 1
ans = N*a**2 - 2*s*a + t
print(ans)

Buggy submission (verdict: Runtime Error):
import math
N = int(input())
a = list(map(int,input().split())
s = 0
t = 0
for i in range(N):
    s += a[i]
    t += (a[i])**2
a = math.floor(s/N)
if (s/N) - a > 0.5:
    a += 1
ans = N*a**2 - 2*s*a + t
print(ans)
Problem p04032 (python)

Fixed submission:
s = input()
n = len(s)
for i in range(n-1):
    if s[i] == s[i+1]:
        print(i+1,i+2)
        break
    if i != n-2:
        if s[i] == s[i+2] or s[i+1] == s[i+2]:
            print(i+1,i+3)
            break
    if i == n-2:
        print(-1,-1)

Buggy submission (verdict: Runtime Error):
s = input()
n = len(s)
for i in range(n-1):
    a = s[i:i+2]
    if i != n-2:
        b = s[i:i+3]
    if a[0] == a[1]:
        print(i+1,i+2)
        break
    if b[0] == b[2] or b[1] == b[2]:
        print(i+1,i+3)
        break
    if i == n-2:
        print(-1,-1)

Buggy submission (verdict: Runtime Error):
s = input()
n = len(s)
for i in range(n-1):
    a = s[i:i+2]
    if i != n-2:
        b = s[i:i+3]
    if a[0] == a[1]:
        print(i+1,i+3)
        break
    if b[0] == b[2] or b[1] == b[2]:
        print(i+1,i+3)
        break
    if i = n-2:
        print(-1,-1)
Problem p04046 (python)

Fixed submission:
import math
H, W, A, B = map(int,input().split())
e = 10**9 + 7
def power(a,b):
    if b == 0:
        return 1
    elif b == 1:
        return a % e
    elif b%2 == 0:
        return power(a,b//2)**2 % e
    else:
        return power(a,b//2)**2*a % e
    
M = [1]
for i in range(1,H+W):
    a = M[i-1]*i%e
    M.append(a)
N= [0]*(H+W)
N[H+W-1] = power(M[H+W-1], e-2)
for i in range(H+W-2, -1, -1):
    N[i] = N[i+1] * (i+1) % e

def c(a,b):
    return M[a]*N[b]*N[a-b]%e

T = 0
for i in range(W-B):
    P = c(H+W-A-i-2,H-A-1)
    Q = c(A+i-1,i)
    T = (T + P*Q)
print(T%e)

Buggy submission (verdict: Runtime Error):
import math
H, W, A, B = map(int,input().split())
def f(a,b):
    p = math.factorial(a+b-2)
    q = math.factorial(a-1)
    r = math.factorial(b-1)
    S = p // (q*r)
return S
T = 0
for i in range(1,H-A):
    P = f(i,B+1)
    Q = f(H-i+1,W-B)
    T = T + P*Q
print(T)
Problem p02553 (python)

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

if b >= 0 and d >= 0 and a <= 0 and c <= 0:# - + - + = +
    e = b*d
    f = a*c
    if e > f:
        print(e)
    else:
        print(f)
elif a >= 0 and b >= 0 and c >= 0 and d >= 0: #+ + + +
    print(b*d)
elif a <= 0 and b <= 0 and c <= 0 and d <= 0: #- - - - = -
    print(a*c)
elif a >= 0 and b >= 0 and c <= 0 and d <= 0: #+ + - -
    print(a*d)
elif a >= 0 and b >= 0 and c <= 0 and d >= 0: # + + - +
    print(b*d)
elif a <= 0 and b <= 0 and c >= 0 and d >= 0: # - - + +
    print(b*c)
elif a <= 0 and b <= 0 and c <= 0 and d >= 0: # - - - +
    print(a*c)
elif a <= 0 and b >= 0 and c >= 0 and d >= 0: # - + + +
    print(b*d)
elif a <= 0 and b >= 0 and c <= 0 and d <= 0: # - + - -
    print(a*c)

Buggy submission (verdict: Runtime Error):
if b >= 0 and d >= 0 and a <= 0 and c <= 0:
    e = b*d
    f = a*c
    if e > f:
        print(e)
    else:
        print(f)
else:
    e = abs(a)
    f = abs(b)
    g = abs(c)
    h = abs(d)
    l = [e,f,g,h]
    l.sort()
    print(-1*l[0]*l[1])
Problem p02583 (python)

Fixed submission:
n = int(input())
l_list = list(map(int,input().split()))
l_list.sort()
count = 0
for i in range(0, n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            a = l_list[i]
            b = l_list[j]
            c = l_list[k]
            if a == b or b == c or c == b:
                continue
            if a + b > c:
                count += 1
            else:
                break
print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
l_list = list(map(int,input().split()))
l_list.sort()
count = 0
for i in range(0, n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            a = list[i]
            b = list[j]
            c = list[k]
            if a == b or b == c or c == b:
                continue
            if a + b > c:
                count += 1
            else:
                break
print(count)
Problem p02657 (python)

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

print(a*b)

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

print(a * b)
Problem p02705 (python)

Fixed submission:
import math

pi = math.pi

R = int(input())

print(2 * R * pi)

Buggy submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  
  int R;
 
  cout << R * π << endl;　
  
}

Buggy submission (verdict: Runtime Error):
R = input(str())

print R * π
Problem p02553 (python)

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

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

Fixed submission:
N=int(input())
c=N%10
if c==2 or c==4 or c==5 or c==7 or c==9:
  print('hon')
elif c==0 or c==1 or c==6 or c==8:
    print('pon')
else:
  print('bon')

Buggy submission (verdict: Runtime Error):
N=int(input())
c=c%10
if c==2 or c==4 or c==5 or c==7 or c==9:
  print('hon')
elif c==0 or c==1 or c==6 or c==8:
    print('pon')
else:
  print('bon')
Problem p02694 (python)

Fixed submission:
import math
X=int(input())
u=100
y=0
while u<X:
  u=math.floor(u*1.01)
  y+=1
print(y)

Buggy submission (verdict: Runtime Error):
import math
X=int(input())
u=100
y=0
while u>=0:
  u=math.floor(u*1.01)
  y+=1
print(y)

Buggy submission (verdict: Runtime Error):
X=int(input())
u=100
y=0
while u>=0:
  u=int(u*1.01)
  y+=1
print(y)
Problem p02717 (python)

Fixed submission:
X,Y,Z=map(int,input().split())
print(Z,X,Y)

Buggy submission (verdict: Runtime Error):
X,Y,Z=map(int(input().split()))
print(Z,X,Y)
Problem p02741 (python)

Fixed submission:
N=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(N[int(input())-1])

Buggy submission (verdict: Runtime Error):
N=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(N[int(input()-1)])
Problem p02765 (python)

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

Buggy submission (verdict: Runtime Error):
N,R=int(input().split())
c=0
if N>=10:
  c=R
else:
  c=R+100*(10-c)
print(c)
Problem p02841 (python)

Fixed submission:
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print(1 if d2==1 else 0)

Buggy submission (verdict: Runtime Error):
import math
N=int(input())
X=math.ceil(N/1.08)
if math.floor(X*1.08)==N:
    print(X)
else:
    print(':(')

Buggy submission (verdict: Runtime Error):
m1,d1=map(int(input().split())
m2,d2=map(int(input().split())
if d1+1==d2:
    print(0)
else:
    print(1)
Problem p02921 (python)

Fixed submission:
S=input()
T=input()
m=0
for i in range(3):
    if S[i]==T[i]:
        m+=1
print(m)

Buggy submission (verdict: Runtime Error):
A,B=map(int(input().split())
c=A
x=1
while c>B:
        c=c-1+A
        x+=1
print(x)

Buggy submission (verdict: Runtime Error):
S=input().split()
T=input().split()
c=0
for i in S
 if S[i]==T[i]:
   c+=1
print(c)

Buggy submission (verdict: Runtime Error):
S=input()
T=input()
c=0
for i in S
 if S[i]==T[i]:
   c+=1
print(c)
Problem p02922 (python)

Fixed submission:
A,B=map(int,input().split())
s=1
cut=0
while B>s:
    cut+=1
    s=s+A-1
print(cut)

Buggy submission (verdict: Runtime Error):
A,B=map(int(input().split())
c=A
x=1
while c<B:
        c=c-1+A
        x+=1
print(x)

Buggy submission (verdict: Runtime Error):
A,B=map(int,input())
c=0
if B%A!=0:
  c=1
print(B+c)
Problem p02923 (python)

Fixed submission:
N=int(input())
H=map(int,input().split())
H=list(H)
x=0
xmax=0
for i in range(1,N):
    if H[i-1]>=H[i]:
        x+=1
    else:
        xmax=max(x,xmax)
        x=0
xmax=max(x,xmax)
print(xmax)

Buggy submission (verdict: Runtime Error):
N=int(input())
H=map(int,input().split())
H=list(H)
x=0;xmax=[]
for i in range(1,N):
    if H[i-1]>=H[i]:
        x+=1
    else:
        xmax.append(x)
        x=0
print(max(xmax))
Problem p02934 (python)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
c=[1/i for i in A]
print(1/sum(c))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
c=0
for i in N:
  c+=1/A[N]
c=1/c
print(c)

Buggy submission (verdict: Runtime Error):
N=int(input())
A=int(input()).split()
c=0
for i in A:
  c+=reciprocal(A[i])
print(reciprocal(c))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=int(input()).split()
c=0
for i in A:
  c+=reciprocal(A[i])
print(rexiprocal(c)

Buggy submission (verdict: Runtime Error):
N=int(input())
A=int(input()).split()
c=0
for i in N:
  c+=A[i]**-1
print(c**-1)
Problem p02945 (python)

Fixed submission:
A,B=map(int,input().split())
m=max(A+B,A-B,A*B)
print(m)

Buggy submission (verdict: Runtime Error):
A,B=input().split()
max(A*B,A+B,A-B)
Problem p02658 (python)

Fixed submission:
import sys

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

if 0 in A :
    print(0)
    sys.exit()

for i in range(N):
    a = a*A[i]
    if a > 10**18 :
        print(-1)    
        sys.exit()

else : print(a)

Buggy submission (verdict: Runtime Error):
import sys

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

if 0 in A :
    print(0)
    sys.exit()

for i in range(N):
    a = a*A[i]
        if a > 10**18 :
        print(-1)    
        sys.exit()

else : print(a)
Problem p02924 (python)

Fixed submission:
N = int(input())
print(N*(N-1)//2)

Buggy submission (verdict: Runtime Error):
N = int(input())
print(N*(N-1)//2))
Problem p02995 (python)

Fixed submission:
import fractions

A,B,C,D = (int(a) for a in input().split())

U = B - A  + 1
c = (B // C) + (-A // C) + 1
d = (B // D) + (-A // D) + 1
x = C * D // fractions.gcd(C , D)
e = (B // x) + (-A // x) + 1
print(U - c - d + e)

Buggy submission (verdict: Runtime Error):
import math

A,B,C,D = (int(a) for a in input().split())

U = B - A  + 1
c = (B // C) + (-A // C) + 1
d = (B // D) + (-A // D) + 1
x = C * D // math.gcd(C , D)
e = (B // x) + (-A // x) + 1
print(U - c - d + e)
Problem p03000 (python)

Fixed submission:
N , X = (int(a) for a in input().split())
L = list(map(int,input().split()))
Length = [0]
for i in range(N) :
    Length.append(Length[i] + L[i])
    if Length[i+1] > X :
        del Length[-1]
        break
    else : continue

print(len(Length))

Buggy submission (verdict: Runtime Error):
N , X = (int(a) for a in input().split())
L = list(map(int,input().split()))
length = 0
bound = 0
i = 0
while length <= X :
    length += L[i]
    bound += 1
    i += 1

print(bound)
Problem p02606 (python)

Fixed submission:
# coding: utf-8
# Your code h
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
    ans += i%d == 0
    
print(ans)

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!
import sys
import resource
sys.setrecursionlimit(10 ** 9)
#resource.setrlimit(resource.RLIMIT_STACK, (-1, -1))

mm = {}

def popcorn(n):
    n = bin(n)
    return n.count("1")

def f(n):
    n%=popcorn(n)
    return n
    
def nf(n,count):
    if(n == 0):
        return count
    elif(n in mm):
        count += mm[n]-1
        return count
    else:
        n%=popcorn(n)
        return nf(n,count+1)


n = int(input())
a = input()
moto = int(a,2)
for i in range(n-1,0-1,-1):
    if(a[n-1-i] == "0"):
        k=moto+2**i
    else:
        k=moto-2**i
    mo = f(k)
    if(mo in mm):
        print(mm[mo])
        continue
    else:
        count = nf(mo,1)
        print(count)
        mm[mo]=count
Problem p02639 (python)

Fixed submission:
l=input().split()
print(1+l.index("0"))

Buggy submission (verdict: Runtime Error):
l=list().split()
print(1+l.index("0"))

Buggy submission (verdict: Runtime Error):
l=list().split()
print(1+l.index("0"))
Problem p02755 (python)

Fixed submission:
#C消費税
h,j = map(int,input().split())
s=int(h*(25/2))
while True:
    hh=int(s*(2/25))
    jj=int(s/10)
    if(hh==h and jj==j):
        print(s)
        exit()
    if(hh>h and jj>j):
        print(-1)
        exit()
    s+=1

Buggy submission (verdict: Runtime Error):
#文字列
s=list(input())
n=int(input())
for i in range(n):
    li = input().split()
    if(li[0]=="1"):
        s.reverse()
    else:
        if(li[1]=="1"):
            s.insert(0, li[2])
        else:
            s.append(li[2])

print("".join(s))
Problem p02945 (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())
for i in range(2*a-1):
  print(b-a+1,end="")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input(),sprit())
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 p02946 (python)

Fixed submission:
a,b=map(int,input().split())
for i in range(2*a-1):
  print(b-a+1+i,end=" ")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input(),split())
for i in range(2*a-1):
  print(b-a+1+i,end=" ")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input(),split())
for i in range(2*a-1):
  print(b-a+1,end="")
Problem p02969 (python)

Fixed submission:
a=int(input());
print(3*a**2);

Buggy submission (verdict: Runtime Error):
n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        num_list[j]=0;
        print(max(num_list))
    else:
        print(m);

Buggy submission (verdict: Runtime Error):
n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        num_list[j]=0;
        print(max(num_list))
    print(m);

Buggy submission (verdict: Runtime Error):
n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        print(max(num_list))
    print(m);

Buggy submission (verdict: Runtime Error):
n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        print(m=max(num_list))
    print(m);
Problem p03145 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input())
print(a+b//2)
Problem p03210 (python)

Fixed submission:
x = input()
if x in "753":
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
x = input()
if x in 753:
  print("YES")
else:
  print("NO")
Problem p03377 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a<=x and x<=a+b:
  print("YES")
else:
  print("NO")
Problem p03385 (python)

Fixed submission:
s = input()
print("Yes" if len(set(s))==3 else "No")

Buggy submission (verdict: Runtime Error):
s = input
print("Yes" if len(set(s)) else "No")
Problem p03407 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input())
if a+b>c:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input())
print("Yes" a+b>=c else"No")

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
print("Yes" a+b>=c else "NO")
Problem p03415 (python)

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

Buggy submission (verdict: Runtime Error):
a = input()[0]
b = input()[1]
c = inpur()[2]
print(a+b+c)
Problem p03477 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())
print("Left" a+b>c+d else "Balanced"a+b==c+d else "Right")
Problem p03485 (python)

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

Buggy submission (verdict: Runtime Error):
a,b = int(input().split())
print(-(-a+b//2))
Problem p03543 (python)

Fixed submission:
a,b,c,d, = input()
print("Yes" if a==b==c or b==c==d else "No")

Buggy submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())
print("Yes" if a==b==c or b==c==d else "No")
Problem p03555 (python)

Fixed submission:
s = input()
t = input()
print("YES" if s==t[::-1] else "NO")

Buggy submission (verdict: Runtime Error):
s = input()
i = input()
print("YES" if s==t[::-1] else "NO")
Problem p03573 (python)

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

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

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

Fixed submission:
n = input()
print("Yes" if "9" in n else "No")

Buggy submission (verdict: Runtime Error):
n = int(input())
if n in "9":
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n = input()
if 9 in n:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n = int(input())
if '9' in n :
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
if '9' in n:
  print('Yes')
else:
  print('No')
Problem p03635 (python)

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

Buggy submission (verdict: Runtime Error):
n,m=int(input().split())
print((n-1)*(m-1))
Problem p03671 (python)

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

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

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

Buggy submission (verdict: Runtime Error):
a,b,c = sorted(map(in,input().split()))
print(a+b)
Problem p03719 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input())
if c>=a and c<=b:
  print("Yes")
else:
  print("No")
Problem p03738 (python)

Fixed submission:
a = int(input())
b = int(input())
if a>b:
  print("GREATER")
elif a<b:
  print("LESS")
else:
  print("EQUAL")

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a >b:
  print("GREATER")
elif a <b:
  print("LESS")
elif a==b:
  print("EQUAL")
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)

Buggy submission (verdict: Runtime Error):
import math
n = int(input())
print(math.factorial(n)%(10**9+7)