TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.

Submission attempts (in order):
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")

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

for i in range(N-1):
    for j in range(i+1, N):
        if A[i] == A[j]:
            count += 1
            
if count == 0:
    print("Yes")
    
else:
    print("No")

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

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
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')



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

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

A.sort()

isSame = False

for i in range(N - 1):
  if A[i] == A[i + 1]:
    isSame = True
    break
if isSame:
  print('YES')
else:
  print('NO')

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

A.sort()

isSame = False

for i in range(N - 1):
  if A[i] == A[i + 1]:
    isSame = True
    break
if isSame:
  print('NO')
else:
  print('YES')

Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
a = list(map(int,input().split()))
a.sort()
tmp = 0
for i in range(n-1):
    if a[i]==a[i+1]:
        tmp = 1
        break
if tmp == 1:
    print('No')
else:
    print('Yes')
    

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
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")

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

n = int(input())
li = [int(x) for x in input().split()]
a = len(li)
se = set(li)
b = len(se)
if (a==b):
    print("YES")
else:
    print("NO")

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
N = int(input())
List = list(map(str, input().split()))
import collections
c = collections.Counter(List)
print(c)
if len(c)==N:
    print('YES')
else:
    print('NO')

N = int(input())
List = list(map(str, input().split()))
import collections
c = collections.Counter(List)
#print(c)
if len(c)==N:
    print('Yes')
else:
    print('No')

N = int(input())
List = list(map(str, input().split()))
import collections
c = collections.Counter(List)
#print(c)
if len(c)==N:
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
N = int(input())
A_list = [int(item) for item in input().split()]
A_set = set(A_list)

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

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

if len(A_list) == len(A_set):
    print('YES')
else:
    print('NO')


Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
s = list(map(int,input().split()))

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

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

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

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

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

n = int(input())
s = list(map(int,input().split()))
 
def count(x):
    if len(s) != len(set(x)):
        return "NO"
    else:
        return "YES"
print(count(s))

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
def main():
	n=int(input())
	a=list(map(int, input().split()))
	count=[1]*n
	while sum(count)==n:
		for i in range(n):
			count[i] = a.count(a[i])
	if sum(count)==n:
		print('YES')
	else:
		print('NO')
main()

def main():
	n=int(input())
	a=list(map(int, input().split()))
	count = 0
	while count==0:
		for i in range(n):
			if  a.count(a[i])> 1:
				count+=1
				break
			else:
				continue
	if count==0:
		print('YES')
	else:
		print('NO')
main()

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

def main():
	n=int(input())
	a=list(map(int, input().split()))
	count=[0]*n
	while sum(count)==0:
		for i in range(n):
			count[i] = a.count(a[i])-1
	if sum(count)==0:
		print('YES')
	else:
		print('NO')
main()

def main():
	n=int(input())
	a=list(map(int, input().split()))
	count=[0]*n
	for i in range(n):
		count[i] = a.count(a[i])
	if sum(count)==0:
		print('YES')
	else:
		print('NO')
main()

def main():
	n=int(input())
	a=list(map(int, input().split()))
	count=[0]*n
	while sum(count)==n:
		for i in range(n):
			count[i] = a.count(a[i])
	if sum(count)==n:
		print('YES')
	else:
		print('NO')
main()

def main():
	n=int(input())
	a=list(map(int, input().split()))
	count = 0
	while count==0:
		for i in range(n):
			if  a.count(a[i])> 1:
				count+=1
				print('NO')
				break
			else:
				continue
	if count==0:
		print('YES')
main()

def main():
	n=int(input())
	a=list(map(int, input().split()))
	count = 0
	while count==0:
		for i in range(n):
			if  a.count(a[i])> 1:
				count+=1
				print('NO')
				break
	if count==0:
		print('YES')
main()

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

Verdicts: Time Limit Exceeded

Time Limit Exceeded

Wrong Answer

Time Limit Exceeded

Wrong Answer

Wrong Answer

Time Limit Exceeded

Time Limit Exceeded

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

Submission attempts (in order):
N = int(input())
A = [int(x) for x in input().split()]
ans = 'Yes' 
for i in range(N):
    if A.count(A[i]) > 1:
        ans = 'No'
        break
print(ans)


N = int(input())
A = [int(x) for x in input().split()]
A.sort()

ans = 'YES'

for i in range(N-1):
    if A[i] == A[i+1]:
        ans = 'NO'
        break
print(ans)

Verdicts: Wrong Answer

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

Submission attempts (in order):
N=int(input())
A=input().split()
 
for i in range(N)
  if A.count(A[i]) >1:
    print("NO")
    exit(0)
print("YES")

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

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

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

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

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

while(len(A)!=0):
  if A.count(A[0]) !=0:
    print("NO")
    exit(0)
  A.pop(0)
  
print("YES")

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

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

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

A=sorted(A)

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

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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


# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N = ir()
A = lr()
bl = len(set(A)) == N
print('YES' if bl else 'NO')


Verdicts: Wrong Answer

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

Submission attempts (in order):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

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

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# b,r = map(str, readline().split())
# A,B = map(int, readline().split())
N = I()
A = LI()


def main():
    judge=False
    if len(set(A))==N:
        judge=True
    if judge:
        return 'Yes'
    else:
        return 'No'
print(main())


import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

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

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# b,r = map(str, readline().split())
# A,B = map(int, readline().split())
N = I()
A = LI()

def main():
    judge=False
    if len(set(A))==N:
        judge=True
    if judge:
        return 'YES'
    else:
        return 'NO'
print(main())


Verdicts: Wrong Answer

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

Submission attempts (in order):
from collections import Counter

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

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

from collections import Counter

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
a = sorted(map(int, input().split()))

x = 0

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

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

x = 0

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

def main():
    N, *A = map(int, 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())



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



import sys
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

def main():
    N, *A = map(int,read().split())
    d = defaultdict(int)
    for a in A:
        d[a] +=1
    if len(A)==len(d):
        result = 'YES'
    else:
        result = 'NO'

    return result

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



Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
import sys
A = list(map(int, input().split()))
N = int(input())

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


import sys
A = list(map(int, input().split()))
n = int(input())

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

import sys
N = int(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))

cnt = [0]*(10**9+1)

for i in a:
    cnt[i] += 1
    if cnt[i] > 1:
        print('NO')
        exit()
print('YES')

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

a.sort()
for i in range(n-1):
    if a[i] == a[i+1]:
        print('NO')
        exit()
print('YES')


Verdicts: Runtime Error

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

Submission attempts (in order):
a = int(input())
b = list(map(int,input().split()))
c = set(b)

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

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

if len(b) == len(c):
  print("YES")
else:
  print("NO")


Verdicts: Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
ans = 'NO'
if N == len(set(A)):
  ans = 'Yes'

print(ans)

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

print(ans)

Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
a = list(map(int, input(),split()))
sa = set(a)
if len(a) == len(sa):
  print("YES")
else:
  print("NO")

n = int(input())
a = list(map, int(input().split()))
yn = ["YES","NO"]
flag = 0
for i in range(n-1):
  for j in range(i+1, n):
    if i == j: 
      flag = 1
print(yn[flag])

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
N = int(input())
A = [int(i) for i in input().split()]
print('Yes' if len(set(A)) == N else 'No')

N = int(input())
A = [int(i) for i in input().split()]
print('YES' if len(set(A)) == N else 'NO')

Verdicts: Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

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

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
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")

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
def has_duplicates(seq):
    return len(seq) != len(set(seq))

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

if has_duplicates(A) == True:
  print('Yes')
else:
  print('No')

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

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

if has_duplicates(A) == True:
  print('YES')
else:
  print('NO')


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

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

if has_duplicates(A) == True:
  print("NO")
else:
  print("YES")


Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
n = int(input())
aa = tuple(map(int, input().strip()))
if len(set(aa)) == n:
    print("YES")
else:
    print("NO")

n = int(input())
aa = tuple(map(int, input().split()))
if len(set(aa)) == n:
    print("YES")
else:
    print("NO")

Verdicts: Runtime Error

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

Submission attempts (in order):
n=int(input())
a=list(map(int,input().split()))

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

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

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

    


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

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


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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
N=int(input())
A=input().split()
l=len(set(A))
print('Yes' if N==l else 'No')

N=int(input())
A=input().split()
l=len(set(A))
print('YES' if N==l else 'NO')

Verdicts: Wrong Answer

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

Submission attempts (in order):
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()



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



Verdicts: Wrong Answer

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

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

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

N = int(input())
A = list(map(int, input().split()))
print("{}".format("YES" if len(A) == len(set(A)) else "NO"))

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
from collections import Counter

n = int(input())
c = Counter(map(int, input().split()))

print("YES" if c.most_common(1)[1] <= 1 else "NO")

from collections import Counter

n = int(input())
c = Counter(map(int, input().split()))

print("YES" if c.most_common(1)[0][1] <= 1 else "NO")


Verdicts: Runtime Error

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

Submission attempts (in order):
n = int(input())
a = list(input().split())

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


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

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
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')

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
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')

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

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


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

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
　　break
if b==0:
  print('YES')
else:
  print('NO')

n=int(input())
a=[int(i) for i in input().split()]
a.sort()
for j in range(n-1):
	if a[j]<a[j+1]:
		pass
	else:
		print('NO')
		exit()
print('YES')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

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

Submission attempts (in order):
n = int(input())
A = list(map(int, input().split()))
d = {}

for i in A:
    if i in d:
        print("No")
        exit(0)
    else:
        d[i] = 1

print("Yes")


n = int(input())
A = list(map(int, input().split()))
d = {}

for i in A:
    if i in d:
        print("NO")
        exit(0)
    else:
        d[i] = 1

print("YES")


Verdicts: Wrong Answer

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

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


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


Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
a_list = sorted(map(int, input().split()))

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


n, k = map(int, input().split())
p_list = list(map(int, input().split()))
index = 0
value = 0

for i in range(n - k):
    if p_list[i] < p_list[i + k]:
        index = i + 1

for i in range(k):
    value += (1 + p_list[index + i])/ 2 

print(value)


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

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


Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
N=int(input())
A=list(map(int,input().split()))

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


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

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


Verdicts: Wrong Answer

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

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

from collections import Counter
n = int(input())
c = Counter(list(map(int, input().split())))
if len(c) == n:
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
a = input().split(" ")
b = set(a)
if len(b)<len(a):
  answer = "NO"
else:
  answer = "Yes"
print(answer)

N = input()
A = [x for x in input().split()]
if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")

Verdicts: Wrong Answer

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

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


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


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


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

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


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

n = int(input())
a = set(map(int, input().split()))
print('YES' if len(a) == n else 'NO')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = list(map(int,input().split()))
if len(A) != len(set(A)):
    print("No")
else:
    print("Yes")

N = int(input())
A = list(map(int,input().split()))
if len(A) != len(set(A)):
    print("NO")
else:
    print("YES")

Verdicts: Wrong Answer

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

Submission attempts (in order):
N = int(input())
a = list(map(int,input().split()))
ans = "Yes"
judge = 0
for i in range(N-1):
  for j in range(i+1,N):
    if(a[i]==a[j]):
      judge += 1
      ans = "No"
      break
  if(judge>0):
    break
print(ans)

    
  

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

n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = "YES"
for i in range(1,n):
  if(a[i-1]==a[i]):
    ans = "NO"
    break
print(ans)

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
N = int(input())
set_1 = set()
list_1 = list(map(int, input().split(' ')))

for item in list_1:
  set_1.add(item)

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

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

for item in list_1:
  set_1.add(item)

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

def solve():
  N = int(input())
  A = list(map(int, input().split()))
  A.sort()
  for i in range(1, N):
    if A[i - 1] == A[i]:
      print('NO')
      return
  print('YES')
  return
solve()

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
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")


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

Verdicts: Wrong Answer

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

Submission attempts (in order):
n=int(input())
a=[i for i in input().split()]

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

n=int(input())
a=[i for i in input().split()]
print(len(set(a)))
print('YES' if len(set(a)==n) else 'NO')

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

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
n = int(input())
a = input().split(" ")

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

print('NO' if flag else 'YES')


n = int(input())
a = input().split(" ")

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

print('NO' if flag else 'YES')


Verdicts: Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
Ans = "Yes"
List = []

for e in A:
    if e in List:
        Ans = "No"
        break
    else:
        List.append(e)

print(Ans)

N = int(input())
A = list(map(int, input().split()))
A.sort()
Ans = "YES"
List = []
before_n = 0
for e in A:
    if e == before_n:
        Ans = "NO"
        break
    else:
        before_n=e
print(Ans)

Verdicts: Wrong Answer

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

Submission attempts (in order):
import sys
import math
from collections import deque
from collections import defaultdict

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

if __name__ == "__main__":
    main()

import sys
import math
from collections import deque
from collections import defaultdict

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

if __name__ == "__main__":
    main()

Verdicts: Wrong Answer

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

Submission attempts (in order):
n=int(input())
b=input().split()

if len(set(b))==n:
  print("Yes")
else:
  print("NO")

    
    

n=int(input())
b=input().split()

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

    
    

Verdicts: Wrong Answer

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

Submission attempts (in order):
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)


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)


from sys import stdin


def get_result(data):
    N, A = data[0], data[1]
    return 'YES' if len(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)


Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
n = int(input())
a = input().split(' ')

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

n = int(input())
a = input().split(' ')
 
if len(set(a)) == n:
  print('YES')
else:
  print('NO')

Verdicts: Runtime Error

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

Submission attempts (in order):
from  collections import Counter
n = int(input())
a_ = [int(x) for x in input().split()]
a = Counter(a_)
print(a)
print('NO') if a.most_common()[0][1]>1 else print('YES')

from  collections import Counter
n = int(input())
a = Counter([int(x) for x in input().split()])
print('NO') if len(a)!=n else print('YES')

Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
la = list(map(int, input().split())
d = {}
ret = 'NO'
for a in la:
    if a in d:
        ret = 'YSE'
        break
    d[a] = ''
print(ret)


aaa = int(input())
la = list(map(int, input().split()))
d = {}
ret = 'YES'
for a in la:
    if a in d:
        ret = 'NO'
        break
    d[a] = ''
print(ret)


Verdicts: Runtime Error

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

Submission attempts (in order):
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')

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

aa = sorted(a)
flag=True
for i in range(n-1):
    if aa[i]==aa[i+1]:
        flag=False
if flag:
    print('YES')
else:
    print('NO')


Verdicts: Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

flag = 0
for i in range(N-1):
    if A[i] != A[i+1]:
        flag = 0
    else:
        flag = 1

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

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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

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

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

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

N=int(input())
A=list(map(int,input().split()))
ans={}
flag=0

for i in A:
    if(ans.get(i)!=None):
        flag=1
        break
    else:
        ans[i]=1
        
if(flag==0):
    print("YES")
else:
    print("NO")

Verdicts: Wrong Answer

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

Submission attempts (in order):
# 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')

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))

#
# c = collections.Counter()

import collections

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

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



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

#
# c = collections.Counter()

import collections

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

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



Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
a.sort()

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

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

b = [-1] + a

l = []
for i in range(n):
  l.append(a[i] - b[i])
  
if l.count(0) == 0:
  print('YES')
else:
  print('NO')

Verdicts: Wrong Answer

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

Submission attempts (in order):
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")


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


Verdicts: Wrong Answer

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

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

n=int(input()) 
a=list(map(int, input().split()))
def func(a):
    return len(a) == len(set(a))
if func(a):
    print("YES")
else:
    print('NO')

Verdicts: Wrong Answer

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

Submission attempts (in order):
import collections

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

c = collections.Counter(A)

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

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


import collections

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

c = collections.Counter(A)

ans = all([True if v == 1 else False for k, v in c.items()])

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

import collections

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

c = collections.Counter(A)

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

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


import collections

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

c = collections.Counter(A)

ans = all([True if v == 1 else False for k, v in c.items()])

if ans:
    print('YES')
else:
    print('NO')


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
# -*- 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")

# -*- coding: utf-8 -*-
"""
Created on Wed Mar  4 17:14:33 2020

@author: Kanaru Sato
"""

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

D = {}

for i in range(0,N):
    if A[i] not in D:
        D[A[i]] = 1
    elif A[i] in D:
        D[A[i]] += 1
        

flag = 0

for i in list(D.values()):
    if i > 1:
        flag = 1
        break
    elif i <= 1:
        continue

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
'''
Sample Input 1 

5
2 6 1 4 5
Sample Output 1 

YES
'''
lens = int(input())
arrs = [int(x) for x in input(),split()]
print(["NO", "YES"][len(arrs) == len(set(arrs))])

'''
Sample Input 1

5
2 6 1 4 5
Sample Output 1

YES
'''
lens = int(input())
arrs = [int(x) for x in input().split()]
print(["NO", "YES"][len(arrs) == len(set(arrs))])

Verdicts: Runtime Error

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

Submission attempts (in order):
length = int(input())
numArr = [int(str_num) for str_num in input().split(' ')]

numArr.sort()

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

print("Yes")

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

numArr.sort()

def judge():
  for i in range(0, length - 1):
    if numArr[i] == numArr[i + 1]:
      print("NO")
      return False
  return True

if(judge()):
	print("YES")


Verdicts: Wrong Answer

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

Submission attempts (in order):
N=int(input())
A=list(map(int,input().split()))
a=set(A)
if len(a)==N:
    print('Yes')
else:
    print('No')

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
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')

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
import numpy as np

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

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

import numpy as np

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

N2 = np.unique(A).size

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

N1 = int(input())
A = list(map(int, input().split()))
N2 = len(list(set(A)))

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

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
# = map(int, input().split())
n = int(input())
# = input()
a = list(map(int, input().split()))

a.sort()

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

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

a.sort()

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
n=input()
a=list(map(int,input().split()))
print("YES" if len(set(a))==len(a) else "NO"

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

Verdicts: Runtime Error

Accepted