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()))
B=[0]*(10**9)
for i in range(N):
    if B[A[i]-1]>=1: 
        print("NO")
        exit(0)
    else:
        B[A[i]-1]+=1
print("YES")

N=int(input())
A=list(map(int,input().split()))
list.sort(A)
for i in range(N-1):
    if A[i]-A[i+1]==0:
        print("No")
        exit(0)
    else:
        continue
print("Yes")

N=int(input())
A=list(map(int,input().split()))
list.sort(A)
for i in range(N-1):
    if A[i]-A[i+1]==0:
        print("No")
        exit(0)
    else:
        continue
print("Yes")

N=int(input())
A=list(map(int,input().split()))
B=[0]*(10**9)
for i in range(N):
    if B[A[i]-1]>=1: 
        print("NO")
        exit(0)
    else:
        B[A[i]-1]+=1
print("YES")

N=int(input())
A=list(map(int,input().split()))
list.sort(A)
for i in range(N-1):
    if A[i]-A[i+1]==0:
        print("No")
        exit(0)
print("Yes")

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

Verdicts: Runtime Error

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):
N = int(input())
*l = map(int, input().split())
print("YES" if len(l)==len(set(l)) else "NO")

N = int(input())
*l, = map(int, input().split())
print("YES" if len(l)==len(set(l)) 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):
n = int(input())
a = list(map(int, input().split()))
s = list(set(a))

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

n = int(input())
a = list(map(int, input().split()))
s = list(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())
a = list(map(int, input().split()))

flag = 0
for i in range(0, n - 1):
    if (flag == 1):
        break
    for j in range(i+1, n):
        if (a[i] == a[j]):
            flag = 1
            break

if(flag == 1):
    print("No")
else:
    print("Yes")


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

a.sort()

flag = 0
for i in range(0, n - 1):
    if (a[i] == a[i+1]):
        flag = 1
        break

if(flag == 1):
    print("No")
else:
    print("Yes")


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

a.sort()

flag = 0
for i in range(0, n - 1):
    if (a[i] == a[i+1]):
        flag = 1
        break

if(flag == 1):
    print("No\n")
else:
    print("Yes\n")


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

a.sort()

flag = 0
for i in range(0, n - 1):
    if (a[i] == a[i+1]):
        flag = 1
        break

if(flag == 1):
    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):

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):
import collections
N = int(input())
A = list(map(int, input().split()))
cnt = collections.Counter(A)

if cnt.most_common()[0][1] > 1:
    print('No')
else:
    print('Yes')

import collections
N = int(input())
A = list(map(int, input().split()))
cnt = collections.Counter(A)
 
if cnt.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):
n = int(input())
a = set(map(int, input().split()))
print('Yes' if len(a) == n else 'No')


n = int(input())
a = set(map(int, 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):
N = int(input())
A = list(map(int, input().split()))

A.sort()

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

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

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

A.sort()

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

if count == 0:
    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 = map(int, input().split())
flag=0

for i in range(N): 
        for i1 in range(N): 
            if i != i1: 
                if A[i] == A[i1]: 
                    break
                else:
                  flag+=1

if flag>0:
  print("YES")
else:
  print("NO")

N = int(input())
A = list(map(int, input().split()))
S = set(A)
if len(S)==len(A):
    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())
List = list(map(int, input().split()))

count = 'Yes'
for i in range(N-1):
    for j in range(N-1-i):
        if List[i] == List[i+1+j]:
            count = 'No'

print(count)

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

List.sort()
count = 'YES'
for i in range(N-1):
    if List[i] == List[i+1]:
        count = 'NO'
        
print(count)

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()))

check = True
for i in range(A):
  if A.count(A[i]) > 1:
    check = False
    
print("Yes" if check else "No")

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

check = True
for i in range(N-1):
  if A[i] == A[i+1]:
    check = False
    
print("YES" if check 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):
N = int(input())
A = list(map(int,input().split()))

import collections

c = collections.Counter(A)
values, counts = zip(*c.most_common())

if counts[0] != 1:
    print("NO")
else:
    print("Yes")

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

import collections

c = collections.Counter(A)
values, counts = zip(*c.most_common())

if counts[0] != 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):
import collections
N = int(input())
A = list(map(int,input().split()))

K = collections.Counter(A)
B = len(K)

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

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

K = collections.Counter(A)
B = len(K)

if N == len(K):
    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 = kist(map(int,input().split()))
a.sorted
i for i in range(n):
  if a[i-1] == a[i] or a[i] == a[i+1]:
print('No')
  else:
print('Yes')

N = int(input())
A = list(map(int,input().split()))
if len(A) == len(set(A)):
  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 = input()
a = list(map(int, input().split()))
a.sort()
flag = False
for i in range(len(a)-1):
    if a[i] == a[i+1]:
        flag = True
        break
if flag:
    print("No")
else:
    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")
        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()))
ans="Yes"
for i in range(N-1):
    if A[i] in A[i+1:N]:
        ans="No"
print(ans)

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

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

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_n = list(map(int, input().split()))

b_n = sorted(a_n)
flg = 0

for i in range(n - 1):
    if b_n[i] == b_n[i + 1]:
        flg = 1

if flg == 1:
    print("YES")
else:
    print("NO")

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

b_n = sorted(a_n)
flg = 0

for i in range(n - 1):
    if b_n[i] == b_n[i + 1]:
        flg = 1

if flg == 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 = 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):
n = int(input())
P = list(map(int,input().split()))


S={}
ans="Yes"
for p in P:
    if p in S:
        ans = "No"
        break
    else:
        S[p]=1

print(ans)



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


S={}
ans="YES"
for p in P:
    if p in S:
        ans = "NO"
        break
    else:
        S[p]=1

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 = [int(x) for x in input().split()]

cnt = dict()
for i in range(N):
    cnt[A[i]] = cnt.get(A[i], 0) + 1

if max(cnt.values()) > 1:
    print('No')
else:
    print('Yes')

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

cnt = dict()
for i in range(N):
    cnt[A[i]] = cnt.get(A[i], 0) + 1

if max(cnt.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 = list(map(int, input().split()))

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

print('No' if has_duplicates(A) else 'Yes')

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

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

print('NO' if has_duplicates(A) else '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())
n = list(map(int, input().split()))
c = collections.Counter(n)

cnt = c.most_common()

for c in cnt:
  if (c[1]>1):
  	print('No')
  else:
    print('Yes')
  break
  

import collections

N = int(input())
n = list(map(int, input().split()))
c = collections.Counter(n)

cnt = c.most_common()

for c in cnt:
  if (c[1]>1):
  	print('NO')
  else:
    print('YES')
  break
  

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_set = set(A)
if len(A_set) == N:
        print("YES")
    else:
        print("NO")

N = int(input())
A = list(map(int, input().split()))
A_set = set(A)
if len(A_set) == 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):
N = int(input())
A = list(map(int, input().split()))

res = True
for n in range(N):
    for i in range(N):
        if n != i:
            if A[n] == A[i]:
                res = False
if res:
    print('Yes')
else:
    print('No')

N = int(input())
A = list(map(int, input().split()))
A.sort()
res = A[0]
cnt = True
for n in range(1, N):
    if A[n] == res:
        cnt= False
    res = A[n]
if cnt:
    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()))

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

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

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

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

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

Verdicts: Wrong Answer

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()))

l = [0]*(10**9+10)
for i in range(n):
    l[a[i]] += 1

bool = True
for j in range(len(l)):
    if l[j] > 1:
        bool = False
    else:
        continue
        
if bool:
    print('YES')
else:
    print('NO')

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

ans1 = len(set(a))
ans2 = len(a)
if ans1 == ans2:
    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()))
a.sort()

for i in range(len(a)):
    if a[i] == a[i-1]
    print("NO")
else:
    print("YES")

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

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

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

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(e) for e in input().split()]
if len(A) == len(list(set(A))):
    print('Yes')
else:
    print('No')

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

N = int(input())
A = [int(e) for e in input().split()]
B = 0
for i in range(N):
    for j in range(N-i-1):
        if A[i] == A[i+j+1]:
            print('No')
            B = 1
            break
        else:
            continue
        break
    
    
    if i == N-1 and B != 1:
        print('Yes')

N = int(input())
A = [int(e) for e in input().split()]
if len(A) == len(list(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):
#154 c
n=int(input())
a=list(map(int,input().split()))
num=dict()
flag=True
for x in a:
    if x not in num:
        a[x]=1
    else:
        flag=False
    if flag==False:
        break
if flag:
    print("YES")
else:
    print("NO")


#154 c
n=int(input())
a=list(map(int,input().split()))
num=set(a)
if len(a)==len(num):
    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()))

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

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

if len(set(A)) != N:
  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):
from collections import Counter

n = int(input())
a = list(map(int, input().split()))
cnt = Counter(a)
flag = [i for i in cnt.values()]
if len(set(flag)) == 1:
    print("Yes")
else:
    print("No")

from collections import Counter

n = int(input())
a = list(map(int, input().split()))
cnt = Counter(a)
flag = [i for i in cnt.values()]
if len(set(flag)) == 1 and max(flag) == 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_line = map(int, input().split())

A_flags = [0] * pow(10, 8)

for A in A_line:
  A_flags[A-1] += 1

res = 'YES'
for A_flag in A_flags:
  if A_flag >= 2:
    res = 'NO'

print(res)

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

A_line.sort()

res = "YES"
for i in range(len(A_line) - 1):
  if A_line[i] == A_line[i + 1]:
    res = "NO"

print(res)

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 = input().split()
b = len(set(a))
print(b)

n = int(input())
a = input().split()
b = len(set(a))
print('YES' if b==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):
n=int(input())
a=list(map(int,input().split(" ")))
deta=[]
try:
  for i in range(n):
  if a[i] in deta:
	raise "err"
except err:
	print("NO")
print("YES")

n=int(input())
a=list(map(int,input().split(" ")))
deta=[]
error=False

for i in range(n):
  if len(deta)==0:
    pass
  elif error:
    break
  elif a[i] in deta:
    error=True
    deta.append(a[i])
if error:
  print("YES")
else:
  print("NO")

    n=int(input())
    a=list(map(int,input().split(" ")))
    deta=[]
    error=False
     
    for i in range(n):
      if len(deta)==0:
        pass
      elif error:
        break
      elif a[i] in deta:
        error=True
      deta.append(a[i])
    if error:
      print("YES")
    else:
      print("NO")

n=int(input())
a=list(map(int,input().split(" ")))
deta=[]
error=False

for i in range(n):
  if len(deta)==0:
    pass
  elif error:
    break
  elif a[i] in deta:
    error=True
    deta.append(a[i])
  if error:
    print("YES")
  else:
    print("NO")

    n=int(input())
    a=list(map(int,input().split(" ")))
    deta=[]
    error=False
    try:
      for i in range(n):
        if len(deta)==0:
          pass
        elif error:
          break
        elif a[i] in deta:
          error=True
        deta.append(a[i])
    if error:
      print("YES")
    else:
      print("NO")

n=int(input())
a=list(map(int,input().split(" ")))
deta=[]
error=False
try:
  for i in range(n):
    if error:
      break
    elif a[i] in deta:
      error=True
    
if error:
  print("YES")
else:
  print("NO")

n=int(input())
a=list(map(int,input().split(" ")))
deta=[]
error=False
    
for i in range(n):
    if len(deta)==0:
        pass
    elif error:
        break
    elif a[i] in deta:
        error=True
    deta.append(a[i])
if error:
    print("YES")
else:
    print("NO")

n = int(input())
a = list(map(int, input().split(" ")))
deta = set()
error = False

for i in range(n):
    if n == 0:
        pass
    elif error:
        break
    elif a[i] in deta:
        error = True
        break
    deta.add(a[i])
if error:
    print("NO")
else:
    print("YES")

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

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())
l = []
for i in range(N):
    A = int(input())
    if A in l:
        print("NO")
        exit()
    l.append(i)
print("YES")

N = int(input())
A = set(map(int, input().split()))
print("YES" if len(A) == N 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):
n =int(input())
list = list(input().split())


set = set(list)

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

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


set = set(list)

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

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


set = set(list)

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

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


set = set(list)

if len(set) == n:
    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 = map(int, input().split())
cnt = {}
for a in A:
  if cnt.get(a):
    cnt[a] = cnt[a] + 1
  else:
    cnt[a] = 1
for v in cnt.values():
  if v != 1:
    print('No')
    exit()
print('Yes')

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())
li = list(map(int,input().split()))
if n==set(li):
  print("YES")
else:
  print("NO")

n=int(input())
li = list(map(int,input().split()))
if n==len(set(li)):
  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())
    num = [int(i) for i in input().split()]
    if len(num) <= 1:
        return "YES"
    else:
        for i in range(len(num)+1):
            if num[i] == num[i + 1]:
                return "YES"
            else:
                return "NO"
print(main())


def main():

    n = int(input())
    num = [int(i) for i in input().split()]
    if len(num) <= 1:
        return "YES"
    else:
        for i in range(len(num)):
            if num[i] == num[i + 1]:
                return "YES"
            else:
                return "NO"
print(main())


def main():

    n = int(input())
    num = [int(i) for i in input().split()]
    if len(num) <= 1:
        return "YES"
    else:
        for i in range(len(num+1)):
            if num[i] == num[i + 1]:
                return "YES"
            else:
                return "NO"
print(main())


def main():

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

    for i in range(len(num)):
        if num[i] == num[i + 1]:
            return "YES"
        else:
            return "NO"
print(main())



n = int(input())
num = [int(i) for i in input().split()]
if len(num) != len(set(num)):
    print("NO")
else:
    print("YES")


Verdicts: 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):
def solve():
    N = int(input())
    A = set(map(int,input().split()))

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


if __name__ == '__main__':
    solve()


def solve():
    N = int(input())
    A = set(map(int,input().split()))
    if len(A) >= N:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()


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

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




def solve():
    N = int(input())
    A = set(input().split())
    
    a = len(A)
    if a == N:
        print("Yes")
    elif a != N:
        print("No")


if __name__ == '__main__':
    solve()


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

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




def solve():
    N = int(input())
    A = list(map(int,input().split()))
    a = set(A)
    
    if len(a) == N:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()


def solve():
    N = int(input())
    A = list(map(int,input().split()))
    
    if len(A) != len(set(A)):
        print("No")
    else:
        print("No")


if __name__ == '__main__':
    solve()


def solve():
    N = int(input())
    A = set(map(int,input().split()))
    if len(A) == N:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()


def solve():
    N = int(input())
    A = set(input().split())
    
    a = len(A)
    if a == N:
        print("YES")
    elif a != N:
        print("NO")


if __name__ == '__main__':
    solve()


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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):
n = input()
l = list(map(int,input().split()))
l.sort()

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

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

if len(l) == 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 = list(map(int, input().split()))
for x in A:
    if A.count(x) > 1:
        print("NO")
        break
    elif N == x:
        print("YES")
        break
    else:
        print("NO")
        break

N = int(input())
A = list(map(int, input().split()))
for x in A:
    if A.count(x) > 1:
        print("NO")
        break
    elif N == x:
        print("YES")
        break
    elif N != x:
        print("NO")
        break

N = int(input())
A = set(input().split())
if len(A) == N:
    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):
import collections
import sys
N = input()
A = input().split()
A1 = map(int,collections.Counter(A).values())
for i in A1:
    if i >= 2:
        print('No')
        sys.exit()
print('Yes')

import sys
N = int(input())
A = input().split()
if N > len(set(A)):
    print('NO')
    sys.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 = [int(x) for x in input().split()]

B = set(A)

if len(A) == len(B):
  print("Yes")
else:
  print("No")

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

B = 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()))
sa = set(a)
print("Yes") if len(a) == len(sa) else print("No")


n = int(input())
a = list(map(int, input().split()))
sa = set(a)
print("YES") if len(a) == len(sa) 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_n = set(map(int, inpt.split()))

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

n =int(input())
a_n = set(map(int, input().split()))

if n==len(a_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):
n = int(input())
a = set( map(int,input().split()) )
if len(a)==n :
    print('Yes')
else :
    print('No')   

n = int(input())
a = set( map(int,input().split()) )
if len(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):
N = int(input())
A = sorted(map(int,input().split()))

for i in range(len(A)-1):
    if A[i]==A[i+1]:
        print('No')
        exit()

print('Yes')

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

for i in range(len(A)-1):
    if A[i]==A[i+1]:
        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, = map(int, input().split())
print("Yes" if n == len(set(a)) else "No")


n = int(input())
*a, = 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):
N = int(input())
A = {i for i in input().split()}
print("Yes" if N==len(A) else "No")

N = int(input())
A = {i for i in input().split()}
print("YES" if N==len(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 = list(map(int, input().split()))

if has_duplicates(A):
  print('NO')
else:
  print('YES')


def has_no_duplicates(seq):
  return len(seq) == len(set(seq))

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

if has_no_duplicates==True:
  print('YES')
else:
  print('NO')

def has_no_duplicates(seq):
  return len(seq) == len(set(seq))

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

if has_no_duplicates(A):
  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(str,input().split()))
ans = 'Yes'
for i in range(n):
    if a.count(a[i]) != 1:
        ans = 'No'
        break
print(ans)

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

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

Verdicts: Wrong Answer

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()))

x = len(a)
y = len(set(a))

if x == y:
    print('Yes')
else:
    print('No')

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

x = len(a)
y = len(set(a))

if x == y:
    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()))
if len(list(set(A))) == n:
  print("Yes")
else:
  print("No")

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

if len(A) == 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):
n = int(input())
a = list(map(int, input().split()))
set_a = set(a)

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

n = int(input())
a = list(map(int, input().split()))
set_a = 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):
n = int(input())
*l, = map(int, input().split())
L = sorted(l)
S = 0
for i in range(n):
  for l in range(n):
    if L[i] == L[l]:
      S = 1
if S == 0:
  print('YES')
elif S == 1:
  print('NO')

n = int(input())
*l, = map(int, input().split())
L = sorted(l)
S = 0
for i in range(n):
  for l in range(n):
    if L[i] == L[l]:
      S = 1
if S == 0:
  print('YES')
elif S == 1:
  print('NO')

n = int(input())
*l, = map(int, input().split())
L = sorted(l)
S = 0
for i in range(n):
  for l in range(n):
    if L[i] == L[l]:
      S = 1
if S == 0:
  print('Yes')
elif S == 1:
  print('NO')

n = int(input())
*l, = map(int, input().split())
def has_duplicates(seq):
    return len(seq) != len(set(seq))
S = has_duplicates(l)
if str(S) == 'False':
  print('NO')
elif str(S) == 'True':
  print('YES')



n = int(input())
*l, = map(int, input().split())
def has_duplicates(seq):
    return len(seq) != len(set(seq))
S = has_duplicates(l)
if str(S) == 'False':
  print('YES')
elif str(S) == 'True':
  print('NO')



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):
import sys

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

As.sort()
for i in range(N):
    for j in range(i + 1, N):
        if As[i] == As[j]:
            print('NO')
            sys.exit(0)
        if As[j] > As[i]:
            print('break!')
            break

print('YES')

import sys

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')
        sys.exit(0)

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()))

A.sort()
print(A)
for i in range(N // 2 + 1):
    # print(A[i])
    # print(A[i+1])
    
    if A[i] == A[i+1]:
        print("NO")
        exit()
    elif A[-1-i] == A[-2-i]:
        print("NO")
        exit()

print("YES")


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

A.sort()
# print(A)
# print(N//2)
for i in range(N // 2):
    # print(i)
    # print(A[i])
    # print(A[i+1])
    
    if A[i] == A[i+1]:
        print("NO")
        exit()
    elif A[-1-i] == A[-2-i]:
        print("NO")
        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())
m = list(map(int,input().split()))
if len(set(m)) == len(m):
    print("Yes")
else:
    print("No")


n = int(input())
m = list(map(int,input().split()))
if len(set(m)) == len(m):
    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()))
count = 0

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

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

a.sort()

print(a)

for i in range(len(a)-1):
    if(a[i] == a[i+1]):
        print("NO")
        break
    elif(i == len(a)-2):
        print("YES")

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

a.sort()

for i in range(len(a)-1):
    if(a[i] == a[i+1]):
        print("NO")
        break
    elif(i == len(a)-2):
        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 = int(input())
A = {int(i) for i in input().split()}
if N == len(A):
    print('Yes')
else:
    print('No')

N = int(input())
A = {int(i) for i in input().split()}
if N == 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())
arr = list(map(int, input().split()))

# arr = list(filter(lambda x: x == n, arr))
# print(arr)
flag = False
for i in arr:
    tmp_arr = list(filter(lambda x: x == i, arr))
    if arr.count(i) >= 2:
        flag = True
        break

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

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

arr.sort()

flag = False
for i in range(len(arr)-1):
    if arr[i] == arr[i+1]:
        flag = True
        break

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

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

flag = False
for i in arr:
    if arr.count(i) >= 2:
        flag = True
        break

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

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

arr.sort()

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

print(ans)

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

arr.sort()

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

print(ans)

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):
# -*- coding: utf-8 -*-
N = input()
input_line = input()
Ai = input_line.split(" ")
Comment = "Yes"
N = int(N)
#print(type(N))
for i in range(N):
  for j in range(i+1,N):
    if(Ai[i] == Ai[j]):
      Comment = "No"
      break
      
print(Comment)

# -*- coding: utf-8 -*-
N = input()
input_line = input()
Ai = input_line.split(" ")
Comment = "Yes"
for i in range(int(N)):
  for j in range(i+1,int(N)):
    if(Ai[i] == Ai[j]):
      Comment = "No"
      break
      
print(Comment)

# -*- coding: utf-8 -*-
import numpy as np

N = input()
input_line = input()
Ai = input_line.split(" ")
NumAi = np.array(Ai)
Comment = "NO"
N = int(N)
if(len(NumAi) == len(np.unique(NumAi))):
  Comment = "YES"

#if(NumAi != set)
      
print(Comment)

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()))
x = 0
for i in range(n):
    if a.count(a[i]) != 1:
        print("No")
        x = 1
        break
        
if x == 0:
    print("Yes")

n = int(input())
a = list(map(int,input().split()))
ans = "YES"
a.sort()
for i in range(n-1):
    if a[i] == a[i+1]:
        ans="NO"
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):
from collections import defaultdict
n=int(input())
x=list(map(int,input().split()))
a=defaultdict(int)
f=True

for y in x:
    if a[y]==1:
        f=False
        break
    a[y]=1
    
if f:
    print("yes")
else:
    print("no")

from collections import defaultdict
n=int(input())
x=list(map(int,input().split()))
a=defaultdict(int)
f=True
 
for y in x:
    if a[y]==1:
        f=False
        break
    a[y]=1
    
if f:
    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(map(int,input().split()))

d = {}

for i in range(n):
  if a[i] not in d.keys():
    d[a[i]] = 1
  else:
    print('NO')
    sys.exit()

print('Yes')


import sys

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

d = {}

for i in range(n):
  if a[i] not in d.keys():
    d[a[i]] = 1
  else:
    print('NO')
    sys.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):
import numpy as np
N = int(input())
if N != len(set(list(map(int,input().split())))):
    print("No")
else:
    print("Yes")


import numpy as np
N = int(input())
if N != len(set(list(map(int,input().split())))):
    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=input()
hoge=list(map(int,input().split()))
hoge=set(hoge)
if(n==len(hoge)):
  print("Yes")
else:
  print("No")

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

n=int(input())
hoge=list(map(int,input().split()))
hoge=set(hoge)
if(len(hoge)==n):
  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):
length=input()
#len-1
Narray=sorted(input().split())
n=0
while n<int(length)-2:
	if Narray[n] == Narray[n+1]:
		print("NO")
		break
	elif n==int(length)-2:
		print("YES")
		break
	else:
		n+=1
    	

len=input()
#len-1
Narray=sorted(input().split())
n=0
while True
	if not Narray[n] == Narray[n+1]:
    	pass
    elif:
      print("NO")
print("yes")
    	
  

s=input()
array=[]
array+=(int(x) for x in input().split())

def judge(array,s):
  for i in range(int(s)-1):
    if array[i] == array[i+1]:
        return False
  else:
    return True

print(judge(array,s))

s=input()
array=[]
array+=(int(x) for x in input().split())
array.sort()
def judge(array,s):
  for i in range(int(s)-1):
    if array[i] == array[i+1]:
        return "NO"
  return "YES"

print(judge(array,s))

  

Verdicts: 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):
N = int(input())
A = list(map(int,input().split()))
for i in range (N):
  if A[i] in A:
    print('NO')
    exit()
      
print('YES')
 



N = int(input())
A = list(map(int,input().split()))
for i in range (N):
  for j in range (i+1,N):
    if A[i]==A[j]:
      print('No')
      exit()
      
print('Yes')
 

N =int(input())
A =list(map(int ,input().split()))
s =set(A)
if len(A) >len(s):
    print('NO')
else:
    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 = int(input())
A_list = list(map(int, input().split()))

B = {}
for i in A_list:
  B.add(i)

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

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

B = set()
for i in A_list:
  B.add(i)

if len(B) == 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):
N = int(input())
S = [int(i) for i in input().split()].sort()

flg = 0
for i in range(1,N):
  if S[i] = S[i-1]:
    flg = 1
    
if flg == 1:
  print("NO")
else:
  print("YES")  


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

flg = 0
for i in range(1,N):
  if S[i] == S[i-1]:
    flg = 1
    
if flg == 1:
  print("NO")
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):
N=int(input())
A=list(map(it,input().split()))
A.sort()
for i in range(N-1):
  if A[i]=A[i+1]:
    print('NO')
    break
else:
  print('YES')
  

N=int(input())
A=list(map(it,input().split()))
A.sort()
for i in range(N-1):
  if A[i]==A[i+1]:
    print('NO')
    break
else:
  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

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 = 5
# ARR = [2, 6, 1, 4, 5]

# N = 6
# ARR = [4, 1, 3, 1, 6, 2]
#
#
# N = 2
# ARR = [10000000, 10000000]

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

def calculate(n,arr):

    dict = {}
    result = True
    for i in range(n):
        item = arr[i]
        if dict.get(item) == None:
            dict.__setitem__(item,True)
        else:
            result = False
            break
    if result == True:
        print("Yes")
    else:
        print("No")

calculate(N,ARR)


# N = 5
# ARR = [2, 6, 1, 4, 5]

# N = 6
# ARR = [4, 1, 3, 1, 6, 2]
#
#
# N = 2
# ARR = [10000000, 10000000]

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

def calculate(n,arr):

    dict = {}
    result = True
    for i in range(n):
        item = arr[i]
        if dict.get(item) == None:
            dict.__setitem__(item,True)
        else:
            result = False
            break
    if result == True:
        print("YES")
    else:
        print("NO")

calculate(N,ARR)


Verdicts: Wrong Answer

Accepted