input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int, input().split()))
min_a = min(a)
x = [i for i in range(min_a, max(a)+1)]
for i in range(n):
if x[a[i]-min_a] == -1:
print('NO')
exit()
else:
x[a[i]-min_a] = -1
print('YES')
| n = int(eval(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')
| p02779 |
N = int(eval(input()))
A = set(input().split())
print(('YNEOS'[len(A)!=N::2])) | n = int(eval(input()))
print(('YNEOS'[len(set(input().split()))!=n::2])) | p02779 |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(1,n):
for j in range(i):
if a[i] == a[j]:
cnt = 1
if cnt == 0:
print("YES")
else:
print("NO") | n = int(eval(input()))
a = list(map(int, input().split()))
if len(a) == len(set(a)):
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
sq = list(map(int, input().split()))
for _ in range(n):
c = sq.pop()
if c in sq:
print('NO')
exit()
print('YES') | n = int(eval(input()))
sq = list(map(int, input().split()))
st = set(sq)
if len(sq) == len(st):
print('YES')
else:
print('NO') | p02779 |
import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
a.append(x.replace('\n', ''))
arra = a[1].split(' ')
dump = []
res = 'YES'
for x in range(int(a[0])):
if arra[x] in dump:
res = 'NO'
break
dump.append(arra[x])
print(res)
| import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
a.append(x.replace('\n', ''))
arra = a[1].split(' ')
arra = [int(x) for x in arra]
if len(arra) == len(set(arra)):
print('YES')
else:
print('NO') | p02779 |
n = int(eval(input()))
A = input().split(' ')
fl = "YES"
for i, a in enumerate(A):
if a in A[i+1:]:
fl = "NO"
break
print(fl) | n = int(eval(input()))
A = input().split(' ')
if len(A) == len(set(A)):
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
a = list(map(int,input().split()))
if len(a) == len(set(a)):
print('YES')
else:
print('NO')
| n = int(eval(input()))
a = list(map(int,input().split()))
if n == len(set(a)):
print('YES')
else:
print('NO') | p02779 |
import collections
N=int(eval(input()))
L=list(map(int,input().split()))
a=len(L)
c=len(set(L))
if a==c:
print('YES')
else:print('NO') | N=int(eval(input()))
L=list(map(int,input().split()))
a=len(L)
c=len(set(L))
if a==c:
print('YES')
else:print('NO')
| p02779 |
count = int(eval(input()))
s = list()
for x in input().split():
if x in s:
print("NO")
break
else:
s.append(x)
else:
print("YES") | count = int(eval(input()))
A = [int(x) for x in input().split()]
if len(set(A)) == len(A):
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
A = list(map(int,input().split()))
flag = 0
A.sort()
for i in range(len(A)-1):
if A[i] == A[i+1]:
flag += 1
print("NO")
break
else:
continue
if flag == 0:
print("YES") | N = int(eval(input()))
A = list(map(int,input().split()))
S = set(A)
if len(A) == len(S):
print("YES")
else:
print("NO") | p02779 |
n=int(eval(input()))
v=list(map(int,input().split()))
print(("YNEOS"[len(set(v))<n::2]))
| n=int(eval(input()))
v=set(input().split())
print(("YNEOS"[len(v)<n::2]))
| p02779 |
N = int(eval(input()))
A = list(map(int,input().split()))
result = "YES"
for i in range(N):
for j in range(N-i-1):
if(A[i]== A[i+j+1]):
result = "NO"
print(result) | N = int(eval(input()))
A = sorted(list(map(int,input().split())))
result = "YES"
for i in range(N-1):
if(A[i]== A[i+1]):
result = "NO"
print(result) | p02779 |
input_first = eval(input())
input_second= input().split()
N = int(input_first)
in_list = [int(i) for i in input_second]
flag = 0
for i in range(N):
if flag !=0:
break
for j in range(i+1,N):
# print("i",in_list[i],"j",in_list[j])
if in_list[i]==in_list[j]:
print("NO")
flag =1
break
if flag ==0:
print("YES")
|
# input_first= 5
# input_second=[2,6,1,4,5]
input_first = eval(input())
input_second= input().split()
N = int(input_first)
in_list = [int(i) for i in input_second]
check_dic = {}
flag =0
for i in in_list:
if i in list(check_dic.keys()):
# print(i)
print("NO")
flag = 1
break
else:
check_dic[i] = True
# print(check_dic)
if flag ==0:
print("YES") | p02779 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = set(A)
if N == len(B):
print("YES")
else:
print("NO") | N = int(eval(input()))
A = set(map(int,input().split()))
if N == len(A):
print("YES")
else:
print("NO") | p02779 |
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(0, N, 1):
for j in range(i + 1, N, 1):
if A[i] == A[j]:
print("NO")
sys.exit(0)
print("YES") | import sys
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
for i in range(0, N - 1, 1):
if A[i] == A[i + 1]:
print("NO")
sys.exit(0)
print("YES")
| p02779 |
N=int(eval(input()))
A=list(map(int,input().split()))
A_set=set(A)
if len(A_set)==N:
print('YES')
else:
print('NO') | N=int(eval(input()))
A=set(list(map(int,input().split())))
if len(A)==N:
print('YES')
else:
print('NO')
| p02779 |
def is_same(lst):
n=len(lst)
for i in range(n-1):
for j in range(i+1,n):
if(lst[i]==lst[j]):
return True
return False
n=int(eval(input()))
input_line=[int(x) for x in input().split()]
if(not is_same(input_line)):
print("YES")
else:
print("NO") | def is_neighbor_same(lst):
for i in range(len(lst)-1):
if(lst[i]==lst[i+1]):
return True
return False
eval(input())
input_line=[int(x) for x in input().split()]
input_line.sort()
if(is_neighbor_same(input_line)):
print("NO")
else:
print("YES")
| p02779 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = True
for i in range(n-1):
for j in range(i+1,n):
if a[j]==a[i]:
ans = False
break
else:
continue
if ans==True:
print("YES")
else:
print("NO")
| n = int(eval(input()))
a = list(map(int,input().split()))
A = set(a)
if len(A)==len(a):
print("YES")
else:
print("NO")
| p02779 |
import sys
N = int(eval(input()))
A = [int(i) for i in input().split()]
flg = 0
for i in range(len(A)-1):
#print("i:"+str(i))
for j in range(i+1,len(A)):
#print(" j:"+str(j))
if A[i] == A[j]:
print("NO")
sys.exit()
print("YES") | N = int(eval(input()))
A = [int(i) for i in input().split()]
B = list(set(A))
if len(A) == len(B):
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
flag = True
for i in range(N):
for j in range(i+1, N):
if A[i] == A[j]:
flag = False
break
if flag:
print("YES")
else:
print("NO") | N = int(eval(input()))
A = list(map(int, input().split()))
flag = True
A = sorted(A)
for i in range(N-1):
if A[i] == A[i+1]:
flag = False
if flag:
print("YES")
else:
print("NO") | p02779 |
n=int(eval(input()))
a=list(map(int,input().split()))
s=set(a)
if n==len(s):
print('YES')
else:
print('NO') | n=int(eval(input()))
a=list(map(int,input().split()))
b=len(set(a))
if n==b:
print('YES')
else:
print('NO') | p02779 |
import sys
N = int(eval(input()))
d = list(map(int, input().split(" ")))
for item in d:
if d.count(item) > 1:
print("NO")
sys.exit()
print("YES")
| import sys
N = int(eval(input()))
d = list(map(int, input().split(" ")))
newList = list(dict.fromkeys(d))
if len(d) == len(newList):
print('YES')
else:
print("NO")
| p02779 |
n = int(eval(input()))
li = [int(x) for x in input().split()]
sub = list()
for i in li:
if i in sub:
print("NO")
break
sub.append(i)
else:
print("YES") | n = int(eval(input()))
li = [int(x) for x in input().split()]
nozoki = list(set(li))
nozoki.sort()
li.sort()
if (nozoki == li):
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
li = [int(x) for x in input().split()]
nozoki = sorted(list(set(li)))
li.sort()
if (nozoki == li):
print("YES")
else:
print("NO") | n = int(eval(input()))
li = [int(x) for x in input().split()]
a = len(li)
se = set(li)
b = len(se)
if (a==b):
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
list1 = sorted(list(map(int, input().split())))
pre_num = None
s = 'YES'
for num in list1:
if num == pre_num:
s = 'NO'
break
pre_num = num
print(s) | N = int(eval(input()))
list1 = sorted(list(map(int, input().split())))
s = 'YES'
for i in range(N-1):
if list1[i] == list1[i+1]:
s = 'NO'
break
print(s) | p02779 |
n = int(eval(input()))
s = list(map(int,input().split()))
a = 0
for i in range(len(s)):
if s.count(s[i]) > 1:
a = 1
break
if a == 0:
print("YES")
else:
print("NO") | n = int(eval(input()))
s = list(map(int,input().split()))
def count(x):
if len(s) != len(set(x)):
return "NO"
else:
return "YES"
print((count(s))) | p02779 |
N=int(eval(input()))
A=input().split()
for i in range(N):
if A.count(A[i]) >1:
print("NO")
exit(0)
print("YES") | N=int(eval(input()))
A=list(map(int, input().split()))
A=sorted(A)
for i in range(0,N):
if len(A) > i+1:
if A[i] == A[i+1]:
print("NO")
exit(0)
print("YES") | p02779 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
print(('YES' if len(set(A)) == N else 'NO'))
| # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
bl = len(set(A)) == N
print(('YES' if bl else 'NO'))
| p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
flag = False
for i in range(N-1):
j = i+1
while(j<N):
if A[i]==A[j]:
flag = True
break
j += 1
if flag:
break
if flag:
print("NO")
else:
print("YES") | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
flag = False
for i in range(N-1):
if A[i]==A[i+1]:
flag=True
break
if flag:
print("NO")
else:
print("YES") | p02779 |
N = int(eval(input()))
A = set(list(map(int, input().split())))
print(("YES" if len(A) == N else "NO")) | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
A = set(A)
if len(A) == N: print("YES")
else: print("NO")
return 0
if __name__ == "__main__":
solve() | p02779 |
N = int(eval(input()))
A_list = [int(i) for i in input().split(" ")]
result = "YES"
for i in range(0, N-1):
for j in range(i+1, N):
if A_list[i] == A_list[j]:
result = "NO"
break
if result == "NO":
break
print(result)
| N = int(eval(input()))
A_list = [int(i) for i in input().split(" ")]
B_list = list(set(A_list))
if len(A_list) == len(B_list):
print("YES")
else:
print("NO") | p02779 |
N=int(eval(input()))
A=list(map(int,input().strip().split()))
l=[]
dup=False
for e in A:
if e in l:
dup=True
break
else:
l.append(e)
if dup==False:
print("YES")
else:
print("NO") | N=int(eval(input()))
A=list(map(int,input().strip().split()))
A.sort()
a=-1
ndup=True
for e in A:
if a==e:
ndup=False
else:
pass
a=e
if ndup==True:
print("YES")
else:
print("NO") | p02779 |
first_int = int(eval(input()))
secound_list = [int(k) for k in input().split()]
for k in range(first_int):
if secound_list.count(secound_list[k]) >= 2:
print('NO')
break
if k == first_int-1:
print('YES') | first_int = int(eval(input()))
secound_list = [int(k) for k in input().split()]
def has_duplicates(seq):
return len(seq) != len(set(seq))
if has_duplicates(secound_list) == False:
print('YES')
else:
print('NO') | p02779 |
n = int(eval(input()))
x = [int(x) for x in input().split()]
flag = 0
for i in range(len(x)):
for j in range(len(x)):
if i != j:
if x[i] == x[j]:
print("NO")
flag = 1
break
if flag == 1:
break
else:
print("YES") | n = int(eval(input()))
x = [int(x) for x in input().split()]
s = set(x)
if len(s) != len(x):
print("NO")
else:
print("YES") | p02779 |
import sys
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(N):
x = A[i]
for j in range(N-i-1):
if x == A[i+j+1]:
print('NO')
sys.exit()
print('YES') | import sys
N = int(eval(input()))
A = list(map(int,input().split()))
if len(A) == len(set(A)):
print('YES')
else:
print('NO') | p02779 |
# -*- coding: utf-8 -*-
n=int(eval(input())) #数値入力 「N」だけの入力のとき
a=list(map(int, input().split())) #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
f = 0
for i in range(0,n):
if a[i] in a[i+1:]:
print("NO")
f = 1
break
if f ==0:
print("YES") | # -*- coding: utf-8 -*-
n=int(eval(input())) #数値入力 「N」だけの入力のとき
a=list(map(int, input().split())) #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
f = 0
if len(a) != len(set(a)):
print("NO")
else:
print("YES") | p02779 |
n = int(eval(input()))
lst = list(map(int,input().split()))
ans = 0
for i in range(len(lst)):
if (lst.count(lst[i]) != 1):
ans = 1
if (ans == 0):
print("YES")
else:
print("NO")
| n = int(eval(input()))
lst = list(map(int,input().split()))
x = len(lst)
lst = list(set(lst))
y = len(lst)
if (x == y):
print("YES")
else:
print("NO")
| p02779 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = Counter(a)
if max(cnt.values()) == 1:
print('YES')
else:
print('NO')
| n = int(eval(input()))
a = list(input().split())
if len(a) == len(set(a)):
print('YES')
else:
print('NO')
| p02779 |
n = int(eval(input()))
l = list(map(int,input().split()))
l.sort()
d = [0]*(n-1)
for i in range(n-1):
d[i]=l[i+1]-l[i]
p = 1
for j in d:
p = p * j
if p == 0:
print('NO')
else:
print('YES') | n = int(eval(input()))
l = list(map(int,input().split()))
l.sort()
s = 'YES'
for i in range(n-1):
if l[i] == l[i+1]:
s = 'NO'
print(s) | p02779 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
c = collections.Counter(a)
if c.most_common()[0][1] == 1:
print('YES')
else:
print('NO')
| from collections import Counter
n = int(eval(input()))
a = list(map(int,input().split()))
c = Counter(a)
if c.most_common()[0][1] == 1:
print('YES')
else:
print('NO')
| p02779 |
N = eval(input())
A = list(map(int, input().split()))
ans = {}
b = True
for i in A:
if i in ans:
b = False
break
else:
ans[i] = 0
if b:
print("YES")
else:
print("NO")
| N = eval(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
print("YES")
else:
print("NO")
| p02779 |
N = int(eval(input()))
A = list(map(int,input().split()))
C = {}
for i in range(N):
a = A[i]
if a not in C:
C[a] = 0
C[a] += 1
flag = 0
for a in C:
if C[a]>1:
flag = 1
break
if flag==0:
print("YES")
else:
print("NO") | N = int(eval(input()))
A = list(map(int,input().split()))
C = {}
for i in range(N):
a = A[i]
if a not in C:
C[a] = 0
C[a] += 1
if len(C)==N:
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
a = set(map(int, input().split()))
if len(a) == n:
print('YES')
else:
print('NO')
| n = int(eval(input()))
a = set(map(int, input().split()))
print(('YES' if len(a) == n else 'NO')) | p02779 |
N = int(eval(input()))
all_list = input().split(' ')
before_list = []
for i in range(N):
if before_list.count(all_list[i]) == 0:
before_list.append(all_list[i])
else:
print('NO')
exit()
if len(all_list) == len(before_list):
print('YES')
| N = int(eval(input()))
#listで囲むと良い
A = list(map(int, input().split()))
#setは重複する値が消される
if len(set(A)) == N:
print('YES')
else:
print('NO') | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in A:
for j in A[count+1:]:
if i == j:
print("NO")
break
else:
count += 1
continue
break
else:
print("YES")
| N = int(eval(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") | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
Ans = "YES"
List = []
for e in A:
if e in List:
Ans = "NO"
break
else:
List.append(e)
print(Ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
Ans = "YES"
List = []
before_n = 0
for e in A:
if e == before_n:
Ans = "NO"
break
else:
before_n=e
print(Ans) | p02779 |
n=int(eval(input()))
a = list(map(int,input().split()))
for i in range (n):
for j in range(n):
if i != j:
if a[i] == a[j]:
print('NO')
exit()
print('YES') | n=int(eval(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') | p02779 |
from collections import Counter
n = int(input())
a = Counter([int(x) for x in input().split()])
print('NO') if a.most_common()[0][1]>1 else print('YES')
| from collections import Counter
n = int(input())
a = Counter([int(x) for x in input().split()])
print('NO') if len(a)!=n else print('YES')
| p02779 |
n = int(eval(input()))
A = list(map(int, input().split()))
l = []
f = 0
for a in A:
if a in l:
f = 1
print("NO")
break
else:
l.append(a)
if f == 0:
print("YES") | n = int(eval(input()))
A = list(map(int, input().split()))
B = list(set(A))
if len(A) == len(B):
print("YES")
else:
print("NO") | p02779 |
N=int(eval(input()))
A=list(map(int,input().split()))
flag=0
for i in range(N):
for j in range(i+1,N):
if(A[i]==A[j]):
flag=1
break
if(flag==1):
break
if(flag==1):
print("NO")
if(flag==0):
print("YES") | N=int(eval(input()))
A=list(map(int,input().split()))
ans={}
flag=0
for i in A:
if(ans.get(i)!=None):
flag=1
break
else:
ans[i]=1
if(flag==0):
print("YES")
else:
print("NO") | p02779 |
import itertools
import math
import fractions
import functools
n = int(eval(input()))
a = list(map(int, input().split()))
s = set(a)
if len(s) == len(a):
print("YES")
else: print("NO") | n = int(eval(input()))
a = list(map(int, input().split()))
s = set()
for i in range(n):
s.add(a[i])
if len(s) == len(a):
print("YES")
else: print("NO") | p02779 |
n = int(eval(input()))
a_lst = list(map(int,input().split()))
for i in range(n):
if a_lst.count(a_lst[i])!=1:
print('NO')
break
else:
print('YES') | n = int(eval(input()))
a_lst = list(map(int,input().split()))
new_lst = list(set(a_lst))
if len(a_lst)==len(new_lst):
print('YES')
else:
print('NO') | p02779 |
N = int(eval(input()))
H = list(map(int,input().split()))
Ans = "YES"
for i in range(N):
for j in range(N):
if H[i] ==H[j] and i!=j:
Ans = "NO"
print(Ans) | N = int(eval(input()))
H = list(map(int,input().split()))
Hlen = len(H)
Hsyugou = set(H)
Hhennkann = list(Hsyugou)
Hhennkannlen = len(Hhennkann)
if Hlen ==Hhennkannlen:
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in A:
c = 0
for j in A:
if(j == i):
c += 1
if(c > 1):
print("NO")
exit()
print("YES") | N = int(eval(input()))
A = list(map(int, input().split()))
if (len(A) == len(set(A))):
print("YES")
else:
print("NO")
| p02779 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
# リストaの要素の出現回数を計算
s = collections.Counter(a)
# 出現回数の最大値を取得
max_s = max(s.values())
if max_s == 1:
print('YES')
else:
print('NO') | n = int(eval(input()))
# 被りの要素が削除される
a = set(input().split())
print(('YES' if len(a) == n else 'NO')) | p02779 |
N=int(eval(input()))
A=list(map(int,input().split()))
list.sort(A)
for i in range(N-1):
if A[i]-A[i+1]==0:
print("NO")
exit(0)
print("YES") | N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
for i in range(N-1):
if A[i+1]-A[i]==0:
print("NO")
exit(0)
print("YES") | p02779 |
N = int(eval(input()))
NumArr = [int(num) for num in input().split()]
ans = 'YES'
for num in NumArr:
matchCount = NumArr.count(num)
if matchCount > 1:
ans = 'NO'
break
print(ans)
| N = int(eval(input()))
NumArr = [int(num) for num in input().split()]
flg = len(NumArr) == len(set(NumArr))
if flg:
print('YES')
else:
print('NO') | p02779 |
import collections
N = int(eval(input()))
number = list(map(int,input().split()))
number_count = collections.Counter(number)
for i,j in list(number_count.items()):
if j >1:
print("NO")
exit(0)
print("YES")
| N = int(eval(input()))
number = set(map(int,input().split()))
if len(number)==N:print("YES")
else:print("NO") | p02779 |
import math
import itertools
n = int(eval(input()))
#n, d = list(input().split())
A = list(map(int, input().split()))
check = [0]
for i in range(n):
if A[i] in check:
print("NO")
exit()
check.append(A[i])
print("YES")
| import math
import itertools
n = int(eval(input()))
#n, d = list(input().split())
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") | p02779 |
N = int(eval(input()))
A = input().split()
flag = 0
for i in range(len(A)):
for j in range(i+1,len(A)):
if(A[i]==A[j]):
flag = 1
if(flag == 0):
print("YES")
else:
print("NO")
| N = int(eval(input()))
A = input().split()
if(len(A)) == len(set(A)):
print("YES")
else:
print("NO")
| p02779 |
n=int(eval(input()))
if len(set(map(int,input().split())))==n:
print('YES')
else:
print('NO') | n = int(eval(input()))
A = list(map(int,input().split()))
B = set(A)
if len(A) == len(B):
print('YES')
else:
print('NO') | p02779 |
import sys
input = sys.stdin.readline
N = eval(input())
A = list(map(int,input().split()))
flag = False
while 1:
a = A[0]
A = A[1:]
if a in A:
flag = True
break
if len(A) == 0:
break
if flag:
print("NO")
else:
print("YES") | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int,input().split()))
A = set(A)
if N == len(A):
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(len(A)-1):
if A[i+1:].count(A[i]) > 0:
print ('NO')
exit (0)
print ('YES') | N = int(eval(input()))
A = list(map(int,input().split()))
S = set(A)
if len(A) == len(S):
print ('YES')
else:
print ('NO') | p02779 |
n=int(eval(input()))
a=list(map(int,input().split()))
flag=0
for i in range(n):
if a.count(a[i])!=1:
flag=1
if flag==0:
print("YES")
else:
print("NO") | n=int(eval(input()))
a=list(map(int,input().split()))
m=len(a)
a=set(a)
n=len(a)
if m==n:
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
a_n = [int(i) for i in input().split()]
def main():
for i in range(len(a_n)):
for j in range(i):
if a_n[i] == a_n[j]:
print('NO')
return 0
print('YES')
return 0
main() | n = int(eval(input()))
a_n = [int(i) for i in input().split()]
def has_duplicates(seq):
return len(seq) != len(set(seq))
if has_duplicates(a_n):
print('NO')
else:
print('YES') | p02779 |
N = int(eval(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(eval(input()))
A = list(map(int, input().split()))
if len(A) == len(set(A)):
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
res = True
p = 1
for n in range(N):
for i in range(p, N):
if A[n] == A[i]:
res = False
p += 1
if res:
print('YES')
else:
print('NO') | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
res = A[0]
cnt = True
for n in range(1, N):
if A[n] == res:
cnt= False
res = A[n]
if cnt:
print('YES')
else:
print('NO') | p02779 |
from collections import Counter
N=int(eval(input()))
A=list(map(int,input().split()))
c = Counter(A).most_common()
for i in range(len(c)):
if c[i][1]>1:
print("NO")
exit()
print("YES")
| N = int(eval(input()))
A = [int(a) for a in input().split()]
B = set(A)
if len(A)==len(B):
print("YES")
else:
print("NO") | p02779 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt = 0
for i in range(n):
for j in range(n):
if i != j and a[i] == a[j]:
cnt += 1
break
print((["NO","YES"][cnt==0])) | n=eval(input());a=list(map(int,input().split()))
print((["YES","NO"][len(set(a))!=len(a)])) | p02779 |
n = int(eval(input()))
a = list(map(int, input().split(" ")))
deta = []
error = False
for i in range(n):
if n == 0:
pass
elif error:
break
elif a[i] in deta:
error = True
break
deta.append(a[i])
if error:
print("NO")
else:
print("YES") | n = int(eval(input()))
a = list(map(int, input().split(" ")))
deta = set()
error = False
for i in range(n):
if n == 0:
pass
elif error:
break
elif a[i] in deta:
error = True
break
deta.add(a[i])
if error:
print("NO")
else:
print("YES") | p02779 |
n = int(eval(input()))
nums = tuple(input().split())
judge = 0
for i in range(n):
for j in range(i+1,n):
if nums[i] == nums[j]:
judge = 1
if judge == 0:
print("YES")
else:
print("NO") | n = int(eval(input()))
a = input().split()
a = sorted(list(map(int, a)))
def check(a):
for i in range(n-1):
if a[i] == a[i+1]:
return 0
return 1
if check(a) == 0:
print("NO")
else:
print("YES") | p02779 |
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(1,N):
if A[i] in A[0:i]:
print('NO')
exit()
print('YES') | N = int(eval(input()))
A = list(map(int,input().split()))
B = set(A)
if sorted(A) == sorted(B):
print('YES')
else:
print('NO') | p02779 |
N = int(eval(input()))
numb = input().split()
def answer(N, numb):
for i in range(N):
for j in range(N):
if i <= j:
continue
if numb[i] == numb[j]:
return "NO"
return "YES"
print((answer(N,numb)))
| N = int(eval(input()))
numb = input().split()
if len(set(numb)) == len(numb):
print("YES")
else:
print("NO") | p02779 |
import sys
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]
def main():
N = II()
A = LI()
ans = 0
for i in range(N):
for j in range(i+1,N):
if A[i] == A[j]:
ans+=1
break
if ans == 0:
print("YES")
else:
print("NO")
if __name__ == "__main__":
main() | import sys
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]
def main():
N = II()
A = LI()
numa = len(set(A))
#print(numa)
if numa == N:
print("YES")
else:
print("NO")
if __name__ == "__main__":
main() | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
def distinct(arry):
while True:
if len(arry) == 1:
return True
x = arry.pop(0)
if x in arry:
return False
if distinct(A):
print("YES")
else:
print("NO")
| N = int(eval(input()))
A = list(map(int, input().split()))
def distinct(arry):
x = set(arry)
if len(A) != len(x):
return False
return True
if distinct(A):
print("YES")
else:
print("NO")
| p02779 |
n=int(eval(input()))
a=list(map(int,input().split()))
if len(a)==len(set(a)):
print('YES')
else:
print('NO')
| def solve():
N = int(eval(input()))
A = set(input().split())
a = len(A)
if a == N:
print("YES")
elif a != N:
print("NO")
if __name__ == '__main__':
solve()
| p02779 |
n=int(eval(input()))
l=list(map(int, input().split()))
tester=True
for i in range(n):
for j in range(i+1,n):
if l[i]==l[j]:
tester=False
break
if tester==True:
print('YES')
else:
print('NO')
| n=int(eval(input()))
l=list(map(int, input().split()))
s=set(l)
if len(l)==len(s):
print('YES')
else:
print('NO')
| p02779 |
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
for i in range(n-1):
if a[i] == a[i+1]:
print("NO")
exit()
print("YES") | n=int(eval(input()))
a=list(map(int,input().split()))
if len(set(a))==len(a):
print("YES")
else:
print("NO")
| p02779 |
def func():
return
n = int(eval(input()))
# s = input()
# a, b = map(int, input().split())
a = list(map(int, input().split()))
# a = input().split()
'''
for i in range(n-1):
for j in range(i+1, n):
if a[i] == a[j]:
print("NO")
exit()
'''
for i in range(n-1):
if a[i] in a[i+1:]:
print("NO")
exit()
print("YES") | def func():
return
n = int(eval(input()))
# s = input()
# a, b = map(int, input().split())
a = list(map(int, input().split()))
# a = input().split()
ascA = sorted(a)
for i in range(n-1):
if ascA[i] == ascA[i+1]:
print("NO")
exit()
'''
for i in range(n-1):
for j in range(i+1, n):
if a[i] == a[j]:
print("NO")
exit()
'''
'''
ans = [0]*(max(a)+1)
for ida in a:
if ans[ida] > 0:
print("NO")
exit()
ans[ida] += 1
'''
print("YES") | p02779 |
import collections
import sys
N = eval(input())
A = input().split()
A1 = list(map(int,list(collections.Counter(A).values())))
for i in A1:
if i >= 2:
print('NO')
sys.exit()
print('YES') | import sys
N = int(eval(input()))
A = input().split()
if N > len(set(A)):
print('NO')
sys.exit()
print('YES') | p02779 |
n = int(eval(input()))
a = input().split()
flag = False
for i in range(n):
for j in range(i + 1, n):
if a[i] == a[j]:
flag = True
break
if flag:
break
if flag:
print("NO")
else:
print("YES")
| n = int(eval(input()))
a = [int(i) for i in input().split()]
if len(a) != len(set(a)):
print("NO")
else:
print("YES")
| p02779 |
n = int(eval(input()))
A = list(map(int, input().split()))
r = 'YES'
for i in range(n-1):
if A[i] in A[i+1:]:
r = 'NO'
break
print(r) | n = int(eval(input()))
A = list(map(int, input().split()))
print(('YES' if len(A)==len(set(A)) else 'NO')) | p02779 |
a = int(eval(input()))
b = list(map(int, input().split(" ")))
flag = True
for i in b:
if (b.count(i) >= 2):
flag = False
if (flag == True):
print("YES")
else:
print("NO") | a = int(eval(input()))
b = list(map(int, input().split(" ")))
t = set(b)
bb = list(t)
if (len(b) == len(bb)):
print("YES")
else:
print("NO")
| p02779 |
a = int(eval(input()))
b = list(map(int, input().split(" ")))
t = set(b)
bb = list(t)
if (len(b) == len(bb)):
print("YES")
else:
print("NO")
| N = int(eval(input()))
A = {i for i in input().split()}
print(("YES" if N==len(A) else "NO")) | p02779 |
import sys
N = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
for i in range(N):
for j in range(i + 1, N):
if As[i] == As[j]:
print('NO')
sys.exit(0)
if As[i] > As[j]:
break
print('YES') | import sys
N = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
for i in range(N):
for j in range(i + 1, N):
if As[i] == As[j]:
print('NO')
sys.exit(0)
if As[j] > As[i]:
break
print('YES') | p02779 |
import sys
N = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
for i in range(N):
for j in range(i + 1, N):
if As[i] == As[j]:
print('NO')
sys.exit(0)
if As[j] > As[i]:
break
print('YES') | import sys
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
for i in range(N - 1):
if A[i] == A[i + 1]:
print('NO')
sys.exit(0)
print('YES')
| p02779 |
N = int(eval(input()))
A = list(map(int,input().split()))
s = set(A)
print(('YES' if len(s)==len(A) else 'NO')) | N = int(eval(input()))
A = list(map(int,input().split()))
s = set(A)
print(('YES' if len(A)==len(s) else 'NO')) | p02779 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
re = 0
c = Counter(a)
new = list(c.values())
for i in new:
if i > 1:
re += 1
if re > 0:
print("NO")
else:
print("YES")
| n = int(eval(input()))
a = list(map(int, input().split()))
re = 0
from collections import Counter
c = Counter(a)
for i, v in list(c.items()):
if v >= 2:
re += 1
if re >= 1:
print("NO")
else:
print("YES")
| p02779 |
N = int(eval(input()))
alist = list(map(int, input().split()))
checklist = {}
for item in alist:
if alist.count(item) > 1:
print('NO')
exit(0)
print('YES')
| N = int(eval(input()))
alist = input().split()
checklist = {}
for ite in alist:
if checklist.get(ite) == '1':
print('NO')
exit(0)
else:
checklist[ite] = '1'
print('YES')
| p02779 |
import itertools
n=int(eval(input()))
a=list(map(int,input().split()))
for i in itertools.combinations(a,2):
if i[0]==i[1]:
print("NO")
exit()
print("YES") | n=int(eval(input()))
a=list(map(int,input().split()))
s=set(a)
if n==len(s):
print("YES")
else:
print("NO") | p02779 |
a = int(eval(input()))
lis = list(map(int,input().split()))
ans = []
for i in range(a):
b = lis[i]
c = ans.count(b)
if c == 0:
ans.append(b)
if len(ans) == a:
print("YES")
else:
print("NO") | a = int(eval(input()))
lis = list(map(int,input().split()))
ans = list(set(lis))
if a == len(ans):
print("YES")
else:
print("NO") | p02779 |
length=eval(input())
#len-1
Narray=sorted(input().split())
n=0
while n<int(length)-1:
if Narray[n] == Narray[n+1]:
print("NO")
break
elif n==int(length)-2:
print("YES")
break
else:
n+=1
| s=eval(input())
array=[]
array+=(int(x) for x in input().split())
array.sort()
def judge(array,s):
for i in range(int(s)-1):
if array[i] == array[i+1]:
return "NO"
return "YES"
print((judge(array,s)))
| p02779 |
n=int(eval(input()))
s=list(map(int,input().split()))
s.sort()
cnt=0
for i in range(n-1):
for j in range(i+1,n):
if s[i]==s[j]:
print('NO')
exit()
else:
cnt+=1
if cnt==n*(n-1)//2:
print('YES')
| n=int(eval(input()))
s=list(map(int,input().split()))
s.sort()
cnt=0
for i in range(n-1):
if s[i]==s[i+1]:
print('NO')
exit()
else:
cnt+=1
if cnt==n-1:
print('YES')
| p02779 |
n = int(eval(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(eval(input()))
a = set(list(map(int, input().split())))
if len(a) == n:
print("YES")
else:
print("NO") | p02779 |
import sys
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(N-1) :
for j in range(i+1,N) :
if A[i] == A[j] :
print("NO")
sys.exit()
print("YES") | import sys
N = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A)
for i in range(N-1) :
if A[i] == A[i+1] :
print("NO")
sys.exit()
print("YES") | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
for a in A:
if A.count(a) != 1:
print("NO")
exit()
print("YES") | N = int(eval(input()))
A = list(map(int, input().split()))
if len(set(A)) == N:
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
if len(set(A)) == N:
print("YES")
else:
print("NO") | N = int(eval(input()))
A = list(map(int, input().split()))
if len(set(A)) == len(A):
print("YES")
else:
print("NO") | p02779 |
n=int(eval(input()))
a=list(map(int,input().split()))
list=[]
for i in a:
if i in list:
print("NO")
break
list.append(i)
else:
print("YES")
| n=int(eval(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") | p02779 |
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
table = collections.defaultdict(int)
for x in A:
table[x] += 1
if table[x] > 1:
print("NO")
exit(0)
print("YES")
| N = int(eval(input()))
A = set(list(map(int, input().split())))
if len(A) == N:
print("YES")
else:
print("NO")
| p02779 |
N = int(eval(input()))
A = set(list(map(int, input().split())))
if len(A) == N:
print("YES")
else:
print("NO")
| N = int(eval(input()))
A = set((list(map(int, input().split()))))
if len(A) == N:
print("YES")
else:
print("NO")
| p02779 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.