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):
def distinct_or_not(a_list):
    tmp_list = []
    for a in a_list:
        if a not in tmp_list:
            tmp_list.append(a)
        else:
            return 'No'
    return 'Yes'

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

print(distinct_or_not(a_list))

def distinct_or_not_2(a_list):
    a_list.sort()
    for i in range(len(a_list)-1):
        if a_list[i] == a_list[i+1]:
            return 'NO'
    return 'YES'

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

print(distinct_or_not_2(a_list))

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
l= sys.stdin.readline()
count = int(l.strip())
l = sys.stdin.readline()
nums = list(map(int, l.split()))
check = dict()
for n in nums:
  if n in check:
    print("YES")
   	break
  else:
    check[n] = True
print("YES")

import sys
def main():
    l= sys.stdin.readline()
    count = int(l.strip())
    l = sys.stdin.readline()
    nums = list(map(int, l.split()))
    check = dict()
    for n in nums:
        if n in check:
            return "NO"
            
        else:
            check[n] = True
    return "YES"
if __name__ == "__main__":
    print(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):
import sys

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

for i in range(1, N):
    if AList[i - 1] == AList[i]:
        print('No')
        sys.exit()
        
print('Yes')

import sys

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

for i in range(1, N):
    if AList[i - 1] == AList[i]:
        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):

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

if __name__ == '__main__':
  	main()


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


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

if __name__ == '__main__':
  	main()


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

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 = set(a)
if len(a) == len(b):
  print('YES')
else:
  print('NO')v

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



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

def solution(N, A):
    for i in range(N - 1):
        if A[i] == A[i + 1]:
            return "No"
    return "Yes"

print(solution(N, A))


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

def solution(N, A):
    for i in range(N - 1):
        if A[i] == A[i + 1]:
            return "NO"
    return "YES"

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

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


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

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

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

t = max(d.values())

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


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

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

t = max(d.values())

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


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

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

t = max(d.values())

print("YES") if t == 1 else print("NO")


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

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


n = int(input())
aList = list(input().split())
print("YES" if len(aList) == len(set(aList)) 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):
from sys import stdin
import sys

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



from sys import stdin
import sys

#S,T = stdin.readline().rstrip().split()
#A,B = [int(x) for x in stdin.readline().rstrip().split()]
N = stdin.readline().rstrip().split()
s = list(map(int,input().split()))
dict={}
for _,i in enumerate(s):
  
  if dict.get(i)==None:
    dict[i]=1
  else :
    print("NO")
    sys.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())
A = input().split()
if N == len(list(set(A))):
  print('Yes')
else:
  print('No')

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

c=b.copy()
c=set(c)
if len(b)!=len(c):
    print("YES")
else:
    print("NO")


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

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
a_list = list(map(int, input().split()))
a_hash = {}
for a in a_list:
    if a in a_hash:
        print("No")
        exit()
    a_hash[a] = True
print("Yes")


n = int(input())
a_list = list(map(int, input().split()))
a_hash = {}
for a in a_list:
    if a in a_hash:
        print("NO")
        exit()
    a_hash[a] = 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):
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")

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

Verdicts: Wrong Answer

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

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

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

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(['No','Yes'][(len(set(A))==len(A))])

N=int(input())
A=list(map(int,input().split()))
print(['No','Yes'][int(len(set(A))==len(A))])

N=int(input())
A=list(map(int,input().split()))
print(['NO','YES'][int(len(set(A))==len(A))])

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()))
b=len(a)
c=collections.Counter(a)
e=len(c.values())
print(e)
if b==e:
    print("YES")
else:
    print("NO")

import collections
n=int(input())
a=list(map(int,input().split()))
b=len(a)
c=collections.Counter(a)
e=len(c.values())
print(e)
if b==e:
    print("Yes")
else:
    print("No")

import collections
n=int(input())
a=list(map(int,input().split()))
b=len(a)
c=collections.Counter(a)
e=len(c.values())
if b==e:
    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
n=int(input())
a=list(map(int, input().split()))
c=Counter(a)
print('Yes' if len(a)==len(c) else 'No')

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


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

n = input()
l = input().split(" ")
s = set(l)

if len(s) == len(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):
N = int(input())
A = []

tmp = input().split()

for i in range(N):
  A.append(int(tmp[i]))
    
A.sort()

hantei = True

for i in range(N):
  tmp = i
  if i == tmp:
    hantei = False
    
if hantei == True:
  print("YES")
else:
  print("NO")

N = int(input())
A = []

tmp = input().split()

for i in range(N):
  A.append(int(tmp[i]))
    
A.sort()

hantei = True

for i in range(N-1):
  if A[i] == A[i+1]:
    hantei = False
    
if hantei == True:
  print("YES")
else:
  print("NO")

Verdicts: Wrong Answer

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

Submission attempts (in order):
N =int(input())
A = list(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

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 = []

for i in range(N):
  A_list.append(int(input()))
  
len_org = len(A_list)
len_uniq = len(list(set(A_list)))

if len_org == len_uniq:
  print("YES")
else:
  print("NO")

N = int(input())
A_list = []

hoge = input().split()

for i in range(N):
  A_list.append(int(hoge[i]))
  
len_org = len(A_list)
len_uniq = len(list(set(A_list)))

if len_org == len_uniq:
  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())
s = set(map(int,input().split()))
print('YNeos'[n!=len(s)::2])

n = int(input())
s = set(map(int,input().split()))
print('YNEOS'[n!=len(s)::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, *D,  = [list(map(int, s.split())) for s in open(0)]
n, D =  n[0], D[0]
if n == len(set(D)):
    print("Yes")
else:
    print("No")

def main():
    N = int(input())
    nums = list(map(int, input().split()))

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


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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
n=int(input())
a=list(map(int,input().split()))
ans=0
a=sorted(a)
for i in range(n):
  if a[i]==a[i+1]:
    ans=1
    break
if ans==1:
  print('NO')
else:
  print('YES')

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


n=int(input())
a=list(map(int,input().split()))
ans=0
b=sorted(a)
for i in range(n-1):
  if b[i]==b[i+1]:
    ans=1
    break
if ans==1:
  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):
N = (int)(input())
A = list(map(int, input().split()))

def hash(a):
    return a%10


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

    return 'YES'

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

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

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

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

A.sort()
# print(A)
flag = False
for i in range(len(A)):
    if(i+1 < len(A)):
        if(A[i] == A[i+1]):
            print("NO")
            flag = True
            break
if(not flag):
    print("YES")

Verdicts: Wrong Answer

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

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


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

Verdicts: Wrong Answer

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

Submission attempts (in order):
N=int(input())
A=input()
print(len(set(A)))
if len(set(A))-1==N:
    print("Yes")
else:
    print("No")

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

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

N=int(input())
A=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):
from collections import defaultdict
n = int(input())
d = defaultdict(int)
A = list(map(int,input().split()))

for a in A:
    if d[a] == 1:
        print('No')
        exit()
    else:
        d[a] += 1

print('Yes')


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

if lrn(cs) == n:
  print("YES")
else:
  print("NO")

n = int(input())
xs = set(map(int,input().split()))

if len(xs) == 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
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
values,counts = zip(*c.most_common())
print(counts)
if counts[0] != 1:
    print('NO')
else :
    print('YES')

import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
values,counts = zip(*c.most_common())
if counts[0] != 1:
    print('No')
else :
    print('Yes')

import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
values,counts = zip(*c.most_common())
if counts[0] != 1:
    print('NO')
else :
    print('YES')

Verdicts: Wrong Answer

Wrong Answer

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

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


n = input()
s = input().split()
_set = set(s)
if len(s) == len(_set):
    print('Yes')
else:
    print('No')


# abc132A


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

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


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


# abc132A



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


# abc132A



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

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


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


# abc132A

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

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

n=int(input())
a=list(map(int,input().split()))
aa=set(a)
if len(a)==len(aa):
  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 = [int(i) for i in input().split()]
for i,a in enumerate(A):
    if a in A[i+1:]
        print("NO")
        sys.exit(0)
print("YES")

N = int(input())
A = [int(i) for i in input().split()]
def test(A):
    return len(A)!= len(set(A))
if test(A)==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())

s = list(map(int, input().split()))
print(s)
t = set(s)
if len(t) == len(s):
    print("YES")
else:
    print("NO")

n = int(input())

s = list(map(int, input().split()))
#print(s)
t = set(s)
if len(t) == 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):
from collections import Counter
n = int(input())
a = list(map(int,input().split()))
acount = Counter(a)
if n == (len(list(acount.keys()))):
         print("Yes")
else:
         print("No")


from collections import Counter
n = int(input())
a = list(map(int,input().split()))
acount = Counter(a)
if n == (len(list(acount.keys()))):
         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()))
if len(m) == len(list(set(m))):
    print('Yes')
else:
    print('No')

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
from sys import stdin

n = int(stdin.readline().rstrip())
d = [int(x) for x in stdin.readline().rstrip().split()]

m = [0] * 100

for i in d:
    m[i] += 1

result = 0
for i in m:
    if (i > 1):
        result += 1

if (result > 0):
    print("No")
else:
    print("Yes")

from sys import stdin

n = int(stdin.readline().rstrip())
d = [int(x) for x in stdin.readline().rstrip().split()]

m = [0] * 1000000000

for i in d:
    m[i] += 1

result = 0
for i in m:
    if (i > 1):
        result += 1

if (result > 0):
    print("No")
else:
    print("Yes")

from sys import stdin

n = int(stdin.readline().rstrip())
d = [int(x) for x in stdin.readline().rstrip().split()]

m = [0] * 100

for i in d:
    m[i] += 1

for i in m:
    if (i > 1):
        print("No")
    else:
        print("Yes")

from sys import stdin
import math

n = int(stdin.readline().rstrip())
a = [int(x) for x in stdin.readline().rstrip().split()]

d = {}
for aa in a:
    if aa in d.keys():
        d[aa] += 1
    else:
        d[aa] = 1

result = 'YES'
for key, value in d.items():
    if value > 1:
        result = 'NO'

print(result)

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

n_list = map(int,input().split())
n_set = set(n_list)

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


n = int(input())

n_list = map(int,input().split())
n_set = set(n_list)

if len(n_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):
import numpy as np
def f(n, a):
    if len(np.unique(a)) == a:
        print('YES')
    else:
        print('NO')

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

f(n, a)


def f(n, a):
    if len(np.unique(a)) == a:
        print('YES')
    else:
        print('NO')

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

f(n, a)


import numpy as np
def f(n, a):
    if len(np.unique(a)) == n:
        print('YES')
    else:
        print('NO')

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

f(n, a)


import numpy as np
def f(n, a):
    if len(np.unique(a)) == n:
        print('YES')
    else:
        print('NO')

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

f(n, a)


Verdicts: Wrong Answer

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

b = len(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: 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()
for i in range(n-1):
    if a[i]==a[i+1]:
        print('No')
        exit()
print('Yes')

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

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

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):
s = set()
n = input()
for i in map(int,input().split()):
  if i in s:
    print("YES")
    exit(0)
  else:
    s.add(i)
print("NO")

s = set()
n = input()
for i in map(int,input().split()):
  if i in s:
    print("NO")
    exit(0)
  else:
    s.add(i)
print("YES")



Verdicts: Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = [int(input().split() for i in range(N))]
dup = [j for j in set(A) if A.count(j) > 1]
if dup == True:
  print("NO")
else:
  print("YES")

N = int(input())
A = [list(map(int,input().split())) for i in range(N)]
dup = [i for i in set(A) if A.count(i) > 1]
if not dup:
  print("YES")
else:
  print("NO")

N = map(int,input())
A = [list(map(int,input().split())) for i in range(N)]
dup = [i for i in set(A) if A.count(i) > 1]
print("NO" if dup else "YES")


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

N = int(input())
A = [input().split() for i in range(N)]
dup = [j for j in set(A) if A.count(j) > 1]
if dup == True:
  print("NO")
else:
  print("YES")

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

Verdicts: Runtime Error

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):
from math import gcd
N=int(input())
A=list(map(int,input().split()))
flg=1
for i in range(N):
    for j in range(i+1,N):
        if gcd(A[i],A[j])!=1:
            flg=0
print("YES" if flg else "NO")        
        

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

Verdicts: Runtime Error

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

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

n = int(input())
A = list(map(int,input().split()))
for a in A:
  if A.count(a) != 1:
    print('No')
    break
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: 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 = list(map(int, input().split()))

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

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

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

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

if len(set(a_list)) == 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=input()
nums=list(map(int, input().split()))
nums.sort()
res = True
prev = None
for i in nums:
    if i == prev:
        res = False
    else:
        prev = i
if res:
    "YES"
else:
    "NO"

n=input()
nums=list(map(int, input().split()))
nums.sort()
res = True
prev = None
for i in nums:
    if i == prev:
        res = False
    else:
        prev = i
if res:
    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())

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

if len(set(an)) == len(an) :
    print("Yes")

else :
    print("No")


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

n = int(input())

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

an.sort()

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

else :
    print("Yes")


n = int(input())

an = map(int, input().split())

an = list(an)

if len(set(an)) == n :
    print("Yes")

else :
    print("No")


n = int(input())

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

an.sort()

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


n = int(input())

an = map(int, input().split())

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


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
N = map(int,input())

A = set(map(int,input().split()))

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

N = int(input())

A = set(map(int,input().split()))

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int (input())
a = [input() for _ in range(n)]
if ( a(i) != a(i+1) ):
  print("Yes)
else:
  print("No")


n = int (input())
a = [input() for _ in range(n)]
if ( a(i) != a(i+1) ):
  print("Yes")
else:
  print("No")


n = int (input())
a = [input() for _ in range(n)]
if ( a(i) != a(i+1) ):
  print('Yes')
else:
  print('No')


n = int(input())
a = set(map(int, input().split()))
ans = "YES"
if len(a) != n: 
  ans = "NO"
  
print(ans)



Verdicts: 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()))
A.sort()
for i in range(N-1):
    if A[i] == A[i+1]:
        print('NO')
        exit()
print('YES')
    

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

Verdicts: Runtime Error

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

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

s=set(a)

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


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

s=set(a)

if len(s)==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):
def check_all_distinct(A):
  already_seen_chars = list()
  for character in A:
    if character not in already_seen_chars:
      already_seen_chars.append(character)
      print(already_seen_chars)
    else: return "NO"
  return "YES"


if __name__ == "__main__":
  N = int(input())
  A = input().split()
  print(check_all_distinct(A))

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

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

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

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

Verdicts: 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(reverse=True)
f = False
for i in range(n-1):
    if a[i+1] - a[i] == 0:
        f = True
        break

if f == True:
    print('No')
else:
    print('Yes')

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

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

if f == 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):
import sys
from itertools import groupby


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


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


if __name__ == "__main__":
    solve()


import sys
from itertools import groupby


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


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


if __name__ == "__main__":
    solve()


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())
che={}
ans='Yes'
a = list(map(int, input().split()))
for i in a:
  if i in che.keys():
    ans='No'
  else:
    che[i]=0
print(ans)
  
  

n= int(input())
che={}
ans='YES'
a = list(map(int, input().split()))
for i in a:
  if i in che.keys():
    ans='NO'
  else:
    che[i]=0
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 = input()
nums = input().split(" ")
nums = [int(i) for i in nums]

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

N = int(input())
nums = input().split(" ")
nums = [int(i) for i in nums]

if len(set(nums)) == 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):
a = int(input())
b = input().split()
mydict = {}
for i in range(len(b)):
    mydict[b[i]] = 1
print(mydict)
if len(mydict) == a:
    print('YES')
else:
    print('NO')

a = int(input())
b = input().split()
mydict = {}
for i in range(len(b)):
    mydict[b[i]] = 1

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


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

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


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

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


Verdicts: Wrong Answer

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

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


def main():
    n = int(input())
    if has_duplicates(list(map(int, input().split(' ')))):
        print('No')
    else:
        print('Yes')


if __name__ == '__main__':
    main()


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


def main():
    n = int(input())
    if has_duplicates(list(map(int, input().split(' ')))):
        print('NO')
    else:
        print('YES')


if __name__ == '__main__':
    main()


Verdicts: Wrong Answer

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

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

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

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

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

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

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

count = 0

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


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

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



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

count = 0

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


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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

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

c = [0]*n
flag = 0
c[0] = a[0]
for i in range(n):
  for j in range(i):
    if c[j] == a[i]:
      flag = 1
      break
  if flag == 1:
    break
  else:
    c[i] = a[i]

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

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

c = [0]*n
flag = 0
c[0] = a[0]
for i in range(n):
  for j in range(i):
    if c[j] == a[i]:
      flag = 1
      break
    else:
      c[i] = a[i]

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

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

c = [0]*n
flag = 0
c[0] = a[0]
for i in range(n):
  for j in range(i):
    if c[j] == a[i]:
      flag = 1
      break
  if flag == 1:
    break
  else:
    c[i] = a[i]

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

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

a.sort()
flag = 0

for i in range(n-1):
  if a[i] == a[i+1]:
    flag = 1
    break
    
if flag == 0:
  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 = [int(x) for x in input().split()]
mySet = set()
for i in A:
  if i in mySet:
    print('NO')
    exit()
    else:
      mySet.add(i)
print('YES')

N = int(input())
A = [int(x) for x in input().split()]
mySet = set()
for i in A:
  if i in mySet:
    print('NO')
    exit()
  else:
      mySet.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())
alist=list(map(int,input().split()))

aset=set(alist)

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

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

Asett=set(Asetttt)

if len(Asett) == n:
	Flag ="YES"
else:
	Flag="NO"
print(Flag)

Verdicts: Wrong Answer

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

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
import numpy as np

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

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

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

print(ans)

n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
for i in range(len(a)):
    b.append((a[i]+1)/2)
for i in range(len(a)-k+1):
    sum=0
    for j in range(i,i+k):
        sum+=b[j]
    if max<=sum:
        max=sum
print(max)

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

print(ans)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

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

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

A.sort()

flag = True
for i in range(len(A) - 1):
    if A[i] == A[i + 1]:
        flag = False
        break
    
if flag:
    print("Yes")
else:
    print("No")

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

A.sort()

flag = True
for i in range(len(A) - 1):
    if A[i] == A[i + 1]:
        flag = False
    
if flag:
    print("Yes")
else:
    print("No")

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

A.sort()

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

cnt=0
for i in range(n):
    for j in range(i+1,n):
        if A[j]!=A[i]:
            cnt+=1

if cnt>1:
    print("No")
else:
    print("Yes")

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

cnt=0
for i in range(n):
    for j in range(i+1,n):
        if A[i]==A[j]:
            cnt+=1

if cnt>1:
    print("No")
else:
    print("Yes")

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

A = list(set(A))

if len(A) == 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(i+1,n):
        if A[j]!=A[i]:
            cnt+=1
print(cnt)
if cnt>1:
    print("No")
else:
    print("Yes")

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

cnt=0
for i in range(n):
    for j in range(i+1,n):
        if A[i]==A[j]:
            cnt+=1
            break

if cnt==1:
    print("YES")
else:
    print("NO")

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

A = list(set(A))

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted