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

Fixed submission:
n=int(input())
cnt=0
for a in range(1,n):
    cnt+=(n-1)//a

print(cnt)

Buggy submission (verdict: Runtime Error):
import sympy
n = int(input())
cnt = 0
for i in range(1, n):
    cnt+=len(sympy.divisors(n-i))
print(cnt)
Problem p02573 (python)

Fixed submission:
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

n,m=map(int, input().split())
uf=UnionFind(n)
for _ in range(m):
    a,b=map(int, input().split())
    uf.union(a-1, b-1)
cnt=0
for i in range(n):
    cnt=max(cnt, uf.size(i))
print(cnt)

Buggy submission (verdict: Runtime Error):
from collections import Counter
n,m=map(int, input().split())
ans=1
l=[]
x=[-1]*n
for i in range(m):
    a,b=map(int, input().split())
    a-=1
    b-=1
    if x[a]+x[b]==-2:
        l.append(2)
        x[a]=len(l)-1
        x[b]=len(l)-1
    elif x[a]==x[b]:
        continue
    elif x[a]!=-1:
        l[x[b]]+=1
        x[a]=x[b]
    elif x[b]!=-1:
        l[x[a]]+=1
        x[b]=x[a]
    else:
        l[x[a]]+=l[x[b]]
        l[x[b]]=0
        for i in range(n):
            if x[i]==x[b]:
                x[i]=x[a]
print(max(l))

Buggy submission (verdict: Runtime Error):
from collections import Counter
import collections
n, m = map(int, input().split())
koseki = [-1 for _ in range(n)]  # -1
group = []
mouyatta = Counter()
for i in range(m):
    a, b = map(int, input().split())
    # if mouyatta[tuple(sorted([a,b]))]==0:
    # mouyatta[tuple(sorted([a,b]))]+=1
    if koseki[a-1] == koseki[b-1] and koseki[a-1] != -1:
        continue
    elif koseki[a-1] != -1:
        koseki[b-1] = koseki[a-1]
        group[koseki[a-1]] += 1
    elif koseki[b-1] != -1:
        koseki[a-1] = koseki[b-1]
        group[koseki[b-1]] += 1
    else:
        group.append(2)
        koseki[a-1] = len(group)-1
        koseki[b-1] = len(group)-1
# print(group)
print(max(group))
Problem p02658 (python)

Fixed submission:
n=int(input())
l=list(map(int, input().split()))
m=1
for i in range(n):
    m*=l[i]
    if m>10**18:
        if 0 in l:
            print(0)
            exit()
        print(-1)
        exit()

print(m)

Buggy submission (verdict: Runtime Error):
from decimal import Decimal
a,b=map(float, input().split())
print(int(Decimal(a)*Decimal(b)))

Buggy submission (verdict: Runtime Error):
A,B=map(float, input().split())
A=int(A*100)
B=int(B*100)
print(int(A*B)/10000)
Problem p02675 (python)

Fixed submission:
N=str(input())
M=int(N[len(N)-1])

h=[2,4,5,7,9]
p=[0,1,6,8]
if M in h:
    print('hon')
elif M in p:
    print('pon')
else:
    print('bon')

Buggy submission (verdict: Runtime Error):
K=int(input())
S=str(input())
if len(S)<=K:
    print(S)
else:
    print(S[:K]+'...')
Problem p02683 (python)

Fixed submission:
from math import inf
n, m, x = map(int, input().split())
ca = list()
for _ in range(n):
    ca.append(list(map(int, input().split())))

money = inf
tmp = 1
for i in range(n):
    tmp += 2**i
for i in range(tmp):
    B = str(format(i, str(n).zfill(n)+'b'))
    j = 0
    cnt = 0
    a = [0]*m
    for ch in B:
        if ch == '1':
            cnt += ca[j][0]
            for k in range(1, m+1):
                a[k-1] += ca[j][k]
        j += 1
    for ch in a:
        if ch < x:
            break
    else:
        money = min(cnt, money)
print(-1 if money == inf else money)

Buggy submission (verdict: Runtime Error):
from math import inf
n, m, x = map(int, input().split())
ca = list()
for _ in range(n):
    ca.append(list(map(int, input().split())))

money = inf
tmp = 1
for i in range(n):
    tmp += 2**i
for i in range(tmp):
    B = str(format(i, str(n).zfill(n)+'b'))
    j = 0
    cnt = 0
    a = [0]*m
    for ch in B:
        if ch == '1':
            cnt += ca[j][0]
            for k in range(1, m+1):
                a[k-1] += ca[j][k]
        j += 1
    if a[0] >= x and a[1] >= x and a[2] >= x:
        money = min(cnt, money)

print(-1 if money == inf else money)
Problem p02684 (python)

Fixed submission:
from collections import Counter
n, k = map(int, input().split())
A = list(map(int, input().split()))
C = Counter([])
X, Y = [], []
m = 0
for _ in range(n):
    a = A[m]-1
    C[m] += 1
    X.append(m)
    if C[a] != 0:
        Y = X[X.index(a):]
        X = X[:X.index(a)]
        break
    m = a
# print(X,Y)
x = len(X)
y = len(Y)
if k <= x-1:
    print(X[k]+1)
else:
    k -= x
    print(Y[k-(k//y)*y]+1)

Buggy submission (verdict: Runtime Error):
from collections import Counter
n, k = map(int, input().split())
A = list(map(int, input().split()))
C = Counter([])
X, Y = [], []
m = 0
for _ in range(n):
    a = A[m]-1
    C[m] += 1
    X.append(m)
    if C[a] != 0:
        Y = X[X.index(a):]
        X = X[:X.index(a)]
        break
    m = a
# print(X,Y)
x = len(X)
y = len(Y)
if k-1 <= x:
    print(X[k]+1)
else:
    k -= x
    print(Y[k-(k//y)*y]+1)

Buggy submission (verdict: Runtime Error):
from collections import Counter
n, k = map(int, input().split())
A = list(map(int, input().split()))
C = Counter([])
X, Y = [], []
m = 0
for _ in range(n):
    a = A[m]-1
    C[m] += 1
    X.append(m)
    if C[a] != 0:
        Y = X[X.index(a):]
        X = X[:X.index(a)]
        break
    m = a
# print(X,Y)
x=len(X)
y=len(Y)
if k <= x:
    print(X[k]+1)
else:
    k -= x
    print(Y[k-(k//y)*y]+1)

Buggy submission (verdict: Runtime Error):
N, K = map(int, input().split())
A = list(map(int, input().split()))
Kn = [0]*N
l = []
p = 0
i = 1
while True:
    Kn[p] = 1
    # print(p)
    if Kn[A[p]-1] == 1:
        break
    elif i == K:
        print(p+1)
    l.append(A[p])
    p = A[p]-1
    i += 1
if N % len(l) == 0:
    print(l[len(l)-1])
else:
    print(l[N % len(l)-1])
Problem p02706 (python)

Fixed submission:
n, m = map(int, input().split())
a = list(map(int, input().split()))
print(-1 if n-sum(a) < 0 else n-sum(a))

Buggy submission (verdict: Runtime Error):
import math
# i=int(input())
#n,m=map(int, input().split())
r = int(input())
print(r*2*math.pi)
Problem p02747 (python)

Fixed submission:
#N=int(input())
#N,M=map(int, input().split())
#L=list(map(int, input().split()))
S = str(input())
if len(S)%2==1:
  print('No')
  exit()
n = 0
while len(S) > n:
    if n % 2 == 1 and S[n] != 'i':
        print('No')
        exit()
    elif n % 2 == 0 and S[n] != 'h':
        print('No')
        exit()
    n += 1

print('Yes')

Buggy submission (verdict: Runtime Error):
S = str(input())
n = 0
m = 0
if S[n]!='h':
  while S[n]!='h':
    n+=1
    m+=1
while len(S) > n:
    if (n+m) % 2 == 1 and S[n] != 'i':
        print('No')
        exit()
    elif (n+m) % 2 == 0 and S[n] != 'h':
        print('No')
        exit()
    n += 1

print('Yes')

Buggy submission (verdict: Runtime Error):
S = str(input())
n = 0
m = 0
if S[n]!='h':
  while S[n]!='h':
    n+=1
    m+=1
while len(S) > n:
    if n+m % 2 == 1 and S[n] != 'i':
        print('No')
        exit()
    elif n+m % 2 == 0 and S[n] != 'h':
        print('No')
        exit()
    n += 1

print('Yes')
Problem p02765 (python)

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

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

Fixed submission:
N=int(input())
A=list(map(int, input().split()))
for i in range(N):
  if A[i]%2==0:
    if A[i]%3!=0 and A[i]%5!=0:
      print('DENIED')
      exit()

print('APPROVED')

Buggy submission (verdict: Runtime Error):
N=int(input())
A=map(int, input().split())
for i in range(N):
  if A[i]%2==0:
    if A[i]%3==0 or A[i]%5==0:
      print('APPROVED')
      exit()

print('DENIED')
Problem p02811 (python)

Fixed submission:
K,X=map(int, input().split())
print('Yes' if 500*K>=X else 'No')

Buggy submission (verdict: Runtime Error):
K,X=map(int, input().split())
print('Yes' if 500*K>=X else 'No')

Buggy submission (verdict: Runtime Error):
K,X=map(int, input().split())
print('Yes' if 500*K>=X else 'No')
Problem p02945 (python)

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

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

Fixed submission:
N=int(input())
L=[]
for _ in range(N):
  L.append(int(input()))
sL=sorted(L)
sL.reverse()
m=max(L)
m2=sL[1]

for i in range(N):
  if L[i]==m:
    print(m2)
  else:
    print(m)

Buggy submission (verdict: Runtime Error):
N=int(input())
L=[]
T=[]
for _ in range(N):
  x=int(input())
  L.append(x)
  if x not in T:
    T.append(x)

T.sort()
if not L.count(T[len(T)-1])<N//3
  T.reverse()

for i in range(N):
  for j in range(len(T)):
    if T[j]!=L[i]:
      print(T[j])
      break
    elif len(T)==1:
      print(T[j])

Buggy submission (verdict: Runtime Error):
N=int(input())
L=[]
T=[]
for _ in range(N):
  x=int(input())
  L.append(x)
  if x not in T:
    T.append(x)

T.sort()
if not L.count(T[len(T)-1])<N//75:
  T.reverse()

for i in range(N):
  for j in range(len(T)):
    elif T[j]!=L[i]:
      print(T[j])
      break
    elif len(T)==1:
      print(T[j])

Buggy submission (verdict: Runtime Error):
N=int(input())
L=[]
T=[]
for _ in range(N):
  x=int(input())
  L.append(x)
  if x not in T:
    T.append(x)

T.sort()
if not L.count(T[len(T)-1])!<N//75:
  T.reverse()

for i in range(N):
  for j in range(len(T)):
    elif T[j]!=L[i]:
      print(T[j])
      break
    elif len(T)==1:
      print(T[j])

Buggy submission (verdict: Runtime Error):
N=int(input())
L=[]
T=[]
for _ in range(N):
  x=int(input())
  L.append(x)
  if x not in T:
    T.append(x)

T.sort()
if not L.count(T[len(T)-1])!<N//75:
  T.reverse()

for i in range(N):
  for j in range(len(T)):
    elif T[j]!=L[i]:
      print(T[j])
      break
    elif len(T)==1:
      print(T[j])
Problem p02983 (python)

Fixed submission:
L, R = map(int, input().split())
if R-L >= 2018:
    print(0)
else:
    ans = 2019
    for i in range(L, R):
        for j in range(i + 1, R + 1):
            ans = min(ans, i*j % 2019)
    
    print(ans)

Buggy submission (verdict: Runtime Error):
L,R=map(int, input().split())
if R//2019-L//2019>0:
  print(((2019//L*2019)*((2019//L*2019)+1))%2019)
else:
  print((L*(L+1))%2019)
Problem p03059 (python)

Fixed submission:
A,B,T=(map(float, input().split())) 
print(int((T+0.5)//A*B))

Buggy submission (verdict: Runtime Error):
A,B,T=map(int, float(input()))
print(int((T+0.5)//A*B))

Buggy submission (verdict: Runtime Error):
A,B,T=map(int, float(input()))
print((T+0.5)//A*B)
Problem p03068 (python)

Fixed submission:
N=int(input())
S=str(input())
K=int(input())
W=S[K-1]
for i in range(N):
  if S[i]!=W:
    S=S.replace(S[i],'*')
print(S)

Buggy submission (verdict: Runtime Error):
N=input()
S=input()
K=int(input())
W=S[K-1]
for i in range(N):
  if S[i]!=W:
    S=S.replace(S[i],'*')
print(S)

Buggy submission (verdict: Runtime Error):
N=input()
S=input()
K=int(input())
W=S[K-1]
for i in range(N):
  print(i)
  if S[i]!=W:
    S=S.replace(S[i],'*')
print(S)
Problem p03076 (python)

Fixed submission:
import math
a=int(input());b=int(input());c=int(input());d=int(input());e=int(input())

N=math.ceil(a/10)*10+math.ceil(b/10)*10+math.ceil(c/10)*10+math.ceil(d/10)*10+math.ceil(e/10)*10
X=[a%10,b%10,c%10,d%10,e%10]
n=0
while(n!=5):
  if X[n]==0:
    X[n]=10
  n+=1

else:
  print(N-(10-min(X)))

Buggy submission (verdict: Runtime Error):
import math
a=int(input());b=int(input());c=int(input());d=int(input());e=int(input())

N=math.ceil(a/10)*10+math.ceil(b/10)*10+math.ceil(c/10)*10+math.ceil(d/10)*10+math.ceil(e/10)*10
X=[a%10,b%10,c%10,d%10,e%10]
X.remove([i for i, x in enumerate(X) if x == 0])
if a==b==c==d==e:
  print(N-min(X))
else:
  print(N-(10-min(X)))

Buggy submission (verdict: Runtime Error):
a,b,c,d,e=int(input())
print(a)

Buggy submission (verdict: Runtime Error):
a,b,c,d,e=int(input())
Problem p03086 (python)

Fixed submission:
s=input()
i=1
n=0
ans=[0]
sta=0

 
while i<=len(s):
  if s[i-1]=='A'or s[i-1]=='C' or s[i-1]=='G' or s[i-1]=='T':
    n=n+1
    sta=1
  elif sta==1:
    ans.append(n)
    n=0

  if i<=len(s)&n==len(s):
    ans.append(n)
  elif n!=0:
      ans.append(n)
    
  i=i+1
  
print(max(ans))

Buggy submission (verdict: Runtime Error):
s=input()
i=1
n=0
ans=[]
sta=0
 
while i<=len(s):
  if s[i-1]=='A'or s[i-1]=='C' or s[i-1]=='G' or s[i-1]=='T':
    n=n+1
    sta=1
  elif sta==1:
    ans.append(n)
    n=0
    
  i=i+1
if sta==0:
  ans=[0]
  
print(max(ans))

Buggy submission (verdict: Runtime Error):
s=input()
i=1
n=0
ans=[]
sta=0
 
while i<=len(s):
  if s[i-1]=='A'or s[i-1]=='T' or s[i-1]=='C' or s[i-1]=='G':
    n=n+1
    sta=1
  elif sta==1:
    ans.append(n)
    n=0
    
  i=i+1
if sta==0:
  ans=[0]
  
print(max(ans))

Buggy submission (verdict: Runtime Error):
i=1
n=0
ans=[]
sta=0
 
while i<=len(s):
  if s[i-1]=='A'or s[i-1]=='C' or s[i-1]=='G' or s[i-1]=='T':
    n=n+1
    sta=1
  elif sta==1:
    ans.append(n)
    n=0
    
  i=i+1
if sta==0:
  ans=[0]
  
print(max(ans))

Buggy submission (verdict: Runtime Error):
s=input()
i=1
n=0
ans=[]
sta=0
 
while i<=len(s):
  if s[i-1]=='A'or s[i-1]=='T' or s[i-1]=='C' or s[i-1]=='G':
    n=n+1
    sta=1
  elif sta==1:
    ans.append(n)
    n=0
    
  i=i+1
if sta==0:
  ans=[0]
  
print(max(ans))

Buggy submission (verdict: Runtime Error):
s=input()
i=1
ans=''
 
while i<=len(s):
  if s[i-1]=='A'|s[i-1]=='C'|s[i-1]=='G'|s[i-1]=='T':
    ans=ans+s[i-1]
  i=i+1
 
print (len(ans))

Buggy submission (verdict: Runtime Error):
s=input()
i=1
ans=''
 
while i<=len(s):
  if s[i-1]=='A'|s[i-1]=='C'|s[i-1]=='G'|s[i-1]=='T':
    ans=ans+s[i-1]
  i+=1
 
print (len(ans))

Buggy submission (verdict: Runtime Error):
s=input()
i=1
ans=''

while i<=len(s):
  if s[i-1]=='A'|s[i-1]=='C'|s[i-1]=='G'|s[i-1]=='T':
    i=i+ans
  i+=1

print (len(ans))
Problem p03101 (python)

Fixed submission:
H,W=input().split()
h,w=input().split()

x=int(H)-int(h)
y=int(W)-int(w)
print(x*y)

Buggy submission (verdict: Runtime Error):
print((H-h)*(W-w))
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 n in range(N)]

def Sof(a):
  d=C
  for m in range(M):
    d+=a[m]*B[m]
  return d > 0

co=0
for i in range(N):
  if(Sof(A[i])):
    co+=1

print(co)

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 n in range(N)]

def Sof(a):
  d=C
  for m in range(M):
    d+=a[m]*b[m]
  return d > 0

co=0
for i in range(N):
  if(Sof(A[i])):
    co+=1

print(co)
Problem p03110 (python)

Fixed submission:
N=int(input())
ans=0

for i in range(N):
  x,u=input().split()
  if u=='BTC':
    ans+=float(x)*380000
  else:
    ans+=int(x)

print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
ans=0

for i in range(N):
  x,u=input().split()
  if u=='BTC':
    ans+=x*380000
  else:
    ans+=x

print(ans)
Problem p03125 (python)

Fixed submission:
a,b=map(int, input().split())
if b%a==0:
  print(a+b)
else:
  print(b-a)

Buggy submission (verdict: Runtime Error):
a,b=input()
if b%a==0:
  print(a+b)
else:
  print(b-a)

Buggy submission (verdict: Runtime Error):
a,b=input().split()
if b%a==0:
  print(a+b)
else:
  print(b-a)
Problem p03126 (python)

Fixed submission:
N,M = map(int,input().split())
list_a = [0]*M
for i in range(N):
    k = input().split()
    for K in range(1,int(k[0])+1):
        list_a[int(k[K])-1] += 1
 
print(list_a.count(N))

Buggy submission (verdict: Runtime Error):
N,M=map(int, input().split())
List=[0]*M

for i in range(N):
  K=input().split()
  for k in range(K):
    List[int(k[K])-1]+=1
    
print(List.count(N))
Problem p03211 (python)

Fixed submission:
S=str(input())
a=99999
for i in range(len(S)-2):
  a=min(abs(753-int(S[i]+S[i+1]+S[i+2])),a)
  
print(a)

Buggy submission (verdict: Runtime Error):
S=str(input())
for i in range(len(S)-3):
  a=max(int(S[i]+S[i+1]+S[i+2]),a)
  
print(abs(753-a))
Problem p03238 (python)

Fixed submission:
N=int(input())
if N==1:
  print('Hello World')
else:
  A=int(input())
  B=int(input())
  print(A+B)

Buggy submission (verdict: Runtime Error):
N=int(input())
if N=1:
  print('Hello World')
else:
  A=int(input())
  B=int(input())
  print(A+B)
Problem p03262 (python)

Fixed submission:
from fractions import gcd
from functools import reduce

def gcd_list(numbers):
    return reduce(gcd, numbers)

N, X=map(int, input().split())
x=list(map(int, input().split()))
y=list()

for i in x:
    y.append(abs(X-i))

#print(y)
print(gcd_list(y))

Buggy submission (verdict: Runtime Error):
from math import gcd
from functools import reduce

def gcd_list(numbers):
    return reduce(gcd, numbers)

N, X=map(int, input().split())
x=list(map(int, input().split()))
y=list()

for i in x:
    y.append(abs(X-i))

#print(y)
print(gcd_list(y))
Problem p03284 (python)

Fixed submission:
N,K=map(int,input().split())
print(0 if N%K==0 else 1)

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
print(K*bool(N%K!==0)-N%K)
Problem p03292 (python)

Fixed submission:
L=list(map(int, input().split()))
X=sorted([abs(L[2]-L[0]),abs(L[0]-L[1]),abs(L[1]-L[2])])
print(X[0]+X[1])

Buggy submission (verdict: Runtime Error):
L=list(map(int, input().split()))
X=sorted([abs(L[3]-L[1]),abs(L[1]-L[2]),abs(L[2]-L[3])])
print(X[0]+X[1])
Problem p03351 (python)

Fixed submission:
a,b,c,d=map(int, input().split())
if abs(a-c)<=d:
  print('Yes')
elif abs(a-b)<=d and abs(b-c)<=d:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a,b,c,d=input().split()
if abs(a-c)<=d:
  print('Yes')
elif abs(a-b)<=d and abs(b-c)<=d:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a,b,c,d=input().split()
if abs(a-b)<=d and abs(b-c)<=d:
  print('Yes')
else:
  print('No')
Problem p03447 (python)

Fixed submission:
X=int(input());A=int(input());B=int(input())
print(X-A-B*((X-A)//B))

Buggy submission (verdict: Runtime Error):
X=input();A=input();B=input()
print(X-A-(X-A)//B)
Problem p03470 (python)

Fixed submission:
N=int(input())
S=set()
for i in range(N):
  S.add(int(input()))
  
print(len(S))

Buggy submission (verdict: Runtime Error):
N=int(input())
S={}
for i in range(N):
  S.add(int(input()))
  
print(len(S))
Problem p03485 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int, input().split())
print(math.ceil((a+B)/2))
Problem p03597 (python)

Fixed submission:
N=int(input());A=int(input())
print(N*N-A)

Buggy submission (verdict: Runtime Error):
N=input();A=input()
print(N*N-A)
Problem p03719 (python)

Fixed submission:
A,B,C=map(int,input().split())
if A<=C and C<=B:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
A,B,C=int(input().split())
if A<=C and B>C:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
A,B,C=int(input().split())
if A=<C and B=>C:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
A,B,C=int(input().split())
if A=<C and B=>C:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
A,B,C=int(input().split())
if A<=C and B>=C:
  print('YES')
else:
  print('NO')
Problem p03777 (python)

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

if b=='H':
  if a=='H':
    print('H')
  else:
    print('D')
else:
  if a=='H':
    print('D')
  else:
    print('H')

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

if b=='H':
  if a=='H':
    print('H')
  else:
    print('D')
else:
  if a=='H':
    print('D')
  else:
    print('H')

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

if b=='H':
  if a=='H':
    print('H')
  else:
    print('D')
else:
  if a=='H':
    print('D')
  else:
    print('H')

Buggy submission (verdict: Runtime Error):
a,b=map(int, input().split())
if d=='H':
  if a=='H':
    print('H')
  else:
    print('D')
else:
  if a=='H':
    print('D')
  else:
    print('H')
Problem p03795 (python)

Fixed submission:
x=int(input())*800
print(x-x//12000*200)

Buggy submission (verdict: Runtime Error):
print(input()-(input()//15)*200)

Buggy submission (verdict: Runtime Error):
print(input()-input()//15*200)
Problem p03813 (python)

Fixed submission:
if int(input())<1200:
  print('ABC')
else:
  print('ARC')

Buggy submission (verdict: Runtime Error):
if input()<=1200:
  print('ABC')
else:
  print('ARC')
Problem p03826 (python)

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

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(str, input().split())
if a*b>=c*d:
  print(a*b)
else:
  print(c*d)

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(str, input().split())
print(a*b*int(a*b>=c*d)+c*d*int(a*b<c*d))
Problem p03844 (python)

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

if b=='+':
  print(int(a)+int(c))
else:
  print(int(a)-int(c))

Buggy submission (verdict: Runtime Error):
a=int(input());b=str(input());c=int(input())

if b=='+':
  print(a+c)
else:
  print(a-c)

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

if b=='+':
  print(a+c)
else:
  print(a-c)

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

if b=='+':
  print(a+c)
else:
  print(a-c)

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

if c=='+':
  print(a+c)
else:
  print(a-c)
Problem p03957 (python)

Fixed submission:
s=str(input())
count=0
for i in range(len(s)):
  if count==0 and s[i]=='C':
    count+=1
  elif count==1 and s[i]=='F':
    count+=1
    print('Yes');exit()
    
print('No')

Buggy submission (verdict: Runtime Error):
s=str(input())
count=0
for i in range(len(s)):
  if count==0 and s[i]==C:
    count+=1
  elif count==1 and s[i]==F:
    count+=1
    print('Yes');exit()
    
print('No')
Problem p03997 (python)

Fixed submission:
a=int(input());b=int(input());h=int(input())

print((a+b)*h//2)

Buggy submission (verdict: Runtime Error):
a=input();b=input();h=input()

print((a+b)*h//2)

Buggy submission (verdict: Runtime Error):
a=input();b=input();h=input()

print((a+b)/2*h)
Problem p04029 (python)

Fixed submission:
N=int(input())
ans=0
for i in range(N):
  ans+=i+1
print(ans)

Buggy submission (verdict: Runtime Error):
N=input()
ans=0
for i in range(N):
  ans+=N
print(ans)
Problem p04043 (python)

Fixed submission:
a,b,c=map(int,input().split())
if a==5 and b==7 and c==5:
  print('YES')
elif a==5 and b==5 and c==7:
  print('YES')
elif a==7 and b==5 and c==5:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a==5 and b==7 and c==5:
  print(YES)
elif a==5 and b==5 and c==7:
  print(YES)
elif a==7 and b==5 and c==5:
  print(YES)
else:
  print(NO)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a==5 and b==7 and c==5&:
  print(YES)
elif a==5 and b==5 and c==7&:
  print(YES)
elif a==7 and b==5 and c==5&:
  print(YES)
else:
  print(NO)