TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int,input().split()))

if len(set(a)) == N:
  print('YES')
else:
  print('NO')

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

if set(a)==N:
  print("Yes")
else:
  print("No")

N = int(input())
A = list(map(int,input().split()))
 
if len(set(A)) == N:
  print('YES')
else:
  print('NO')

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
B = A
if len(B) == len(list(set(A))):
  print("Yes")
else:
  print("No")

N = int(input())
A = list(map(int, input().split()))
B = A
if len(B) == len(list(set(A))):
  print("YES")
else:
  print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
def main():
    N = int(input())
    A = [int(i) for i in input().split()]
    s = set()
    for i in range(N):
        s.add(A[i])

    if N == len(s):
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

def main():
    N = int(input())
    A = [int(i) for i in input().split()]
    s = set()
    for i in range(N):
        s.add(A[i])

    if N == len(s):
        print("YES")
    else:
        print("NO")

if __name__ == '__main__':
    main()

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
num = int(input())
str_list = input.split(" ")

yes = True

for index, s in enumerate(str_list):
	if s in str_list[:index]:
    	yes = False
   		break
if yes:
	print("YES")
else:
	print("NO")

num = int(input())
str_list = input.split(" ")
 
num_dict = {}
yes = True
for s in str_list:
  if s in num_dict:
    yes = False
    break
  else:
    num_dict[s] = 1
if yes:
  print("YES")
else:
  print("NO")

num = int(input())
str_list = input.split(" ")

num_dict = {}
for s in str_list:
  if s in num_dict:
    print("NO")
    return
  else:
    num_dict[s] = 1
print("YES")

num = input()
str_list = input.split(" ")
 
yes = True

for index, s in enumerate(str_list):
	if s in str_list[:index]:
		yes = False
		break
if yes:
	print("YES")
else:
	print("NO")

num = int(input())
str_list = input.split(" ")

yes = True
 
for index, s in enumerate(str_list):
	if s in str_list[:index]:
    	yes = False
		break
if yes:
	print("YES")
else:
	print("NO")

num = int(input())
str_list = input.split(" ")

yes = True
 
for index, s in enumerate(str_list):
	if s in str_list[:index]:
		yes = False
		break
if yes:
	print("YES")
else:
	print("NO")

num = input()
str_list = input().split(" ")
 
yes = True
num_dict = {}
for s in str_list:
	if s in num_dict:
		yes = False
		break
	else:
		num_dict[s] = 1
if yes:
	print("YES")
else:
	print("NO")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
a.sort()
tmp = 0
flag = True
for i in range(n):
    if a[i] == tmp:
        flag = False
        break
    tmp = a[i]

if flag:
    print('Yes')
else:
    print('No')

n = int(input())
a = list(map(int, input().split()))
a.sort()
tmp = 0
flag = True
for i in range(n):
    if a[i] == tmp:
        flag = False
        break
    tmp = a[i]

if flag:
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n=int(input())
a=list(input())
ans="Yes"
for i in range(n):
  for j in range(n):
    if a[i]==a[j]:
      ans="No"
print(ans)

n=int(input())
a=list(input())
ans="Yes"
for i in range(n-1):
  if a[i]==a[i+1]:
    ans="No"
print(ans)


n=int(input())
a=set(map(int,input().split()))
print("Yes") if len(a)==n else print("No")

n=int(input())
a=set(map(int,input().split()))
print("YES") if len(a)==n else print("NO")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = [int(x) for x in input().split()]
la = len(A)
B = set(A)
lb = len(B)
if la == lb:
  print("Yes")
else:
  print("No")

N = int(input())
A = [int(x) for x in input().split()]
la = len(A)
B = set(A)
lb = len(B)
if la == lb:
  print("YES")
else:
  print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = input().split()

L = []

for i in range(N):
  if A[i] not in L:
    L.append(A[i])
    if i == N-1:
      print('Yes')
  else:
    print('No')
    break

N = int(input())
A = input().split()

L = []

for i in range(N):
  if A[i] not in L:
    L.append(A[i])
    if i == N-1:
      print('Yes')
  else:
    print('No')
    break

N = int(input())
seq = input().split()

if len(seq) != len(set(seq)):
  print('YES')
else:
  print('NO')

N = int(input())
seq = input().split()
 
if len(seq) != len(set(seq)):
  print('NO')
else:
  print('YES')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import sys
input = sys.stdin.readline
import numpy as np

def print_ans(N, ar):
    print(1)
if __name__ == '__main__':
    N = int(input().rstrip())
    ar = list(map(int,input().rstrip().split()))
    print_ans(N, ar)

import sys
input = sys.stdin.readline
import numpy as np
def print_ans(N, ar):
    """Test Case
    >>> print_ans(5, [2, 6, 1, 4, 5])
    YES
    >>> print_ans(6, [4, 1, 3, 1, 6, 2])
    NO
    >>> print_ans(2, [10000000, 10000000])
    NO
    """
    br = set(ar)
    print("YES" if len(br) == N else "NO")
    

if __name__ == '__main__':
    N = int(input().rstrip())
    ar = list(map(int,input().rstrip().split()))
    print_ans(N, ar)




Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = input().split()

for i in range(N):
    a = A.pop(0)
    if a in A:
        print("No")
        break

if i == N-1:
    print("Yes")

N = int(input())
A = input().split()
A.sort()
f = 0

for i in range(N - 1):
    if A[i] == A[i+1]:
        print("NO")
        f += 1
        break

if f==1:
    print("YES")

N = int(input())
A = input().split()
A.sort()
f = 0

for i in range(N - 1):
    if A[i] == A[i+1]:
        print("NO")
        f += 1
        break

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n_dice, n_choice = map(int, input().split())
dice_list = tuple(map(int, input().split()))
sumofarea_list = [sum(dice_list[i:i+n_choice]) for i in range(n_dice - n_choice + 1)]
print(max(sumofarea_list)/2 + n_choice / 2)

list_len = int(input())
integer_list = map(int ,input().split())
if list_len == len(set(integer_list)):
    print('YES')
else:
    print('NO')

Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

def check(seq):
    if len(seq) != len(set(seq)):
        return "YES"
    else:
        return "NO"

print(check(A))

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

def check(seq):
    if len(seq) != len(set(seq)):
        return "NO"
    else:
        return "YES"

print(check(A))

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

A.sort()

for i in range(N - 1):
    if A[i] == A[i + 1]:
        print('NO')
        return

print('YES')


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

A.sort()

for i in range(N - 1):
    if A[i] == A[i + 1]:
        print('NO')
        break
else:
    print('YES')


Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
from collections import Counter
N = int(input())
a = list(map(int,input().split()))
A = Counter(a)
for v in A.values():
  if v >= 2:
    print('No')
    exit()
print('Yes')

from collections import Counter
N = int(input())
a = list(map(int,input().split()))
A = Counter(a)
for v in A.values():
  if v >= 2:
    print('NO')
    exit()
print('YES')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
lst = []
flug = True
for i in range(n):
    if a[i] in lst:
        flug = False
        break
    lst.append(a[i])
if flug: print("Yes")
else: print("No")

import time
start = time.time()

n = int(input())
a = list(map(int, input().split()))

# st = set()

#     st.add(a[i])
# if len(st) == n: print("YES")
# else: print("NO")

# print(time.time() - start)

a.sort()
for i in range(n-1):
    if a[i] == a[i+1]:
        print("NO")
        break
else:
    print("YES")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
num = int(input())
num_list = list(map(int,input().split()))

base = len(set(num_list))

if base == num:
  ans = "No"
elif not base == num:
  ans = "Yes"

print(ans)


num = int(input())
num_list = list(map(int,input().split()))

base = len(set(num_list))

if base == num:
  ans = "Yes"
elif not base == num:
  ans = "No"

print(ans)


num = int(input())
num_list = list(map(int,input().split()))

base = len(set(num_list))

if base == num:
  ans = "Yes"
elif not base == num:
  ans = "No"

print(ans)


num = int(input())
num_list = list(map(int,input().split()))

base = len(set(num_list))

if base == num:
  ans = "YES"
elif not base == num:
  ans = "NO"

print(ans)


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import sys
from collections import Counter
input=sys.stdin.readline

n=int(input())
a=list(map(int,input().split()))

c=Counter(a)
if n==a:
  print('YES')
  
else:
  print('NO')

import sys
from collections import Counter
input=sys.stdin.readline

n=int(input())
a=list(map(int,input().split()))

c=Counter(a)
if n==c:
  print('YES')
  
else:
  print('NO')

import sys
from collections import Counter
input=sys.stdin.readline

n=int(input())
a=list(map(int,input().split()))

c=len(Counter(a))
if n==c:
  print('YES')
  
else:
  print('NO')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n, k = map(int, input().split())
p = list(map(int, input().split()))
a = sum(p[0:k])
l = [a]
for i in range(n-k):
    a = a-p[i]+p[i+k]
    l.append(a)
print((max(l)+k)/2)

n, k = map(int, input().split())
p = list(map(int, input().split()))
a = sum(p[0:k])
l = [a]
for i in range(n-k):
    a = a-p[i]+p[i+k]
    l.append(a)
print(l)
print((max(l)+k)/2)


n=int(input())
s=list(map(int,input().split()))
d=list(set(s))
if len(s)==len(d):
  print("YES")
else:
  print("NO")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))

a1 = sorted(a)

for i in range(1, n):
  if a1[i] == a1[i-1]:
    print("No")
    break
  elif i == n-1:
    print("Yes")

n = int(input())
a = list(map(int, input().split()))

a1 = sorted(a)

for i in range(1, n):
  if a1[i] == a1[i-1]:
    print("NO")
    break
  elif i == n-1:
    print("YES")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
s = list(map(int, input().split()))
st = set(s)

if len(st) == n:
 	print("Yes")
else:
	print("No")

n = int(input())
s = list(map(int, input().split()))

st = set(s)

if len(st) == n:
    print("YES")
else:
    print("NO")


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N=int(input())
A=list(map(int,input().split()))
A.sort()
ans=0
for x in range(N-1):
  if A[x]==A[x+1]:
    ans += 1
    break
if ans==0:
  print("Yes")
else:
  print("No")

N=int(input())
A=list(map(int,input().split()))
A.sort()
ans=0
for x in range(N-1):
  if A[x]==A[x+1]:
    ans += 1
    break
if ans==0:
  print("YES")
else:
  print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n=int(input())
a=list(map(int,input().split()))
a.sort()
s=""
r=0
for m in a:
  if m == s:
    r=1
  s=m
if r ==1:
  print("No")
else:
  print("Yes")


n=int(input())
a=list(map(int,input().split()))
a.sort()
s=""
r=0
for m in a:
  if m == s:
    r=1
  s=m
if r ==1:
  print("NO")
else:
  print("YES")


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
lis = list(map(int,input().split()))
x = 0
lis.sort()
for i in range(0,N+1):
        if lis[i] == lis[i+1]:
                x = 1
                break
if x == 0:
        print("YES")
else:
        print("NO")

N = int(input())
lis = list(map(int,input().split()))
x = 0
lis.sort()
for i in range(0,N):
        if lis[i] == lis[i+1]:
                x = 1
                break
if x == 0:
        print("YES")
else:
        print("NO")

N = int(input())
lis = list(map(int,input().split()))
x = 0
for i in range(N):
        for j in range(i,N):
                if lis[i] == lis[j]:
                        x = 1
if x == 0:
        print("YES")
else:
        print("NO")

N = int(input())
lis = list(map(int,input().split()))
lis.sort()
judge = 0
for i in range(1,N):
    if lis[i-1] == lis[i]:
        judge = 1
if judge == 0:
    print("YES")
else:
    print("NO")


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A_list = list(map(int, input().split()))

count_list = []
for a in A_list:
    count = 0
    for i in range(N):
        if a == A_list[i]:
            count += 1
    count_list.append(count)

if max(count_list) == 1:
    print('Yes')
else:
    print('No')

N = int(input())
A_list = list(map(int, input().split()))
A_set = set(A_list)

if len(A_list) == len(A_set):
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N=int(input())
A=list(map(int,input().split()))

A_sorted=sorted(A)

ans='Yes'

for i in range(N-1):
    if A_sorted[i]==A_sorted[i+1]:
        ans='No'
        break

print(ans)

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

A_sorted=sorted(A)

ans='YES'

for i in range(N-1):
    if A_sorted[i]==A_sorted[i+1]:
        ans='NO'
        break

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
list_n = []
for i in range(n):
    list_n.append(int(input()))

if len(list_n) == len(set(list_n)):
    print("YES")
else:
    print("NO")

n = int(input())
list_n = list(map(int, input().split()))

if len(list_n) == len(set(list_n)):
    print("YES")
else:
    print("NO")

Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import sys
N=int(input())
A=list(map(int,input().split()))
A.sort()
for i in range(N):
    if A[i]==A[i+1]:
        print('NO')
        sys.exit()
print('YES')

import sys
N=int(input())
A=list(map(int,input().split()))
A.sort()
for i in range(1,N):
    if A[i-1]==A[i]:
        print('NO')
        sys.exit()
print('YES')

Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N=int(input())
L=list(map(int,input().split()))
if N==set(L):
  print("YES")
else:
  print("NO")

N=int(input())
L=list(map(int,input().split()))
if N==len(set(L)):
  print("YES")
else:
  print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = [int(x) for x in input().split()]

flag = True

while flag:
    for i in range(N-1):
        for j in range(i+1, N):
            if A[i] == A[j]:
                print('No')     
                flag = False      
while flag:
    print('Yes')
    

N = int(input())
A = [int(x) for x in input().split()]

flag = True

while flag:
    for i in range(N-1):
        for j in range(i+1, N):
            if A[i] == A[j]:
                print('NO')     
                flag = False      
while flag:
    print('YES')

N = int(input())
A = [int(x) for x in input().split()]

if len(A) != len(set(A)):
    print('NO')
else:
    print('YES')

Verdicts: Wrong Answer

Time Limit Exceeded

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
a=int(input())
b=list(input().split())
c=sorted(b)
count=0
for i in range (a-1):
	if c[i]==c[i+1]:
		count=1
		break
	
if count==1:
	print("No")	
else:print("Yes")

a=int(input())
b=list(input().split())
c=sorted(b)
count=0
for i in range (a-1):
	if c[i]==c[i+1]:
		count=1
		break
	else:count=0
	
if count==1:
	print("No")	
else:print("Yes")

a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a-1):
	if c[i]==c[i+1]:
		print("No")
		break
	else:print("Yes")

a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a):
	if c[i]==c[i+1]:
		print("No")
		break
	else:print("Yes")
	

a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a-1):
	if c[i]==c[i+1]:
		print("NO")
		break
	else:print("YES")

a=int(input())
b=list(input().split())
c=sorted(b)
count=0
for i in range (a-1):
	if c[i]==c[i+1]:
		count=1
		break
	
if count==1:
	print("NO")	
else:print("YES")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
_ = int(input())
A = list(map(int, input().split()))

import collections
c = collections.Counter(A)

if max(c.values()) > 1:
    print("No") 
else:
    print("Yes")

_ = int(input())
A = list(map(int, input().split()))

import collections
c = collections.Counter(A)

if max(c.values()) > 1:
    print("NO") 
else:
    print("YES")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = {input().split()}
print('YNEOS'[len(A)==N::2]

N = int(input())
A = {input().split()}
print('YNEOS'[len(A)==N::2])


n = int(input())
print('YNEOS'[len(set(input().split()))!=n::2])

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
f=0
for i in c.values():
    if i>1:
        f+=1
        break
if f==1:
    print("No")
else:
    print("Yes")

import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
f=0
for i in c.values():
    if i>1:
        f+=1
        break
if f==1:
    print("NO")
else:
    print("YES")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
data = list(map(int, input().split()))

data.sort()

ans = "Yes"
for i in range(len(data) - 1):
  if data[i] == data[i+1]:
    ans = "No"
    break

print(ans)


n = int(input())
data = list(map(int, input().split()))

data.sort()

ans = "YES"
for i in range(len(data) - 1):
  if data[i] == data[i+1]:
    ans = "NO"
    break

print(ans)


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
B = set(list)
if len(A) == len(B):
  print("YES")
else:
  print("NO")

N = int(input())
A = list(map(int, input().split()))
B = set(A)
if len(A) == len(B):
  print("YES")
else:
  print("NO")

Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
B = set(A)
print("Yes" if len(A) == len(B) else "No")

N = int(input())
A = list(map(int, input().split()))
B = set(A)
print("YES" if len(A) == len(B) else "NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))

for i in range(n):
    if a[i] in a:
        print('NO')
        break
else:
    print('YES')


n = int(input())
a = list(map(int, input().split()))
a.sort()

tmp = a[0]
for i in range(1,n):
    if a[i] == tmp:
        print('NO')
        break
    else:
        tmp = a[i]
else:
    print('YES')


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
abc = list(map(int, input().split()))
ans = 'YES'
abc = sorted(abc)
for i in range(n):
  if abc[i] = abc[i+1]
  ans ='NO'

print(ans)


n = int(input())
abc = list(map(int, input().split()))
ans = 'YES'
abc = sorted(abc)
for i in range(n-1):
  if abc[i] == abc[i+1]:
  	ans ='NO'

print(ans)

Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
a_2 = set(a)
if len(a) == len(a_2):
    print("Yes")
else:
    print("No")

n = int(input())
a = list(map(int, input().split()))
a_2 = set(a)
if len(a) == len(a_2):
    print("YES")
else:
    print("NO")


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A_list = list(map(int, input().split()))

s = set(A_list)

if len(s) == N:
    print("Yes")
else:
    print("No")


N = int(input())
A_list = list(map(int, input().split()))

s = set(A_list)

if len(s) == N:
    print("YES")
else:
    print("NO")


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = input()
A = list(map(int, input().split()))

if N == len(set(A)):
  print('YES')
else:
  print('NO')


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

val = True
for i in A:
  if i == N:
    val = False
    break
  else:
    continue

if val == False:
  print('No')
else:
  print('Yes')
  

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

if N == len(set(A)):
  print('Yes')
else:
  print('No')


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

if N == len(set(A)):
  print('YES')
else:
  print('NO')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n=int(input())
a=list(map(int,input().split()))
print ('Yes' if len(a)==len(set(a)) else 'No')

n=int(input())
a=list(map(int,input().split()))
print ('YES' if len(a)==len(set(a)) else 'NO')


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = input().split()
x = 0
for i in a:
    b = a.pop(0)
    if b in a:
        x += 1
        break
if x == 1:
    print("No")
else:
    print("Yes")

n = int(input())
a = input().split()
d = dict()
for i in a:
    d[i] = 0
if len(d) == len(a):
    print("YES")
else:
    print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
A = [int(x) for x in input().split()]
print('YES' if len(A) = len(set(A)) else 'NO')

n = int(input())
A = [int(x) for x in input().split()]
print('YES' if len(A) == len(set(A)) else 'NO')


Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
  a.append(x.replace('\n', ''))
arra = a[1].split(' ')
arra = [int(x) for x in arra]
if arra == set(arra):
  print('YES')
else:
  print('NO')

import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
  a.append(x.replace('\n', ''))
arra = a[1].split(' ')
arra = [int(x) for x in arra]
if len(arra) == len(set(arra)):
  print('YES')
else:
  print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
x = int(input())
a = list(map(int, input().split()))
rslt = len(set(a))
print("Yes" if x == rslt else "No")

x = int(input())
a = list(map(int, input().split()))
rslt = len(set(a))
print("YES" if x == rslt else "NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

d = {x:0 for x in A}
for x in A:
    d[x] += 1

if max(d.values()) >= 2:
    print('No')
else:
    print('Yes')

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

d = {x:0 for x in A}
for x in A:
    d[x] += 1

if max(d.values()) >= 2:
    print('NO')
else:
    print('YES')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
i = int(input())
W = list(map(int, input().split()))

if i-len(set(W))==0:
    print('Yes')
else:
    print('No')

i = int(input())
W = list(map(int, input().split()))

if i-len(set(W))==0:
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int,input().split()))

def loop(n):
  for i in range(n):
    for j in range(i+1,n):
      if a[i]==a[j]:
        print('No')
        return
  print('Yes')

loop(n)

n = int(input())
a = list(map(int,input().split()))

if len(a) == len(set(a)):
  print('Yes')
  
else:
  print('No')
  

n = int(input())
a = list(map(int,input().split()))

if len(a) == len(set(a)):
  print('Yes')
  
else:
  print('No')

n = int(input())
a = list(map(int,input().split()))

if n == len(set(a)):
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
S = int(input())
A = input()
z = ''
arr1 = [i for i in A.split(' ')]
for i in range(S):
	for j in range(i+1, S):
		if(arr1[i]==arr1[j]):
			z = 'YES'
			break
if(z=='YES'):
	print(z)
else:
	print('NO')

S = int(input())
A = input()
arr1 = [i for i in A.split(' ')]
for i in range(S):
	for j in range(S):
		if(arr1[i]==arr1[j]):
			print('NO')
			break
print('YES')

n = int(input())
arr = [int(n) for n in input().split()]
_set = set()
for i in range(0, n):
    _set.add(arr[i])
print("YES") if len(_set) == len(arr) else print("NO")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import numpy as np
n = input()
num_list = list(map(int,input().split()))
num_list = np.sort(num_list)

flag = False
for i in range(len(num_list)):
    if i == len(num_list)-1:
        break
    
    if num_list[i] == num_list[i+1]:
        flag = True
        break
        
if flag:
    print('No')

else:
    print('Yes')

import numpy as np
n = input()
num_list = list(map(int,input().split()))
num_list = np.sort(num_list)

flag = False
for i in range(len(num_list)):
    if i == len(num_list)-1:
        break
    
    if num_list[i] == num_list[i+1]:
        flag = True
        break
        
if flag:
    print('NO')

else:
    print('YES')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import collections
n = int(input())
a = list(map(int,input().split()))

li = collections.Counter(a)

li2 = [i for i in li.values()]

if max(li2)==1:
    print("Yes")
else:
    print("No")
    


import collections
n = int(input())
a = list(map(int,input().split()))

li = collections.Counter(a)

li2 = [i for i in li.values()]

if max(li2)==1:
    print("YES")
else:
    print("NO")
    


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = [int(a) for a in input().split()]
B = list(set(A))
if len(A) == len(B):
  print('Yes')
else:
  print('No')

N = int(input())
A = [int(a) for a in input().split()]
B = list(set(A))
if len(A) == len(B):
  print('YES')
else:
  print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())

a = list(map(int, input().split()))


x = len(set(a))


if x == len(a):
    print("Yes")
else:
    print("No")

n = int(input())

a = list(map(int, input().split()))


x = len(set(a))


if x == len(a):
    print("YES")
else:
    print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
lst = list(map(int, input().split()))
sets = set(lst)
if len(lst) == len(sets):
  print('Yes')
else:
  print('No')

N = int(input())
lst = list(map(int, input().split()))
sets = set(lst)
if len(lst) == len(sets):
  print('YES')
else:
  print('NO')


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
s = set(a)

if len(a) == len(s):
  print("Yes")
else:
  print("No")
  


n = int(input())
a = list(map(int, input().split()))
s = set(a)

if len(a) == len(s):
  print("YES")
else:
  print("NO")
  

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n=int(input())
num=[int(i) for i in input().split()]

if len(num)==len(set(num)):
  print('Yes')
else:
  print('No')

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

if len(num)==len(set(num)):
  print('YES')
else:
  print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import numpy as np

n = int(input())
A = [int(a) for a in input().split()] 
A.sort()
A.append(-1)

B = [-1] + A[:-1]

A = np.array(A) 
B = np.array(B) 

s = A-B 
ans = len(np.nonzero(s)[0])
if ans == n+1:
  print("Yes")
else:
  print("No")

import numpy as np
n = int(input())
k = 0
A =[int(a) for a in input().split()]
A.sort()
A = np.array(A)
AC = [0]*n
AC = np.array(AC)
AC[1:] =A[:n-1]
AA = A - AC
if 0 in AA:
    print("NO")
elif A[n-2] == A[n-1]:
    print("NO")
else:
    print("YES")


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
A = list(map(int, input().split()))

if len(A) == len(set(A)):
  print('Yes')
else:
  print('No')

n = int(input())
A = list(map(int, input().split()))

if len(A) == len(set(A)):
  print('YES')
else:
  print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))

cnt = [0] * 10**9
for i in a:
    cnt[i-1] += 1
if n == a.count(1):
    print('YES')
else:
    print('NO')

n = int(input())
a = list(map(int, input().split()))

cnt = [0] * 10**9
for i in a:
    cnt[i-1] += 1
if n == a.count(1):
    print('Yes')
else:
    print('No')

n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(n-1):
    if a[i] == a[i+1]:
        print('NO')
        exit()
print('YES')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import sys

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

for i in range(0, N, 1):
	if A[i] == A[i + 1]:
		print("NO")
		sys.exit(0)

print("YES")

import sys

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

for i in range(0, N - 1, 1):
	if A[i] == A[i + 1]:
		print("NO")
		sys.exit(0)

print("YES")


Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = input()
s = input().split()
if len(set(s)) == n:
  print(YES)
else:
  print(NO)

n = input()
a = list(input().split())

b = set(a)

if len(a) == len(b):
  print(YES)
else:
  print(NO)

n = input()
a = list(input().split())

b = set(a)

if len(a) == len(b):
  print(YES)
else:
  print(NO)


n = input()
s = set(input().split())
if len(s) == n:
  print(YES)
else:
  print(NO)


n = input()
a = list(input().split())

b = set(a)

if len(a) == len(b):
  print("YES")
else:
  print("NO")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n=int(input())
a=list(map(int,input().split()))

def has_duplicates(seq):
  return len(seq) != len(set(seq))

if has_duplicates(a) == True:
  print('No')
else:
  print('Yes')


n=int(input())
a=list(map(int,input().split()))

def has_duplicates(seq):
  return len(seq) != len(set(seq))

if has_duplicates(a) == True:
  print('No')
elif has_duplicates(a) == False:
  print('Yes')


n=int(input())
a=list(map(int,input().split()))

s=set(a)
print('Yes' if len(s)==len(a) else 'No')

# def has_duplicates(seq):


# if has_duplicates(a) == True:
#   print('No')
# elif has_duplicates(a) == False:
#   print('Yes')


# #   if a[i] == a[i+1]:
# #     print('No')
# #     exit()

# # print('Yes')


n=int(input())
a=list(map(int,input().split()))

def has_duplicates(seq):
  return len(seq) != len(set(seq))

if has_duplicates(a) == True:
  print('No')
else:
  print('Yes')


n=int(input())
a=list(map(int,input().split()))
s=set(a)
print('YES' if len(s)==len(a) else 'NO')
# def has_duplicates(seq):


# if has_duplicates(a) == True:
#   print('No')
# elif has_duplicates(a) == False:
#   print('Yes')


# #   if a[i] == a[i+1]:
# #     print('No')
# #     exit()

# # print('Yes')


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
input();a=list(map(int,input().split()));print("YNEOS"[len(A)>len(set(A))::2])

input();A=list(map(int,input().split()));print("YNEOS"[len(A)>len(set(A))::2])

Verdicts: Runtime Error

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
print('Yes' if len(set(A)) == len(A) else 'No')

N = int(input())
A = list(map(int, input().split()))
print('YES' if len(set(A)) == N else 'NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import sys
input = sys.stdin.readline

n = int(input())
a = list(map(int, input().split()))

cur = set(a)
if len(cur) == len(a):
    print("Yes")
else:
    print("No")

import sys
input = sys.stdin.readline

n = int(input())
a = list(map(int, input().split()))

cur = set(a)
if len(cur) == len(a):
    print("YES")
else:
    print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import sys
N = int(input())
A = list(input().split())
def has(s):
    return len(s) != len(set(s))
B = has(A)

if B == False:
    print("NO")
    sys.stdout.flush
else:
    print("YES")
    sys.stdout.flush

import sys
N = int(input())
A = list(input().split())
def has(s):
    return len(s) != len(set(s))
B = A
B = has(A) 
if B == False:
    print("NO")
    sys.stdout.flush
else:
    print("YES")
    sys.stdout.flush

import sys
N = int(input())
A = list(input().split())
def has(s):
    return len(s) != len(set(s))
B = A
B = has(A) 
if B == False:
    print("YES")
    sys.stdout.flush
else:
    print("NO")
    sys.stdout.flush

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())

a = list(map(int,input().split()))

set_a = list(set(a))

if len(set_a) == n:
    print("Yes")
else:
    print("No")

n = int(input())
 
a = list(map(int,input().split()))
 
set_a = list(set(a))
 
if len(set_a) == n:
    print("YES")
else:
    print("NO")

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
if c.most_common()[0][1] > 1:
    print('No')
else:
    print('Yes')

import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
if c.most_common()[0][1] > 1:
    print('NO')
else:
    print('YES')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
a=int(input())
b=list(map(int,input().split()))
c=set(b)
out=''
if len(c)==len(b):
  out='Yes'
else:
  out='No'
print(out)

a=int(input())
b=list(map(int,input().split()))
c=set(b)
out=''
if len(c)==len(b):
  out='YES'
else:
  out='NO'
print(out)

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

flag = True
for i in range(N):
  for j in range(i+1, N):
    if A[i] == A[j]:
      flag = False
if flag:
  print("Yes")
else:
  print("No")

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

flag = True
A = sorted(A)
print(A)
for i in range(N-1):
  if A[i] == A[i+1]:
    flag = False
if flag:
  print("YES")
else:
  print("NO")

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

flag = True
A = sorted(A)
for i in range(N-1):
  if A[i] == A[i+1]:
    flag = False
if flag:
  print("YES")
else:
  print("NO")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n=int(input())
a=list(map(int,input().split()))
b=len(set(a))
if n==b:
    print('Yes')
else:
    print('No')

n=int(input())
a=list(map(int,input().split()))
b=len(set(a))
if n==b:
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
def main():
    N = int(input())
    A = set(map(int, input().split()))
    print(A)
    print(N, len(A))

    if N == len(A):
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()


def main():
    N = int(input())
    A = set(map(int, input().split()))

    if N == len(A):
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):

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

def has_duplicates(seq):
    return len(seq) != len(set(seq))

l = A
if has_duplicates(l):
    print("No")
else:
    print("Yes")



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

def has_duplicates(seq):
    return len(seq) != len(set(seq))

l = A
if has_duplicates(l):
    print("NO")
else:
    print("YES")


Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
ans = None
for i in a:
  if a.find(i) != -1:
    ans = 'NO'
    break
else:
  ans = 'YES'
print(ans)
  

n = int(input())
a = input().replace(' ', '')
ans = None
for i in a:
  if a.find(i) != -1:
    ans = 'NO'
    break
else:
  ans = 'YES'
print(ans)

n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = None
for i in range(len(a) - 1):
  if a[i] == a[i + 1]:
    ans = 'NO'
    break
else:
  ans = 'YES'
print(ans)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
N = int(input())
A = [int(i) for i in input().split()]

if len(A) == len(set(A)):
    print('Yes')
else:
    print('No') 

N = int(input())
A = [int(i) for i in input().split()]

if len(A) == len(set(A)):
    print('YES')
else:
    print('NO') 

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
n = int(input())
a = set(input().split())
print('Yes' if len(a) == n else 'No')

n = int(input())
a = set(input().split())
print('YES' if len(a) == n else 'NO')

Verdicts: Wrong Answer

Accepted
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
import collections
n = int(input())
a = list(map(int, input().split()))

c = collections.Counter(a)
ans = 0
for i in a:
  if c[i] == 1 :
    ans += 1
if ans == len(a):
  print('Yes')
else:
  print('No')

import collections
n = int(input())
a = list(map(int, input().split()))

c = collections.Counter(a)
v  = c.values()
ans = 0
for i in v:
  if i == 1:
    ans += 1
if ans == n:
  print('Yes')
else:
  print('No')

n = int(input())
a = list(map(int, input().split()))

ans = set(a)
print(len(ans))
if len(ans) == n:
  print('YES')
else:
  print('NO')

n = int(input())
a = list(map(int, input().split()))
res = 0
for i in a:
  if a.count(i) >= 2:
    res += 1
    
if res == 0:
  print('Yes')
else:
  print('No')

import collections
n = int(input())
a = list(map(int, input().split()))

ans = set(a)
if len(ans) == n:
  print('Yes')
else:
  print('No')

import collections
n = int(input())
a = list(map(int, input().split()))

c = collections.Counter(a)
v  = c.values()
ans = 0
for i in v:
  if i == 1:
    ans += 1
if ans == n:
  print('YES')
else:
  print('NO')


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted