Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
r, g, b = map(int, input().split)
 
number = r * 100 + g * 10 + b
 
if number % 4 == 0:
  print("YES")
else:
  print("NO")

Fixed submission:
r, g, b = map(int, input().split())
 
number = r * 100 + g * 10 + b
 
if number % 4 == 0:
  print("YES")
else:
  print("NO")

Buggy python submission (verdict: Runtime Error):
r, g, b = map(int, input().split)
 
number = r * 100 + g * 10 + b
 
if number % 4 == 0:
  print("YES")
 
else:
  print("NO")

Fixed submission:
r, g, b = map(int, input().split())
 
number = r * 100 + g * 10 + b
 
if number % 4 == 0:
  print("YES")
else:
  print("NO")

Buggy python submission (verdict: Runtime Error):

r, g, b = map(int, input().split)

number = r * 100 + g * 10 + b

if number % 4 = 0:
  print("YES")
 
else:
  print("NO")

Fixed submission:
r, g, b = map(int, input().split())
 
number = r * 100 + g * 10 + b
 
if number % 4 == 0:
  print("YES")
else:
  print("NO")

Buggy python submission (verdict: Runtime Error):

number = int(input())
 
if number % 4 == 0:
  print("YES")
else:
  print("NO")

Fixed submission:
r, g, b = map(int, input().split())
 
number = r * 100 + g * 10 + b
 
if number % 4 == 0:
  print("YES")
else:
  print("NO")

Buggy python submission (verdict: Runtime Error):
number = int(input())

if number % 4 = 0:
  print("YES")

else:
  print("NO")

Fixed submission:
r, g, b = map(int, input().split())
 
number = r * 100 + g * 10 + b
 
if number % 4 == 0:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = sorted(list(map(int, input().split())), reverse=True)


print(sum(a[1:2*n:2]))

Fixed submission:
n=int(input())
a=list(map(lambda x: int(x), input().split()))
a.sort(reverse=True)
print(sum(a[1:2*n:2]))

Buggy python submission (verdict: Runtime Error):
N = int(input())
a = sorted(list(map(int, input().split())), reverse=True)

print(sum(a[1:2*n:2]))

Fixed submission:
n=int(input())
a=list(map(lambda x: int(x), input().split()))
a.sort(reverse=True)
print(sum(a[1:2*n:2]))
Buggy python submission (verdict: Time Limit Exceeded):
K, S = map(int,input().split())

answer = 0

for i in range(K + 1):
    for j in range(K + 1):
        for k in range(K + 1):
            if i + j + k == S:
                answer += 1

print(answer)

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

answer = 0

for i in range(K + 1):
    for j in range(K + 1):
        if 0 <= S - i - j <= K:
            answer += 1

print(answer)
Buggy python submission (verdict: Runtime Error):
n,m = map(int, input().strip().split(" "))

homework = list(map(int, input().strip().split(" ")))

day = n - sum(homework)

if day >= 0:
  
  print(day)
  
else:
  
  print(-1)


Fixed submission:
import math

R = int(input())

print(R * 2 * math.pi)

Buggy python submission (verdict: Runtime Error):
 print(int(input(R))*6.3)


Fixed submission:
import math

R = int(input())

print(R * 2 * math.pi)

Buggy python submission (verdict: Runtime Error):
6.3R

Fixed submission:
import math

R = int(input())

print(R * 2 * math.pi)

Buggy python submission (verdict: Runtime Error):
x = 2 * R * 3

Fixed submission:
import math

R = int(input())

print(R * 2 * math.pi)

Buggy python submission (verdict: Runtime Error):
x = 2 * R * 3.14

print(x)

Fixed submission:
import math

R = int(input())

print(R * 2 * math.pi)

Buggy python submission (verdict: Runtime Error):
 print(int(input())*6.3)


Fixed submission:
import math

R = int(input())

print(R * 2 * math.pi)

Buggy python submission (verdict: Runtime Error):
R

Fixed submission:
import math

R = int(input())

print(R * 2 * math.pi)
Buggy python submission (verdict: Runtime Error):
n,m = map(int, input().strip().split(" "))

homework = list(n,m)

day = n - sum(homework)

if day >= 0:
  
  print(day)
  
else:
  
  print(-1)

Fixed submission:
n,m = map(int, input().strip().split(" "))
 
homework = list(map(int, input().strip().split(" ")))
 
day = n - sum(homework)
 
if day >= 0:
    print(day)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
n,m = map(int, input().strip().sprit(' '))

homework = list(map(int, input().strip().sprit(' ')))

day = n - sum(homework)

if day >= 0:
  print(day)
else:
  print(-1)

  

Fixed submission:
n,m = map(int, input().strip().split(" "))
 
homework = list(map(int, input().strip().split(" ")))
 
day = n - sum(homework)
 
if day >= 0:
    print(day)
else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
r, g, b = map(int, input().split())
x = r * 100 + g * 10 + b

if x % 4 = 0:
  print("YES")
  
else:
  print("NO")

Fixed submission:
r, g, b = map(int, input().split())
x = r * 100 + g * 10 + b

if x % 4 == 0:
  print("YES")
  
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
li = input().split()
count = 0
for num in range(li[0],li[1]+1):
  if num % li[2] == 0:
    count += 1
print(count)

Fixed submission:
li = list(map(int,input().split()))
count = 0
for num in range(li[0],li[1]+1):
  if num % li[2] == 0:
    count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=[int(x) for x in input().split()]
x=1
P=10**18
for a in A:
  x*=a
if x>P:x=-1
print(x)

Fixed submission:
N=int(input())
A=[int(x) for x in input().split()]
x=1
P=10**18
if 0 in A:x=0 
else:
  for a in A:
    x*=a
    if x>P:
      x=-1
      break
print(x)
Buggy python submission (verdict: Runtime Error):
N,K=map(int,input().split())
if N==0:print(0)
elif N<K:print(min(N,K-N))
elif N>=K*2:print(N%K)
else:print(N%(N-K))  

Fixed submission:
N,K=map(int,input().split())
print(min(N%K,K-(N%K)))
Buggy python submission (verdict: Time Limit Exceeded):
A, B, M = map(int, input().split())
Ma = [int(_) for _ in input().split()]
Mb = [int(_) for _ in input().split()]
Mm = [[int(_) for _ in input().split()] for __ in range(M)]

r = 10 ** 5
for i in range(A):
  for j in range(B):
    c = max([z for x,y,z in Mm if x == i+1 and y == j+1], default=0)
    r = min(r, Ma[i] + Mb[j] - c)
print(r)

Fixed submission:
# AtCoder Hitachi B
A, B, M = map(int, input().split())
Ma = [int(_) for _ in input().split()]
Mb = [int(_) for _ in input().split()]
Mm = [[int(_) for _ in input().split()] for __ in range(M)]
# unuse vaucher
r0 = min(Ma) + min(Mb)
# use vaucher
r1 = min([Ma[x-1]+Mb[y-1]-c for x,y,c in Mm])
print(min(r0,r1))

Buggy python submission (verdict: Time Limit Exceeded):
A, B, M = map(int, input().split())
Ma = [int(_) for _ in input().split()]
Mb = [int(_) for _ in input().split()]
Mm = [[int(_) for _ in input().split()] for __ in range(M)]

r = 10 ** 5
for i in range(A):
  for j in range(B):
    c = 0
    for x, y, z in Mm:
      if i == (x - 1) and j == (y - 1):
        c = max(c, z)
    r = min(r, Ma[i] + Mb[j] - c)
print(r)

Fixed submission:
# AtCoder Hitachi B
A, B, M = map(int, input().split())
Ma = [int(_) for _ in input().split()]
Mb = [int(_) for _ in input().split()]
Mm = [[int(_) for _ in input().split()] for __ in range(M)]
# unuse vaucher
r0 = min(Ma) + min(Mb)
# use vaucher
r1 = min([Ma[x-1]+Mb[y-1]-c for x,y,c in Mm])
print(min(r0,r1))
Buggy python submission (verdict: Runtime Error):
x = input()

print(x*x)

Fixed submission:
x = int(input())
print(x**2)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
numbers = [ int(i) for i in input().split()]

result = 1
for i in range(n):
    result *= numbers[i]    

if result > 10**18:
    print(-1)
else:
    print(result)

Fixed submission:
n = int(input())
numbers = [ int(i) for i in input().split()]
if 0 in numbers:
    print(0)
else:
    result = 1

    max = 10**18
    for i in range(n):
        result *= numbers[i]    
        if result > max:
            break


    if result > max:
        print(-1)
    else:
        print(result)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
lack = []
for _ in range(M):
    lack.append(int(input()))

mod = 1000000007

def fib(n):
    memo=["EMPTY"]*(n+1)
    def inner(n):
        if n in lack:
            return 0
        elif n == 0:
            return 1
        elif n == 1:
            return 1
        elif memo[n] != "EMPTY":
            return memo[n]
        else:
            memo[n] = inner(n-1)+inner(n-2)
            return memo[n] % mod
    return inner(n)

print(fib(N)% mod)

Fixed submission:
P, Q, R = map(int, input().split())
lst = [P, Q, R]
lst = sorted(lst)
print(lst[0]+lst[1])

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
lack = []
for _ in range(M):
    lack.append(int(input()))

def fib(n):
    memo=["EMPTY"]*(n+1)
    def inner(n):
        if n in lack:
            return 0
        elif n == 0:
            return 1
        elif n == 1:
            return 1
        elif memo[n] != "EMPTY":
            return memo[n]
        else:
            memo[n] = inner(n-1)+inner(n-2)
            return memo[n]
    return inner(n) %1000000007

print(fib(N)%1000000007)

Fixed submission:
P, Q, R = map(int, input().split())
lst = [P, Q, R]
lst = sorted(lst)
print(lst[0]+lst[1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
H = [i for i in map(int, input().split())]

cnt = 0
for i in range(i):
    if H[i] == max(H):
        cnt += 1
print(cnt)

Fixed submission:
N = int(input())
H = [i for i in map(int, input().split())]
cnt = 0
for i in range(N):
    if max(H[0:i+1]) == H[i]:
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
A = [int(input()) for i in range(5)]
#１の位が１～９のうちで1に近いほど、最後に調理される
B = [a-a%10+10 if a % 10 != 0 else a for a in A]
diff = [(b-a) for a,b in zip(a,b)]
print(sum(B) - max(diff))

Fixed submission:
A = [int(input()) for i in range(5)]
#１の位が１～９のうちで1に近いほど、最後に調理される
B = [a-a%10+10 if a % 10 != 0 else a for a in A]
diff = [(b-a) for a,b in zip(A,B)]
print(sum(B) - max(diff))
Buggy python submission (verdict: Runtime Error):
from itertools import accumulate


N, Q = list(map(int, input().split()))
S = input()
A = [list(map(int, input().split())) for i in range(Q)]

flg = []
for i in range(N-1):
    tmp_S = S[i:i+2]
    if tmp_S == 'AC':
        flg.append(1)
    else:
        flg.append(0)

flg2 = [0] + flg
flg2 = list(accumulate(flg2))

for a in A:
    print(flg2[a[1]-1] - flg2[a[0]-1])

Fixed submission:
b = input()
if b == "A":
    print("T")
elif b == "T":
    print("A")
elif b == "G":
    print("C")
else:
    print("G")

Buggy python submission (verdict: Runtime Error):
from itertools import accumulate
n, q = list(map(int, input().split()))
s = input()
a = [list(map(int, input().split())) for i in range(q)]

flg = []

for i in range(n-1):
    tmp = s[i:i+2]
    if tmp == 'AC':
        flg.append(1)
    else:
        flg.append(0)
    
flg2 = [0] + flg
flg2 = list(accumulate(flg2))

for l in a:
    print(flg2[l[1]-1] - flg2[l[0]-1])

Fixed submission:
b = input()
if b == "A":
    print("T")
elif b == "T":
    print("A")
elif b == "G":
    print("C")
else:
    print("G")
Buggy python submission (verdict: Runtime Error):
N = int(input())
L = str(N)
L1 = str(L[-3] + L[-2] + L[-1])
N1 = int(L1)
if N1 == 0:
    print(0)
else:
    print(1000 - N1)

Fixed submission:
N = int(input())
if N < 1000:
    print(1000-N)
else:
    
    L = str(N)
    L1 = str(L[-3] + L[-2] + L[-1])
    N1 = int(L1)
    if N1 == 0:
        print(0)
    else:
        print(1000 - N1)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

mul = 1
for i in range(N):
    mul *= A[i]

if mul > 10**18:
    print("-1")

else:
    print(mul)


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

#print(A)

A.sort()
#print(A)

mul = 1
for i in range(N):
    if mul == 0:
        break
    elif mul > 10**18:
        mul = -1
        break
    else:
        mul *= A[i]
 
if mul > 10**18:
    print("-1")
else:
    print(mul)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
d = []
A = []
safe = []
ubsafe = []
for k in range(K):
    d.append(int(input()))
    A.append(list(map(int, input().split())))

for _ in range(K-1):
    for p in range(d[K-1]-1):
        safe.append(A[_][p])
        
L = len(list(set(safe)))
print(N-L)


Fixed submission:
N, K = map(int, input().split())
d = []
A = []

for k in range(K):
    d.append(int(input()))
    A.append(list(map(int, input().split())))

Alist = [e for row in A for e in row]
        
L = len(list(set(Alist)))
print(N-L)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
d = []
A = []
safe = []
ubsafe = []
for k in range(K):
    d.append(int(input()))
    A.append(list(map(int, input().split())))

for _ in range(K-1):
    for p in range(d[K-1]):
        safe.append(A[_][p])
        
L = len(list(set(safe)))
print(N-L)


Fixed submission:
N, K = map(int, input().split())
d = []
A = []

for k in range(K):
    d.append(int(input()))
    A.append(list(map(int, input().split())))

Alist = [e for row in A for e in row]
        
L = len(list(set(Alist)))
print(N-L)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
d = []
A = []
safe = []
ubsafe = []
for k in range(K):
    d.append(int(input()))
    A.append(list(map(int, input().split())))

for _ in range(K):
    for p in range(d[K-1]):
        safe.append(A[_][p])
        
L = len(list(set(safe)))
print(N-L)


Fixed submission:
N, K = map(int, input().split())
d = []
A = []

for k in range(K):
    d.append(int(input()))
    A.append(list(map(int, input().split())))

Alist = [e for row in A for e in row]
        
L = len(list(set(Alist)))
print(N-L)
Buggy python submission (verdict: Runtime Error):
N = int(input())
#景品リスト作成
keihin = []

#かぶってなければ箱へ
for i in range(N):
    if keihin.count(input()) == 0:
        keihin.append(input())

#出力
print(len(keihin))


Fixed submission:
#入力
S, W = map(int, input().split())

if W >= S:
    print("unsafe")
else:
    print("safe")

Buggy python submission (verdict: Runtime Error):
#入力
HPlist = list(map(int, input().split()))
HPlist[0] = A
HPlist[1] = B
HPlist[2] = C
HPlist[3] = D

int aokiDeath
int takahashiDeath

#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")

Fixed submission:
#入力
S, W = map(int, input().split())

if W >= S:
    print("unsafe")
else:
    print("safe")

Buggy python submission (verdict: Runtime Error):
#入力
HPlist = list(map(int, input().split()))
HPlist[0] = A
HPlist[1] = B
HPlist[2] = C
HPlist[3] = D


#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")

Fixed submission:
#入力
S, W = map(int, input().split())

if W >= S:
    print("unsafe")
else:
    print("safe")

Buggy python submission (verdict: Runtime Error):
#入力
A, B, C, D = map(int, input().split())


#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")

Fixed submission:
#入力
S, W = map(int, input().split())

if W >= S:
    print("unsafe")
else:
    print("safe")
Buggy python submission (verdict: Runtime Error):
#入力
HPlist = list(map(int, input().split()))
HPlist[0] = A
HPlist[1] = B
HPlist[2] = C
HPlist[3] = D


#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")

Fixed submission:
#入力
A, B, C, D = map(int, input().split())


#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
#入力
A, B, C, D = map(int, input().split())

#各々HPを定義
int takahashi = A
int aoki = C
int aokiDeath
int takahashiDeath

#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")


Fixed submission:
#入力
A, B, C, D = map(int, input().split())


#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
#景品リスト作成
keihin = []

#かぶってなければ箱へ
for i in range(N):
    if keihin.count(input()) == 0:
        keihin.append(input())

#出力
print(len(keihin))


Fixed submission:
N = int(input())
S = [str(input()) for _ in range(N)]

S.sort()

count = 1

for i in range(N-1):
    if S[i] != S[i+1]:
        count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
a = list(map(int, input().split())

homework = sum(a)

if homework > N:
    print("-1")

else:
    print(N - homework)

Fixed submission:
R = int(input())

import math

circle = 2 * R * math.pi

print(circle)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
a = list(map(int, input().split))

homework = sum(a)

if homework > N:
    print("-1")

else:
    print(N - homework)

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

homework = sum(a)

if homework > N:
    print("-1")

else:
    print(N - homework)

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
a = [int(input()) for i in range(M)]

homework = sum(a)

if homework > N:
    print("-1")

else:
    print(N - homework)


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

homework = sum(a)

if homework > N:
    print("-1")

else:
    print(N - homework)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    print(A.count(i+1))

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

count = 0
buka = [0 for _ in range(N)]

for i in range(N-1):
    buka[A[i]-1] += 1

for k in range(N):
    print(buka[k])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    count = A.count(i+1)
    print(count)

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

count = 0
buka = [0 for _ in range(N)]

for i in range(N-1):
    buka[A[i]-1] += 1

for k in range(N):
    print(buka[k])
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))

totalVote = sum(A)
border = totalVote / (4 * M)
A.sort(reverse = True)

if A[M-1] >= border:
    print("Yes")
else:
    print("No")


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

x = str(X)
y = str(Y)
z = str(Z)
print(z + " " + x + " " + y)

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

x = str(X)
y = str(Y)
z = str(Z)
print(Z + " " + X + " " + Y)

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

x = str(X)
y = str(Y)
z = str(Z)
print(z + " " + x + " " + y)

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

print(Z + " " + X + " " + Y)

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

x = str(X)
y = str(Y)
z = str(Z)
print(z + " " + x + " " + y)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = [int(input()) for k in range(N)]

totalVote = sum(A)
border = totalVote / (4 * M)
A.sort(reverse = True)

if A[M-1] >= border:
    print("Yes")
else:
    print("No")

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

totalVote = sum(A)
border = totalVote / (4 * M)
A.sort(reverse = True)

if A[M-1] >= border:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())

if (A = B and B = C) or (A != B and B != C and C != A):
    print("No")

else:
    print("Yes")


Fixed submission:
A, B, C = map(int, input().split())

if (A == B and B == C) or (A != B and B != C and C != A):
    print("No")

else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input())

if (A = B and B = C) or (A != B and B != C and C != A):
    print("No")

else:
    print("Yes")

Fixed submission:
A, B, C = map(int, input().split())

if (A == B and B == C) or (A != B and B != C and C != A):
    print("No")

else:
    print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

count = 0
for i in range(N):
    for j in range(i+1, N):
        if A[i] == A[j]:
            count = count + 1
            print("NO")
            break

if count == 0:
    print("YES")


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

A.sort()
count = 0

for i in range(1, N):
    if A[i-1] == A[i]:
        count += 1
        break

if count == 0:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

count = 0
for i in range(N):
    for j in range(i+1, N):
        if A[i] == A[j]:
            count = count + 1

if count == 0:
    print("YES")
else:
    print("NO")


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

A.sort()
count = 0

for i in range(1, N):
    if A[i-1] == A[i]:
        count += 1
        break

if count == 0:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

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

if count == N:
    print("YES")
else:
    print("NO")


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

A.sort()
count = 0

for i in range(1, N):
    if A[i-1] == A[i]:
        count += 1
        break

if count == 0:
    print("YES")
else:
    print("NO")