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:
def main():
    N = int(input())
    A = [int(i) for i in input().split()]
    s = set()
    for i in range(N):
        s.add(A[i])

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

judge = True
if len(A) != len(set(A)):
    judge = False
if judge == True:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

A = sorted(A)
fl = True

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

print ('Yes' if fl else 'No')

Submission status: Wrong Answer

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

for x in a:
    d[x] = d.get(x, 0) + 1

t = max(d.values())

print("Yes") if t == 1 else print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
input()
lst = input().split()
dic = dict(Counter(lst))
x = max(list(dic.values())) - 1
if x:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
from collections import Counter
input()
lst=input().split()
dic=dict(Counter(lst))
x=max(list(dic.values()))-1
if x:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
from collections import Counter
input()
lst=list(map(int,input().split()))
dic=dict(Counter(lst))
x=max(list(dic.values()))-1
if x:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
import sys
from collections import Counter
N=int(input())
l=input().split()
l=Counter(l)
l=l.most_common()

c=len(l)
d=0

for i in l:
    if i[1]==1:
        d+=1
if d==c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
from collections import Counter
N=int(input())
l=input().split()
l=Counter(l)
l=l.most_common()
for i in l:
    if i[1]==1:
        continue
    else:
        print('No')
        sys.exit()
print('yes')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input().split()
x = 0
for i in a:
    b = a.pop(0)
    if b in a:
        x += 1
        break
if x == 1:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split(" ")))
A.sort()
same = False
for i in range(N - 1):
  if A[i] == A[i + 1]:
    same |= True
print('YES' if same else 'NO')

Submission status: Wrong Answer

Solution code:
N=int(input())
ls=[int(s) for s in input().split()]
s=set(ls)
if len(s)==N:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
n = input()
num_list = list(map(int,input().split()))
num_list = np.sort(num_list)

flag = False
for i in range(len(num_list)):
    if i == len(num_list)-1:
        break
    
    if num_list[i] == num_list[i+1]:
        flag = True
        break
        
if flag:
    print('No')

else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import sys

n=int(input())

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

for i in range(len(a)-1):
  for j in range(i+1,len(a)):

    if a[i]==a[j]:
      print("No")
      sys.exit()

print("Yes")

Submission status: Wrong Answer

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

if len(set(b))==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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

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

d = {}
for i in m:
    if i in d:
        print("No")
        exit(0)
    d[i] = 1
print("Yes")

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n = ii()
A = iil()

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()))	
l = list()

l = sorted(a)
answer = max(x - y for x, y in zip(l, l[1:]))
if answer == 0:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
n = int(input())

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

set_a = list(set(a))

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

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    A = list(map(int,input().split()))
    B = set(A)
    C = len(B)
    if N == len(set(A)):
        print("Yes")
    else:
        print("No")
    # Uniqueにする
    # 　Aとlennを比較数
    # countsu

main()

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
numlist = list(map(int, input().split()))

numlist.sort()
for i in range(N-1):
    if numlist[i] == numlist[i+1]:
        print('No')
        sys.exit()

print('Yes')

Submission status: Wrong Answer

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

if c.most_common()[0][1] == 1:
    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)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
#s = [input().split() for i in range(n)] 
s = list(map(int, input().split()))
print(s)
t = set(s)
if len(t) == len(s):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(input().split())
while A!=[]:
    a = A.pop()
    if A.count(a) > 0:
        print('No')
        exit()
print('YES')

Submission status: Wrong Answer

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

i = 0
while i < n:
  j = i+1
  while j < n:
    if a_list[i] == a_list[j]:
      print("No")
      exit()
    j += 1
  i += 1

print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())

print("Yes" if len(set(input().split())) == n  else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
from collections import Counter
N = int(input())
a = list(map(int,input().split()))
A = Counter(a)
for v in A.values():
  if v >= 2:
    print('No')
    exit()
print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import collections
N=int(input())
A=list(map(int,input().split()))
A=collections.Counter(A)
A=A.most_common()
na=A[0][1]
if na==1:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import collections
N=int(input())
A=list(map(int,input().split()))
A=collections.Counter(A)
A=A.most_common()
na=A[0][1]
if na>=2:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
ans=1
for i in A:
  if A.count(i)>=2:
    ans=0
if ans==1:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
array = list(map(lambda x: int(x), input().split()))

are_all_different = True

for n in range(N):
    print(array.count(array[n]))
    if array.count(array[n]) >= 2:
        are_all_different = False

if are_all_different:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = []
for x in A:
    if A.count(x)>1:
        print("NO")
        B.append(0)
        break
    
    elif A.count(x) == 1:
        if x == N:
            print("YES")
            B.append(0)
            break
if len(B) == 0:
    print("NO")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = False
for x in A:

    if A.count(x) > 1:
        B = False
        break
    
    elif N == x:
        B = True
        break
if B:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a.sort()

ans = 'Yes'
for i in range(n-1) :
  if a[i] == a[i+1] :
    ans = 'No'

print(ans)

Submission status: Wrong Answer

Solution code:
import collections

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

a_dict = collections.Counter(a)

if max(a_dict.values()) > 1:
    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 = int(input())
x = list(map(int,input().split()))
y = len(x)
y = y - 1
for i in range(y):
    for j in range(y):
        if x[i] == x[j]:
            print("NO")
            exit()
print("YES")

Submission status: Wrong Answer

Solution code:
import time
start = time.time()

n = int(input())
a = list(map(int, input().split()))
# a = [i for i in range(n)]
st = set()
for i in range(n):
    st.add(i)
if len(st) == n: print("YES")
else: print("NO")

# print(time.time() - start)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
lst = []
flug = True
for i in range(n):
    if a[i] in lst:
        flug = False
        break
    lst.append(a[i])
if flug: print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
from __future__ import print_function

import sys

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd
# fractions.gcd() を用いること
# math.log2()はatcoderでは対応していない．留意せよ．

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


def lcm(n, m):
    return int(n * m / gcd(n, m))


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def main():
    # input
    n = int(input().strip())
    a = list(map(int, input().strip().split()))

    # check if "for all i in [0,n-1], C[a[i]] == 0"
    C = Counter()
    for i in range(n):
        if C[a[i]] != 0:  # fail
            print("No")
            return
        else:             # pass
            C[a[i]] += 1
    print("Yes")
    return


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = input()
y = map(int, input().split())
k = list(y)
t = len(set(k))
q = len(k)

if q > t:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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


set = set(list)

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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


while True:
    try:
        a = a_list.pop()
    except IndexError:
        print("Yes")
        exit()

    if a in a_list:
        print("No")
        exit()

Submission status: Wrong Answer

Solution code:
import sys

def binary_search(li, item):
  low = 0
  high = len(li) - 1
  
  while low <= high:
    mid = (low + high) // 2
    guess = li[mid]
    if item == guess:
      return True
    if item < guess:
      high = mid-1
    else:
      low = mid+1
  return False

n = int(input())
a_li = list(map(int, input().split()))
a_li.sort()
for a in a_li:
  if binary_search(a_li, a) == True:
    print("NO")
    sys.exit()
print("YES")

Submission status: Wrong Answer

Solution code:
N = int(input())
c = 0
A = list(map(int,input().split()))
ans = {}
for i in range(N):
    a = A[i]
    if a not in ans:
        ans[a] = 1
    else:
        c = 1
        break
if c == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

    c = collections.Counter(a_list)    

    ans = c.most_common(1)

    if ans[0][1] >= 2:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
nums = list(map(int,input().split()))
c = 0
nums = sorted(nums)

for i in range(n-1):
    if nums[i] == nums[i+1]:
        c += 1
        break
    
if c != 0:
    print('No')

else:
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = (int(x) for x in input().split())
flag = False

def f(x, l):
  if x in l:
    flag = true

a = map(f, A)

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = (int(x) for x in input().split())
flag = False

def f(x, l):
  if x in l:
    flag = true

map(f, A)

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = (int(x) for x in input().split())
flag = False

def f(x, l):
  if x in l:
    flag = true

map(f, A)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0
for i in A:
    for j in A[count+1:]:
        if i == j:
            print("Yes")
            break
    else:
        count += 1
        continue
    break
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
from collections import Counter

# 最頻値
def mode(list):
    c = Counter(list)
    freq_scores = c.most_common()
    max_count = freq_scores[0][1]
    modes = []
    for num in freq_scores:
        if num[1] == max_count:
            modes.append(num[0])
    return(modes)

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

Submission status: Wrong Answer

Solution code:
import sys
from itertools import groupby


def input():
    return sys.stdin.readline()[:-1]


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


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
  a.append(x.replace('\n', ''))
arra = a[1].split(' ')
arra = [int(x) for x in arra]
if arra == set(arra):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
  a.append(x.replace('\n', ''))
arra = a[1].split(' ')
dump = []
res = 'YES'
for x in range(int(a[0])):
  if x in dump:
    res = 'NO'
  dump.append(x)
print(res)

Submission status: Wrong Answer

Solution code:
import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
  a.append(x.replace('\n', ''))
arra = a[1].split(' ')
dump = []
res = 'YES'
for x in range(int(a[0])):
  if x in dump:
    res = 'NO'
    break
  dump.append(x)
print(res)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(judge(array,s))

Submission status: Wrong Answer

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

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

print(judge(array,s))

Submission status: Wrong Answer

Solution code:
n = int(input())
A = list(map(int,input().split()))
for a in A:
  if A.count(a) != 1:
    print('No')
    break
else:
  print('Yes')

Submission status: Wrong Answer

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

for i in A:
    C = A.count(i)
    if C > 1:
        flug = True

if flug == True:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N = int(input())
flug = False
a = input().split()
A = []
for i in range(N):
    A.append(a[i])

for i in A:
    C = A.count(i)
    if C > 1:
        flug = True

if flug == True:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if len(set(A)) == 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()))
B=Counter(A)
print(len(A))
print(len(B))
if len(A)==len(B):
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
import sys

#S,T = stdin.readline().rstrip().split()
#A,B = [int(x) for x in stdin.readline().rstrip().split()]
N = stdin.readline().rstrip().split()
s = list(map(int,input().split()))
dict={}
for _,i in enumerate(s):
  #print( dict.get(i))
  if dict.get(i)==None:
    dict[i]=1
  else :
    print("No")
    sys.exit(0)
print("Yes")

Submission status: Wrong Answer

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

aset=set(alist)

if len(aset) == n:
	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")
    break
print("YES")

Submission status: Wrong Answer

Solution code:
from collections import Counter
N=int(input())
A=list(map(int, input().split()))
count=0
B=Counter(A)
for i in B.values():
	if i!=1:
		count+=1
if count==0:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
from collections import Counter
N=int(input())
A=list(map(int, input().split()))
count=0
B=Counter(A)
for i in B.values():
	if i!=1:
		count+=1
		break
if count==1:
	print('No')
else:
	print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Mar  4 17:27:29 2020

@author: Kanaru Sato
"""

N = int(input())
A = input().split()
flag = 0

for i in range(0,N):
    for j in range(0,N):
        if A[i] == A[j]:
            flag = 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print('YES' if len(a) == len(b) else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
f=1
for i in range(n-1):
    if l[i]==l[i+1]:
        f=0
        break
print("YES") if f else print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())

a = list(map(int, input().split()))
ngcounter = 0
for i in range(n):
  num = a[i]
  a.pop(i)
  if num in a:
    ngcounter += 1
    break
  else:
    a.append(num)
    
if ngcounter > 0:
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input())

a = list(map(int, input().split()))
ngcounter = 0
for i in range(n):
  if a[i] in a :
    ngcounter += 1
    break
    
if ngcounter > 0:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
    for j in range(i,n):
        if a[i]==a[j]:
            c+=1

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

Submission status: Wrong Answer

Solution code:
n=int(input())
lst=list(map(int,input().split()))
dic_a={}
for i in range(len(lst)):
  if lst[i] in dic_a:
    dic_a[lst[i]]=1
  else:
    print("NO")
    break
else:print("YES")

Submission status: Wrong Answer

Solution code:
n=int(input())
lst=list(map(int,input().split()))
dic_a={}
for i in range(len(lst)):
  if lst[i] in dic_a:
    dic_a[lst[i]]=1
  else:
    print("NO")
else:print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
A = list(map(int,input().split()))
AA = collections.Counter(A)
first_key = next(iter(AA))
first_value = AA[first_key]
if first_value == 1:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
import collections
import sys
N = int(input())
A = list(map(int,input().split()))
AA = collections.Counter(A)
for first_value in AA.values():
  if first_value == 1:
    print('YES')
    sys.exit()
  else:
    print('NO')
    sys.exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

nozoki = list(set(li)).sort()
li.sort()
if (nozoki == li):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

sub = list()
for i in li:
    if i in sub:
        print("No")
        break
    sub.append(i)
else:
    print("Yes")

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

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]:
            ans="No"
            break
print(ans)