problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
⌀ | fixed_code
stringlengths 12
526k
⌀ | labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
⌀ | fixed_submission_id
int64 2
1.54M
⌀ | user_id
stringlengths 10
10
⌀ | language
stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02779
|
s = input()
a = map(int, input().lower().split())
if int(s) == len(set(a)):
print("YESS")
else:
print("NO")
|
s = input()
a = map(int, input().lower().split())
if int(s) == len(set(a)):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,039
| 578,038
|
u994527877
|
python
|
p02779
|
N = int(input())
A = [int(e) for e in input().split()]
if len(A) == len(list(set(A))):
print('Yes')
else:
print('No')
|
N = int(input())
A = [int(e) for e in input().split()]
if len(A) == len(list(set(A))):
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,045
| 578,046
|
u723503495
|
python
|
p02779
|
def func():
return
n = int(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 a[i] == a[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")
|
def func():
return
n = int(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")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 578,058
| 578,059
|
u739259290
|
python
|
p02779
|
N = int(input())
P = list(map(int,input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
if has_duplicates(P) == 'False':
print('YES')
elif has_duplicates(P) == 'True':
print('NO')
|
N = int(input())
P = list(map(int,input().split()))
def has_duplicates(seq):
return str(len(seq) != len(set(seq)))
if has_duplicates(P) == 'False':
print('YES')
elif has_duplicates(P) == 'True':
print('NO')
|
[
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 578,064
| 578,065
|
u051331793
|
python
|
p02779
|
N=int(input())
A=list(map(int, input().split()))
B=sorted(A)
answer="YES"
for i in range(N):
if B[i]==B[i+1]:
answer="NO"
break
print(answer)
|
N=int(input())
A=list(map(int, input().split()))
B=sorted(A)
answer="YES"
for i in range(N-1):
if B[i]==B[i+1]:
answer="NO"
print(answer)
|
[
"control_flow.break.remove"
] | 578,066
| 578,067
|
u017535952
|
python
|
p02779
|
N=int(input())
A=list(map(int, input().split()))
B=sorted(A)
answer="YES"
for i in range(0,N-1):
if B[i]==B[i+1]:
answer="NO"
break
print(answer)
|
N=int(input())
A=list(map(int, input().split()))
B=sorted(A)
answer="YES"
for i in range(N-1):
if B[i]==B[i+1]:
answer="NO"
print(answer)
|
[
"call.arguments.change",
"control_flow.break.remove"
] | 578,068
| 578,067
|
u017535952
|
python
|
p02779
|
N=int(input())
A=list(map(int, input().split()))
B=sorted(A)
answer="YES"
for i in range(0,N):
if B[i]==B[i+1]:
answer="NO"
break
print(answer)
|
N=int(input())
A=list(map(int, input().split()))
B=sorted(A)
answer="YES"
for i in range(N-1):
if B[i]==B[i+1]:
answer="NO"
print(answer)
|
[
"call.arguments.change",
"control_flow.break.remove"
] | 578,069
| 578,067
|
u017535952
|
python
|
p02779
|
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()
|
[] | 578,071
| 578,072
|
u315706001
|
python
|
p02779
|
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))
if len(s) == len(x):
print('YES')
else:
print('NO')
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 578,082
| 578,083
|
u251780079
|
python
|
p02779
|
def quick_sort(list):
stand=list[0]
over=[]
same=[]
under=[]
for i in list:
if(i>stand):
over.append(i)
elif(i<stand):
under.append(i)
else:
same.append(i)
if(len(over)>1):
over=quick_sort(over)
else:
pass
if(len(under)>1):
under=quick_sort(under)
else:
pass
return over+same+under
N=int(input())
A=list(map(int,input().split()))
A=quick_sort(A)
ans="Yes"
if(len(A)>1):
for i in range(len(A)):
if(A[i-1]==A[i]):
ans="NO"
break
else:
pass
else:
pass
print(ans)
|
def quick_sort(list):
stand=list[0]
over=[]
same=[]
under=[]
for i in list:
if(i>stand):
over.append(i)
elif(i<stand):
under.append(i)
else:
same.append(i)
if(len(over)>1):
over=quick_sort(over)
else:
pass
if(len(under)>1):
under=quick_sort(under)
else:
pass
return over+same+under
N=int(input())
A=list(map(int,input().split()))
A=quick_sort(A)
ans="YES"
if(len(A)>1):
for i in range(len(A)):
if(A[i-1]==A[i]):
ans="NO"
break
else:
pass
else:
pass
print(ans)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 578,084
| 578,085
|
u918817732
|
python
|
p02779
|
n = int(input())
*l, = map(int, input().split())
def has_duplicates(seq):
return len(seq) != len(set(seq))
S = has_duplicates(l)
if str(S) == 'False':
print('NO')
elif str(S) == 'True':
print('YES')
|
n = int(input())
*l, = map(int, input().split())
def has_duplicates(seq):
return len(seq) != len(set(seq))
S = has_duplicates(l)
if str(S) == 'False':
print('YES')
elif str(S) == 'True':
print('NO')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,093
| 578,094
|
u759718348
|
python
|
p02779
|
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")
|
[
"call.remove"
] | 578,095
| 578,096
|
u401949008
|
python
|
p02779
|
import sys
N = int(input())
A = list(input().split())
def has(s):
return len(s) != len(set(s))
B = A
B = has(A)
if B == False:
print("NO")
sys.stdout.flush
else:
print("YES")
sys.stdout.flush
|
import sys
N = int(input())
A = list(input().split())
def has(s):
return len(s) != len(set(s))
B = A
B = has(A)
if B == False:
print("YES")
sys.stdout.flush
else:
print("NO")
sys.stdout.flush
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,105
| 578,106
|
u572425901
|
python
|
p02779
|
import sys
N = int(input())
A = list(input().split())
def has(s):
return len(s) != len(set(s))
B = has(A)
if B == False:
print("NO")
sys.stdout.flush
else:
print("YES")
sys.stdout.flush
|
import sys
N = int(input())
A = list(input().split())
def has(s):
return len(s) != len(set(s))
B = A
B = has(A)
if B == False:
print("YES")
sys.stdout.flush
else:
print("NO")
sys.stdout.flush
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,107
| 578,106
|
u572425901
|
python
|
p02779
|
n = int(input())
a = list(map(int, input(),split()))
sa = set(a)
if len(a) == len(sa):
print("YES")
else:
print("NO")
|
n = int(input())
a = list(map(int, input().split()))
sa = set(a)
if len(a) == len(sa):
print("YES")
else:
print("NO")
|
[
"assignment.value.change",
"call.arguments.change"
] | 578,127
| 578,128
|
u617659131
|
python
|
p02779
|
N = int(input())
seq = input().split()
if len(seq) != len(set(seq)):
print('YES')
else:
print('NO')
|
N = int(input())
seq = input().split()
if len(seq) != len(set(seq)):
print('NO')
else:
print('YES')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,131
| 578,132
|
u508934152
|
python
|
p02779
|
n = int(input())
m = list(map(int,input().split()))
m.sort()
for i in range(n):
if m[i] == m[i+1]:
print('NO')
exit()
print('YES')
|
n = int(input())
m = list(map(int,input().split()))
m.sort()
for i in range(n-1):
if m[i] == m[i+1]:
print('NO')
exit()
print('YES')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 578,143
| 578,144
|
u951401193
|
python
|
p02779
|
n=int(input())
a=list(map(int, input().split()))
def func(a):
return len(a) == len(set(a))
if func(a):
print("Yes")
else:
print('No')
|
n=int(input())
a=list(map(int, input().split()))
def func(a):
return len(a) == len(set(a))
if func(a):
print("YES")
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,145
| 578,146
|
u672882146
|
python
|
p02779
|
N=int(input())
A=list(map(int,input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
if has_duplicates(A):
print("No")
else:
print("Yes")
|
N=int(input())
A=list(map(int,input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
if has_duplicates(A):
print("NO")
else:
print("YES")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,155
| 578,156
|
u645538982
|
python
|
p02779
|
N = int(input())
l = sorted([int(x) for x in input().split()])
ans = 'YES'
for i in range(N-1):
if l[0] == l[1]:
ans = 'NO'
print(ans)
|
N = int(input())
l = sorted([int(x) for x in input().split()])
ans = 'YES'
for i in range(N-1):
if l[i] == l[i+1]:
ans = 'NO'
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 578,157
| 578,158
|
u930574673
|
python
|
p02779
|
n = int(input())
a = list(map(int, input().split()))
s = set(a)
if len(a) == len(s):
print("Yes")
else:
print("No")
|
n = int(input())
a = list(map(int, input().split()))
s = set(a)
if len(a) == len(s):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,159
| 578,160
|
u558494840
|
python
|
p02779
|
N = int(input()) # 数字を変数に格納
List = list(map(int,input().split())) # 複数の数字をリストに格納
List.sort()
for i in range(N-1):
if List[i] == List[i+1]:
result = 'NO'
break
print(result)
|
N = int(input()) # 数字を変数に格納
List = list(map(int,input().split())) # 複数の数字をリストに格納
List.sort()
result = 'YES'
for i in range(N-1):
if List[i] == List[i+1]:
result = 'NO'
break
print(result)
|
[
"assignment.add"
] | 578,161
| 578,162
|
u150664457
|
python
|
p02779
|
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,165
| 578,166
|
u319345083
|
python
|
p02779
|
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")
|
[
"call.add",
"call.arguments.change"
] | 578,167
| 578,168
|
u468522925
|
python
|
p02779
|
def main():
N = int(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
return 'YES'
return 'No'
if __name__ == '__main__':
print(main())
|
def main():
N = int(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
return 'YES'
return 'NO'
if __name__ == '__main__':
print(main())
|
[
"literal.string.change",
"literal.string.case.change",
"function.return_value.change"
] | 578,171
| 578,172
|
u116002573
|
python
|
p02779
|
def main():
N = int(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
return 'YES'
return 'No'
if __name__ == '__main__':
print(main())
|
def main():
N = int(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
return 'YES'
return 'NO'
if __name__ == '__main__':
print(main())
|
[
"literal.string.change",
"literal.string.case.change",
"function.return_value.change"
] | 578,173
| 578,172
|
u116002573
|
python
|
p02779
|
n = int(input())
a_set = set(list(map(int, input().split())))
print("Yes" if len(a_set) == n else "No")
|
n = int(input())
a_set = set(list(map(int, input().split())))
print("YES" if len(a_set) == n else "NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,179
| 578,180
|
u081193942
|
python
|
p02779
|
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")
|
[
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 578,181
| 578,182
|
u455809703
|
python
|
p02779
|
# coding: utf-8
def solve(*args: str) -> str:
n = int(args[0])
A = list(map(int, args[1].split()))
A.sort()
p = A[0]
for a in A[1:]:
if a == p:
return 'NO'
return 'YES'
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
# coding: utf-8
def solve(*args: str) -> str:
n = int(args[0])
A = list(map(int, args[1].split()))
A.sort()
p = A[0]
for a in A[1:]:
if a == p:
return 'NO'
p = a
return 'YES'
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
[
"assignment.add"
] | 578,206
| 578,207
|
u164727245
|
python
|
p02779
|
def main():
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 0
for i in range(len(a)-1):
if a[i] == a[i+1]:
ans = 1
if ans == 1:
print("No")
else:
print("Yes")
if __name__ == '__main__':
main()
|
def main():
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 0
for i in range(len(a)-1):
if a[i] == a[i+1]:
ans = 1
if ans == 1:
print("NO")
else:
print("YES")
if __name__ == '__main__':
main()
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,208
| 578,209
|
u879584308
|
python
|
p02779
|
a = list(map(int, input().split()))
print('YNEOS'[len(a) > len(set(a))::2])
|
input()
a = list(map(int, input().split()))
print('YNEOS'[len(a) > len(set(a))::2])
|
[
"call.add"
] | 578,210
| 578,211
|
u021019433
|
python
|
p02779
|
N = int(input())
A = list(input().split())
a = len(collections.Counter(A))
n = len(A)
if (a == n):
print('Yes')
else:
print('No')
|
import collections
N = int(input())
A = list(input().split())
a = len(collections.Counter(A))
n = len(A)
if (a == n):
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,212
| 578,213
|
u015593272
|
python
|
p02779
|
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,214
| 578,215
|
u396518935
|
python
|
p02779
|
import collections
N = int(input())
A = list(map(int, input().split()))
C = collections.Counter(A)
if C.most_common()[0][1] == 1:
print("Yes")
else:
print("No")
|
import collections
N = int(input())
A = list(map(int, input().split()))
C = collections.Counter(A)
if C.most_common()[0][1] == 1:
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,216
| 578,217
|
u672220554
|
python
|
p02779
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,224
| 578,225
|
u459798349
|
python
|
p02779
|
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)
|
[
"call.remove"
] | 578,226
| 578,227
|
u288001809
|
python
|
p02779
|
# -*- coding: utf-8 -*-
N = int(input())
A_list = list(map(int, input().split()))
print("Yes" if len(A_list) == len(set(A_list)) else "No")
|
# -*- coding: utf-8 -*-
N = int(input())
A_list = list(map(int, input().split()))
print("YES" if len(A_list) == len(set(A_list)) else "NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,230
| 578,231
|
u811817592
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
A_ = {}
for a in A:
if a not in A_:
A_[a] = 1
else:
A[a] += 1
break
if len(A) == len(A_):
print("YES")
else:
print("NO")
|
N = int(input())
A = list(map(int, input().split()))
A_ = {}
for a in A:
if a not in A_:
A_[a] = 1
else:
A_[a] += 1
break
if len(A) == len(A_):
print("YES")
else:
print("NO")
|
[
"identifier.change"
] | 578,241
| 578,242
|
u504256702
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
S = list(set(A))
if len(A) == len(S):
return "YES"
else:
return "NO"
|
N = int(input())
A = list(map(int, input().split()))
S = list(set(A))
if len(A) == len(S):
print("YES")
else:
print("NO")
|
[
"function.return_value.change",
"call.arguments.change"
] | 578,246
| 578,247
|
u975485663
|
python
|
p02779
|
import sys
input = sys.stdin.readline
n = int(input())
*a, = map(int, input().split())
if len(set(a)) == n:
print('Yes')
else:
print('No')
|
import sys
input = sys.stdin.readline
n = int(input())
*a, = map(int, input().split())
if len(set(a)) == n:
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,250
| 578,251
|
u102275718
|
python
|
p02779
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,254
| 578,255
|
u388719350
|
python
|
p02779
|
n=int(input())
*a,=map(int,input().split())
if len(set(a)) == len(a):
print("Yes")
else:
print("No")
|
n=int(input())
*a,=map(int,input().split())
if len(set(a)) == len(a):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,258
| 578,259
|
u857070771
|
python
|
p02779
|
N = int(input())
A = list(map(int,input().split()))
A = sorted(A)
for i in range(len(A)-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(len(A)-1):
if A[i] == A[i+1]:
print("NO")
exit()
print("YES")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,260
| 578,261
|
u990608646
|
python
|
p02779
|
n = int(input())
A = list(map(int, input().split()))
setA = set(A)
print("Yes" if len(setA)==len(A) else "No")
|
n = int(input())
A = list(map(int, input().split()))
setA = set(A)
print("YES" if len(setA)==len(A) else "NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,269
| 578,270
|
u024383312
|
python
|
p02779
|
import collections
N = int(input())
l = list(map(int,input().split()))
c = collections.Counter(l)
if c.most_common()[0][1] > 1:
print('No')
else:
print('Yes')
|
import collections
N = int(input())
l = list(map(int,input().split()))
c = collections.Counter(l)
if c.most_common()[0][1] > 1:
print('NO')
else:
print('YES')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,273
| 578,274
|
u107269063
|
python
|
p02779
|
N = int(input())
A = list(input())
SET_A = set(A)
if len(A)==len(SET_A):
print("YES")
else:
print("NO")
|
N = int(input())
A = input().split()
SET_A = set(A)
if len(A)==len(SET_A):
print("YES")
else:
print("NO")
|
[
"call.remove",
"call.add"
] | 578,277
| 578,278
|
u189479417
|
python
|
p02779
|
import heapq
N = int(input())
A = list(int(x) for x in input().split())
heapq.heapify(A)
com1 = heapq.heappop(A)
ans = True
for _ in range(N-1):
com2 = heapq.heappop(A)
if com1 == com2:
ans = False
break
com1 = com2
if ans:
print('Yes')
else:
print('No')
|
import heapq
N = int(input())
A = list(int(x) for x in input().split())
heapq.heapify(A)
com1 = heapq.heappop(A)
ans = True
for _ in range(N-1):
com2 = heapq.heappop(A)
if com1 == com2:
ans = False
break
com1 = com2
if ans:
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,291
| 578,292
|
u900848911
|
python
|
p02779
|
n = int(input())
a = list(map(int,input().split()))
s_a = set(a)
if n == len(s_a):
print('Yes')
else:
print('No')
|
n = int(input())
a = list(map(int,input().split()))
s_a = set(a)
if n == len(s_a):
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,318
| 578,319
|
u183657342
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
if len(set(A)) == len(A):
print('Yes')
else:
print('No')
|
N = int(input())
A = list(map(int, input().split()))
if len(set(A)) == len(A):
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,320
| 578,321
|
u666844906
|
python
|
p02779
|
import math
import fractions
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def ValueToBits(x,digit):
res = [0 for i in range(digit)]
now = x
for i in range(digit):
res[i]=now%2
now = now >> 1
return res
def BitsToValue(arr):
n = len(arr)
ans = 0
for i in range(n):
ans+= arr[i] * 2**i
return ans
def ValueToArray10(x, digit):
ans = [0 for i in range(digit)]
now = x
for i in range(digit):
ans[digit-i-1] = now%10
now = now //10
return ans
#a = list(map(int, input().split()))
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)
|
import math
import fractions
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def ValueToBits(x,digit):
res = [0 for i in range(digit)]
now = x
for i in range(digit):
res[i]=now%2
now = now >> 1
return res
def BitsToValue(arr):
n = len(arr)
ans = 0
for i in range(n):
ans+= arr[i] * 2**i
return ans
def ValueToArray10(x, digit):
ans = [0 for i in range(digit)]
now = x
for i in range(digit):
ans[digit-i-1] = now%10
now = now //10
return ans
#a = list(map(int, input().split()))
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)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 578,322
| 578,323
|
u366541443
|
python
|
p02779
|
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')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 578,327
| 578,328
|
u350578302
|
python
|
p02779
|
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,331
| 578,332
|
u932864155
|
python
|
p02779
|
l=int(input())
list = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
r=has_duplicates(list)
print(r)
if(str(r)=="False"):
print("YES")
else:
print("NO")
|
l=int(input())
list = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
r=has_duplicates(list)
if(str(r)=="False"):
print("YES")
else:
print("NO")
|
[
"call.remove"
] | 578,335
| 578,336
|
u031115006
|
python
|
p02779
|
N = input()
A = input().split()
if int(N) == len(set(A)):
print("NO")
else:
print("YES")
|
N = input()
A = input().split()
if int(N) == len(set(A)):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,339
| 578,340
|
u241544828
|
python
|
p02779
|
import collections
n=int(input())
A = list(map(int, input().split()))
c=collections.Counter(A)
if c==len(A):
print("YES")
else:
print("NO")
|
import collections
n=int(input())
A = list(map(int, input().split()))
c=collections.Counter(A)
if len(c)==len(A):
print("YES")
else:
print("NO")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 578,341
| 578,342
|
u239653493
|
python
|
p02779
|
# 入力、宣言
intLen=int(input())
intList=sorted(list(map(int,input().split())))
result="Yes"
# 処理
# 対象項目と次の項目を比較
for i in range(len(intList)-1):
if intList[i]==intList[i+1]:
result="No"
# 出力
print(result)
|
# 入力、宣言
intLen=int(input())
intList=sorted(list(map(int,input().split())))
result="YES"
# 処理
# 対象項目と次の項目を比較
for i in range(len(intList)-1):
if intList[i]==intList[i+1]:
result="NO"
# 出力
print(result)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 578,354
| 578,355
|
u183432736
|
python
|
p02779
|
N = int(input())
numbers = list(map(int,input().split()))
numbers = set(numbers)
if N == len(numbers):
print('Yes')
else :
print('No')
|
N = int(input())
numbers = list(map(int,input().split()))
numbers = set(numbers)
if N == len(numbers):
print('YES')
else :
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,356
| 578,357
|
u150517577
|
python
|
p02779
|
from collections import Counter
N = int(input())
A = Counter(map(int, input().split()))
A = A.values()
for a in A:
if a != 1:
print("NO")
exit()
print("Yes")
|
from collections import Counter
N = int(input())
A = Counter(map(int, input().split()))
A = A.values()
for a in A:
if a != 1:
print("NO")
exit()
print("YES")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,358
| 578,359
|
u981931040
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
A.sort()
isSame = False
for i in range(N - 1):
if A[i] == A[i + 1]:
isSame = True
break
if isSame:
print('YES')
else:
print('NO')
|
N = int(input())
A = list(map(int, input().split()))
A.sort()
isSame = False
for i in range(N - 1):
if A[i] == A[i + 1]:
isSame = True
break
if isSame:
print('NO')
else:
print('YES')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,362
| 578,363
|
u588749694
|
python
|
p02779
|
# C - Distinct or Not
N = int(input())
A = list(map(int, input().split(' ')))
A.sort()
S = list(set(A))
if A == S:
print('YES')
else:
print('NO')
|
# C - Distinct or Not
N = int(input())
A = list(map(int, input().split(' ')))
A.sort()
S = list(set(A))
if len(A) == len(S):
print('YES')
else:
print('NO')
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 578,364
| 578,365
|
u558146042
|
python
|
p02779
|
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')
|
[
"call.remove"
] | 578,366
| 578,367
|
u470618774
|
python
|
p02779
|
len1 = input()
len2 = len(set(input().split(" ")))
if len1 == len2:
print("YES")
else:
print("NO")
|
len1 = int(input())
len2 = len(set(input().split(" ")))
if len1 == len2:
print("YES")
else:
print("NO")
|
[
"call.add",
"call.arguments.change"
] | 578,382
| 578,383
|
u314397652
|
python
|
p02779
|
len1 = int(input())
len2 = set(input().split(" "))
if len1 == len2:
print("YES")
else:
print("NO")
|
len1 = int(input())
len2 = len(set(input().split(" ")))
if len1 == len2:
print("YES")
else:
print("NO")
|
[
"call.add",
"call.arguments.change"
] | 578,384
| 578,383
|
u314397652
|
python
|
p02779
|
len1 = input()
len2 = set(input().split(" "))
if len1 == len2:
print("YES")
else:
print("NO")
|
len1 = int(input())
len2 = len(set(input().split(" ")))
if len1 == len2:
print("YES")
else:
print("NO")
|
[
"call.add",
"call.arguments.change"
] | 578,385
| 578,383
|
u314397652
|
python
|
p02779
|
import sys
input = sys.stdin.readline
def main():
n = int(input())
x = tuple(map(int, input().split()))
length = len(x)
if n == length:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
n = int(input())
x = set(map(int, input().split()))
length = len(x)
if n == length:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 578,389
| 578,390
|
u193264896
|
python
|
p02779
|
N = int(input())
A_list = [int(item) for item in input().split()]
A_set = set(A_list)
if len(A_list) == len(A_set):
print('Yes')
else:
print('No')
|
N = int(input())
A_list = [int(item) for item in input().split()]
A_set = set(A_list)
if len(A_list) == len(A_set):
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,393
| 578,394
|
u591503175
|
python
|
p02779
|
N = int(input())
A = input().split()
A.sort()
f = 0
for i in range(N - 1):
if A[i] == A[i+1]:
print("NO")
f += 1
break
if f==1:
print("YES")
|
N = int(input())
A = input().split()
A.sort()
f = 0
for i in range(N - 1):
if A[i] == A[i+1]:
print("NO")
f += 1
break
if f==0:
print("YES")
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 578,397
| 578,398
|
u510434738
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
def check(seq):
if len(seq) != len(set(seq)):
return "YES"
else:
return "NO"
print(check(A))
|
N = int(input())
A = list(map(int, input().split()))
def check(seq):
if len(seq) != len(set(seq)):
return "NO"
else:
return "YES"
print(check(A))
|
[
"literal.string.change",
"function.return_value.change"
] | 578,399
| 578,400
|
u511854420
|
python
|
p02779
|
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,405
| 578,406
|
u244070045
|
python
|
p02779
|
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,407
| 578,406
|
u244070045
|
python
|
p02779
|
N = int(input())
A = input().split()
A.sort()
frag = None
for i in range(N-1):
if A[i] ==A[i+1]:
print('NO')
frag = 1
break
if frag == None:
print('Yes')
|
N = int(input())
A = input().split()
A.sort()
frag = None
for i in range(N-1):
if A[i] ==A[i+1]:
print('NO')
frag = 1
break
if frag == None:
print('YES')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,412
| 578,413
|
u891876269
|
python
|
p02779
|
N=int(input())
A=list(map(int,input().split()))
A.sort()
for i in range(N):
if A[i]==A[i+1]:
print("NO")
break
else:
print("YES")
break
|
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")
|
[
"control_flow.break.remove"
] | 578,414
| 578,415
|
u252610200
|
python
|
p02779
|
N = input()
a = input().split()
def has_duplicates(seq):
return len(seq) != len(set(seq))
b = has_duplicates(a)
if b == True:
print('YES')
if b == False:
print('NO')
|
N = input()
a = input().split()
def has_duplicates(seq):
return len(seq) != len(set(seq))
b = has_duplicates(a)
if b == True:
print('NO')
if b == False:
print('YES')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,418
| 578,419
|
u038132197
|
python
|
p02779
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,427
| 578,428
|
u419963262
|
python
|
p02779
|
n = int(input())
arr = list(map(int,input().split()))
arrset = set(arr)
if len(arr) == len(arrset):
print("Yes")
else:
print("No")
|
n = int(input())
arr = list(map(int,input().split()))
arrset = set(arr)
if len(arr) == len(arrset):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,434
| 578,435
|
u078181689
|
python
|
p02779
|
N=int(input())
A=[int(i) for i in input().split()]
if len(A)==len(set(A)):
print("Yes")
else:
print("No")
|
N=int(input())
A=[int(i) for i in input().split()]
if len(A)==len(set(A)):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,436
| 578,437
|
u069172538
|
python
|
p02779
|
import collections
n=input()
a=list(map(int,input().split()))
c=collections.Counter(a)
ans=True
for i,m in c.items():
if m>1:
ans=False
break
if ans:
print("Yes")
else:
print("No")
|
import collections
n=input()
a=list(map(int,input().split()))
c=collections.Counter(a)
ans=True
for i,m in c.items():
if m>1:
ans=False
break
if ans:
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,438
| 578,439
|
u877415670
|
python
|
p02779
|
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
a = na()
a.sort()
diff = True
for i in range(n-1):
if a[i] == a[i+1]:
diff = False
if diff:
print("Yes")
else:
print("No")
|
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
a = na()
a.sort()
diff = True
for i in range(n-1):
if a[i] == a[i+1]:
diff = False
if diff:
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,440
| 578,441
|
u119714109
|
python
|
p02779
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,456
| 578,457
|
u974292946
|
python
|
p02779
|
n = int(input())
list = list(map(int, input().split()))
if len(list) == len(set(list)):
print("Yes")
else:
print("No")
|
n = int(input())
list = list(map(int, input().split()))
if len(list) == len(set(list)):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,458
| 578,459
|
u207137484
|
python
|
p02779
|
n = int(input())
a = list(map(int,input().split()))
a.sort()
s = list(set(a))
if a == s:
print('YES')
else:
print('NO')
|
n = int(input())
a = list(map(int,input().split()))
a.sort()
s = list(set(a))
s.sort()
if a == s:
print('YES')
else:
print('NO')
|
[
"call.add"
] | 578,471
| 578,472
|
u063703408
|
python
|
p02779
|
from collections import Counter
from operator import itemgetter
N = int(input())
A = Counter(map(int,input().split()))
A1 = list(A.items())
A1 = sorted(A1,key=itemgetter(1),reverse = True)
print(A1)
if A1[0][1] == 1:
print('YES')
else:
print('NO')
|
from collections import Counter
from operator import itemgetter
N = int(input())
A = Counter(map(int,input().split()))
A1 = list(A.items())
A1 = sorted(A1,key=itemgetter(1),reverse = True)
#print(A1)
if A1[0][1] == 1:
print('YES')
else:
print('NO')
|
[
"call.remove"
] | 578,479
| 578,480
|
u812576525
|
python
|
p02779
|
from collections import Counter
from operator import itemgetter
N = int(input())
A = Counter(map(int,input().split()))
A1 = list(A.items())
A1 = sorted(A1,key=itemgetter(1),reverse = True)
if A1[0][1] == 1:
print('Yes')
else:
print('No')
|
from collections import Counter
from operator import itemgetter
N = int(input())
A = Counter(map(int,input().split()))
A1 = list(A.items())
A1 = sorted(A1,key=itemgetter(1),reverse = True)
#print(A1)
if A1[0][1] == 1:
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,481
| 578,480
|
u812576525
|
python
|
p02779
|
N = input()
a = list(input().split())
import collections
c = collections.Counter(a)
flag = True
for i in c.values():
#print(i)
if i!=1:
flag = False
break
if flag == False:
print('No')
else:
print('Yes')
|
N = input()
a = list(input().split())
import collections
c = collections.Counter(a)
flag = True
for i in c.values():
#print(i)
if i!=1:
flag = False
break
if flag == False:
print('NO')
else:
print('YES')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,484
| 578,485
|
u038408819
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
B = list(set(A))
if len(A) == len(B):
ans = 'YES'
else:
ans = 'No'
print(ans)
|
N = int(input())
A = list(map(int, input().split()))
B = list(set(A))
if len(A) == len(B):
ans = 'YES'
else:
ans = 'NO'
print(ans)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 578,486
| 578,487
|
u815878613
|
python
|
p02779
|
N = int(input())
A = list(map(int,input().split()))
if len(A) != len(set(A)):
print("No")
else:
print("Yes")
|
N = int(input())
A = list(map(int,input().split()))
if len(A) != len(set(A)):
print("NO")
else:
print("YES")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,490
| 578,491
|
u806392288
|
python
|
p02779
|
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 = list(map(int,input().split()))
if len(A) == len(list(set(A))):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,492
| 578,493
|
u799978560
|
python
|
p02779
|
import collections
N = int(input())
n = list(map(int, input().split()))
c = collections.Counter(n)
cnt = c.most_common()
for c in cnt:
if (c[1]>1):
print('No')
else:
print('Yes')
break
|
import collections
N = int(input())
n = list(map(int, input().split()))
c = collections.Counter(n)
cnt = c.most_common()
for c in cnt:
if (c[1]>1):
print('NO')
else:
print('YES')
break
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,494
| 578,495
|
u713228137
|
python
|
p02779
|
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")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,496
| 578,497
|
u442581202
|
python
|
p02779
|
N=int(input())
s=list(map(int,input().split()))
# N=6
# s=[4 ,1 ,3 ,1 ,6 ,2]
from collections import Counter
S=Counter(s)#カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
if S.most_common(1)[0][1]==1:
print("YES")
else:
print("N0")
|
N=int(input())
s=list(map(int,input().split()))
# N=6
# s=[4 ,1 ,3 ,1 ,6 ,2]
from collections import Counter
S=Counter(s)#カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
if S.most_common(1)[0][1]==1:
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 578,500
| 578,501
|
u417014669
|
python
|
p02779
|
N=int(input())
s=list(map(int,input().split()))
# N=6
# s=[4 ,1 ,3 ,1 ,6 ,2]
from collections import Counter
S=Counter(s)#カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
if S.most_common(1)[0][1]==1:
print("Yes")
else:
print("No")
|
N=int(input())
s=list(map(int,input().split()))
# N=6
# s=[4 ,1 ,3 ,1 ,6 ,2]
from collections import Counter
S=Counter(s)#カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
if S.most_common(1)[0][1]==1:
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,502
| 578,501
|
u417014669
|
python
|
p02779
|
N = input()
A = list(map(int, input().split()))
if len(A) == len(set(A)):
print("Yes")
else:
print("No")
|
N = input()
A = list(map(int, input().split()))
if len(A) == len(set(A)):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,520
| 578,521
|
u212786022
|
python
|
p02779
|
import collections
N = int(input())
A = list(map(int , input().split()))
c = collections.Counter(A)
if len(c) == N:
print('Yes')
else:
print('No')
|
import collections
N = int(input())
A = list(map(int , input().split()))
c = collections.Counter(A)
if len(c) == N:
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,534
| 578,535
|
u140191608
|
python
|
p02779
|
i = int(input())
W = list(map(int, input().split()))
if i-len(set(W))==0:
print('Yes')
else:
print('No')
|
i = int(input())
W = list(map(int, input().split()))
if i-len(set(W))==0:
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,541
| 578,542
|
u546104065
|
python
|
p02779
|
n = int(input())
a = list(map(int, input().split()))
a1 = sorted(a)
for i in range(1, n):
if a1[i] == a1[i-1]:
print("No")
break
elif i == n-1:
print("Yes")
|
n = int(input())
a = list(map(int, input().split()))
a1 = sorted(a)
for i in range(1, n):
if a1[i] == a1[i-1]:
print("NO")
break
elif i == n-1:
print("YES")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,549
| 578,550
|
u518386853
|
python
|
p02779
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,555
| 578,556
|
u336564899
|
python
|
p02779
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,557
| 578,556
|
u336564899
|
python
|
p02779
|
n = int(input())
a = [int(i) for i in input().split()]
res = set()
ans = False
for i in a:
if i in res:
ans = True
else:
res.add(i)
if ans ==True:
print('No')
else:
print('Yes')
|
n = int(input())
a = [int(i) for i in input().split()]
res = set()
ans = False
for i in a:
if i in res:
ans = True
else:
res.add(i)
if ans ==True:
print('NO')
else:
print('YES')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,562
| 578,563
|
u293198424
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
print('No' if has_duplicates(A) else 'Yes')
|
N = int(input())
A = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
print('NO' if has_duplicates(A) else 'YES')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,564
| 578,565
|
u709799578
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
a = set(A)
if len(A) == len(a):
print("Yes")
else:
print("No")
|
N = int(input())
A = list(map(int, input().split()))
a = set(A)
if len(A) == len(a):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,580
| 578,581
|
u698902360
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.