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'
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if a[i]==a[j]:
            print(a[i],a[j])
            ans="No"
            break
print(ans)

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:
import heapq

N = int(input())
A = list(map(int, input().split()))
res = "YES"
heapq.heapify(A)
for i in range(len(A)):
    if i == 0:
        continue
    if A[i] == A[i-1]:
        res = "NO"
        break
    else:
        continue
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(input().split())
for i in range(n):
  for k in range(i+1,n):
    if a[i] == a[k]:
      print("No")
      exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
def distinct_or_not(a_list):
    tmp_list = []
    for a in a_list:
        if a not in tmp_list:
            tmp_list.append(a)
        else:
            return 'No'
    return 'Yes'

n = int(input())
a_list = [int(a) for a in input().split()]

print(distinct_or_not(a_list))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    a = list(map(int, input().split()))
    tmp = {}
    is_unique = True
    for i in range(n):
        if not a[i] in tmp:
            is_unique = False
            break
        tmp[a[i]] = a[i]
    
    if is_unique:
        print("YES")
    else:
        print("NO")


if __name__=="__main__":
    main()

Submission status: Wrong Answer

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

base = len(set(num_list))

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

print(ans)

Submission status: Wrong Answer

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

base = len(set(num_list))

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

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=input().split()
a=[]
for i in range(len(A)):
  x=int(A[i])
  a.append(x)
for i in range(N):
  if a[i] in a[i+1:]:
    print("NO")
  else:
    print("YES")

Submission status: Wrong Answer

Solution code:
N=int(input())
A=input().split()
a=[]
for i in range(len(A)):
  x=int(A[i])
  a.append(x)
for i in range(N):
  if a[i] in A[i+1:]:
    print("NO")
  else:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
n = int(input())
a = list(map(int,input().strip().split()))
if Counter(a).most_common(1)[0][1] != 1:
    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())
a=sorted(list(map(int,input().split())))
unt=False
for i in range(0,n-1):
    if a[i]==a[i+1]:
        unt=True
if unt:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
b=0
for j in range(n):
  for k in range(n):
    if a[j]==a[k] and j!=k:
      b+=1
      break
    break
if b==0:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int() for i in input().split()]
b=0
for j in range(n):
  for k in range(n):
    if a[j]==a[k] and j!=k:
      b+=1
if b==0:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N=int(input())
lis = list(map(int, input().split()))
j = 'YES'
lis_s = set(lis)
if len(lis) != len(lis_s):
  j == 'NO'
print(j)

Submission status: Wrong Answer

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

inList.sort()

noFlag = 0

for indx in range(len(inList) - 1):
  if inList[indx] == inList[indx + 1]:
    print("No")
    noFlag = 1
    break

if noFlag == 0:
  print("Yes")

Submission status: Wrong Answer

Solution code:
n,*l=open(0).read().rstrip()

print("YES" if int(n)==len(set(int(g) for g in l if g not in ["\n"," "])) else "NO")

Submission status: Wrong Answer

Solution code:
n=input()
t=input().split()
if len(set(t))==n:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
t=input().split()
m=t.pop(0)
n=int(m)
if len(set(t))==n:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
t=input().split()
m=t.pop(0)
n=int(m)
if len(set(t))==n:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
t=input().split()
n=int(t.pop(0))
if len(set(t))==n:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
t=input().split()
del t[0]
t.sort()
n=len(t)
p=0
for i in range(n-1):
    if t[i]==t[i+1]:
        p+=1
        
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
import collections

N = int(input())
l = list(map(int, input().split()))
c = collections.Counter(l)
if len(c) == len(l):
  print("YES")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
t=list(input().replace(" ",""))
del t[0]
t.sort()
n=len(t)
p=0
for i in range(n-1):
    if t[i]==t[i+1]:
        p+=1
        
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
t=list(input().replace(" ",""))
n=len(t)
p=0
for i in range(1,n):
    j=i+1
    while j<=n-1:
        if t[i]==t[j]:
            p+=1
        j+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
t=list(input().replace(" ",""))
n=len(t)
p=0
for i in range(1,n):
    for j in range(i+1,n):
        if t[i]==t[j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
t=list(input().replace(" ",""))
n=len(t)
p=0
for i in range(1,n):
    for j in range(1,i-1):
        if t[i]==t[j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
t=list(input().replace(" ",""))
n=len(t)
p=0
for i in range(1,n):
    for j in range(1,i):
        if t[i]==t[j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
n=input()
lst=len(set(input().split()))
if n==lst:
    print("YES")
else:  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
t=list(input())
import math
n=int(math.ceil((len(t)+1)//2))
p=0
for i in range(1,n):
    for j in range(1,i):
        if t[2*i]==t[2*j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
t=list(input())
n=int((len(t)+1)//2)
p=0
for i in range(1,n):
    for j in range(1,i):
        if t[2*i]==t[2*j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
t=list(input())
n=int((len(t)+1)/2)
p=0
for i in range(1,n):
    for j in range(1,i):
        if t[2*i]==t[2*j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
a = [int(i) for i in input().split()]

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

flag = True
a.sort()
for i in range(n - 1):
    if a[i] == a[i + 1]:
        flag = False
if flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

duplicate_list = [x for x in set(An) if An.count(x) > 1]

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

Submission status: Wrong Answer

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

if c.most_common()[0][1] > 2:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
from collections import Counter

# Initializing variables
n = int(input())
ai = list(map(int, input().split()))
c = max(Counter(ai).values())

# Calculating if the input is pairwise distinct or not
if c > 1:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = list(map(int,input().split()))
c = set(b)

if len(b) == len(c):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい

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

ans = True
for i in range(len(A)-2):
    if A[i] == A[i+2]:
        ans = False
        break
        
if ans:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

count = 0

for i in range(n-1):
    if a[i] == a[i + 1]:
        count += 1
if count == 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

count = 0

for i in range(len(a)-1):
    if a[i] == a[i + 1]:
        count += 1
if count == 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 len(a)==len(b):
    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())
L=list(map(int,input().split()))
if N==set(L):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

past = -1
can = True

for ai in a:
    can &= ai != past
    past = ai

print("YES" if can else "NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
count = int(input())
n_sequence = sorted([int(x) for x in input().split()])

for n in range(count):
    if (n_sequence[n-2] == n_sequence[n-1]) or (n_sequence[n-1] == n_sequence[n]) \
       or (n_sequence[n-2] == n_sequence[n]):
        print("NO")
        break
else:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = input()
A = list(map(int,input().split()))
ans = "YES"
for i in range (len(A)):
    for j in range(i, len(A)):
        if A[i] == A[j]:
            ans = "NO"
print(ans)

Submission status: Wrong Answer

Solution code:
kazu1 = int(input())
kazu2 = list(map(int, input().split()))

try:
    kazu2.index(kazu1)
    print('YES')
except ValueError:
    print('NO')

Submission status: Wrong Answer

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


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

flg = has_duplicates(a)

if flg:
    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[i+1:]:
    print('NO')
else:
  print('YES')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

list_2 = list(set(list_1))

list_1.sort()

if list_1 == list_2:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

list_2 = list(set(list_1))

list_1.sort()

if list_1 == list_2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

num = len(list_1)
num_2 = len(set(list_1))

if num == num_2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

b = list(set(a))

if sorted(a) == sorted(b):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = A
if len(B) == len(list(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:
from sys import stdin


def get_result(data):
    N, A = data[0], data[1]
    return 'Yes' if len(list(set(A))) == len(A) else 'NO'

if __name__ == '__main__':
    raw_data = [val.rstrip('\n') for val in stdin.readlines()]
    data = [list(map(int, val.split(' '))) for val in raw_data]
    result = get_result(data)
    print(result)

Submission status: Wrong Answer

Solution code:
from sys import stdin


def get_result(data):
    N, A = data[0], data[1]
    return 'Yes' if len(list(set(A))) == N[0] else 'NO'

if __name__ == '__main__':
    raw_data = [val.rstrip('\n') for val in stdin.readlines()]
    data = [list(map(int, val.split(' '))) for val in raw_data]
    result = get_result(data)
    print(result)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=set(map(int,input().split()))
print("YES") if len(a)==n 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 print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
d=dict()
s=list(map(int,input().split()))
for i in s:
  if i in d:
    d[i]=2
  else:
    d[i]=1
if 2 in d.values():
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
s=input()
l=input().split()
from collections import Counter
l=Counter(l)
if len(l)!=s:
    print("NO")
    exit(0)
print("YES")

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
flag=False
for j in range(n):
  if j<n-1:
    if a[j]==a[j+1]:
      flag=True
      break
if flag:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
flag=False
for j in range(n):
  if j<n-1:
    if a[j]==a[j+1]:
      flag=True
if flag:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
n = input()
n = input().split()
s=set()
for c in n:
	if c in s:
		print("NO")
		break
	s.add(c)
print("YES")

Submission status: Wrong Answer

Solution code:
flag = True
n = int(input())

a = input().split()

a.sort()

start = 0
for i in a:
    start += 1
    for j in a[start-1:start+1]:
        if i == j:
            flag = False
            break
            
if flag:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
line1 = input()
line2 = input()
num_list = line2.split(" ")

for num in num_list:
    if num_list.count(num) >= 2:
        print("NO")
        break
print("YES")

Submission status: Wrong Answer

Solution code:
input1 = int(input())
input2 = list(map(int,input().split()))
temp = len(input2)

input2.sort()

if temp == len(input2):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N = input().split()
if len(N)==len(set(N)):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
N = input().split()
if N==N:
  print('NO')
else:
  print('YES')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
As=[int(i) for i in range(N)]

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

Submission status: Wrong Answer

Solution code:
a = input()
b = input().split()
c = 0
for i in a:
    for l in a:
        if i == l:
            c += 1
if c > 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(x) for x in input().split()]
a.sort()
flag = 0
for i in range(n-1):
    if a[i] == a[i+1]:
        flag = 1
if flag:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0

a.reverse()
for i in range(n-1):
    if a[0] - a[1] == 0:
        print("NO")
        x = 1
        break
    a.pop(0)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0

a.reverse()
for i in range(n-2):
    if a[-1] - a[-2] == 0:
        print("NO")
        x = 1
        break
    a.pop()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0

a.reverse()
for i in range(n-1):
    if a[-1] - a[-2] == 0:
        print("NO")
        x = 1
        break
    a.pop()

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

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
b = list(int(x) for x in input().split())
a = np.array(b)
x = 0
for i in range(n):
    if (a[0] in np.delete(a, 0)) is True:
        print("NO")
        x = 1
        break

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

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
a = list(int(x) for x in input().split())

x = 0
for i in range(n):
    if (a[0] in np.delete(a, 0)) is True:
        print("NO")
        x = 1
        break

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0
for i in range(n):
    if a[0] in a is True:
        print("NO")
        x = 1
        break
    a.pop(0)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(int(x) for x in 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")

Submission status: Wrong Answer

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

c=b.copy()
c=set(c)
if len(b)!=len(c):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []

tmp = input().split()

for i in range(N):
  A.append(int(tmp[i]))
    
A.sort()

hantei = True

for i in range(N):
  tmp = i
  if i == tmp:
    hantei = False
    
if hantei == True:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())
List = list(map(int, input().split()))
for i in range(n - 1):
    for j in range(n - i - 2):
        if List[i] == List[i + j]:
            print('NO')
            exit()

print('YES')

Submission status: Wrong Answer

Solution code:
n = int(input())
List = list(map(int, input().split()))
for i in range(n - 1):
    for j in range(n - i - 1):
        if List[i] == List[i + j]:
            print('NO')
            exit()

print('YES')

Submission status: Wrong Answer

Solution code:
def solve(n, a):
    for i in range(n-1):
        if a[i] == a[i+1]:
            return "NO"
    return "YES"

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

Submission status: Wrong Answer

Solution code:
import sys

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

A.sort()
i = 0
while i<N-1:
    if A[i]==A[i+1]:
        print('No')
        sys.exit()
    else:
        i = i+1
print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
b = (int(x) for x in input().split())
a = list(b)
x = 0
for i in range(n):
    for j in range(n - i - 1):
        if a[i] == a[i + j + 1]:
            print("No")
            x = 1
            break
 
if x == 0:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())
b = (int(x) for x in input().split())
a = list(b)
x = 0
for i in range(n):
    if a.count(a[i]) != 1:
        print("No")
        x = 1
        break

if x == 0:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())
b = (int(x) for x in input().split())
a = list(b)
x = 0
for i in range(n):
    if a.count(a[i]) != 1:
        print("Yes")
        x = 1
        break

if x == 0:
    print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
b = (int(x) for x in input().split())
a = list(b)
x = 0
for i in range(n):
    if a.index(a[i]) != 1:
        print("Yes")
        x = 1
        break

if x == 0:
    print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
b = (int(x) for x in input().split())
a = list(b)
x = 0
for i in range(n):
    for j in range(n - i - 1):
        if a[i] == a[i + j + 1]:
            print("Yes")
            x = 1
            break

if x == 0:
    print("No")

Submission status: Wrong Answer

Solution code:
n=input()
m=input()
if m in n == True:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n=input()
m=input()
if n in m == True:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np

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

if len(np.unique(An)) == n:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num = input()
list = list(map(int,input().split()))
flg  = False
for i in list:
  if list.count(i) >= 2:
  	flg = True
    
if flg:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
num = input()
list = list(map(int,input().split()))
flg  = False
for i in list:
  if list.count(i) >= 2:
  	flg = True
    
if flg:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())
s_nums = input().split(" ")
nums = []
for i in range(len(s_nums)):
  if s_nums[i] not in nums:
    nums.append(s_nums[i])

if len(s_nums)==l:
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
A = list(map(int, input().split()))
l = collections.Counter(A)
if N == len(l):
    print("Yes")
elif N != len(l):
    print("No")

Submission status: Wrong Answer

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

ans = 'YES'

for i in range(n):
    for j in range(i, n-i):
        if a[i] == a[j]:
            ans = 'NO'
            break

print(ans)

Submission status: Wrong Answer

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

ans = 'YES'

for i in range(n):
    for j in range(n-i):
        if a[i] == a[j]:
            ans = 'NO'

print(ans)

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = input()
words = list(input().split())

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

Submission status: Wrong Answer

Solution code:
N = int(input())
P = list(map(int, input().split()))
count = 1
for i in range(1, N):
  if P[i] <= min(P[0:i]):
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N=(int)(input())
A=(input()).split()
A.sort()
 
for i in range(N-1):
  if A[i]==A[i+1]:
    print('NO')
  if i==N-2:
    print('YES')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

list=[]
cnt=0
for a in A:
    if a in list:
        print('No')
        break
    else:
        list.append(a)
        cnt+=1
if cnt==N:
    print('Yes')

Submission status: Wrong Answer

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


list=[]
cnt=0
for a in A:
    if a in list:
        print('No')
        break
    else:
        list.append(a)
        cnt+=1
if cnt==N:
    print('Yes')

Submission status: Wrong Answer

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

print(A)

list=[]
cnt=0
for a in A:
    if a in list:
        print('No')
        break
    else:
        list.append(a)
        cnt+=1
if cnt==N:
    print('Yes')