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

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

ii = len(An)

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



N = int(input()) 

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

ii = len(An)

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


N = int(input()) 

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

ii = len(An)

if len( set(An) ) == ii:
    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):
a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a-1):
 if c[i]==c[i+1]:
  print("No")
  break
 else:print("Yes")
 break


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

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



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



a=int(input())
b=list(input().split())
c=sorted(b)
ans=0
for i in range (a-1):
 if c[i]==c[i+1]:
  ans=1
  break
if ans==0:
	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):
input()
a = [int(x) for x in iput().split()]
if(len(set(a)) < len(a)):
  print('YES')
else:
  print('NO')

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

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


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


import collections
n = int(input())
ls = list(map(int,input().split()))
if len(ls) == len(collections.Counter(ls)):
    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):
from collections import Counter

n=int(input())

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

cc=Counter(arr)
for k,v in cc.items():
  if v>1:
    print("NO")
    break
else:
print("NO")


#from collections import Counter
n=int(input())
arr=list(map(int,input().split()))
di={}
for i in arr:
  if i in di:
    print("NO")
    break
  else:
    di[i]=1
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()
#print(A)
yesno = 'NO'
for i in range(len(A)-1):
    if A[i]==A[i+1]:
        yesno = 'YES'
        break
print(yesno)

N = int(input())
A = list(map(int, input().split()))
A.sort()
#print(A)
yesno = 'No'
for i in range(len(A)-1):
    if A[i]==A[i+1]:
        yesno = 'Yes'
        break
print(yesno)   

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

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())
if(sorted(Counter([i for i in input().split()]).most_common())[0][1] > 1):
  print('No')
else:
  print('Yes') 


from collections import Counter
n = int(input())
if(sorted(Counter([i for i in input().split()]).most_common(), key=lambda x: x[1], reverse = True)[0][1] > 1):
  print('NO')
else:
  print('YES') 


Verdicts: Wrong Answer

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

Submission attempts (in order):
import sys

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

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

import sys


def main():
  input = sys.stdin.readline
  n = int(input())
  a_li = list(input().split())
  a_li = [int(s) for s in a_li]

  a_li.sort()
  for i in range(n-1):
    if a_li[i] == a_li[i+1]:
      print("NO")
      sys.exit()
  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 = input()
x = list(map(int, input().split()))
s = set()
list(map(s.add, x))
if len(s) != len(x):
  print('YES')
else:
  print('NO')


n = input()
x = list(map(int, input().split()))
s = set()
list(map(s.add, x))
print(len(s))


n = input()
x = list(map(int, input().split()))
s = set()
list(map(s.add, x))
if len(s) == len(x):
  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())
aa = map(int, input().split())
if len(set(aa)) != N:
  print('NO')
else:
  print('YES)

N = int(input())
aa = map(int, input().split())
if len(set(aa)) != N:
  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(" ")))
Triger = 0
if len(A) > 200000:
  print("No")
else:
  A.sort()
  for i in range(1,len(A)-1):
    if A[i] == A[i-1]:
      print("No")
      Triger += 1
      break
  if Triger == 0:
    print("Yes")

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())

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

count = 0

for a_item in a:
    ab = a.count(a_item)
    if ab <= 2:
        count += 1
        #print('NO')
       # break

# print('YES')
if count <= 1:
    print('YES')
else:
    print('NO')

n = int(input())

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

count = 0

for index, a_item in enumerate(a):
    ab = a[index:].count(a_item)
    print(ab)
    if ab >= 2:
        count += 1
        #print('NO')
       # break

# print('YES')
if count == 0:
    print('YES')
else:
    print('NO')


n = int(input())

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

count = 0

for index, a_item in enumerate(a):
    ab = a[index:].count(a_item)
    print(ab)
    if ab >= 2:
        count += 1
        break
        #print('NO')
       # break

# print('YES')
if count == 0:
    print('YES')
else:
    print('NO')

n = int(input())

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

a.sort()

count = 0

for i in range(n-1):
    if a[i] == a[i+1]:
        count += 1

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

Verdicts: Wrong Answer

Wrong Answer

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(i) for i in input().split()]
is_same = False

for i in range(n):
    for j in range(i+1, n+1):
        if a[i] == a[j]:
            is_same = True

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

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

a.sort()

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

Verdicts: Runtime Error

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

Submission attempts (in order):
hoge = int(input())
n = list(map(int,input().split()))
ans = "YESt"
count = 0

for i in n :
    
    for j in n :
        if i == j :
            count += 1
    
    if count >= 2 :
        ans = "NO"
    
    count = 0

print(ans)

hoge = int(input())
n = list(map(int,input().split()))
ans = "YESt"
count = 0

for i in n :
    for j in n :
        if i == j :
            count += 1
    if count >= 2 :
        ans = "NO"
        break
    count = 0

print(ans)

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

ans = "YES" if len(n) == len(set(n)) else "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 = [int(i) for i in 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 = [int(i) for i in input().split()]

a = sorted(a)

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


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

for i in range(n-1):
    if a[i] == a[i+1]:
        print("NO")
        exit()
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()))
def has_duplicates2(seq):
    seen = []
    unique_list = [x for x in seq if x not in seen and not seen.append(x)]
    return len(seq) != len(unique_list)
print("YES" if has_duplicates2(a) else "NO")

n = int(input())
a = list(map(int, input().split()))
b = set(a)
a.sort()
if len(a) != len(b):
    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 math
from functools import reduce

N = int(input())
A = list(map(int, input().split()))
print(A)
def gcd_list(numbers):
    return reduce(math.gcd, numbers)
def has_duplicates(seq):
    return len(seq) != len(set(seq))


if gcd_list(A)==1 and has_duplicates(A) == False:
    print("YES")
else:
    print("NO")

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

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


if has_duplicates(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()))
f=sortedlist(s)
d=set(s)
if(len(s)==len(d)):
  print("YES")
else:
  print("NO")


n=int(input())
s=list(map(int,input().split()))
f=sorted(list(s))
d=set(s)
if(len(s)==len(d)):
  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()) 
N = list(map(int,input().split()))
N.sort()
for i in range(0,n-1):
    if N[i] == N[i+1]:
        print('No')
        break
else:
    print('Yes')

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


n = int(input()) 
N = list(map(int,input().split()))
N.sort()
for i in range(0,n-1):
    if N[i] == N[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, K = map(int, input().split())
p = list(map(int, input().split()))

S = [0]*(N+1)
for i in range(N):
  S[i+1] = S[i] + (1+p[i])/2

ans = 0
for i in range(N-K+1):
  diff = S[i+K] - S[i]
  ans = max(ans, diff)
print(ans)

N = int(input())
a = list(map(int, input().split()))
if len(a)==len(set(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):
from collections import Counter
import sys
n = int(input())
l = sys.stdin.read().split()
c = counter(l)
m = max(c.values())

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

n = int(input())
flag = 1
l = []
for i in range(n):
    a = int(input())
    if a in l:
        flag = 0
        break
    else:
        l.append(a)
if(flag==1):
    print("YES")
else:
    print("NO")

from collections import Counter
import sys
n = int(input())
l = sys.stdin.read().split()
c = counter(l)
m = max(c.value())

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

from collections import Counter
import sys
n = int(input())
l = sys.stdin.read().split()
c = Counter(l)
m = max(c.values())

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

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

#include <algorithm>
#include <cstdio>

#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <map>
using namespace std;
//cout <<  << endl;
typedef long long int ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
#define MOD 1000000007
#define MAX_V 100010
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N]={0};
 
ll fib(ll a){
    if (fibl[a]!=0)return fibl[a];
    if (a==0){
        return 0;
    }else if (a==1){
        return 1;
    }
    return fibl[a]=fib(a-1)+fib(a-2);
}
 
ll eratosthenes(ll n) {
    int p = 0;
    for (ll i=0; i<=n; ++i) x[i] = true;
    x[0] = x[1] = false;
    for(int i=2; i<=n; ++i) {
        if(x[i]) {
            p++;
            for(int j=2*i; j<=n; j+=i) x[j] = false;
        }
        
        num[i] = p;
    }
    return p;
}
bool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
    return firstElof.first < secondElof.first;
}
 
ll gcd(ll a,ll b){
    if (a%b==0)return(b);
    else return(gcd(b,a%b));
}
 
ll junnretu(ll n){
    ll ans=1;
    for (ll i=1;i<=n;i++){
        ans*=i;
    }
    return ans;
}
 
map<ll,ll> prime_factor(ll n){
    map<ll,ll> mp;
    for(ll i=2; i*i<=n; i++){
        while(n % i == 0){
            mp[i]++;
            n /= i;
        }
    }
    if(n != 1) mp[n] = 1;
    return mp;
}
 
ll keta(ll N){
    int tmp{};
    while( N > 0 ){
        tmp += ( N % 10 );
        N /= 10;
    }
    N = tmp;
    return N;
}

int main(){
    ll s;
    cin >> s;
    ll x[s];
    for (ll i=0;i<s;i++){
        cin >> x[i];
        for (ll j=0;j<=i;j++){
            if (x[i]==x[j]){
                cout << "NO" << endl;
                return 0;
            }
        }
    }
    cout << "YES" << endl;
    return 0;
}


import collections
a=input()
a=int(a)
b=input().split()
c = collections.Counter(b)
        
if (len(c)==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):
n=int(input())
a=sorted(list(map(int,input().split())))
ans='YES'
for i in range(n):
  if a[i]==a[i+1]:
    ans='NO'
  if ans=='NO':
    break
print(ans)

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

Verdicts: Runtime Error

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

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

for i in range(n):
  if l[i] in d:
    flag=1
    break
    
if flag==0:
  print("YES")
else:
  print("NO")

n=int(input())
l=list(map(int,input().split()))
d={}
flag=0

for i in range(n):
  if l[i] in d:
    flag=1
    break
  else:
    d[l[i]]=1
    
if flag==0:
  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()))
tmp=set(A)
tmp=list(tmp)


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

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


if len(tmp)==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(' ')))
bucket = [0]*1000000001

distinct = True
for i in a:
    if bucket[i] != 0:
        distinct = False
        break
    bucket[i] += 1
    
if distinct:
    print("Yes")
else:
    print('No')

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

distinct = True
for i in a:
    if i in m:
        distinct = False
        break
    m[i] = 1
    
if distinct:
    print("YES")
else:
    print('NO')

Verdicts: Runtime Error

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

Submission attempts (in order):
from collections import Counter

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

if [1 ** N] == Counter(A).values():
    print("Yes")
else:
    print("No")

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

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

from collections import Counter

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

if [1 ** N] == Counter(A).values():
    print("YES")
else:
    print("NO")

from collections import Counter

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

if [1] * N == list(Counter(A).values()):
    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 = list(map(int, input().split()))
a = sorted(a)
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 = sorted(a)
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):
cnt = int(input())
tar_array = input().split()
tar_array.sort()

out = "YES"
tar = ""
print(tar_array)
for i in range(cnt):
  if tar == tar_array[i]:
    out = "NO"
    break
  tar = tar_array[i]

print(out)

cnt = int(input())
tar_array = input().split()
tar_array.sort()

out = "YES"
tar = ""
for i in range(cnt):
  if tar == tar_array[i]:
    out = "NO"
    break
  tar = tar_array[i]

print(out)

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


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

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

if int(len([i for i in a if a.count(i) >= 2])) !=0:
    print("No")
else :
    print("Yes")

input()

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

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

Verdicts: Wrong Answer

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

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

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

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

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

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


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

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
n = int(input())
s = set(input().split())
if n == s:
  print('YES')
else:
  print('NO')

n = int(input())
s = len(set(input().split()))
if n == 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):
# -*- coding: utf-8 -*-
import numpy as np

n = int(input())
a = np.array(input().split(), dtype='int')

ans = ''
count_all = 0

for j in range(n):
    num = a[j]
    if len(a[a == num]) != 1:
        ans == 'NO'
        break
    a = np.delete(a, j)

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

# -*- coding: utf-8 -*-
import numpy as np

n = int(input())
a = np.array(input().split(), dtype='int')

a_sort = np.sort(a)
ans = ''

for i in range(n - 1):
    if a_sort[i] == a_sort[i + 1]:
        ans = 'NO'
        break
    
if ans == 'NO':
    print(ans)
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()))

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

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

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

ans = 'YES'

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

print(ans)

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

ans = 'YES'

for i in range(n):
    for j in range(i, n-i):
        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(n):
    for j in range(j, n-i):
        if 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(n-1):
    if a[i] == a[i+1]:
        ans = 'NO'
        break

print(ans)

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

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

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






A = sorted(A)

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

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



 


A = sorted(A)
 
ans = 'YES'
for i in range(N-1):
  if A[i] == A[i+1]:
    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):
import sys
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")
    sys.exit()
print("Yes")

import sys
N = int(input())
An = sorted(list(map(int,input().split())))

for i in range(N-1):
  if An[i] == An[i+1]:
    print("NO")
    sys.exit()
print("YES")

Verdicts: Wrong Answer

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

Submission attempts (in order):
N=int(input())
A=set(map(int,input().split()))
print('YNeos'[N!=len(A)::2])

N=int(input())
A=set(map(int,input().split()))
print('YNEOS'[N!=len(A)::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):
def main():
    N = int(input())
    List = list(map(int,input().split()))
    Set = set()
    for i in List:
        if i in Set:
        	print('No')
        	return
        Set.add(i)
    print('Yes')
    return
main()

def main():
    N = int(input())
    List = list(map(int,input(),split()))
    Set = set()
    for i in List:
      if i in Set:
        print('No')
        return
      Set.add(i)
	print('Yes')
main()

def main():
    N = int(input())
    List = list(map(int,input().split()))
    Set = set()
    for i in List:
        if i in Set:
        	print('NO')
        	return
        Set.add(i)
    print('YES')
    return
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):
input()
words = input().split(" ")
for i, w in enumerate(words):
  for ii, ww in enumerate(words):
    if i != ii and w == ww:
      print("YES")
      exit()
print("NO")

len1 = input()
len2 = set(input().split(" "))
if len1 == len2:
  print("YES")
else:
  print("NO")


len1 = input()
len2 = len(set(input().split(" ")))
if len1 == len2:
  print("YES")
else:
  print("NO")


len1 = int(input())
len2 = set(input().split(" "))
if len1 == len2:
  print("YES")
else:
  print("NO")


input()
words = input().split(" ")
for w in words:
  if words.count(w) >= 2:
    print("YES")
    exit()
print("NO")

len1 = int(input())
len2 = len(set(input().split(" ")))
if len1 == len2:
  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):
def resolve():
    N = int(input())
    A = list(map(int,input().split()))
    c = collections.Counter(A)
    C = max(c.values())
    if C > 1 :
        print('NO')
    else:
        print('YES')
resolve()

import  collections
def resolve():
    N = int(input())
    A = list(map(int,input().split()))
    c = collections.Counter(A)
    C = max(c.values())
    if C > 1 :
        print('NO')
    else:
        print('YES')
resolve()

Verdicts: Runtime Error

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

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

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

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

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
n = 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(a_list) == len(set(a_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 = input().split()
c=list(map(int, input().split()))


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

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

if(len(c) != len(set(c))):
    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,k] = [int(i) for i in input().split()]
p = [(int(i)+1)/2 for i in input().split()]

a = []
#print(a)
ans = -1
ruiseki = []
for i in range(n-k+1):
    ruiseki.append(sum(p[i:i+k]))
print(max(ruiseki))


n = int(input())
a = [int(i) for i in input().split()]
dic = {}
for i in range(n):
	try:
		dic[a[i]] += 1
	except:
		dic[a[i]] = 1
if max(dic.values()) > 1:
	print("Yes")
else:
  	print("No")


n = int(input())
a = [int(i) for i in input().split()]
dic = {}
for i in range(n):
	try:
		dic[a[i]] += 1
	except:
		dic[a[i]] = 1
if max(dic.values()) > 1:
	print("No")
else:
  	print("Yes")


n = int(input())
a = [int(i) for i in input().split()]
dic = {}
for i in range(n):
	try:
		dic[a[i]] += 1
	except:
		dic[a[i]] = 1
if max(dic.values) > 1:
	print("Yes")
else:
  	print("No")

n = int(input())
a = [int(i) for i in input().split()]
dic = {}
for i in range(n):
	try:
		dic[a[i]] += 1
	except:
		dic[a[i]] = 1
if max(dic.values()) > 1:
	print("NO")
else:
  	print("YES")


Verdicts: Runtime Error

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()))
b=[]
flag=True
for i in range(n):
  if a[i] in b:
    flag=False
    break
  else:
    b.append(a[i])
if flag:
  print("Yes")
else:
  print("No")

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
N=int(input())
li = list(map(int,input().split()))	
num = {}
for l in li:
    print(num)
    if str(l) not in num  :
        num[l] = 1
    else:
        print("NO")
        break
else:
    print("YES")



N=int(input())
li = list(map(int,input().split()))	
num = {}
for l in li:
    if str(l) in num != True:
        num[l] = 1
    else:
        print("NO")
        break
else:
    print("YES")





N=int(input())
li = list(map(int,input().split()))	
num = {}
for l in li:
    if str(l) not in num :
        num[str(l)] = 1
    elif num[str(l)]==1:
        print("NO")
        break
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):
N = int(input())
A = list(map(int,input().split()))

import collections
counter = collections.Counter(A)

for i in list(counter.values()):
    if not i == 1:
        print("No")
        exit()
else:
    print("Yes")


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

import collections
counter = collections.Counter(A)

for i in list(counter.values()):
    if not i == 1:
        print("No")
        exit()
print("Yes")


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

import collections
counter = collections.Counter(A)

for i in list(counter.values()):
    if not i == 1:
        print("NO")
        exit()
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()))
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: 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 b == a:
    print("YES")
else:
    print("NO")

n = int(input())
a = 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()))

a=0
i=-1
while True:
  i+=1
  if A.count(A[i])>=2:
    print("NO")
    a=1
    break
  else:
    A.remove(A[i])
    i-=1
    
if a==0:
  print(A)
  print("YES")

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

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

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

a=0
for i in A:
  if A.count(i)>=2:
    print("No")
    a=1
    break

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

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

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

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

n = int(input())

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

n = int(input())

a = list(map(int, input().split()))
ngcounter = 0
a.sort()
for i in range(n-1):
  if a[i] == a[i+1]:
    ngcounter += 1
    break
  
if ngcounter > 0:
  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, k = map(int, input().split())
p = [int(i) for i in input().split()]
maxp = 0
for i in range(n - k + 1):
    sump = sum(p[i: i + k])
    if maxp < sump:
        maxp = sump
        j = i
print((maxp + k) / 2)

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

N=int(input())
A=input().split()
a=[]
for i in range(len(A)):
  x=int(A[i])
  a.append(x)
for i in range(N):
  if a[i] in A[i+1:]:
    print("NO")
  else:
    print("YES")

import numpy as np
N=int(input())
a=list(map(int, input().split()))
A=np.array(a)
def has_duplicates(seq):
    return len(seq) != len(set(seq))

s=has_duplicates(A)
if s==False:
  print("YES")
elif s==True:
  print("NO")

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
i=int(input())
x=[]
for i in range(0,i):
  a=int(input())
  if a in x:
    c=0
    break
  else:
    c=1
if(c==0):
  print("NO")
else: 
  print("YES")

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

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

if(has_duplicates(L) == False):
    print("Yes")
else:
    print("No")

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

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

if(has_duplicates(L) == False):
    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 a.sort()==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 = input().split()
flag = 1
A.sort()

for i in range(N):
	if A[i] == A[i+1]:
		flag = 0
		break
if flag==0:
	print('NO')
elif flag==1:
	print('YES')



N = int(input())
A = input().split()
flag = 1
A.sort()

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



Verdicts: Runtime Error

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

Submission attempts (in order):
n = int(input())
a = list(map(int,input().split()))
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 = input().split()
for i in range (N) :
    A[i] = int(A[i])

A = sorted(A)
fl = True

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

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


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


Verdicts: Wrong Answer

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

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

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


if __name__ == '__main__':
    main()


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

    print('YES' if len(a_list) == len(set(a_list)) else '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(map(int,input().split()))
x=0
a.sort()
for i in range(n-1):
  if a[i]==a[i+1]:
    x+=1
if x=0:
  print("YES")
else:
  print("NO")


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

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

Verdicts: Runtime Error

Runtime Error

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

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

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

if has_duplicates(b) == 1:
  print("YES")
elif has_duplicates(b) == 0:
  print("NO")

n = int(input())
lis = list(map(int, input().split()))
dic = {}
for i in lis:
    dic[i] = dic.get(i, 0) + 1
for j in dic.values():
    if j != 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):
import numpy as np

N = int(input())
x = np.array(list(map(int, input().split())))

ans = 0
for i in range(N):
	if x[i] in x[0:i]:
		ans = 1
		break
if ans == 1:
	print("No")
else:
	print("Yes")




import numpy as np

N = int(input())
x = np.array(list(map(int, input().split())))
x = np.sort(x)

ans = 0
for i in range(1,N):
	if x[i] == x[i-1]:
		ans = 1

if ans == 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 = input()
words = list(input().split())

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

N = int(input())
numbers = set(map(int, input().split()))

if len(numbers) == 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())
l1=list(map(int,input().split()))
l2=list(set(l1))
L2=len(l2)
print('Yes' if n==L2 else 'No')

n=int(input())
l1=list(map(int,input().split()))
l2=list(set(l1))
L2=len(l2)
print('YES' if n==L2 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())
l = [int(i) for i in input().split()]

l.sort()

print('Yes' if all([l[i]!=l[i+1] for i in range(n-1)]) else 'No')

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

l.sort()

print('YES' if all([l[i]!=l[i+1] for i in range(n-1)]) 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):
S=int(input())
T = input().split()
U = [int(T(i)) for i in S]
U.sort
r = 0

for i in S-1:
  if(T[i] == T[i+1]):
    r++
    
if(r==0):
  print("YES")
else:
  print("NO")

S=int(input())
T = input().split()
U = [int(i) for i in T]
U.sort()
r = 0

for i in range(S-1):
  if(U[i] == U[i+1]):
    r+=1
    
if(r==0):
  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()))	
l = list()

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

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

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

Verdicts: Wrong Answer

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

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


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

flg = has_duplicates(a)

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

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


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

flg = has_duplicates(a)

if not flg:
    print('YES')
else:
    print('NO')

Verdicts: Wrong Answer

Accepted