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())
lst=list(map(int,input().split()))
dic_a={}
for i in range(len(lst)):
  if lst[i] in dic_a:
    dic_a[lst[i]]=1
  else:
    print("NO")
else:print("YES")

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

n=int(input())
lst=list(map(int,input().split()))
dic_a={}
for i in range(len(lst)):
  if lst[i] not in dic_a:
    dic_a[lst[i]]=1
  else:
    print("NO")
    break
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):
#154c
n = int(input())
a = [input() for _ in range(n)]

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

#154c
n = int(input())
a = list(input().split())

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

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

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

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

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

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

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

cnt = set(a)
if n == int(len(cnt)):
  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().split())
dic=Counter(a)
for val in dic.values():
    if val>=2:
        print("NO")
        exit()
print("YES")

from collections import Counter
n=int(input())
a=list(map(int,input().split()))
dic=Counter(a)
for val in dic.values():
    if val>=2:
        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):
import sys
n = int(input())
A = list(map(int, input().split()))
for i in range(n):
  for j in range(i+1, n):
    if A[i]==A[j]:
      print('No')
      sys.exit()
print('Yes')

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

import sys
n = int(input())
A = list(map(int, input().split()))
set_A = set(A)
if len(A) == len(set_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()))
s=0
for i in range(N-1):
  for j in range(i+1,N):
    if all(A[i]!=A[j]):
      print("YES")
    else:
      print("NO")

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

N=int(input())
A=map(int,input().split())
n=len(set(A))
if N!=n:
  print("NO")
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):
s=int(input())
# b=input()
# c=[]

#     c.append(a[i])
a = list(map(int,input().split()))
#b = list(map(int,input().split()))

c = {i for i in a}  

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

s=int(input())
# b=input()
# c=[]

#     c.append(a[i])
a = list(map(int,input().split()))
#b = list(map(int,input().split()))
count=0
for i in range(s):
    for k in range(s):
        if  a[i]==a[k]:
            count+=1
        print(count)

if count<=s:
    print("YES")
else:
    print("NO")

s=int(input())
# b=input()
# c=[]

#     c.append(a[i])
a = list(map(int,input().split()))
#b = list(map(int,input().split()))

c = {i for i in a}  

if len(a)==len(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):
N = input()
A = [int(k) for k in input().split()]

result = True

for char in A:
    if(A.count(char) != 1):
        result = False
        break

if (result == True):
    print("Yes")
else:
    print("No")


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

result = True

# for char in A:
#     if(A.count(char) != 1):
#         result = False
#         break

#     for j in range(i+1, N):
#         # print("A[i]= "+str(A[i])+", A[j]= "+str(A[j]))
#         if A[i] == A[j]:
#             result = False
A.sort()

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

if (result == 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):
import copy

N = int(input())
list1 = list(map(int, input().split()))
list2 = copy.copy(list1)
list3 = set(list1)

x=len(list2)
y=len(list3)

if x==y:
    print('Yes')
else:
    print('No')


import copy

N = input()
list1 = list(map(int, input().split()))
list2 = copy.copy(list1)
list3 = set(list1)

x=len(list2)
y=len(list3)

if x==y:
    print('Yes')
else:
    print('No')

import copy

N = int(input())
list1 = list(map(int, input().split()))
list2 = copy.copy(list1)
list3 = set(list1)



x=len(list2)
y=len(list3)


if x==y:
    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 collections import Counter
def solve():
    N = int(input())
    A = set(map(int,input().split()))
    if N == len(A):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()


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


if __name__ == '__main__':
    solve()


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


s = input()
a = map(int, input().lower().split())

if int(s) == 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 collections
N = int(input())
A = list(map(int , input().split()))
c = collections.Counter(A)
if len(c) == N:
    print('Yes')
else:
    print('No')

import collections
N = int(input())
A = list(map(int , input().split()))
c = collections.Counter(A)
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):
from collections import Counter
from sys import exit

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

cnt = Counter(A)

for i in cnt.values():
    if i != 1:
        print("No")
        exit(0)

print("Yes")

from collections import Counter
from sys import exit

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

cnt = Counter(A)

for i in cnt.values():
    if i != 1:
        print("NO")
        exit(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())
arr=set(map(int,input().split())
print("YES" if n==len(arr) else "NO")

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

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

List.sort()

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

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

List.sort()
result = 'YES'

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

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())
l_set = set(input().split())
if n == len(l_set):
    print("Yes")
else:
    print("No")

n = int(input())
l_set = set(input().split())
if n == len(l_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, K = input().split()
P = input().split()
max_sum = 0
for i in range(int(N)-int(K) + 1):
  sum = 0
  for k in range(i, i + int(K)):
    print(k)
    p = int(P[k])
    sum += (p / 2) + 0.5
    if max_sum < sum:
      max_sum = sum
print(float(max_sum))


N = input()
A = input().split()
a = []
for s in A:
	a.append(int(s))
if len(set(a)) == len(a):
  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):
b=input()
a=[int(x) for x in input().split()]
if a==list(set(a)):
    print("YES")
else:
    print("NO")

b=input()
a=sorted([int(x) for x in input().split()])
c=0
while True:
    if a[c]==a[c+1]:
        ANS=False
        break
    if c==len(a)-2:
        ANS=True
        break
    c+=1
if ANS:
    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())
    print("Yes" if n == len(set(map(int, input().split()))) else "No")
    
if __name__ == '__main__':
    main()

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

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

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):
def check(seq):
    return len(seq) != len(set(seq))

def main():
  N = int(input())
  A = list(map(int, input.split()))
  ans = check(A)
  if ans:
    print("NO")
  else:
    print("Yes")
main()

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

def main():
  N = int(input())
  A = list(map(int, input().split()))
  ans = check(A)
  if ans:
    print("NO")
  else:
    print("YES")
main()

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

inList.sort()

noFlag = 0

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

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

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

inList.sort()

noFlag = 0

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

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

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()
arr=list(map(int,input().split()))
arr=sorted(arr)
for i in range(n-1):
  if arr[i]==arr[i+1]:
    print('NO')
    break
else:
  print('YES')

n=int(input())
arr=list(map(int,input().split()))
arr=sorted(arr)
for i in range(n-1):
  if arr[i]==arr[i+1]:
    print('NO')
    break
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):
def has_duplicates(seq):
    if len(seq) != len(set(seq)):
        return "No"
    else:
        return "Yes"

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


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

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


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)) = N, else "NO")

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())
lis=list(map(int,input().split()))
out="Yes"
for i in range(n):
  for j in range(i+1,n):
    #print("{}{}".format(i,j))
    if lis[i]==lis[j]:
      out="No"
      break
  if out =="No":
    break
print(out)


n=int(input())
lis=list(map(int,input().split()))
out="Yes"
for i in range(n):
  for j in range(i+i,n):
    if lis[i]==lis[j]:
      out="No"
      break
  if out =="No":
    break
print(out)


n=int(input())
li=sorted(list(map(int,input().split())))
bef=-1

for i in li:
  if bef==i:
    print("NO")
    break
  bef=i
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())
a = list(map(int, input().split()))
d = dict()
for i in range(n):
    d.setdefault(a[i])
if len(d) != n :
    print("No")
else:
    print("Yes")

n = int(input())
a = list(map(int, input().split()))
d = dict()
for i in range(n):
    d.setdefault(a[i])
if len(d) != n :
    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()))

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):
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()
  else:
    pass
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()
  else:
    pass
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 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")

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

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

Wrong Answer

Runtime Error

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())
S = input().split()
if N == set(S):
  print("YES")
else:
  print("NO")
        

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

a.sort()

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

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

N = int(input())
LI = list(map(int,input().split()))
if len(set(LI)) == 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 = [int(x) for x in input().split()]

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


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


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

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


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

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


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




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):
num = input()
list = list(map(int,input().split()))
flg  = False
for i in list:
  if list.count(i) >= 2:
  	flg = True
    
if flg:
  print("Yes")
else:
  print("No")


num = input()
list = list(map(int,input().split()))
flg  = False
for i in list:
  if list.count(i) >= 2:
	flg = True
	break
print("NO") if flg else print("YES")


list = list(input().split())


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


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


num = input()
list = list(map(int,input().split()))
list2 = set(list) 
print("YES") if len(list) == len(list2) 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):


intLen=int(input())
intList=sorted(list(map(int,input().split())))

result="Yes"



for i in range(len(intList)-1):
    if intList[i]==intList[i+1]:
        result="No"


print(result)

    



intLen=int(input())
intList=sorted(list(map(int,input().split())))

result="YES"



for i in range(len(intList)-1):
    if intList[i]==intList[i+1]:
        result="NO"


print(result)

    

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_a = set(a)
if n == len(s_a):
    print('Yes')
else:
    print('No')

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

if n == len(s_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 = input()
A = list(map(int,input().split()))
ans = "YES"
for i in range (len(A)):
    for j in range(i, len(A)):
        if A[i] == A[j]:
            ans = "NO"
print(ans)

N = input()
A = sorted(list(map(int,input().split())))
ans = "YES"
for i in range (1,len(A)):
    if A[i] == A[i-1]:
        ans = "NO"
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 collections

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

a_dict = collections.Counter(a)

if max(a_dict.values()) > 1:
    print('No')
else:
    print('Yes')

import collections

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

a_dict = collections.Counter(a)

if max(a_dict.values()) > 1:
    print('NO')
else:
    print('YES')

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 sorted(a) == sorted(b):
  print('Yes')
else:
  print('No')

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

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

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

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

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

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


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

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

if has_duplicates(lst)==True:
    print("No")
else:
    print("Yes")


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

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

if has_duplicates(lst)==True:
    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()
SET_A = set(A)
print(A)
print(SET_A)
if len(A)==len(SET_A):
    print("YES")
else:
    print("NO")

N = int(input())
A = list(input())
SET_A = set(A)
if len(A)==len(SET_A):
    print("YES")
else:
    print("NO")

N = int(input())
A = input().split()
SET_A = set(A)
if len(A)==len(SET_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()))
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 = int(input())
A = list(map(int, input().split()))
dic = {}
print(len(A))
j = True

for i in range(0, len(A)):
  if str(A[i]) in dic:
    print("NO")
    j = False
    break
  else:
    dic.setdefault(str(A[i]), A[i])

if j:
  print("YES")



n = int(input())
A = list(map(int, input().split()))
dic = {}
j = True

for i in range(0, len(A)):
  if str(A[i]) in dic:
    print("NO")
    j = False
    break
  else:
    dic.setdefault(str(A[i]), A[i])

if j:
  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())
arr=[int(x) for x in input().split()]
arr1=set(arr)
if arr1==arr:
  print("YES")
else:
  print("NO")

n=int(input())
arr=[int(x) for x in input().split()]
l=set(arr)
l=list(l)
l.sort()
arr.sort()
if arr==l:
  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
import sys

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

C = dict(Counter(A))
for a in C:
    if C[a] > 1:
        print('No')
        sys.exit()
print('Yes')

from collections import Counter
import sys
N = int(input())
A = [int(x) for x in input().split()]

C = dict(Counter(A))
for a in C:
    if C[a] > 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(" ")))
A.sort()
same = False
for i in range(N - 1):
  if A[i] == A[i + 1]:
    same |= True
print('YES' if same else 'NO')

N = int(input())
A = list(map(int, input().split(" ")))
A.sort()
same = False
for i in range(N - 1):
  if A[i] == A[i + 1]:
    same |= True
print('NO' if same 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,K = map(int,input().split())
p = list(map(int,input().split()))
max = 0
for i in range(N-K+1):
    s = 0
    for j in range(i,i+K):
        s += p[j]
    if s > max:
        max = s
print((max+K)/2)

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

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


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(input().split())
for i in range(n):
  for k in range(i+1,n):
    if a[i] == a[k]:
      print("No")
      exit()
print("Yes")

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

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

a.sort()

for i in range(1,len(a)):
  if(a[i]==a[i-1]):
    print('No')
    break
    
else: print('Yes')

n = int(input())
a = [ int(x) for x in input().split()]
 
a.sort()
 
for i in range(1,len(a)):
  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):
def pairwise_distinct():
    n = int(input())
    k = []
    for i in range(0,n):
        k.append(int(input()))
    if (len(set(k)) == len(k)):
        return "YES"
    else:
        return "NO"

    return k
        
        

print(pairwise_distinct())

def pairwise_distinct():
    n = int(input())
    k = list(input().split()) #input based on n
    if not len(k) == n:
        return "==== pleas input based on n times in one line ===="
    else:
        if (len(set(k)) == len(k)):
            return "YES"
        else:
            return "NO"

print(pairwise_distinct())

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):
#154 Distinct or not
n = int(input())
a = list(map(int,input().split())
b = set(a)

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

#154 Distinct or not
n = int(input())
a = list(map(int,input().split()))
b = len(set(a))

print(len(a),b)

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

#154 Distinct or not
n = int(input())
a = list(map(int,input().split()))
b = set(a)

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

#154 Distinct or not
n = int(input())
a = list(map(int,input().split()))
b = len(set(a))

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

N = 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 math
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 1
i_before = a[0]
for i in a:
    ans *= (i - i_before)
    i_before=i
if i ==0:
    print('No')
else:
    print('Yes')

n = int(input())
a = list(map(int, input().split()))
import collections
a_c = collections.Counter(a)
if sum(a_c.values()) == len(a_c.values()):
    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-1):
    if A[i]==A[i+1]:
        print("No")
        break
    if i==N-2:
        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
    if i==N-2:
        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 math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

n = I()

A = FLI()

cnt = Counter(A)
flg = False
for a in A:
   if A.count(a) > 1:
      flg = True

if not flg:
  print("Yes")
else:
  print("No")


from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

n = I()

A = FLI()
print(A)

cnt = Counter(A)
flg = False
for a in A:
   if A.count(a) > 1:
      flg = True

if not flg:
  print("Yes")
else:
  print("No")

from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

n = I()

A = FLI()

flg = len(set(A)) == n

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

n = int(input())
nums = list(map(int, input().split()))
num_set = set(nums)
if len(nums) == len(num_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):
import sys
input = sys.stdin.readline

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

len_a = len(a)
set_a = len(set(a))

if len_a == set_a:
    print('Yes')
else:
    print('No')


import sys
input = sys.stdin.readline

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

len_a = len(a)
set_a = len(set(a))

if len_a == 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
a=int(input())
b=list(map(int,input().split()))
for i in range(a):
  for j in range(1,a):
    if b[i]==b[j]:
      print('NO')
      sys.exit()
print('YES')

import sys
a=int(input())
b=list(map(int,input().split()))
c=[]
for i in range(a):
  c+=b[i]
  for i in range(len(c)):
    if b[i]==c[i]:
      print('NO')
      sys.exit()
print('YES')

import sys
a=int(input())
b=list(map(int,input().split()))
c=[]
for i in range(a):
  c+=str(b[i])
  for i in range(len(c)):
    if int(c[i+1])==b[i]:
      print('YES')
      sys.exit()
print('NO')
      
    

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

import sys
a=int(input())
b=list(map(int,input().split()))
c=[]
for i in range(a):
  c+=str(b[i])
  for i in range(len(c)):
    if i==len(c)-1:
      break
    if int(c[i+1])==b[i]:
      print('YES')
      sys.exit()
print('NO')
      
    

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


Verdicts: Wrong Answer

Runtime Error

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 has_duplicates(seq):
    return len(seq) != len(set(seq))

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


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


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


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

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

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

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


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


iranai  =input()
l   =   input()
aa  =   l.split(sep=" ")
if has_duplicates(aa):
    print("YES")
else:
    print("NO")




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

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

n=int(input())
a=list(map(int,input().split()))
ans='Yes'
for i in range(1,n):
    for j in range(i):
        if a[i]==a[j]:
            ans='No'
            break
print(ans)

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

Verdicts: 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):
def solve():
    N = int(input())
    array = list(map(int, input().split()))
    if array == list(set(array)):
        print("YES")
    else:
        print("NO")

solve()

def solve():
    N = int(input())
    array = sorted(map(int, input().split()))
    for index in range(1, N):
        if array[index] == array[index - 1]:
            print("NO")
            return
    print("YES")
solve()

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

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


n=int(input())
b=len(set((map(int,input().split()))))
if n==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,*a = map(int,open(0).read().split())
a.sort()
flag = True
for i in range(1,N):
  if a[i]==a[i-1]:
    print('No')
    flag=False
    break
if flag ==True:
  print('Yes')

N,*a = map(int,open(0).read().split())
a.sort()
flag = True
for i in range(1,N):
  if a[i]==a[i-1]:
    print('NO')
    flag=False
    break
if flag ==True:
  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):
if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
  
f len(set(A)) == len(A):
    print('Yes')
else:
    print('No')

if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))

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

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

if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
  
if len(A) == N:
    print('Yes')
else:
    print('No')

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

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

Verdicts: Runtime Error

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 = [int(x) for x in input().split]
for i in A:
    for j in A:
        if i == j:
            print('NO')
        else:
            print('YES')
            

N = int(input())
A = [int(x) for x in input().split()]
NO = False
while NO == False:
    for i in A:
        j=0
        if A[j] == i:
            j += 1
            NO = True
if NO == True:
    print('NO')
else:
    print('YES')


N = int(input())
A = list(map(int,input().split()))
S = sorted(A)
Check = False
for i in range(len(S)-1):
    if S[i] == S[i+1]:
        Check = True
        break
if Check == True:
    print('NO')
else:
    print('YES')
    

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

print(A[0] in A[1:])

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

if A[0] in A[1:] :
    print('YES')
else:
    print('NO')

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

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

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

print(A[0] in A[1:])

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

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

Verdicts: 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("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()))
s = set(a)
if len(s) == n:
    print('Yes')
else:
    print('No')

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

n = int(input())
a = list(map(int,input().split()))
s = set(a)
if len(s) == 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):
import collections
n=int(input())
A = list(map(int, input().split
c=collections.Counter(A)
if c==len(A):
    print("YES")
else:
    print("NO")

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

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

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

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

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

Verdicts: Runtime Error

Wrong Answer

Runtime Error

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())
List=list(map(int,input().split()))
Set=set()
for i in range(len(List)):
    Set.add(List[i])
if len(Set)==n :
    print("Yes")
else :
    print("No")

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

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()
if n in A:
  print("YES")
else:
  print("NO")
N = int(input())
A = [int(x) for x in input().split()]

if n in A:
  print("YES")
else:
  print("NO")
提出情報
提出日時

N = input()
A = input().split()
if N in A:
  print("NO")
else:
  print("YES")

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

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

if n in A:
  print("YES")
else:
  print("NO")

N = input()
A = input().split()
if n in A:
  print("YES")
else:
  print("NO")

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

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Accepted