Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
from math import ceil

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

A, B = [], []
for _ in range(N):
    a, b = map(int, input().split())
    A.append(a), B.append(b)
B = sorted(list(filter(lambda x: x > max(A), B)))

count = 0
while H > 0:
    if B:
        H -= B.pop()
    else:
        count += ceil(H / max(A))
        break
    count += 1
print(count)

Fixed submission:
from math import ceil

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

A, B = [], []
for _ in range(N):
    a, b = map(int, input().split())
    A.append(a), B.append(b)
max_a = max(A)
B = sorted(list(filter(lambda x: x > max_a, B)))

count = 0
while H > 0:
    if B:
        H -= B.pop()
    else:
        count += ceil(H / max_a)
        break
    count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = sorted(list(map(int, input().split())))
ans = 0
for a in A[::-1]:
    if A.count(a) != a:
        A.remove(a)
        ans += 1
print(ans)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = set(A)

result = {}
for b in B:
    result[b] = 0
for a in A:
    result[a] += 1

count = N
for b in B:
    if result[b] >= b:
        count -= b

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = []
for _ in range(N):
    a = int(input())
    if a not in ans:
        ans.append(a)
    else:
        ans.remove(a)
print(len(ans))

Fixed submission:
N = int(input())
ans = {}
for _ in range(N):
    a = int(input())
    if a in ans:
        ans[a] = 1 - ans[a]
    else:
        ans[a] = 1
print(sum(ans.values()))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = input().split()
B = []
for a in A:
    B.append(a)
    B.reverse()
print(' '.join(B))

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

if n % 2 != 0:
    r, l = a[1::2], a[::2]
else:
    r, l = a[::2], a[1::2]

l.reverse()
print(' '.join(l + r))
Buggy python submission (verdict: Time Limit Exceeded):
def count_digits(n):
    count = 0
    while n > 0:
        n //= 10
        count += 1
    return count

N = int(input())
digits = count_digits(N)

for A in range(1, N+1):
    if N % A != 0:
        continue
    B = N // A
    maximum = max(count_digits(A), count_digits(B))
    digits = min(maximum, digits)

print(digits)


Fixed submission:
N = int(input())
numbers = []
for i in range(1, int(N**0.5)+1):
    if N % i == 0:
        digits = max(len(str(i)), len(str(N//i)))
        numbers.append(digits)
print(min(numbers))
Buggy python submission (verdict: Time Limit Exceeded):
a, b, x = map(int, input().split())
cnt = 0
for i in range(a, b+1):
    if i % x == 0:
        cnt += 1
print(cnt)

Fixed submission:
a, b, x = map(int, input().split())
A = (a-1) // x
B = b // x
print(B - A)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()

def shifter(n, char):
    if ((ord(char) + n) > ord('Z')):
        n = n - 26
    
    return chr(ord(char) + n)

shifted_s = ''.join([shifter(n, char) for char in list(s)])

print(shifted_s)

Fixed submission:
S = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
day = input()
#print day till next sunday
print(len(S) - S.index(day))
Buggy python submission (verdict: Runtime Error):
n = [i for i in input().split()]
a = n[0]
b = n[1]
if a < 10:
  b += (10-a)*100
print(b)

Fixed submission:
n = [int(i) for i in input().split()]
a = n[0]
b = n[1]
if a < 10:
  b += (10-a)*100
print(b)

Buggy python submission (verdict: Runtime Error):
n = [i for i in input().split()]
a = n[1]
b = n[2]
if a < 10:
  b += (10-a)*100
print(b)

Fixed submission:
n = [int(i) for i in input().split()]
a = n[0]
b = n[1]
if a < 10:
  b += (10-a)*100
print(b)

Buggy python submission (verdict: Runtime Error):
n = [i for i in input().split()]
a = n[1]
b = n[2]
if a <10:
  b += (10-a)*100
print(b)

Fixed submission:
n = [int(i) for i in input().split()]
a = n[0]
b = n[1]
if a < 10:
  b += (10-a)*100
print(b)
Buggy python submission (verdict: Runtime Error):
N = int(input())
words = []
for _ in range(N):
    words.append(input())
count_table = {}
for w in words:
    if w in count_table:
        count_table[w] += 1
    else:
        count_table[w] = 0
best_count = 0
for w in count_table:
    if best_count < count_table[w]:
        best_count = count_table[w]
        best_words = [w]
    elif best_count == count_table[w]:
        best_words.append(w)
for w in sorted(best_words):
    print(w)

Fixed submission:
N = int(input())
words = []
for _ in range(N):
    words.append(input())
count_table = {}
for w in words:
    if w in count_table:
        count_table[w] += 1
    else:
        count_table[w] = 0
best_count = 0
best_words = []
for w in count_table:
    if best_count < count_table[w]:
        best_count = count_table[w]
        best_words = [w]
    elif best_count == count_table[w]:
        best_words.append(w)
for w in sorted(best_words):
    print(w)
Buggy python submission (verdict: Runtime Error):
a, b = [int(x) for x in input().split()]
if a <= b:
  return str(a) * b
else:
  return str(b) * a

Fixed submission:
a, b = [int(x) for x in input().split()]
if a <= b:
  print(str(a) * b)
else:
  print(str(b) * a)
Buggy python submission (verdict: Runtime Error):
ny = input()
n, y = [int(x) for x in ny.split(" ")]
min_y_1000 = y % 5000
min_n_1000 = math.floor(min_y_1000 / 1000)
match = [-1,-1,-1]
if y % 1000 == 0:
    for n_1000 in range(min_n_1000,max_n_1000 + 1, 5):
        y_2 = y - 1000 * n_1000
        n_2 = n - n_1000
        n_10000_n_5000_comb = calc_10000_5000_comb(n_2,y_2)
        if n_10000_n_5000_comb:
            match = n_10000_n_5000_comb + [n_1000]
            break
print(" ".join(map(str,match)))

Fixed submission:
import math
def calc_10000_5000_comb(n2,y2):
    max_10000 = min(math.floor(y2 / 10000), n2)
    for n_10000 in range(max_10000 + 1)[::-1]:
        y5000 = y2 - 10000 * n_10000
        n_5000 = math.floor(y5000 / 5000)
        if n_5000 + n_10000 == n2:
            return [n_10000, n_5000]
        if n2 < n_5000 + n_10000:
            break
    return []
ny = input()
n, y = [int(x) for x in ny.split(" ")]
min_y_1000 = y % 5000
min_n_1000 = math.floor(min_y_1000 / 1000)
max_n_1000 = n
match = [-1,-1,-1]
if y % 1000 == 0:
    for n_1000 in range(min_n_1000,max_n_1000 + 1, 5):
        y_2 = y - 1000 * n_1000
        n_2 = n - n_1000
        n_10000_n_5000_comb = calc_10000_5000_comb(n_2,y_2)
        if n_10000_n_5000_comb:
            match = n_10000_n_5000_comb + [n_1000]
            break
print(" ".join(map(str,match)))
Buggy python submission (verdict: Runtime Error):
a, b, k = int(input().split())

if a <= k:
  if b -(k - a) <=0:
    print('0 0')
  else:
    s = 0
    t = b - (k - a)
    print('{} {}'.format(s, t))
else:
  s = a - k
  t = b
  print('{} {}'.format(s, t))


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

if a <= k:
  if b -(k - a) <=0:
    print('0 0')
  else:
    s = 0
    t = b - (k - a)
    print('{} {}'.format(s, t))
else:
  s = a - k
  t = b
  print('{} {}'.format(s, t))
Buggy python submission (verdict: Runtime Error):
choice = [1, 2, 3]
a = input()
b = input()
choice.remove(a)
choice.remove(b)
print(choice)

Fixed submission:
c = ['1', '2', '3']
a = input()
b = input()
c.remove(a)
c.remove(b)
print(c[0])
Buggy python submission (verdict: Runtime Error):
import math

a, b = map(int, input().split())
def lcm(s, t):
    ans = s * t // (math.gcd(s, t))
    return ans
print(lcm(a, b))

Fixed submission:

a, b = map(int, input().split())
def gcd(l, m):
    x = min(l, m)
    y = max(l, m)
    if y % x == 0:
        return x
    else:
        while y % x != 0:
            z = y % x
            y = x
            x = z
        else:
            return z

def lcm(s, t):
    ans = s * t // (gcd(s, t))
    return ans

print(lcm(a, b))

Buggy python submission (verdict: Runtime Error):
import math

a, b = map(int, input().split())
#print(a)print(type(a))print(b)print(type(b))
def lcm(s, t):
    ans = s * t // (math.gcd(s, t))
    return ans
print(lcm(a, b))

Fixed submission:

a, b = map(int, input().split())
def gcd(l, m):
    x = min(l, m)
    y = max(l, m)
    if y % x == 0:
        return x
    else:
        while y % x != 0:
            z = y % x
            y = x
            x = z
        else:
            return z

def lcm(s, t):
    ans = s * t // (gcd(s, t))
    return ans

print(lcm(a, b))
Buggy python submission (verdict: Runtime Error):
N = int(input())
Hs = input().split()
A = []
for k in range(N): # 0, 1, 2, 3, 4
  c = 0
  for i in range(k, N - 1): # 0~3, 1~3, ... 
    if int(Hs[i]) < int(Hs[i+1]):
      A.append(c)
      break
    elif int(Hs[i]) >= int(Hs[i+1]):
      c += 1
    if i == N - 2:
      A.append(c)
      break
  if i == N - 2:
    break
      
print(max(A))

Fixed submission:
N = int(input())
Hs = input().split()
A = []
b = 0
b_h = 0
for i in range(N-1):
  if int(Hs[i]) < int(Hs[i+1]):
    b = i
    A.append(b-b_h)
    b_h = b+1

if len(A) != N-1:
  b = i + 1
  A.append(b-b_h)
  print(max(A))
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
a = input()
s = input()

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


Fixed submission:
a = input()
s = input()

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

Buggy python submission (verdict: Runtime Error):
a = input()
s = input()

if int(a)=>3200:
    print(s)
else:
    print("red")
~                

Fixed submission:
a = input()
s = input()

if int(a)>=3200:
    print(s)
else:
    print("red")
Buggy python submission (verdict: Runtime Error):
N = int(input())
Vs = input().split()

if N == 2:
    print(sum([int(x) for x in Vs])/N)
else:
    lists = [int(x) for x in Vs]
    while N > 1:
        lists.sort()
        x = lists.pop(0) + lists.pop(0)) / 2
        lists.insert(0, x)
        N -= 1

    print(lists[0])

Fixed submission:
N = int(input())
Vs = input().split()

if N == 2:
    print(sum([int(x) for x in Vs])/N)
else:
    lists = [int(x) for x in Vs]
    while N > 1:
        lists.sort()
        x = (lists.pop(0) + lists.pop(0)) / 2
        lists.insert(0, x)
        N -= 1

    print(lists[0])
Buggy python submission (verdict: Runtime Error):
ABC = input().split()
A = ABC[0]
B = ABC[1]
C = ABC[2]
if A / B > C:
  print(C)
else:
  print(A / B)

Fixed submission:
ABC = input().split()
A = int(ABC[0])
B = int(ABC[1])
C = int(ABC[2])
if B / A > C:
  print(C)
else:
  print(int(B / A))
Buggy python submission (verdict: Runtime Error):
A = input()
if A 　== "A":
  print("T")
elif A == "T"
  print("A")
elif A == "C"
  print("G")
elif A == "G"
  print("C")

Fixed submission:
A = input()
if A == "A":
  print("T")
elif A == "T":
  print("A")
elif A == "C":
  print("G")
elif A == "G":
  print("C")
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
L = list(map(int, input().split()))
XOR = 0
result = []
for i in range(K+1):
  for LINT in L:
     XOR += i ^ LINT
  result.append(XOR)
print(max(result))

Fixed submission:
T, X = map(int, input().split())
print(T/X)

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


Fixed submission:
T, X = map(int, input().split())
print(T/X)

Buggy python submission (verdict: Runtime Error):
n = int(input())
L = list(map(int, input().split()))
nagai = max(L)


Fixed submission:
T, X = map(int, input().split())
print(T/X)
Buggy python submission (verdict: Runtime Error):
n = int(input())
L = list(map(int, input().split()))
nagai = max(L)
if nagai > sum(L)
   print('Yes')
 else
   print('No')

Fixed submission:
n = int(input())
L = list(map(int, input().split()))
nagai = int(max(L))
wa = int(sum(L))
if nagai < wa - nagai:
   print('Yes')
else:
   print('No')
Buggy python submission (verdict: Runtime Error):
n=int(input())
L={}
c=0
for i in range (n):
    s=input()
    if s in L:
        L[s]+=1
    else:
        L.update({s:1})
        c+=1
M=list(L.values())
C=list(L.keys())
b=max(M)
F=[]
for i in range(c):
    if M[i]==b:
        F+=[C[i]]
F.sort()
for i in F:
    print(i)
        
    


Fixed submission:
A,B,C=map(int,input().split())
print((A==B and B!=C or A==C and C!=B or B==C and B!=A) and "Yes" or "No")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
L=[]
M=[]
c=0
for i in range (n):
    s=input()
    if s in L:
        M[L.index(s)]+=1
    else:
        L+=[s]
        M+=[1]
        c+=1
b=max(M)
F=[]
for i in range(c):
    if M[i]==b:
        F+=[L[i]]
F.sort()
for i in F:
    print(i)
    


Fixed submission:
n=int(input())
L={}
c=0
for i in range (n):
    s=input()
    if s in L:
        L[s]+=1
    else:
        L.update({s:1})
        c+=1
M=list(L.values())
C=list(L.keys())
b=max(M)
F=[]
for i in range(c):
    if M[i]==b:
        F+=[C[i]]
F.sort()
for i in F:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
# 1行目は入力ワード数
# word を1行ずつ入力し、最も投票数が多かったwordを出力

import collections

def check(input_list):

    vote_dict = collections.Counter(input_list)

    result_list = [k for k, v in vote_dict.items() if v == max(vote_dict.values())]
    result_list.sort()
    
    return result_list

if __name__ == '__main__':
    num = int(input())
    input_list = [input() for a in range(num)]

    for str in check(input_list):
        print(str)


Fixed submission:
import collections

def check(input_list):

    vote_dict = collections.Counter(input_list)
    max_value = max(vote_dict.values())

    result_list = [k for k, v in vote_dict.items() if v == max_value]
    result_list.sort()
    
    return result_list

if __name__ == '__main__':
    num = int(input())
    input_list = [input() for a in range(num)]

    for str in check(input_list):
        print(str)

Buggy python submission (verdict: Time Limit Exceeded):
# 1行目は入力ワード数
# word を1行ずつ入力し、最も投票数が多かったwordを出力

def check(input_list):
    vote_dict = {}
    
    for a in input_list:
        if(a in vote_dict.keys()):
            vote_dict[a] += 1
        else:
            vote_dict[a] = 1
            
    result_list = [k for k, v in vote_dict.items() if v == max(vote_dict.values())]
    result_list.sort()
    
    return result_list

if __name__ == '__main__':
    num = int(input())
    input_list = [input() for a in range(num)]

    for str in check(input_list):
        print(str)


Fixed submission:
import collections

def check(input_list):

    vote_dict = collections.Counter(input_list)
    max_value = max(vote_dict.values())

    result_list = [k for k, v in vote_dict.items() if v == max_value]
    result_list.sort()
    
    return result_list

if __name__ == '__main__':
    num = int(input())
    input_list = [input() for a in range(num)]

    for str in check(input_list):
        print(str)
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
sumA = ""
sumB = ""
for i in range(int(b)):
    sumA +=""+str(a)
for i in range(int(a)):
    sumB +=""+str(b)
if(int(sumA)>int(sumB)):
    print(sumA)
elif(int(sumB)>int(sumA)):
    print(sumB)
elif(int(sumA) == int(sumB)):
    print(sumA)

Fixed submission:
a, b = input().split()
aa = ""
bb = ""
for i in range(0, int(b)):
    aa += a
for j in range(0, int(a)):
    bb += b

if (int(a)>int(b)):
    print(bb)
else:
    print(aa)

Buggy python submission (verdict: Runtime Error):
a, b = input().split()
aa = ""
bb= ""
for i in range(1, int(b)-1):
    aa += a
for j in range(1, int(a)-1):
    bb += b

if (ord(aa)>ord(bb)):
    print(aa)
else:
    print(bb)

Fixed submission:
a, b = input().split()
aa = ""
bb = ""
for i in range(0, int(b)):
    aa += a
for j in range(0, int(a)):
    bb += b

if (int(a)>int(b)):
    print(bb)
else:
    print(aa)
Buggy python submission (verdict: Runtime Error):
n, r = int(input().split())
if n < 10:
  print(100 * (10 - n) + r)
else:
  print(r)

Fixed submission:
hako = list(map(int, input().split()))
if hako[0] < 10:
  print(100 * (10 - hako[0]) + hako[1])
else:
  print(hako[1])
Buggy python submission (verdict: Time Limit Exceeded):
hako = []
zan = []
num = int(input())
for n in range(num):
  hako.append(int(input()))
for h in range(len(hako)):
  zan.append(hako[h])
  hako.remove(hako[h])
  print(max(hako))
  hako.insert(h, zan[h])

Fixed submission:
num = int(input())
box = [int(input()) for _ in range(num)]
box_dash = sorted(box, reverse=True)
for b in box:
  if b == box_dash[0]:
    print(box_dash[1])
  else:
    print(box_dash[0])
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input())
if a % b == 0:
  print(a + b)
else:
  print(b - a)


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

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

Fixed submission:
a, b = map(int, input().split())
if b % a == 0:
  print(a + b)
else:
  print(b - a)
Buggy python submission (verdict: Runtime Error):
a = int(input())
kazu = [int(input()) for _ in range(1)]
if a == 1:
  print("Hello World")
else:
  print(sum(kazu))


Fixed submission:
a = int(input())
if a == 1:
  print("Hello World")
else:
  b = int(input())
  c = int(input())
  print(b + c)

Buggy python submission (verdict: Runtime Error):
a = int(input())
kazu = [int(input()) for _ in range(2)]
if a == 1:
  print("Hello World")
else:
  print(sum(kazu))

Fixed submission:
a = int(input())
if a == 1:
  print("Hello World")
else:
  b = int(input())
  c = int(input())
  print(b + c)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a + b) % 2 == 0:
  print(a + b) // 2
else:
  print((a + b) // 2 + 1)

Fixed submission:
a, b = map(int, input().split())
x = (a + b) / 2
if x == (a + b) // 2:
  print((a + b) //2)
else:
  print((a + b) // 2 + 1)
Buggy python submission (verdict: Runtime Error):
kazu = {"A":10,"B":11,"C":12,"D":13,"E":14,"F":15}
x, y = input().split()
if kazu[x] > kazu[y]:
  print(">")
elif kazu[x] = kazu[y]:
  print("=")
elif kazu[x] < kazu[y]:
  print("<")

Fixed submission:
kazu = ["A","B","C","D","E","F"]
X, Y = input().split()
x = kazu.index(X)
y = kazu.index(Y)
if x > y:
  print(">")
elif x == y:
  print("=")
elif x < y:
  print("<")
Buggy python submission (verdict: Runtime Error):
n, m = map(intm input().split())
print((n - 1) * (m - 1))

Fixed submission:
n, m = map(int, input().split())
print((n - 1) * (m - 1))
Buggy python submission (verdict: Runtime Error):
boin = [a, i, u, e, o]
moji = input()
if moji in boin:
  print('vowel')
else:
  print('consonant')

Fixed submission:
boin = ["a", "e", "i", "o", "u"]
moji = input()
if moji in boin:
  print('vowel')
else:
  print('consonant')
Buggy python submission (verdict: Runtime Error):
n = int(input())
arr = [int(i) for i in input().split()]

for d in arr :
  
  if d % 2 == 0 :
    
    if d % 3 == 0 :

      pass
    
    elif d % 5 = 0 : 
      pass
    
    else :

      print("DENIED")
      exit()
      
print("APPROVED")

Fixed submission:
n = int(input())
arr = [int(i) for i in input().split()]

for d in arr :
  
  if d % 2 == 0 :
    
    if d % 3 == 0 or d % 5 == 0:

      pass
    
    else :

      print("DENIED")
      exit()
      
print("APPROVED")
Buggy python submission (verdict: Runtime Error):
line = [int(i) for i in input.split()]
v1 = line[0]
v2 = line[1]

if 0 < v1 and v1 < 10 and 0 < v2 and v2 < 10 :
  print(v1*v2)
else:
  print(str(-1))

Fixed submission:
line = [int(i) for i in input().split(" ")]
v1 = line[0]
v2 = line[1]

if 0 < v1 and v1 < 10 and 0 < v2 and v2 < 10 :
  print(str(v1*v2))
else:
  print("-1")
Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = (int(i) for i in input().split())
p =[k]*(n+1)
for i in range(q):
    v = int(input())
    for j in range(len(p)) :
      
      if j != v :
        p[j] -= 1 
        

for i in range(1,len(p)) :
  if 0 < p[i] :
    print("Yes")
  else:
    print("No")

Fixed submission:
n,k,q = (int(i) for i in input().split())
d = -q+k
p =[d]*(n+1)


for i in range(q):
    v = int(input())
    p[v] += 1


for i in range(1,len(p)) :
  if 0 < p[i] :
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):

N, T = map(int, input().split())
t = list(map(int, input().split()))
s, e = 0, 0
ans = 0
for i in range(N):
  if t[i] <= e:
    e = t[i] + T
    else:
      ans += e - s
      s = t[i]
      e = t[i] + T
ans += e - s
print(ans)




Fixed submission:
n,t = (int(i) for i in input().split())
ni = [int(i) for i in input().split()]

total = 0

for i in range(1,len(ni)) :
  delta = ni[i] - ni[i-1]
  if delta < t :
    total += delta
  else :
    total += t

    
print(total+t)
Buggy python submission (verdict: Time Limit Exceeded):

line = int(input())

v1 = 1
for i in range(1,line+1) :
  v1 = v1 * i
	
print(v1%(10**9+7))

Fixed submission:

line = int(input())

v1 = 1
for i in range(1,line+1) :
  v1 = v1 * i % (10**9+7)
	
print(v1)
Buggy python submission (verdict: Time Limit Exceeded):
count=0
mainasu=0
num=int(input())
An=[int(i) for i in input().split()]

for i in An[0:num]:
    mainasu+=1
    for w in An[mainasu:]:
        if w==i:
            count+=1
        
    if count>=1:
        break
    
if 0==count:
    print("YES")
    
else :
    print("NO")

Fixed submission:
def duplication(lis):
    return len(lis) == len(set(lis)) 

num=int(input())
An=[int(i) for i in input().split()]


if duplication(An) == True:
    print("YES")
    
else :
    print("NO")

Buggy python submission (verdict: Time Limit Exceeded):
count=0
mainasu=0
num=int(input())
An=[int(i) for i in input().split()]

for i in An[0:num]:
    mainasu+=1
    for w in An[mainasu:]:
        
        if i==w:
            count=1
            break
    if count>=1:
        break
    
if 0==count:
    print("YES")
    
else :
    print("NO")

Fixed submission:
def duplication(lis):
    return len(lis) == len(set(lis)) 

num=int(input())
An=[int(i) for i in input().split()]


if duplication(An) == True:
    print("YES")
    
else :
    print("NO")

Buggy python submission (verdict: Time Limit Exceeded):
count=0
mainasu=0
num=int(input())
An=[int(i) for i in input().split()]
An_co=An
for i in An[0:num]:
    mainasu+=1
    An_co.pop(0)
    for w in An_co:
        
        if i==w:
            count=1
            break
    
if 0==count:
    print("YES")
    
else :
    print("NO")

Fixed submission:
def duplication(lis):
    return len(lis) == len(set(lis)) 

num=int(input())
An=[int(i) for i in input().split()]


if duplication(An) == True:
    print("YES")
    
else :
    print("NO")

Buggy python submission (verdict: Time Limit Exceeded):
count=0
mainasu=0
num=int(input())
An=[int(i) for i in input().split()]
for i in An:
    mainasu+=1
    
    for w in range(num-mainasu):
        
        if i==An[w+mainasu]:
            count=1
            break
    
if 0==count:
    print("YES")
    
else :
    print("NO")

Fixed submission:
def duplication(lis):
    return len(lis) == len(set(lis)) 

num=int(input())
An=[int(i) for i in input().split()]


if duplication(An) == True:
    print("YES")
    
else :
    print("NO")
Buggy python submission (verdict: Runtime Error):
H,W,h,w = (int(i) for i in input().split())
print((H-W)*(h-w))


Fixed submission:
H,W, = (int(i) for i in input().split())
h,w = (int(i) for i in input().split())
print((H-h)*(W-w))
Buggy python submission (verdict: Runtime Error):
s = input()
alphabet = list('abcdefghijklmnopqrstuvwxyz')
print(alphabet[alphabet.index(s)+1])


Fixed submission:
s = input()
alphabet = list('abcdefghijklmnopqrstuvwxyz')
print(alphabet[alphabet.index(s)+1])

Buggy python submission (verdict: Runtime Error):
alphabet = list('abcdefghijklmnopqrstuvwxyz')

s=input()

ss = alphabet.index(s)

print(alphabet[ss])


Fixed submission:
s = input()
alphabet = list('abcdefghijklmnopqrstuvwxyz')
print(alphabet[alphabet.index(s)+1])