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=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=int(input())
a=[int(v) for v in input().split()]
check=1
a.sort()
for i in range (0,n-1):
    if a[i]==a[i+1]:
        kt=0
        break
if check==0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
number = [int(x) for x in input().split()]
sort_number = sorted(number)
s_number = list(set(number))

print("YES" if sort_number == s_number else "NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
lis=list(map(int,input().split()))
out="Yes"
for i in range(n):
  for j in range(i+1,n):
    #print("{}{}".format(i,j))
    if lis[i]==lis[j]:
      out="No"
      break
  if out =="No":
    break
print(out)

Submission status: Wrong Answer

Solution code:
n=int(input())
lis=list(map(int,input().split()))
out="Yes"
for i in range(n):
  for j in range(i+i,n):
    if lis[i]==lis[j]:
      out="No"
      break
  if out =="No":
    break
print(out)

Submission status: Wrong Answer

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

Auni = set(A)

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

Submission status: Wrong Answer

Solution code:
N =int(input())
A = list(map(int,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()))
if len(list(set(A))) == n:
  print("Yes")
else:
  print("No")

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())
a = list(input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def has_duplicates(seq):
    if len(seq) == len(set(seq)):
        print("Yes")
    else:
        print("No")
    #return len(seq) != len(set(seq))
N = int(input())
A = list(map(int,input().split()))
has_duplicates(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

S.sort()
banpei=0
for i in range(N):
    if banpei==S[i]:
        print("No")
        exit()
    else:
        banpei=S[i]
    
print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split(" ")))
Triger = 0
if len(A) > 200000:
  print("NO")
else:
  A.sort()
  for i in range(1,len(A)-1):
    if A[i] == A[i-1]:
      print("NO")
      Triger += 1
      break
  if Triger == 0:
    print("YES")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split(" ")))
Triger = 0
if len(A) > 200000:
  print("No")
else:
  A.sort()
  for i in range(1,len(A)-1):
    if A[i] == A[i-1]:
      print("No")
      Triger += 1
      break
  if Triger == 0:
    print("Yes")

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

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()))
a.sort()
s=""
r=0
for m in a:
  if m == s:
    r=1
  s=m
if r ==1:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

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

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

if(dup(li)): 
    print("No")
else:
     print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

N=int(input())
flag=True
inList=list(map(int,input().split()))
for i in range(len(inList)):
    for j in range(i,len(inList)):
        if inList[j]==inList[i]:
            print('NO')
            flag=False
            break
    if not flag:
        break

if flag:
    print('YES')

Submission status: Wrong Answer

Solution code:
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):
#   return len(seq) != len(set(seq))

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

# # 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=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')

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) == True:
  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 - 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()

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
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
if cnt:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = "Yes"
x = {}
for i in a:
    if x.get(i, False):
        ans = "No"
        break
    x[i] = True

print(ans)

Submission status: Wrong Answer

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

x = {}
for i in a:
    if x.get(i, False):
        print("No")
        break
    x[i] = True
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())

n_list = map(int,input().split())
n_set = set(n_list)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
n = int(input())
d = defaultdict(int)
A = list(map(int,input().split()))

for a in A:
    if d[a] == 1:
        print('No')
        exit()
    else:
        d[a] += 1

print('Yes')

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(i) for i in 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()))

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

Submission status: Wrong Answer

Solution code:
n = int(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:
def main():
    n = int(input())
    print("Yes" if n == len(set(map(int, input().split()))) else "No")
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C
from collections import Counter
N=int(input())
A=[int(x) for x in input().split()]

A_C=Counter(A)

flag=True
for i,v in A_C.items():
    if v!=1:
        flag=False
        break
if flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input().split()
if N == set(S):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n=int(input())
a=input().split()
i=0
t=0
for i in a:
    if a.count(i)==1:
        t+=1
        if t==n:
            print('Yes')
        else:
            continue
    else:
        print('No')
        break

Submission status: Wrong Answer

Solution code:
n = int(input()) 
a = list(map(int, input().split()))
at = sorted(a)
if len(a) == 1:
	print('YES')
elif len(a) == len(at):
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

Solution code:
n = int(input()) 
a = list(map(int, input().split()))
at = sorted(a)
if len(a) == len(at):
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input().split()
b = len(set(a))
print(b)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = list(map(int, input().split()))
sl = sorted(l)
if len(l) == len(sl):
    print('YES')
else:
    Print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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 = 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')

Submission status: Wrong Answer

Solution code:
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    n = int(sys.stdin.readline())
    A = list(map(int,sys.stdin.readline().split()))
    num_dict = {}
    flag = True
    for x in A:
        if not x-1 in num_dict:
            num_dict[x-1] = x-1
        else:
            flag = False
            break
    print("Yes") if flag else print("No")
    return 0

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from itertools import combinations as comb
n = int(input())
a = list(map(int,input().split()))

isBad = False
for x,y in comb(a,2):
    if(x==y):
        isBad = True

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

Submission status: Wrong Answer

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

a=True
for i in range(N):
    b=A[0]
    A.remove(b)
    if (b in A)==True:
        print("No")
        a=False
        break
if a==True:
    print("Yes")

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")
        break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())
l = list(map(int,input().split()))
d = {}
for i in l:
    if i in d:
        d[i] += 1
    if i not in d:
        d[i] = 1
length = len(d)
if length ==n:
    print("YES")
else:
    print("NO")
print(d)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = list(map(int,input().split()))
d = {}
for i in l:
    if i in d:
        d[i] += 1
    if i not in d:
        d[i] = 1
length = len(d)
if length ==n:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result = True

a.sort()

for i in range(len(a)-1):
    if a[i] == a[i+1]:
        result = False
        break

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
l = [int(x) for x in raw_input().split()]
ret = "YES"
i = 0
while i + 1 < n:
    if l[i] == l[i+1]:
        ret = "NO"
    i += 1
print ret

Submission status: Wrong Answer

Solution code:
N = int(input())
L = [map(int,input().split())]
if len(set(L)) == N:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

import collections
c = collections.Counter(A)

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10**7)

def run():
    N = int(input())
    A = list(map(int, sysread().split()))
    A = sorted(A)
    for i in range(N-1):
        if A[i] == A[i+1]:
            print('No')
            return None
    print('Yes')


if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
n = int(input())
a = set( 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().strip().split()))

c = 0

for i in range(N - 1):
    for j in range(N - 1 - i):
        if A[i] == A[j + i + 1]:
            print('No')
            c += 1
            break

if c != 1:
    print('Yes')

Submission status: Wrong Answer

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


a = len(A)
c = 0

for i in range(a - 1):
    for j in range(a - 1 - i):
        if A[i] == A[j + i + 1]:
            print('No')
            c += 1
            break

if c != 1:
    print('Yes')

Submission status: Wrong Answer

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

a = len(A)
cnt = 0
for i in range(a - 1):
    for j in range(a - 1 - i):
        
        if A[i] == A[j + i + 1]:            
            cnt += 1
        
if cnt > 0:
    print('No')
else:
    print('Yes')

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:
from collections import Counter

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

if [1 ** N] == Counter(A).values():
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

if [1 ** N] == Counter(A).values():
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# input
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:
S=int(input())
T = input().split()
U = [int(i) for i in T]
U.sort
r = 0

for i in range(S-1):
  if(T[i] == T[i+1]):
    r+=1
    
if(r==0):
  print("YES")
else:
  print("NO")

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a_list = list(map(int, input().split()))
a_hash = {}
for a in a_list:
    if a in a_hash:
        print("No")
        exit()
    a_hash[a] = True
print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
A.sort()
#print(A)
yesno = 'NO'
for i in range(len(A)-1):
    if A[i]==A[i+1]:
        yesno = 'YES'
        break
print(yesno)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
A.sort()
#print(A)
yesno = 'No'
for i in range(len(A)-1):
    if A[i]==A[i+1]:
        yesno = 'Yes'
        break
print(yesno)

Submission status: Wrong Answer

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

set_a = set(a)

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

Submission status: Wrong Answer

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

import collections
dic = collections.Counter(a)

if max(dic.values()) == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a_list1=sorted(a)

a_set=set(a_list1)

a_list2=list(a_set)


if a_list1==a_list2:
    print('YES')
        
else:
    print('NO')

Submission status: Wrong Answer

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

a_list1=sorted(a)

a_set=set(a)

a_list2=list(a_set)

if a_list1==a_list2:
    print('YES')
    
else:
    print('NO')

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()
  else:
    pass
print('Yes')

Submission status: Wrong Answer

Solution code:
import numpy as np
from collections import defaultdict

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

d = defaultdict(int)

for i in range(n):
    d[a[i]] += 1

print("Yes") if max(d.values()) == 1 else print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
set_1 = set()
list_1 = list(map(int, input().split(' ')))

for item in list_1:
  set_1.add(item)

if len(list_1) == len(set_1):
  print("Yes", end="")
else:
  print("No", end="")

Submission status: Wrong Answer

Solution code:
N = int(input())
set_1 = set()
list_1 = list(map(int, input().split(' ')))

for item in list_1:
  set_1.add(item)

if len(list_1) == len(set_1):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

def count(x):
    if len(s) != len(set(x)):
        return print("NO")
    else:
        return print("YES")

Submission status: Wrong Answer

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

a = 0
for i in range(len(s)):
    if s.count(s[i]) == 1:
        a = 1
        break

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = list(map(int,input().split()))
a = 0
for i in range(len(s)):
    for j in range(i,len(s)):
        if s[i] == s[j]:
            a = a + 1
if a >= 1:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
d = []
p = 0
for i in range(N):
    d.append(A[i])
    if A[i] in d:
        p = 1
        break
if p == 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input()

a=list(map(int, input().split())) #スペース区切りの数字をlistで取得

if int(len([i for i in a if a.count(i) >= 2])) !=0:
    print("No")
else :
    print("Yes")

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

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

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

Submission status: Wrong Answer

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

result = True

for char in A:
    if(A.count(char) != 1):
        result = False
        break

if (result == True):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

A.sort()

flag = True
for i in range(len(A) - 1):
    if A[i] == A[i + 1]:
        flag = False
        break
    
if flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

A.sort()

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

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())  # 文字列または整数(一変数)
    A = list(map(int, input().split()))  # 整数のリスト

    d = {}

    for i in A:
        if not i in d.keys():
            d[i] = None
        else:
            print("No")
            return
    else:
        print("YES")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import Counter
def solve():
    N = int(input())
    A = set(map(int,input().split()))
    if N == len(A):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

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

match = False
for i in range(1, N):
    if A[i] == A[i-1]:
        match = True
        break

if not match:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())

A = []
ans = True
for i in input().split():
    if int(i) in A:
        ans = False
        break
    else:
        A.append(int(i))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
arr=[int(x) for x in input().split()]
arr1=set(arr)
if arr1==arr:
  print("YES")
else:
  print("NO")