Problem:


Score : 300 points

Problem Statement

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

Constraints

2 ≤ N ≤ 200000

1 ≤ A_i ≤ 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N

Output

If the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.

Sample Input 1

5
2 6 1 4 5

Sample Output 1

YES

The elements are pairwise distinct.

Sample Input 2

6
4 1 3 1 6 2

Sample Output 2

NO

The second and fourth elements are identical.

Sample Input 3

2
10000000 10000000

Sample Output 3

NO



Sample input:
5
2 6 1 4 5


Sample output:
YES

Submission status: Wrong Answer

Solution code:
N = int(input())
A = {int(i) for i in input().split()}
if N == len(A):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

b = set(a)
a.sort()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n=int(input())
A = list(map(int, input().split()))
for i in range(0,n-1):
    for j in range(i+1,n):
        if A[i]==A[j]:
            print("No")
            break
    else:
        continue
    break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = map(int, input().split())
A = sorted(A)
b = 0

for a in A:
    if b == a:
        print('No')
        exit()
    else:
        b = a
print('Yes')

Submission status: Wrong Answer

Solution code:
N=input()
A=input().split()
if(N in A):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())
A = list(map(int, input().split()))
if n > 9:
    print('NO')
elif sorted(A) == sorted(set(A)):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N=int(input())
s=list(map(int,input().split()))
# N=6
# s=[4 ,1 ,3 ,1 ,6 ,2]


from collections import Counter
S=Counter(s)#カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})

if S.most_common(1)[0][1]==1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a=int(input())
b=[int(i) for i in input().split()]
c=[]
for i in range(len(b)-1):
    if b[i]==b[i+1]:
        c.append(1)
if len(c)>0:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

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

for i in range(N):
  if A.count(A[i]) !=0:
    print("NO")
    exit(0)
print("YES")

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
A = list(map(int, input().split()))
A.sort()
B = None

for i in A:
    if B is None:
        B = i
    else:
        if i == B:
            print('NO')
            sys.exit()

print('YES')

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
flag=0
for i in range(N):
    for j in range(i+1,N):
        if(A[i]==A[j]):
            flag=1
            break
    if(flag==1):
        break

if(flag==1):
    print("YES")
if(flag==0):
    print("NO")

Submission status: Wrong Answer

Solution code:
a=input()
b=input()
N=int(a[0])
f=0
c=b.split()
c.sort()
for i in range(N-1):
    if(c[i] == c[i+1]):
        f=1
        break
if(f==0):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
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

Submission status: Wrong Answer

Solution code:
def main():
  n = int(input())
  A = [int(x) for x in input().split()]
  for a in A:
    if A.count(a) != 1:
      print("Yes")
      return 0
  print("No")
  return 0
          
if __name__ == "__main__":
  main()

Submission status: Wrong Answer

Solution code:
import sys

N = int(input())
d = list(map(int, input().split(" ")))

newList = list(dict.fromkeys(d))

if d == newList:
  print('YES')
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
import sys
num = int(input())
num_list = input().split(" ")

new_list = sorted(num_list)
for i in range(num):
  try:
    if new_list[i]==new_list[i+1]:
      print(new_list[i])
      print("NO")
      sys.exit()
    else:
      pass
  except:
    pass

    
    
print("YES")

Submission status: Wrong Answer

Solution code:
N=int(input())
li = list(map(int,input().split()))	
num = {}
for l in li:
    if str(l) in num != True:
        num[l] = 1
    else:
        print("NO")
        break
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
N = input()
A = input().split()

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
dup = [i for i in set(A) if A.count(i) > 1]
if dup == True:
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
N=int(input())
A=input().split()
if len(set(A))==N:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def quick_sort(list):
    stand=list[0]
    over=[]
    same=[]
    under=[]
    for i in list:
        if(i>stand):
            over.append(i)
        elif(i<stand):
            under.append(i)
        else:
            same.append(i)
    
    if(len(over)>1):
        over=quick_sort(over)
    else:
        pass
    if(len(under)>1):
        under=quick_sort(under)
    else:
        pass

    return over+same+under

N=int(input())
A=list(map(int,input().split()))
A=quick_sort(A)
ans="Yes"
for i in range(len(A)):
    if(A[i-1]==A[i]):
        ans="NO"
        break
    else:
        pass
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

N = int(input())
x = np.array(list(map(int, input().split())))

ans = 0
for i in range(N):
	if x[i] in x[0:i]:
		ans = 1
		break
if ans == 1:
	print("No")
else:
	print("Yes")

Submission status: Wrong Answer

Solution code:
def onlya(n , a):

    ans = "YES"

    for i in range(n):
        for w in range(i + 1 , n):
            print(a[i])
            print(a[w])
            if a[i] == a[w]:
                return "NO"

    return ans

def main():
    n = int(input())
    a = list(map(int,input().split()))
    print(onlya(n , a))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
B = set(A)
if len(B) == N:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
res = set()
ans = False
for i in a:
    if i in res:
        ans = True
    else:        
        res.add(i)
if ans ==True:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import numpy as np

N1 = int(input())
A = np.array(map(int, input().split()))

N2 = np.unique(A).size

if N1 == N2:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

import collections
counter = collections.Counter(A)

for i in list(counter.values()):
    if not i == 1:
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input()) 

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

ii = len(An)

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
NO = False
while NO:
    for i in A:
        j=0
        while i != A[j]:
            j += 1
            print('NO')
            NO = True

print('YES')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
set_a = set(a)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a_list = sorted(map(int, input().split()))

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
A = list(map(int , input().split()))
c = collections.Counter(A)
if len(c) == N:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

import collections

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

if len(collections.Counter(a_list))==len(a_list):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
from operator import itemgetter

N = int(input())
A = Counter(map(int,input().split()))
A1 = list(A.items())
A1 = sorted(A1,key=itemgetter(1),reverse = True)

if A1[0][1] == 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:

N = int(input())
A = [int(i) for i in input().split()]
f = 0
for i in range(10):
    if A.count(i) > 1:
        f = 1 
        
if f > 0:
    print("NO")
else:
 print("YES")

Submission status: Wrong Answer

Solution code:
input_num = int(input())
a = list(map(int,input().rstrip().split(" ")))
ans = True
for i in range(1,input_num):
  for i2 in range(i):
    if a[i2] == a[i]:
      ans = False
      break
if ans:
  print("Yes")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N = input()
A = input().split()

if A[0] in A[1:] :
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
n=int(input()) 
a=list(map(int, input().split()))
def func(a):
    return len(a) == len(set(a))
if func(a):
    print("Yes")
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def has_duplicates(seq):
    return len(seq) != len(set(seq))
if has_duplicates(A):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
N = input()
a = input().split()
ans = ''
for i in a:
  if N == i:
    ans='YES'
    break;
  else:
    ans='NO'
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a_list = list(map(int, input().split()))

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

Submission status: Wrong Answer

Solution code:
a = input()
b = input().split()
c = 0

for i in range(len(b)):
    if a == b[i]:
        c = 1
if c == 0:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
def main():

    N = int(input())
    A = list(map(int, input().split()))
    if len(A) == len(set(A)):
        return 'YES'
    return 'No'

if __name__ == '__main__':
    print(main())

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
N = input()
A = input().split()

print(A[0] in A[1:])

Submission status: Wrong Answer

Solution code:
s=int(input())
t=list(map(int,input().split()))
t.sort()
a=0
for i in range(len(t)-1):
  if t[i]==t[i+1]:
    a+=1
    break
if a==1:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import fractions
n=int(input())
a=list(map(int,input().split()))
ans=a[0]
cnt=0
if ans==1:
  cnt+=1
for i in range(1,n):
  if a[i]==1:
    cnt+=1 
  ans=fractions.gcd(ans,a[i])
if cnt > 1:
  print("NO")
elif ans==1:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def onlya(n , a):

    ans = "YES"

    for i in range(n):
        for w in range(i , n):
            if a[i] == a[w]:
                return "NO"

    return ans

def main():
    n = int(input())
    a = list(map(int,input().split()))
    print(onlya(n , a))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 1
i_before = a[0]
for i in a:
    ans *= (i - i_before)
    i_before=i
if i ==0:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
N = int(input()) 

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

ii = len(An)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input().split(" ")
b = set(a)
if len(b)<len(a):
  answer = "NO"
else:
  answer = "Yes"
print(answer)

Submission status: Wrong Answer

Solution code:
a=input()
b=input()
N=int(a[0])
f=0
c=b.split()
c.sort()
for i in range(N-1):
    if(c[i] == c[i+1]):
        f=1
        break
if(f==0):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

import collections
counter = collections.Counter(A)

for i in list(counter.values()):
    if not i == 1:
        print("No")
        exit()
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = sorted(list(map(lambda x: int(x),input().split())))
flag = 0
for i in range(n - 1):
    if a[i] == a[i+1] :
        print('NO')
        flag = 1
        break

if flag == 0 :
    print('Yes')

Submission status: Wrong Answer

Solution code:
_ = input()
_list = input()

num_list = _list.split(' ')

for num in num_list:
  if num_list.count(num) > 1:
    print('No')
    break
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
A = input().split()

print(A[0] in A[1:])

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = [int(n) for n in input().split(" ")]
st = set(lst)
print(lst)
print(st)
print(len(lst))
print(len(st))
if len(lst) == len(st):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
c=0
for i in range(len(A)):
  if A.count(A[i])==0:
    c=c+1

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

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 1
i_before = a[0]
for i in a:
    ans *= (i - i_before)
    i_before=i
if i ==0:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input().split(" ") 
b = set(a) 
if len(b)<len(a):     
  answer = "NO" 
else:     
  answer = "YES" 
  print(answer)

Submission status: Wrong Answer

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

if list(set(A)) == sorted(A):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())
a_list = list(map(int, input().split()))
ans = 'Yes'
cheacked = []

for i in a_list:
    if i in cheacked:
        ans = 'No'
        break
    else:
        cheacked.append(i)
        
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
a=sorted(a)
if list(set(a))!=a:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
N = input()
nums = input().split(" ")
nums = [int(i) for i in nums]

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

Submission status: Wrong Answer

Solution code:
_list = input()

num_list = _list.split(' ')

for num in num_list:
  if num_list.count(num) > 1:
    print('No')
    break
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
print('YNEOS'[len(a) > len(set(a))::2])

Submission status: Wrong Answer

Solution code:
N = map(int,input())

A = set(map(int,input().split()))

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

Submission status: Wrong Answer

Solution code:
cnt = int(input())
tar_array = input().split()
tar_array.sort()

out = "YES"
tar = ""
print(tar_array)
for i in range(cnt):
  if tar == tar_array[i]:
    out = "NO"
    break
  tar = tar_array[i]

print(out)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
if N == len(list(set(A))):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
A_list = list(map(int, input().split()))

print("Yes" if len(A_list) == len(set(A_list)) else "No")

Submission status: Wrong Answer

Solution code:
hoge = int(input())
n = list(map(int,input().split()))
ans = "YESt"
count = 0

for i in n :
    for j in n :
        if i == j :
            count += 1
    if count >= 2 :
        ans = "NO"
        break
    count = 0

print(ans)

Submission status: Wrong Answer

Solution code:

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

A = sorted(A)

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

print("Yes")

Submission status: Wrong Answer

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

A.sort()
B = list(set(A))
#print(A)
#print(B)

if A == B:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
N=int(input())
A=input()
print(len(set(A)))
if len(set(A))-1==N:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
same=0
for i in range(n):
    for j in range(i+1,n):
        if(a[i]==a[j]):
            same+=1
if(same==0):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
l = sorted([int(x) for x in input().split()])
ans = 'YES'
for i in range(N-1):
  if l[0] == l[1]:
    ans = 'NO'
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())
    array = sorted(list(map(int, input().split())))
    if array == list(set(array)):
        print("YES")
    else:
        print("NO")

solve()

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
l = list(map(int,input().split()))

c = collections.Counter(l)
if c.most_common()[0][1] > 1:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import collections

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

c = collections.Counter(A)

ans =  any([1 for k, v in c.items() if v > 1])

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n):
  if i==n-1:
    print("Yes")
    break
  elif a[i]==a[i+1]:
    print("No")
    break

Submission status: Wrong Answer

Solution code:
'''
.append(要素) リストに要素を追加 
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
import itertools
from functools import reduce
from operator import mul

N = int(stdin.readline().rstrip())
nums = [int(s) for s in stdin.readline().rstrip().split()]
nums.sort()
check = True
for el in range(N):
    if el == N - 1:
        break
    if nums[el] == nums[el + 1]:
        print('No')
        check = False
        break
if check:
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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(0)

print("Yes")

Submission status: Wrong Answer

Solution code:
N=input()
A = list(map(int, input().split()))
A_set = set(A)

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

Submission status: Wrong Answer

Solution code:
# = map(int, input().split())
n = int(input())
# = input()
a = list(map(int, input().split()))

a.sort()

now = a[0]
for i in range(1, n):
	if now == a[i]:
		print("No")
		exit(0)
	else:
		now = a[i]
print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))
flag = True
a.sort()
for i,j in zip(a[0:len(a)-1],a[1:len(a)]):
    if i == j:
        flag = False
        break
if flag == True:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = [int(n) for n in input().split(" ")]
st = set(lst)
if len(lst) == len(st):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
a = [int(i) for i in input().split()]
for i in range(len(a)-1):
    for j in range(i+1,len(a)):
        if a[i]==a[j]:
            print('Yes')
            sys.exit()
print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c = collections.Counter(A)
c = c.most_common()
if c[0][1] == 1:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
length = int(input())
numArr = [int(str_num) for str_num in input().split(' ')]

numArr.sort()

for i in range(0, length - 1):
  if numArr[i] == numArr[i + 1]:
    print("No")
    exit()

print("Yes")

Submission status: Wrong Answer

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

flg = 1
for i in range(N):
  if A[i] in A[i+1:]:
    print("No")
    flg= 0
    break
if flg:
  print("Yes")

Submission status: Wrong Answer

Solution code:
from sys import exit

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
answer="YES"
for i in range(n-1):
  if a[i]==a[i+1]:
    answer="NO"
    break
print(answer)

Submission status: Wrong Answer

Solution code:
n, *D,  = [list(map(int, s.split())) for s in open(0)]
n, D =  n[0], D[0]
if n == len(set(D)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys

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

for i in range(1, N):
    if AList[i - 1] == AList[i]:
        print('No')
        sys.exit()
        
print('Yes')

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())
    array = list(map(int, input().split()))
    if array == list(set(array)):
        print("YES")
    else:
        print("NO")

solve()

Submission status: Wrong Answer

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

A_uniq = len(set(A))

if N==A_uniq:
  print('YES')
else:
  ('NO')

Submission status: Wrong Answer

Solution code:
def main():
	n = int(input())
	a = list(map(int,input().split()))
	a.sort()
	ans = 0
	for i in range(len(a)-1):
		if a[i] == a[i+1]:
			ans = 1
	if ans == 1:
 		print("No")
	else:
 		print("Yes")
	
 
if __name__ == '__main__':
	main()

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)

def solution(N, A):
    for i in range(N - 1):
        if A[i] == A[i + 1]:
            return "No"
    return "Yes"

print(solution(N, A))

Submission status: Wrong Answer

Solution code:
cnt = int(input())
tar_array = input().split()
tar_array.sort()

out = "YES"
tar = ""
for i in range(len(tar_array)):
  if tar == tar_array[i]:
    out = "NO"
    break

print(out)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))
check = set(a)
if len(a) == len(check):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = {}
a = list(map(int, input().split()))
flag = True
for i in range(n):
  if n in ans:
    flag = False
    break
  else:
    ans[a[i]] = 1
    
if flag:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

B=set()

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

Submission status: Wrong Answer

Solution code:
a = int(input())
n = list(map(int, input().split()))
n.sort()
d = set(n)
d = list(d)
if n == d:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n=int(input())
l1=list(map(int,input().split()))
l2=list(set(l1))
L2=len(l2)
print('Yes' if n==L2 else 'No')

Submission status: Wrong Answer

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


def main():
    n = int(input())
    if has_duplicates(list(map(int, input().split(' ')))):
        print('No')
    else:
        print('Yes')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
#a,b = map(int,input().split())
a_L = list(map(int,input().split()))
#print(a_L)
if len(a_L) == len(set(a_L)):
    print("YES")
else:
    print("No")

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A_list = [int(item) for item in input().split()]
A_set = set(A_list)

if len(A_list) == len(A_set):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(x) for x in input().split()]

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = set(A)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
nums = list(map(int, input().split()))
num_set = set(nums)
if len(nums) == len(num_set):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
n = int(input())
A = list(map(int,input().split()))
print("Yes") if len(A) == len(set(A)) else print("No")

Submission status: Wrong Answer

Solution code:
def main(n, a):
    if len(set(a)) == n:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))

    map(n, a)

Submission status: Wrong Answer

Solution code:
def main():
  N=int(input())
  A=list(map(int, input().split()))
  A=sorted(A)
  a=A[0]
  for i in range(1,N):
    if a==A[i]:
      print('No')
      return
    else:
      a=A[i]
  print('Yes')
  return

main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
n = int(input()) 

a_set = set(list(map(int, input().split())))

print("Yes" if len(a_set) == n else "No")

Submission status: Wrong Answer

Solution code:
# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()

import collections

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

if c.most_common()[0][1] == 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

a.sort(reverse=True)
f = False
for i in range(n-1):
    if a[i+1] - a[i] == 0:
        f = True
        break

if f == True:
    print('No')
else:
    print('Yes')