Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))
for j in range(len(A)):
    remove = A.pop(j)
    print(max(A))
    A.insert(j, remove)


Fixed submission:
N = int(input())
numbers = []
for i in range(N):
    numbers.append(int(input()))
ordered = sorted(numbers, reverse = True)

for j in range(len(numbers)):
    if numbers[j] == ordered[0]:
        print(ordered[1])
    else:
        print(ordered[0])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))
for j in range(len(A)):
    remove = A.pop(j)
    print(max(A))
    A.insert(j, remove)

Fixed submission:
N = int(input())
numbers = []
for i in range(N):
    numbers.append(int(input()))
ordered = sorted(numbers, reverse = True)

for j in range(len(numbers)):
    if numbers[j] == ordered[0]:
        print(ordered[1])
    else:
        print(ordered[0])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = []
removed = []
for i in range(N):
    A.append(int(input()))
for j in range(len(A)):
    remove = A.pop(j)
    print(max(A))
    A.insert(j,remove)

Fixed submission:
N = int(input())
numbers = []
for i in range(N):
    numbers.append(int(input()))
ordered = sorted(numbers, reverse = True)

for j in range(len(numbers)):
    if numbers[j] == ordered[0]:
        print(ordered[1])
    else:
        print(ordered[0])
Buggy python submission (verdict: Runtime Error):
n = list(input())
for i in range(len(n)):
  if n[i] == n[i+1]:
    print("Bad")
  else:
    print("Good")

Fixed submission:
password = list(input())
if password[0] == password[1] or password[1] == password[2] or password[2] == password[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
n = int(input())
new = set(n)
if len(new) != 4:
  print("Bad")
else:
  print("Good")

Fixed submission:
password = list(input())
if password[0] == password[1] or password[1] == password[2] or password[2] == password[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
password = list(input())
for i in range(len(password)):
  for j in range(i+1, len(password)):
    if password[i] == password[j]:
      print("Bad")
      exit(1)
print("Good")
 

Fixed submission:
password = list(input())
if password[0] == password[1] or password[1] == password[2] or password[2] == password[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
password = list(input())
pw = set(password)
if len(pw) != 4:
  print("Bad")
  break
print("Good")


Fixed submission:
password = list(input())
if password[0] == password[1] or password[1] == password[2] or password[2] == password[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
password = input().split()
pw = set(password)
if len(password) != len(pw):
  print("Bad")
  break
print("Good")


Fixed submission:
password = list(input())
if password[0] == password[1] or password[1] == password[2] or password[2] == password[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
password = set(input().split())
if len(password) != 4:
  print("Bad")
  break
print("Good")


Fixed submission:
password = list(input())
if password[0] == password[1] or password[1] == password[2] or password[2] == password[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
password = list(input())
for i in range(len(password)):
  for j in range(i+1, len(password)):
    if i != j and password[i] == password[j]:
      print("Bad")
      exit(1)
print("Good")


Fixed submission:
password = list(input())
if password[0] == password[1] or password[1] == password[2] or password[2] == password[3]:
  print("Bad")
else:
  print("Good")
Buggy python submission (verdict: Runtime Error):
num, t = map(int, input().split())
taste = []
findmin = []

sum= 0
for i in range(1,len(num)+1):
  taste.append(t+i-1)
  sum += t+i-1
for j in range(len(taste)):
  findmin.append(j*j)
m = findmin.index(min(findmin))
print(sum - taste[m])





Fixed submission:
num, t = map(int, input().split())
taste = []
findmin = []

sum= 0
for i in range(1,num + 1):
  taste.append(t+i-1)
  sum += t+i-1
for j in range(len(taste)):
  findmin.append(taste[j]*taste[j])
m = findmin.index(min(findmin))
print(sum - taste[m])

Buggy python submission (verdict: Runtime Error):
num, t = map(int, input().split())
taste = []
findmin = []

sum= 0
for i in range(len(num)):
  taste.append(t+i-1)
  sum += t+i-1
for j in range(len(taste)):
  findmin.append(j*j)
m = findmin.index(min(findmin))
print(sum - taste[m])





Fixed submission:
num, t = map(int, input().split())
taste = []
findmin = []

sum= 0
for i in range(1,num + 1):
  taste.append(t+i-1)
  sum += t+i-1
for j in range(len(taste)):
  findmin.append(taste[j]*taste[j])
m = findmin.index(min(findmin))
print(sum - taste[m])
Buggy python submission (verdict: Runtime Error):
N, limit = map(int, input().split())
bounce = int(input().split())
b = [0]
count = 0
for i in range(len(bounce)):
  b.append(b[i]+bounce[i])
  
for j in range(len(b)):
  if b[j] <= limit:
    count += 1
print(count)


Fixed submission:
N, limit = map(int, input().split())
bounce = input().split()
b = [0]
count = 0
for i in range(len(bounce)):
  b.append(b[i]+int(bounce[i]))
  
for j in range(len(b)):
  if b[j] <= limit:
    count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
N, limit = map(int, input().split())
bounce = input().split()
b = [0]
count = 0
for i in range(len(bounce)):
  b.append(b[i]+bounce[i])
  
for j in range(len(b)):
  if b[j] <= limit:
    count += 1
print(count)


Fixed submission:
N, limit = map(int, input().split())
bounce = input().split()
b = [0]
count = 0
for i in range(len(bounce)):
  b.append(b[i]+int(bounce[i]))
  
for j in range(len(b)):
  if b[j] <= limit:
    count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
N, limit = map(int, input().split())
bounce = input().split()
b = [0]
count = 0
for i in range(len(bounce)):
  b.append(bounce[i]+i)
  
for j in range(len(b)):
  if b[j] <= limit:
    count += 1
print(count)

Fixed submission:
N, limit = map(int, input().split())
bounce = input().split()
b = [0]
count = 0
for i in range(len(bounce)):
  b.append(b[i]+int(bounce[i]))
  
for j in range(len(b)):
  if b[j] <= limit:
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
remain  = []
S1 = 0
S2 = 0
string = list(map(int,input().split())
for T in range(1,N+1):
    for i in range(T):
        S1 += string[i]
    for j in range(T, len(string)):
        S2 += string[j]
    remain.append(abs(S1-S2))
    S1 = 0
    S2 = 0
print(min(remain))
              
          
        
              
      
        
        


Fixed submission:
N = int(input())
string = list(map(int,input().split()))
remain  = []
S1 = 0
S2 = 0

for T in range(1,N+1):
    for i in range(T):
        S1 += string[i]
    for j in range(T, len(string)):
        S2 += string[j]
    remain.append(abs(S1-S2))
    S1 = 0
    S2 = 0
print(min(remain))

Buggy python submission (verdict: Runtime Error):
N = input().split()
remain  = []
S1 = 0
S2 = 0
string = list(map(int,input().split())
for T in range(1,N+1):
    for i in range(T):
        S1 += string[i]
    for j in range(T, len(string)):
        S2 += string[j]
    remain.append(abs(S1-S2))
    S1 = 0
    S2 = 0
print(min(remain))
              
          
        
              
      
        
        


Fixed submission:
N = int(input())
string = list(map(int,input().split()))
remain  = []
S1 = 0
S2 = 0

for T in range(1,N+1):
    for i in range(T):
        S1 += string[i]
    for j in range(T, len(string)):
        S2 += string[j]
    remain.append(abs(S1-S2))
    S1 = 0
    S2 = 0
print(min(remain))

Buggy python submission (verdict: Runtime Error):
N = input().split()
remain  = []
S1 = 0
S2 = 0
string = list(map(int,input().split())
for T in range(1,N+1):
    for i in range(T):
        S1 += string[i]
    for j in range(T, len(string)):
        S2 += string[j]
    remain.append(abs(S1-S2))
print(min(remain))
              
          
        
              
      
        
        

Fixed submission:
N = int(input())
string = list(map(int,input().split()))
remain  = []
S1 = 0
S2 = 0

for T in range(1,N+1):
    for i in range(T):
        S1 += string[i]
    for j in range(T, len(string)):
        S2 += string[j]
    remain.append(abs(S1-S2))
    S1 = 0
    S2 = 0
print(min(remain))
Buggy python submission (verdict: Runtime Error):
length, index = map(int, input().split())
string = list(input())
string = replace(string[index],string[index].lower())
print(string.join())

Fixed submission:
N, change = map(int, input().split())
string = list(input())
string[change-1] = string[change-1].lower()
print(''.join(string))
Buggy python submission (verdict: Runtime Error):
N = int(input())
hotel = list(map(int, input().split()))
count = 0
for i in range(1, N):
  for j in range(0, i):
    if all(hotel[i] >= hotel[j]):
      count += 1
print(count+1)


Fixed submission:
N = int(input())
hotel = list(map(int, input().split()))
count = 0
c = 0
for i in range(1, N):
    c=0
    for j in range(0, i):
        
        if hotel[i] >= hotel[j]:
            c += 1
        if c == i:
            count += 1
print(count+1)

Buggy python submission (verdict: Runtime Error):
N = int(input())
hotel = list(map(int, input().split()))
count = 0
for i in range(1, N):
  for j in range(i):
    if all(hotel[i] >= hotel[j]):
      count += 1
print(count+1)


Fixed submission:
N = int(input())
hotel = list(map(int, input().split()))
count = 0
c = 0
for i in range(1, N):
    c=0
    for j in range(0, i):
        
        if hotel[i] >= hotel[j]:
            c += 1
        if c == i:
            count += 1
print(count+1)
Buggy python submission (verdict: Runtime Error):
a = map(int, input())
b = map(int, input())
c = map(int, input())
d = map(int, input())
e = map(int, input())
k = map(int, input())
if e - a =< k:
  print("Yay!")
else:
  print(":(")

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a <= k:
  print("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
v = input()
if v = "A":
  print("T")
elif v = "T":
  print("A")
elif v = "C":
  print("G")
elif v = "G":
  print("C")

Fixed submission:
v = input()
if v == "A":
  print("T")
elif v == "T":
  print("A")
elif v == "C":
  print("G")
elif v == "G":
  print("C")
Buggy python submission (verdict: Runtime Error):
count = 0
c = []
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    count += 1
  else:
    c.append(count)
    count = 0

print(max(c))

Fixed submission:
count = 0
MAX = 0
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    count += 1
    if MAX < count:
        MAX = count
  else:
    count = 0

print(MAX)

Buggy python submission (verdict: Runtime Error):
#HATAGAYA
count = 0
c = []
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    count += 1
  else:
    c.append(count)
    count = 0
print(max(c))

Fixed submission:
count = 0
MAX = 0
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    count += 1
    if MAX < count:
        MAX = count
  else:
    count = 0

print(MAX)

Buggy python submission (verdict: Runtime Error):
#HATAGAYA
words = ''
w = []
flag = []
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    flag.append('True')
  else:
    flag.append('False')

for j in range(len(S)):
  if flag[j] == 'True':
  	words += S[j]
  elif flag[j] == 'False':
    w.append(words)
    words = ''

print(len(max(w)))

Fixed submission:
count = 0
MAX = 0
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    count += 1
    if MAX < count:
        MAX = count
  else:
    count = 0

print(MAX)

Buggy python submission (verdict: Runtime Error):
words = ''
w = []
flag = []
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    flag.append('True')
  else:
    flag.append('False')

for j in range(len(S)):
  if flag[j] == 'True':
  	words += S[j]
  elif flag[j] == 'False':
    w.append(words)
    words = ''

print(len(max(w)))

Fixed submission:
count = 0
MAX = 0
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    count += 1
    if MAX < count:
        MAX = count
  else:
    count = 0

print(MAX)

Buggy python submission (verdict: Runtime Error):
words = ''
w = []
flag = []
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    flag.append('True')
  else:
    flag.append('False')
print(S)
print(flag)

for j in range(len(S)):
  if flag[j] == 'True':
  	words += S[j]
  elif flag[j] == 'False':
    w.append(words)
    words = ''

print(len(max(w)))

Fixed submission:
count = 0
MAX = 0
S = list(input())
for i in range(len(S)):
  if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
    count += 1
    if MAX < count:
        MAX = count
  else:
    count = 0

print(MAX)
Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input().split())
ans =[]
for i in range(1, min(A,B)+1):
    if A%i == 0 and B%i == 0:
        ans.append(i)
    
    if len(ans) == K:
        print(ans[len(ans)-1])
        exit(1)
    
      


Fixed submission:
A,B,K = map(int,input().split())
ans =[]
for i in range(1, min(A,B)+1):
    if A%i == 0 and B%i == 0:
        ans.append(i)
    

print(ans[-K])

Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input.split())
ans =[]
for i in range(1, min(A,B)+1):
  if A%i == 0 and B%i == 0:
    ans.append(i)
  if len(ans) == K:
    print(ans[len(ans)-1])
    exit(1)
    
      


Fixed submission:
A,B,K = map(int,input().split())
ans =[]
for i in range(1, min(A,B)+1):
    if A%i == 0 and B%i == 0:
        ans.append(i)
    

print(ans[-K])

Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input.split())
ans =[]
for i in range(1, min(A,B)+1):
  if A%i == 0 and B%i == 0:
    ans.append(i)
  if len(ans) == K:
    print(ans[len(ans)])
    exit(1)
    
      


Fixed submission:
A,B,K = map(int,input().split())
ans =[]
for i in range(1, min(A,B)+1):
    if A%i == 0 and B%i == 0:
        ans.append(i)
    

print(ans[-K])

Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input.split())
ans =[]
for i in range(1, min(A,B)+1):
  if A%i == 0 and B%i == 0:
    ans.append(i)
  if len(ans) == K:
    print(len(ans))
    exit(1)
    
      


Fixed submission:
A,B,K = map(int,input().split())
ans =[]
for i in range(1, min(A,B)+1):
    if A%i == 0 and B%i == 0:
        ans.append(i)
    

print(ans[-K])

Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input.split())
ans =[]
for i in range(1, min(A,B)):
  if A%i == 0 and B%i == 0:
    ans.append(i)
  if len(ans) == K:
    print(len(ans))
    exit(1)
    
      

Fixed submission:
A,B,K = map(int,input().split())
ans =[]
for i in range(1, min(A,B)+1):
    if A%i == 0 and B%i == 0:
        ans.append(i)
    

print(ans[-K])
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
erase = {}
for i in range(N):
    a = list(map(int, input().split()))
    
    if i == 0:
        food = a[1:]
    else:
        for j in range(len(food)): 
            if food[j] not in a[1:]:
                erase.add(food[j])
print(len(food)-len(erase))      


Fixed submission:
N, M = map(int, input().split())
erase = set()
for i in range(N):
    a = list(map(int, input().split())) 
    
    if i == 0:
        food = a[1:]
    for j in range(len(food)): 
        
        if food[j] not in a[1:]:
            erase.add(j)

print(len(food)-len(erase))

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
erase = {}
for i in range(N):
    a = list(map(int, input().split())) #a = [2,1,3] -> a = [3,1,2,3]
    
    if i == 0:
        food = a[1:] #food = [1] -> food = [1,3]
    else:
        for j in range(len(food)): 
            if food[j] not in a[1:]:
                erase.add(food[j])
print(len(food)-len(erase))      


Fixed submission:
N, M = map(int, input().split())
erase = set()
for i in range(N):
    a = list(map(int, input().split())) 
    
    if i == 0:
        food = a[1:]
    for j in range(len(food)): 
        
        if food[j] not in a[1:]:
            erase.add(j)

print(len(food)-len(erase))

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
erase = {}
for i in range(N):
    a = list(map(int, input().split())) #a = [2,1,3] -> a = [3,1,2,3]
    
    if i == 0:
        food = a[1:] #food = [1] -> food = [1,3]
    else:
        for j in range(len(food)): 
            if food[j] not in a[1:]:
                erase.add(j)
print(len(food)-len(erase))      


Fixed submission:
N, M = map(int, input().split())
erase = set()
for i in range(N):
    a = list(map(int, input().split())) 
    
    if i == 0:
        food = a[1:]
    for j in range(len(food)): 
        
        if food[j] not in a[1:]:
            erase.add(j)

print(len(food)-len(erase))
Buggy python submission (verdict: Runtime Error):
N = int(input())
edges = list(map(int, input().split()))
sum = 0
m = max(edges)
m.pop(edges.index(m))
for i in range(len(edges)):
  sum += edges[i]
if m < sum:
  print("Yes")
else:
  print("No")


Fixed submission:
N = int(input())
edges = list(map(int, input().split()))
sum = 0
m = max(edges)
edges.pop(edges.index(m))
for i in range(len(edges)):
  sum += edges[i]
if m < sum:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
edges = list(map(int, input().split()))
sum = 0
m = max(edges)
m.pop(m.index(m))
for i in range(len(edges)):
  sum += edges[i]
if m < sum:
  print("Yes")
else:
  print("No")

Fixed submission:
N = int(input())
edges = list(map(int, input().split()))
sum = 0
m = max(edges)
edges.pop(edges.index(m))
for i in range(len(edges)):
  sum += edges[i]
if m < sum:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
price = []
p = 0
for i in range(N):
  price.append(int(input())
m = price.index(max(price))
for j in range(len(price)):
  if j != m:
     p += price[j]
  else:
     p += price[j]//2
print(p)

Fixed submission:
N = int(input())
price = []
p = 0
for i in range(N):
  price.append(int(input()))
m = price.index(max(price))
for j in range(len(price)):
  if j != m:
     p += price[j]
  else:
     p += price[j]//2
print(p)
Buggy python submission (verdict: Runtime Error):
S = input().split()
words = []
remain = []
for i in range(len(S)-2):
  words.append(S[i] + S[i+1] + S[i+2])
for j in range(len(words)):
  remain.append(753 - int(words[j]))
ans = remain.index(min(remain))
print(words[ans])
  
  

Fixed submission:
S = list(input())
words = []
remain = []
for i in range(len(S)-2):
    words.append(S[i] + S[i+1] + S[i+2])
for j in range(len(words)):
    if int(words[j]) >= 753:
        remain.append(int(words[j]) - 753)
    else:
        remain.append(753 - int(words[j]))
ans = remain.index(min(remain))
print(remain[ans])
Buggy python submission (verdict: Runtime Error):
candidates = input()
T, A = map(int, input().split())
heights = int(input().split())
ans = []
for i in range(len(heights)):
  ans.append(A - (T - heights[i]*0.006))
answer = ans.index(min(ans))
print(answer + 1)


Fixed submission:
candidates = input()
T, A = map(int, input().split())
heights = input().split()
ans = []
for i in range(len(heights)):
    if T - int(heights[i])*0.006 >= A:
        ans.append((T - int(heights[i])*0.006) - A)
    else:
        ans.append(A - (T - int(heights[i])*0.006))
answer = ans.index(min(ans))
print(answer + 1)
Buggy python submission (verdict: Runtime Error):
N = int(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 = int(input())
  B = int(input())
  print(A+B)
Buggy python submission (verdict: Runtime Error):
N,T = map(int,input().split())
paths = []
for i in range(N):
  cost, time = map(int,input().split())
  if time < T:
    paths.append(cost)
print(min(paths))
    


Fixed submission:
N,T = map(int,input().split())
paths = []
for i in range(N):
  cost, time = map(int,input().split())
  if time <= T:
    paths.append(cost)
if len(paths) == 0:
  print("TLE")
else:
  print(min(paths))

Buggy python submission (verdict: Runtime Error):
N, T = map(int, input().split())
paths = []
for i in range(N):
	cost, time = map(int, input().split())
   	if time < T: 
	  	paths.append(cost)
print(min(paths))
    


Fixed submission:
N,T = map(int,input().split())
paths = []
for i in range(N):
  cost, time = map(int,input().split())
  if time <= T:
    paths.append(cost)
if len(paths) == 0:
  print("TLE")
else:
  print(min(paths))

Buggy python submission (verdict: Runtime Error):
N,T = map(int,input().split())
paths = []
for i in range(N):
	cost, time = map(int,input().split())
   	if time < T: 
	  	paths.append(cost)
print(min(paths))
    

Fixed submission:
N,T = map(int,input().split())
paths = []
for i in range(N):
  cost, time = map(int,input().split())
  if time <= T:
    paths.append(cost)
if len(paths) == 0:
  print("TLE")
else:
  print(min(paths))
Buggy python submission (verdict: Runtime Error):
N = int(input())
count1 = 0
for i in range(1,N+1):
  if i % 2 != 0:
  	count2 = 0  
    for j in range(1,i+1):
      if i % j == 0:
        count2 += 1
      if count2 == 8:
        count1 += 1
print(count1)
        
  

Fixed submission:
N = int(input())
count1 = 0
for i in range(1,N+1):
  if i % 2 != 0: #Odd Number
    count2 = 0  
    for j in range(1,i+1):
      if i % j == 0:
        count2 += 1
      if count2 == 8:
        count1 += 1
print(count1)
Buggy python submission (verdict: Runtime Error):
S = input()
count = 0
answer = "WA"

if S[0] == 'A' and S[2:-1].count('C') == 1:
    C = S.index('C')
    exception = [0]
    exception.append(C)

if len(exception) == 2:
    for j in range(len(S)):
        if j not in exception and S[j].islower():
            count += 1

if count == len(S)-2:
    answer = "AC"
    

print(answer)


Fixed submission:
N = int(input())
if N < 1200:
  print('ABC')
elif N < 2800:
  print('ARC')
else:
  print('AGC')
Buggy python submission (verdict: Runtime Error):
N = input()
nums = list(N)
count = 0
for i in nums:
  count += i

if int(N) % count == 0:
  print("Yes")
else:
  print("No")

Fixed submission:
N = input()
nums = list(N)
count = 0
for i in nums:
  count += int(i)

if int(N) % count == 0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
mi, ma, num = map(int,input().split())
ans = []
if num <= ma-mi+1
  for i in range(mi,mi+num):
    ans.append(i)
  for j in range(ma-num+1,ma+1):
    if j not in ans:
      ans.append(j)
  for k in ans:
    print(k)
else:
  for l in range(mi,ma+1):
    print(l)


Fixed submission:
mi, ma, num = map(int,input().split())
ans = []
if num <= ma-mi+1:
  for i in range(mi,mi+num):
    ans.append(i)
  for j in range(ma-num+1,ma+1):
    if j not in ans:
      ans.append(j)
  for k in ans:
    print(k)
else:
  for l in range(mi,ma+1):
    print(l)
Buggy python submission (verdict: Runtime Error):
fee = []
for i in range(4):
  fee.append(int(input()))
ans += mix(fee[0], fee[1])
ans += mix(fee[2], fee[3])
print(ans)

Fixed submission:
fee = []
ans = 0
for i in range(4):
  fee.append(int(input()))
ans += min(fee[0], fee[1])
ans += min(fee[2], fee[3])
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
if A+B == C:
  print("Yes")
else:
  prin("No")

Fixed submission:
A,B,C = map(int, input().split())
if A+B >= C:
  print("Yes")
else:
  print("No")