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

table = {}
answer = 'Yes'
for i in range(0, len(A)):
    Ai = A[i]
    count = table.get(Ai) + 1 if table.get(Ai) else 1
    table[Ai] = count

    if table.get(Ai) >= 2:
        answer = 'No'
        break

print(answer)


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

table = {}
answer = 'Yes'
for i in range(0, len(A)):
    Ai = A[i]
    count = table.get(Ai) + 1 if table.get(Ai) else 1
    table[Ai] = count

    if table.get(Ai) >= 2:
        answer = 'No'
        break

print(answer)


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

table = {}
answer = 'Yes'
for i in range(0, len(A) + 1):

    Ai = A[i]
    count = table.get(Ai) + 1 if table.get(Ai) else 1
    table[Ai] = count

    if table.get(Ai) >= 2:
        answer = 'No'
        break

print(answer)


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

table = {}
answer = 'YES'
for i in range(0, len(A)):
    Ai = A[i]
    count = table.get(Ai) + 1 if table.get(Ai) else 1
    table[Ai] = count

    if table.get(Ai) >= 2:
        answer = 'NO'
        break

print(answer)


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

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

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

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

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

a_set = set(a)
if len(a) == len(a_set):
    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):
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')

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()
B = set(A)
if len(A) == len(B):
    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):
def main():
    N = int(input())
    A = list(map(int, input().split(" ")))
    numbers = []
    answer = "Yes"
    for a in A:
        if not a in numbers:
            numbers.append(a)
        else:
            answer = "No"
            break
    print(answer)


if __name__ == '__main__':
    main()

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


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("YES" if len(set(A))==len(A) else "NO")


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


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

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


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


Verdicts: Runtime Error

Runtime Error

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()))
setA = set(A)
print("Yes" if len(setA)==len(A) else "No")

n = int(input())
A = list(map(int, input().split()))
setA = set(A)
print("YES" if len(setA)==len(A) 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()))
b=list(set(a))
if len(a)==len(b):
  print("Yes")
else:
  print("No")

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

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

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

n = int(input())
l = list(map(int, input().split()))
s = list(set(l))
if len(l) == len(s):
    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 fractions
n=int(input())
a=list(map(int,input().split()))
ans=a[0]
cnt=0
if ans==1:
  cnt+=1
for i in range(1,n):
  if a[i]==1:
    cnt+=1 
  ans=fractions.gcd(ans,a[i])
if cnt > 1:
  print("NO")
elif ans==1:
  print("YES")
else:
  print("NO")

n=int(input())
a=list(map(int,input().split()))
l=set(a)
if len(l)==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):
l=int(input())
list = list(map(int, input().split()))

i=0
r="NO"

while(i<l):
  j=0
  while(j<l):
    if(i!=j):
      if(list[i]==list[j]):
        r="YES"
    j+=1
  i+=1

print(r)

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

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

r=has_duplicates(list)
print(r)

if(str(r)=="False"):
  print("YES")
else:
  print("NO")

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

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

r=has_duplicates(list)

if(str(r)=="False"):
  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-1):
    for j in range(i, n):
        if a[i]==a[j]:
            c+=1
            break

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

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]:
        c+=1
        break
if c==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):
n=int(input())
a=list(map(int,input().split()))
s="NO"
for i in range(n):
    for j in range(i+1,n):
        if a[i]==s[j]:
            s="YES"
            break
print(s)

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

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

Verdicts: Runtime Error

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()
flag = False
for count in range(0,len(A-1)):
    if A[count] == A[count+1]:
        flag = True
        break

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

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

A.sort()
flag = False
for count in range(0,len(A)-1):
    if A[count] == A[count+1]:
        flag = True
        break

if flag == False:
    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()))
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')

n = int(input())
a = list(map(int,input().split()))
b = [0 for _ in range (max(a)+1)]
for i in a:
    b[i]+=1
    if b[i]==2:
        print("No")
        exit()
print("Yes")

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

    
    

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

def has_duplicates(seq):
    return len(seq) != len(set(seq))
  
b = has_duplicates(a)
if b == True:
  print('YES')
if b == False:
  print('NO')

N = input()
a = input().split()

def has_duplicates(seq):
    return len(seq) != len(set(seq))
  
b = has_duplicates(a)
if b == True:
  print('NO')
if b == False:
  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 sys

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

import sys

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

import collections
c = collections.Counter(a)

flag = True
for i in c.values():
    #print(i)
    if i!=1:
        flag = False
        break
if flag == False:
    print('No')
else:
    print('Yes')
        


N = input()
a = list(input().split())

import collections
c = collections.Counter(a)

flag = True
for i in c.values():
    #print(i)
    if i!=1:
        flag = False
        break
if flag == False:
    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())
L = [map(int,input().split())]
if len(set(L)) = N:
  print('YES')
else:
  print('NO')

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

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


Verdicts: Runtime Error

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
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")
		sys.exit()
print("Yes")

import sys
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")
		sys.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):
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):
import collecttions
l=list(map(int,input().split()))
for i in l:
  if l.count(i)!=1:
    print("NO")
    exit(0)
print("YES")
  


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

N=int(input())
a=[int(input() ) for i in range(N)]
for i in range(N-1):
  if a[i]==a[i+1]:
    print("NO")
    exit(0)
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(0)
print("YES")

Verdicts: Runtime Error

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):
def main():
    n = int(input())
    nums = input().split(' ')
    s = set()
    result = 'YES'

    for i in range(n):
        num = nums[i]
        if num in s:
            result = 'NO'
            break
        s.add(num)

    return result


if __name__ == '__main__':
    main()


from typing import List


def main():
    n = int(input())
    nums = input().split(' ')
    r = don(n, nums)
    if r:
        print('YES')
    else:
        print('NO')


def don(n: int, nums: List[str]) -> bool:
    s = set()
    result = True

    for i in range(n):
        num = nums[i]
        if num in s:
            result = False
            break
        s.add(num)

    return result


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):
# coding: utf-8
import sys
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10**7)

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


if __name__ == "__main__":
    run()

# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import combinations

#import numpy as np
def run():
    N = int(input())
    A = list(map(int, sysread().split()))
    A = sorted(A)
    for i in range(N-1):
        if A[i] == A[i+1]:
            print('NO')
            return None
    print('YES')


if __name__ == "__main__":
    run()

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

s =0

print(n,a)

for f in range(n):
  
  for g in range(n):

    if g != f:
    	if a[f] == a[g]:
      		#print(a[f], a[g])
      		s = s+1
      
if s>0: print("NO")
else: print('YES')

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

print(n,a)

for f in range(n):
  
  for g in range(n):

    if g != f:
    	if a[f] == a[g]:
      		#print(a[f], a[g])
      		s = s+1
      
if s>0: print("NO")
else: print('YES')

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

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("NO")
        s=s+1
        break
        
if s == 0: print("YES")

Verdicts: Wrong Answer

Runtime Error

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 = sorted([int(i) for i in input().split()])
ans = 'Yes'
for i in range(1, n):
  if a[i-1] == a[i]:
    ans = 'No'
    break
print(ans)

n = int(input())
a = sorted([int(i) for i in input().split()])
ans = 'YES'
for i in range(1, n):
  if a[i-1] == a[i]:
    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())
P = list(map(int,input().split()))
def has_duplicates(seq):
    return len(seq) != len(set(seq))
ans = has_duplicates(P)
if ans == 'True':
  print('YES')
if ans == 'False':
  print('NO')

N = int(input())
P = list(map(int,input().split()))
def has_duplicates(seq):
    return len(seq) != len(set(seq))
if has_duplicates(P) == 'False':
    print('YES')
elif has_duplicates(P) == 'True':
    print('NO')

N = int(input())
P = list(map(int,input().split()))
def has_duplicates(seq):
    return str(len(seq) != len(set(seq)))
if has_duplicates(P) == 'False':
  print('YES')
elif has_duplicates(P) == 'True':
  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())
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')

N = int(input())
li = list(map(int, input().split()))
li.sort()


S = 1
for i in range(N-1):
    if  li[i+1] == li[i]:
        S = S*0
    else:
        S = S
if S == 0:
    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()))
B=[]
p=True
for a in A:
  if a in B:
    p = False
    break
  else:
    B.append(a)
print("Yes" if p else "No")

N=int(input())
A=list(map(int,input().split()))
B=[]
p=True
for a in A:
  if a in B:
    p = False
    break
  else:
    B.append(a)
print("Yes" if p else "No")

N=int(input())
A=list(map(int,input()))
S=set(A)
print("YES" if len(A)==len(S) else "NO")

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


Verdicts: Runtime Error

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())
l = list(map(int,input().split()))
d = {}
for i in l:
    if i in d:
        d[i] += 1
    if i not in d:
        d[i] = 1
length = len(d)
if length ==n:
    print("YES")
else:
    print("NO")
print(d)

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

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

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

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

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

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

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

print('YES' if len(S) == len(setS) 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):
n = int(input())
a = input().split()
s = set()

dup = False
for i in a:
    if i in s:
        dup = True
    else:
        s.add(i)

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


n = int(input())
a = input().split()
s = set()

dup = False
for i in a:
    if i in s:
        dup = True
    else:
        s.add(i)

if dup:
    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, A = int(input()), list(map(int, input().split()))
print("Yes" if len(set(A)) == len(A) else "No")

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

n = int(input())
a = list(map(int, input().split()))
if n == 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):
flag = True
n = int(input())

a = input().split()

a.sort()

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

flag = True
n = int(input())

a = input().split()

a.sort()
start = 0
for i in a:
    for j in a[start-1:start+1:2]:
        if i == j:
            flag = False
            break
    start += 1
    
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):
import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
N=int(input())
A  = list(map(int,input().split()))

# print(A)
dictA={}

for i in A:
    if i in dictA: 
        print("NO")
        exit(0)
    dictA[i]=1
print("YES"
)
[myoden@ubuntu002 C]$ cat testC.py  ;echo 
import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
N=int(input())
A  = list(map(int,input().split()))

# print(A)
dictA={}

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


import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
N=int(input())
A  = list(map(int,input().split()))

# print(A)
dictA={}

for i in A:
    if i in dictA: 
        print("NO")
        exit(0)
    dictA[i]=1
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):
N = int(input())
A = list(map(int, input().split()))
B = set(A)

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


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

if len(A) == len(B):
    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=input()
A=(input()).split()
A.sort()

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

N=(int)(input())
A=(input()).split()
A.sort()
 
for i in range(N-1):
    if A[i]==A[i+1]:
        print('NO')
        break
    elif i==N-2:
        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):
n=map(int,input())
lst=len(set(map(int,input(split))))
if n==lst:
    print("YES")
else:  print("NO")

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

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

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

Verdicts: Runtime Error

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 = map(int, input().split())
b = len(a)
c = len(set(a))
if b == c:
  print("YES")
else:
  print("NO")

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

N = int(input()) == len(set(map(int, input().split())))
if 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):
num = int(input())
table = list(map(int, input().split()))
print(table)
count = 0
list.sort(table)
print(table)
for i in range(1, num-1):
    if num == 2:
        if table[i-1] == table[i]:
            count += 1
    elif table[i] == table[i+1] or table[i-1] == table[i]:
        count += 1
    else:
        continue
if count == 0:
    print('YES')
else:
    print('NO')

num = int(input())
table = list(map(int, input().split()))
print(table)
count = 0
list.sort(table)
for i in range(num-1):
    if table[i] == table[i+1]:
        count += 1
    else:
        continue
if count == 0:
    print('YES')
else:
    print('NO')

num = int(input())
table = list(map(int, input().split()))
count = 0
list.sort(table)
if num == 2:
        if table[0] == table[1]:
            count += 1
else:
    for i in range(1, num-1):
        if num == 2:
            if table[0] == table[1]:
                count += 1
        elif table[i] == table[i+1] or table[i-1] == table[i]:
            count += 1
        else:
            continue
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())
num_list = list(map(int, input().split()))
num_list = sorted(num_list)

for i in range(len(num_list)):
  if num_list[i] == num_list[i+1]:
    print('NO')
    exit()
print('YES')

N = int(input())
num_list = list(map(int, input().split()))
num_list = sorted(num_list)

for i in range(len(num_list)):
  if i == N-1:
    print('YES')
  elif num_list[i] == num_list[i+1]:
    print('NO')
    exit()

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

arrset = set(arr)

if len(arr) == len(arrset):
    print("Yes")
else:
    print("No")

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

arrset = set(arr)

if len(arr) == len(arrset):
    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 nrange(N-1):
  if A[i] == A[i+1]:
    print("NO")
    break
else:
  print('YES')

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

for i in range(N):
  if A[i] in A[i+1:]:
    print('NN)
else:
  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")
    break
else:
  print('YES')

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

import collections

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

a_counter = collections.Counter(a_list)

ans = "YES"
for value in a_counter.values():
  if value > 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 = list(map(int,input().split()))

# a = [1,2,3,3,2,2,1]

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

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

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

c = collections.Counter(x)
# print(c)
w = c.values()
# print(w)
for i in w:
    # print(i)
    if i >= 2:
        print("No")
        break
    else:
        print("Yes")
        break
    

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

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

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


if len(set(a)) == n:
    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_set = set(list(map(int, input().split())))

print("Yes" if len(a_set) == n else "No")

n = int(input()) 

a_set = set(list(map(int, input().split())))

print("YES" if len(a_set) == 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())
lisA = [int(i) for i in input().split()]
if len(set(lisA)) == len(lisA):
    print('Yes')
else :
    print('No')

def calc_exp(x:str)->float:
    return (int(x) + 1)/2

NK = input().split()
N, K = int(NK[0]), int(NK[1])
#lis_p = list(map(lambda x: int(x), input().split()))
lis_exp = list(map(calc_exp, input().split()))
dp=0
for i in range(N):
    dp = max(sum(lis_exp[i:i+K]), dp)
print(dp)

def calc_exp(x):
    return (int(x) + 1)/2

NK = input().split()
N, K = int(NK[0]), int(NK[1])
#lis_p = list(map(lambda x: int(x), input().split()))
lis_exp = list(map(calc_exp, input().split()))
dp=0
for i in range(N):
    dp = max(sum(lis_exp[i:i+K]), dp)
print(dp)

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

Verdicts: Wrong Answer

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):
s = int(input())
l = [int(n) for n in input().split()]
l = sorted(l)
flag = 0
print(l)
for i in range(len(l)- 1):
  if l[i] == l[i+1]:
    print("NO")
    flag = 1
    
if flag == 0:
  print("YES")
 

s = int(input())
l = [int(n) for n in input().split()]
l = sorted(l)
flag = 0

for i in range(len(l)- 1):
  if l[i] == l[i+1]:
    print("NO")
    flag = 1
    break
    
if flag == 0:
  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()))

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

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):
t=input().split()
n=int(t.pop(0))
if len(set(n))==n:
    print("YES")
else:
    print("NO")


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

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


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


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


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

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

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

Verdicts: Runtime Error

Runtime Error

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):
import sys
N = int(input())
cc = list(map(int,input().split()))
dic = set()
for i in cc:
  if i in dic:
    print('NO')
    sys.exit()
  else:
    dic.append(i)
print('YES')

    

import sys
N = int(input())
cc = list(map(int,input().split()))
dic = set()
for i in cc:
  if i in dic:
    print('NO')
    sys.exit()
  else:
    dic.add(i)
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):
n=int(input())
a=list(map(int,input().split()))
if len(a)==len(set(a)):
  print('Yes')
else:
  print('No')
  

n=int(input())
a=[int(input()) for i in range(n)]
if len(a)==len(set(a)):
  print('Yes')
else:
  print('No')
  

n=int(input())
a=list(map(int,input().split()))
A=set(a)
if len(a)==len(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')
  

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

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

Verdicts: Wrong Answer

Runtime Error

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

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

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

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 itertools import combinations as comb
n = int(input())
a = list(map(int,input().split()))

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

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

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

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


if(isBad):
    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 = input().split()
B = set(A)
if len(B) == N:
  print('Yes')
else:
  print('No')

N = int(input())
A = input().split()
B = set(A)
if len(B) == N:
  print('Yes')
else:
  print('No')

N = int(input())
A = input().split()
B = set(A)
if len(B) == 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):
2
10000000 10000000

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

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

if len(li) == len(set(li)):
    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 = input()
M = list(map(int,input().split()))
X = set(M)
Y = len(X)

if N == Y:
    print("YES")
    
else:
    print("NO")

N = input()
M = list(map(int,input().split()))
X = set(M)
Y = len(X)

if N == Y:
    print("YES")
    
else:
    print("NO")

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

else:
    print("NO")

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

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

X = set(M)
Y = len(X)

if N == Y:
    print("YES")
else:
    print("NO")

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

else:
    print("NO")

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

X = set(M)
Y = len(X)

if N == Y:
    print("YES")
else:
    print("NO")

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

else:
    print("NO")

Verdicts: Wrong Answer

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):
import collections
N = int(input())
A = input().split(' ')

c = max(collections.Counter(A).values())
if c = = 1:
	print('YES')
else:
	print('NO')


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

c = max(collections.Counter(A).values())
if c == 1:
	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("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
input = sys.stdin.readline

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

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

import sys
input = sys.stdin.readline

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

if len(set(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):
n = int(input())
List = list(map(int, input().split()))
for i in range(n - 1):
    for j in range(n - i - 2):
        if List[i] == List[i + j]:
            print('NO')
            exit()

print('YES')


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

print('YES')

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

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

print(ans)ß

n = int(input())
List = list(map(int, input().split()))
Sorted = sorted(List)
ans = 'YES'
for i in range(n - 1):
    if Sorted[i] == Sorted[i + 1]:
        ans = 'NO'
        break

print(ans)

Verdicts: 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):
import collection

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

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: Runtime Error

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

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

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

if len(b) != len(set(b)):
    print('NO')
else:
    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):
import collections
N = int(input())
l = list(map(int,input().split()))

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

import collections
N = int(input())
l = list(map(int,input().split()))

c = collections.Counter(l)
if c.most_common()[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(input()) for _ in range(n)]
A_set = set(A)
if len(A_set) == n:
    print('YES')
else:
    print('NO')

n = int(input())
A = [int(a) for a in input().split()]
A_set = set(A)
if len(A_set) == 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):
import collections
a=int(input())
b=list(map(str,input().split()))
n=[]
for i in b:
    x=i.replace(' ',',')
    n.append(x)
c=collections.Counter(n)
n,values=zip(*c.most_common())
d=list(values)
print(d)
if d.count(1)==a:
    print('YES')
else:
    print('NO')

import collections
a=int(input())
b=list(map(str,input().split()))
n=[]
for i in b:
    x=i.replace(' ',',')
    n.append(x)
c=collections.Counter(n)
n,values=zip(*c.most_common())
d=list(values)

if d.count(1)==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 = [int(x) for x in input().split()]
d = []
p = 0
for i in range(N):
    d.append(A[i])
    if A[i] in d:
        p = 1
        break
if p == 0:
    print("YES")
else:
    print("NO")


N = int(input())
A = [int(x) for x in input().split()]
A.sort()
p = 0
for i in range(N-1):
    if A[i] == A[i+1]:
        p = 1
        break
if p == 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

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

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


import sys

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

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

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

l.sort()

for i in range(n-1):
  if l[i] == l[i + 1] :
    print("No")
    exit()
print("Yes")
  

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

l.sort()

for i in range(n-1):
  if l[i] == l[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):
N=int(input())
from collections import Counter
if max(Counter([int(x) for x in input().split()]).values())==1:
  print("Yes")
else:
  print("No")

from collections import Counter
if max(Counter([int(x) for x in input().split()]).values())==1:
  print("Yes")
else:
  print("No")

N=int(input())
from collections import Counter
if max(Counter([int(x) for x in input().split()]).values())==1:
  print("YES")
else:
  print("NO")

Verdicts: Wrong Answer

Wrong Answer

Accepted