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()))
lst = []
for x in a:
  if x in lst:
    print('No')
    break
  lst.append(x)
else:
  print('YES')

Submission status: Wrong Answer

Solution code:
n=int(input())
List=list(map(int,input().split()))
Set=set()
for i in range(len(List)):
    Set.add(List[i])
if len(Set)==n :
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

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

a.sort()

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

Submission status: Wrong Answer

Solution code:
N=int(input())
L = [int(x) for x in input().split()]

LS=sorted(L)

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import hashlib
import math

class BloomFilter:

    def __init__(self, num_item, false_positive):
        assert 0 <= false_positive <= 1
        # Optimal number of bit array size and hash function
        # https://en.wikipedia.org/wiki/Bloom_filter#Optimal_number_of_hash_functions
        log2 = math.log(2)
        logp = math.log(false_positive)
        size = - num_item * logp / (log2 * log2)
        num_hash = size / num_item * log2

        self.size = int(math.ceil(size))
        self.num_hash = int(math.ceil(num_hash))

        self.array = self.BitArray(self.size)
        self.hash_functions = [self.HashFunction(i, self.size)
                               for i in range(self.num_hash)]

    def add(self, item):
        for hash_func in self.hash_functions:
            i = hash_func(item)
            self.array[i] = True

    def __contains__(self, item):
        return self.contains(item)

    def contains(self, item):
        for hash_func in self.hash_functions:
            i = hash_func(item)
            if self.array[i] is False:
                return False
        return True

    class BitArray:

        def __init__(self, length):
            # Allocate an object per a bit for simplicity
            self.array = [False for _ in range(length)]

        def __getitem__(self, index):
            return self.get(index)

        def get(self, index):
            return self.array[index]

        def __setitem__(self, index, bit):
            return self.set(index, bit)

        def set(self, index, bit):
            if bit > 0 or bit is True:
                self.array[index] = True
            else:
                self.array[index] = False

    class HashFunction:

        def __init__(self, seed, maximum):
            self.seed = seed.to_bytes(
                seed.bit_length() // 8 + 1, byteorder='big')
            self.maximum = maximum

        def __call__(self, byte_buffer):
            return self.call(byte_buffer)

        def call(self, byte_buffer):
            # MD5 is enough because I don't want to oneway hash function
            b = hashlib.md5(byte_buffer + self.seed).digest()
            i = int.from_bytes(b, byteorder='big', signed=False)
            return i % self.maximum

N = int(input())
L = list(map(int,input().split()))
bf = BloomFilter(num_item=5 * 10 ** 5, false_positive=0.001)

for i in L:
    I = str(i).encode()
    if I in bf:
        print("NO")
    bf.add(I)
print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    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:
def chk(nums):
  for i in nums:
    for ii in nums:
      if i == ii: return False
  return True
s = map(int, input().split())
if chk(s): print('YES')
else: print('NO')

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
l= input().split()
leng=len(l)
flag="NO"

for i in range(leng):
  #print(i)
  for ii in range(i+1, leng):
    #print(l[i],l[ii])
    if l[i] == l[ii]:
      flag="NO"
      sys.exit()
    else:
      flag = "YES"

print(flag)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

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:
if __name__ == "__main__":
    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())
l= input().split()
leng=len(l)
flag="NO"

for i in range(leng):
  #print(i)
  for ii in range(i+1, leng):
    #print(l[i],l[ii])
    if l[i] == l[ii]:
      flag="NO"
      break
    else:
      flag = "YES"

print(flag)

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    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())
l= input().split()
leng=len(l)
flag="NO"
for i in range(leng):
  for ii in range(i, leng):
    print(l[i],l[ii])
    if l[i] == l[ii]:
      flag="NO"
      break
    else:
      flag = "YES"
print(flag)

Submission status: Wrong Answer

Solution code:
n=int(input())
l= input().split()
leng=len(l)
flag="NO"
for i in range(leng):
  for ii in range(i, leng):
    #print(l[i],l[ii])
    if l[i] == l[ii]:
      flag="NO"
    else:
      flag = "YES"
      break
print(flag)

Submission status: Wrong Answer

Solution code:
n=int(input())
l= input().split()
leng=len(l)
flag="NO"
for i in range(n):
  for ii in range(i, n):
    if l[i] == l[ii]:
      pass
    else:
      flag = "YES"
      break
print(flag)

Submission status: Wrong Answer

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

data.sort()

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

print(ans)

Submission status: Wrong Answer

Solution code:

def main():
    n = input()
    an = set(map(int,input().split()))
    
    if n == len(an):
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
  	main()


'''
6
4 1 3 1 6 2
'''

Submission status: Wrong Answer

Solution code:
def the_one(n, arr):
    for i in range(0,n):
        for x in range(0,n):
            if arr[i] == arr[x] and i != x:
                return "NO"
    return "YES"

    n = int(input())
    x = input()
    arr = x.split()
    print(the_one(n, arr))

Submission status: Wrong Answer

Solution code:
N=input()
An = input()
list_An=[]
a = 0
for i in range(len(An)):
    if An[i]==" ":
        list_An.append(int(An[a:i]))
        a = i+1
list_An.append(int(An[a:len(An)]))
list_An.sort()
A = 0
print(list_An)
for i in range(len(list_An)):
    if list_An[i-1]==list_An[i]:
        print("NO")
        A = 1
        break    
if A == 0:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

distinct = True
dic = {}

for x in a:
    if x in dic:
        distinct = False
        break
    dic[x] = True

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

Submission status: Wrong Answer

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

distinct = True
dic = {}

for x in a:
    if x in dic:
        distinct = False
        break
    dic[x] = True

if distinct:
    print("YES")
else:
    print("NN")

Submission status: Wrong Answer

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

# N=6
# A = [4,1,3,1,6,2]


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

Submission status: Wrong Answer

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

import collections

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

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

Submission status: Wrong Answer

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

import collections

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

if sum(counts) == N:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
n = int(input())
numbers = []

for i in map(int,input().split()):
  numbers.append(i)

a = sorted(list(set(numbers)))
b = sorted(numbers)
  
if a == b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
n = int(input())
numbers = []

for i in input().split():
  numbers.append(i)

if set(numbers) == numbers:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

A=sorted(A)

for i in range(0,int(N/2),2):
  if len(A) >= i+1:
    if A[i] == A[i+1]:
      print("NO")
      exit(0)
print("YES")

Submission status: Wrong Answer

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

A=sorted(A)

for i in range(0,int(N/2)+1,2):
  if len(A) > i+1:
    if A[i] == A[i+1]:
      print("NO")
      exit(0)
print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A=sorted(A)

for i in range(0,int(N/2),2):
  if len(A) > i+1:
    if A[i] == A[i+1]:
      print("NO")
      exit(0)
print("YES")

Submission status: Wrong Answer

Solution code:
#入力
N = int(input())
li = list(map(int,input().split()))


S = 0
for i in range(9):
    if li.count(i) <2:
        S = S
    else:
        S = S + 1
if S == 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#入力
N = int(input())
li = list(map(int,input().split()))


S = 0
for i in range(9):
    if li.count(i) <2:
        S = S
    else:
        S = S + 1
if S == 0:
    print('Yes')
else:
    print('No')

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

def main():

    # sys.stdin = open('input154c.txt')

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines

# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np

def main():
	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")
	
	
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

c = collections.Counter(x)
w = c.values()

for i in w:
    if i >= 2:
        print("NO")
        break
    else:
        print("YES")
        break

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

# a = [1,2,3,3,2,2,1]
# s = set(a)
# print(s)
# >>[1,2,3]

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()))
dup = [x for x in set(a) if a.count(x) > 1]
if len(dup) == 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:
l1 = input().split()
l2 = set(l1)
if len(l1) == len(l2):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

a=0
for i in A:
  if A.count(i)>=2:
    print("No")
    a=1
    break

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

Submission status: Wrong Answer

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

def hash(a):
    return a%10


def check(A):
    for i in range(len(A)):
        for j in range(i, len(A)):
            if(j+1 < len(A)):
                if(A[i] == A[j+1]):
                    #print("%d=%d"%(A[i], A[j]))
                    flag = True
                    return 'NO'

    return 'YES'

arr = [[] for i in range(10)]

for i in A:
    arr[hash(i)].append(i)

for i in arr:
    flag = False
    if(check == 'YES'):
        print("YES")
        flag = True
        break
if(not flag):
    print("NO")

Submission status: Wrong Answer

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

ans = list(set(lis))

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

Submission status: Wrong Answer

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

def main():
    flag = 0
    for i in range(len(A)-1):
        for j in range(i+1, len(A)):
            if A[i] == A[j]:
                flag = 1
                break
            else:
                continue
        break

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


if __name__ == "__main__":
    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:
L=list(map(int,input().split()))
L=sorted(L)
v=0
for i in range(len(L)-1):
    if L[i+1]-L[i]==0:
        v=1
if v==1:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
s = input().split()
s_set = set(s)
s_ans = list(s_set)
 
if s == s_ans:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

print('Yes' if len(S) == len(setS) else 'No')

Submission status: Wrong Answer

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

dic = {}

for i in lis:
    dic[i] = dic.get(i, 0) + 1
    if dic[i] != 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
dic={}
n=int(input())
s=input()
for i in range(len(s)):
    if s[i]!=" ":
        if dic.get(s[i],0)==0:
            dic[s[i]]=1
            #print(dic)
        else:
            print("NO")
            #print("*",dic)
            exit()
print("YES")

Submission status: Wrong Answer

Solution code:
dic={}
n=int(input())
s=input()
for i in range(len(s)):
    if s[i]!=" ":
        if dic.get(s[i],0)==0:
            dic[s[i]]=(i+1)//2
        else:
            print("NO")
            exit()
print("YES")

Submission status: Wrong Answer

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

h = {}
ans = 'Yes'
for i in range(N):
    a = h.get(A[i], 0)
    if a != 0:
        ans = 'No'
        break
    h[A[i]] = A[i]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
A.sort()
def yabaton(a):
  n = len(a)
  for i in range(n-1):
    if a[i] == a[i+1]:
      return 'NO'
  return 'YES'
yabaton(A)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
A.sort()
def yabaton(a):
  n = len(a)
  for i in range(n-1):
    if a[i] != a[i+1]:
      return 'NO'
  return 'YES'
yabaton(A)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
A.sort()
def yabaton(a):
  n = len(a)
  for i in range(n-1):
    if a[i] != a[i+1]:
      return 'NO'
  return 'YES'

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
def yabaton(A):
  n = len(A)
  for i in range(0,n-1):
    for j in range(i+1,n):
      if A[i] == A[j]:
        return 'NO'
  return 'YES'
yabaton(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.sort()
if a[n-1]>=a[n-2] + a[n-3]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))
a=sorted(a)
for idx, i in enumerate(a[:-1]):
    if i == a[idx+1]:
        print('NO')
        break
if idx == n - 2:
    print('YES')

Submission status: Wrong Answer

Solution code:
S = set()
for a in map(int, input().split()):
  if a in S:
    print("NO")
    exit()
  else:
    S.add(a)
print("YES")

Submission status: Wrong Answer

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

s.sort
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        ans = False
        break
    else:
        continue
if ans:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
length=input()
#len-1
Narray=sorted(input().split())
n=0
while n<int(length)-2:
	if Narray[n] == Narray[n+1]:
		print("NO")
		break
	elif n==int(length)-2:
		print("YES")
		break
	else:
		n+=1

Submission status: Wrong Answer

Solution code:
n=input()
nums=list(map(int, input().split()))
nums.sort()
res = True
prev = None
for i in nums:
    if i == prev:
        res = False
    else:
        prev = i
if res:
    "YES"
else:
    "NO"

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = set(input().split())
if n == s:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
# C
import numpy as np
import itertools
N = int(input())
A = list(map(int,input().split()))

A.sort()

list_tmp=[ A[i+1]-A[i] for i in range(N-1)]

if 0 in list_tmp:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()
a = input().split()
n = int(n)
a = [int(s) for s in a]
a.sort()
#print(a)
s=0

for i in range(len(a)-1):
    #print(a[i],a[i+1])
    
    if a[i]==a[i+1]:
        print("YES")
        s=s+1
        break
        
if s == 0: print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s=0

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

Submission status: Wrong Answer

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

iranai  =input()
l   =   input()
if has_duplicates(l)==0:
	print("YES")
else:
	print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    StringN = input();
    listA = input().split();
    listA.sort();
#    newlistA = sorted(listA);
#    print(newlistA);

    for i in range(int(StringN)-1):
#        print(newlistA[i]);
#        print(newlistA[i+1]);
        if listA[i] == listA[i+1]:
            print('No');
#            print (i)
            return 0;
    print('Yes');


main();

Submission status: Wrong Answer

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

iranai  =input()
l   =   input()
if has_duplicates(l)== "TRUE":
	print("YES")
else:
  	print("NO")

Submission status: Wrong Answer

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


iranai  =input()
l   =   input()
print(has_duplicates(l))

Submission status: Wrong Answer

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

print('YNeos'[len(set(a))!=n::2])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    StringN = input();
    listA = input().split();
    newlistA = sorted(listA);
#    print(newlistA);

    for i in range(int(StringN)-1):
#        print(newlistA[i]);
#        print(newlistA[i+1]);
        if newlistA[i] == newlistA[i+1]:
            print('No');
            return 0;
    print('Yes');


main();

Submission status: Wrong Answer

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

iranai  =input()
l   =   input()
print(has_duplicates(l))

Submission status: Wrong Answer

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

iranai  =input()
l   =   input()
print(has_duplicates(l))

Submission status: Wrong Answer

Solution code:
N = input()
M = list(map(int,input().split()))
print(M)
X = set(M)
print(X)
Y = len(X)
Z = len(M)
if Y == Z:
    print("YES")

else:
    print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    StringN = input();
    listA = input();
    newlistA = sorted(listA);

    for i in range(int(StringN)-1):
        if newlistA[i] == newlistA[i+1]:
            print('No');
            return 0;
    print('Yes');


main();

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s=int(input())
t=list(map(int,input().split()))
t.sort()
u=set(t)
a=len(t)
b=len(u)
if a!=b:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s=int(input())
t=list(map(int,input().split()))
t.sort()
u=set(t)
a=len(t)
b=len(u)
if a!=b:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()
s = input().split()
_set = set(s)
if len(s) == len(_set):
    print('Yes')
else:
    print('No')
# 被り文字をカウントする場合、集合を作り要素数をカウントする
# string[index]で文字を取る(インデクシング)できる。
# abc132A

Submission status: Wrong Answer

Solution code:
n = int(input())
suuretu = list(map(int,input().split()))
nn = frg = 0
while nn <= n-2:
    mm = nn+1
    while mm <= n-1:
        if suuretu[nn] == suuretu[mm]:
            frg = 1
            print('NO')
            break
        else:
            mm +=1
    
    if nn >= n-1:
        print('YES')
        break
    else:
        nn += 1

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

def main():
    N, *A = read().split()
    for a in A:
        if A.count(a)==1:
            continue
        else:
            result = 'NO'
            return result
    else:
        result = 'Yes'
    return result

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

Submission status: Wrong Answer

Solution code:
input_data = [input() for _ in range(2)]

set_data = set(input_data)

if len(input_data) == len(set_data):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
# C
import numpy as np
import itertools
N = int(input())
A = list(map(int,input().split()))

All_diff=[A[i]-A[j] for i,j in itertools.product(range(N),range(N)) if i<j]   

prod=np.prod(All_diff)

if int(prod)==0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

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

if has_duplicates(b) == 1:
  print("YES")
elif has_duplicates(b) == 0:
  print("NO")

Submission status: Wrong Answer

Solution code:
n = input()
s = input().split()
_set = set(s)
if int(n) == len(_set):
    print('Yes')
else:
    print('No')
# 被り文字をカウントする場合、集合を作り要素数をカウントする
# string[index]で文字を取る(インデクシング)できる。
# abc132A

Submission status: Wrong Answer

Solution code:
a=int(input())
b=list(map(int,input().split()))
i=0
c="YES"   ##ここ文字列だからくおーてーしょんいるの注意
for i in range(a):
 j=i+1
 for j in range(a):
    if b[i]==b[j]:
     c="NO" ##ここも
print(c)

Submission status: Wrong Answer

Solution code:

# input_first= 5
# input_second=[2,6,1,4,5] 
input_first = input()
input_second= input().split()
N = int(input_first)
in_list = [int(i) for i in input_second]


check_dic = {}
flag  =0
for i in in_list:
    if i in check_dic.keys():
        print(i)
        print("NO")
        flag = 1
        break
    else:
        check_dic[i] = True
    

# print(check_dic)
if flag ==0:
    print("YES")

Submission status: Wrong Answer

Solution code:
def main():
	n=int(input())
	a=list(map(int, input().split()))
	a.sort()
	c=0
	for i  in range(n):
		for j in range(n):
			if a[i] == a[j]:
				print('NO')
				c+=1
				break
			break
	if c==0:
		print('YES')
main()

Submission status: Wrong Answer

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

for i in range(n-1):
    for j in range(n-1):
        if a[i] == a[j+1] and a.index(a[i]) != a.index(a[j+1]):
            b = False

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))
ans = 'YES'
if n < 3:
	if a[0] == a[1]:
		ans = 'NO'
else:
	for i in range(1,4):
		s = a[0:i] + a[i+1:n]
		if a[i] in s:
			ans = 'NO'
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0

for i in range(a):
    if li[-1] == li[i]:
        continue
    for j in li[i+1:]:
        if li[i] == j:
            count += 1
        else:
            pass

if count > 0:
    print('NO')
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
N = input()
M = list(map(int,input().split()))
X = set(M)
Y = len(X)
if M == X:
    print("YES")

else:
    print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

# Input
s = [input() for i in range(2)]
N = int(s[0])
As = sorted(list(s[1].split()))

# Proccess
for i in range(0,N-1):
	if As[i] == As[i+1]:
		Anser = "No"
		break
	else:
		Anser = "Yes"
		
# Output							
print(Anser)

Submission status: Wrong Answer

Solution code:
d1 = int(input())
d = input().split()
d2 = [int(x) for x in d]
count=0
d2.sort()
for x in range(d1-1):

    if d2[x]==d2[x+1]:
        count+=1
        print("NO")

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
A = list(map(int,input().split()))
count1 = 1
count2 = 0
for i in range(N - 1):
  for j in range(count1,N):
    if A[i] == A[j]:
      print("YES")
      sys.exit()
    else:
      pass
  count1 += 1  
print("YES")

Submission status: Wrong Answer

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

A = sorted(A)

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:
# -*- coding: utf-8 -*-
def main():
    StringN    = input();
    listA      = input();
    newlistA   = listA.split();
    duplicateA = set(newlistA);

    if int(StringN) != len(newlistA):
        print('No');
        return 0;
    if int(StringN) == len(duplicateA):
        print('Yes');
    else :
        print('No');

main();

Submission status: Wrong Answer

Solution code:
N = input()
M = list(map(int,input().split()))
X = set(M)
Y = len(X)
if N == Y:
    print("YES")

else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys

N = int(input())
A_i = list(map(int, input().split()))
A_i = [i for i in A_i if 1 <= i and i <= 10**9]

if not 2 <= N or not N <= 2*10**5:
    print("error:N")
    sys.exit()
if len(A_i) != N:
    print("error")
    sys.exit()

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

Submission status: Wrong Answer

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

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

if(has_duplicates(L) == False):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

ans = "YES"
A.sort
for i in range(N):
    for j in range(i+1, N):
        if A[i] == A[j]:
            ans = "NO"
        if A[i] > A[j]:
            break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = list(map(int, input().split()))
D = N + 1
A = 0
while A <= N - 1:
    if a.count(a[A]) == 1:
        A += 1
    else:
        break
        print('NO')
if A == N:
    print('YES')