Datasets:
TnT
/
Multi_CodeNet4Repair

Dataset card Data Studio Files
xet
Community
problem_id
stringlengths
6
6
user_id
stringlengths
10
10
time_limit
float64
1k
8k
memory_limit
float64
262k
1.05M
problem_description
stringlengths
48
1.55k
codes
stringlengths
35
98.9k
status
stringlengths
28
1.7k
submission_ids
stringlengths
28
1.41k
memories
stringlengths
13
808
cpu_times
stringlengths
11
610
code_sizes
stringlengths
7
505
p02779
u232652798
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nA = [int(x) for x in input().split]\nfor i in A:\n for j in A:\n if i == j:\n print('NO')\n else:\n print('YES')\n ", "N = int(input())\nA = [int(x) for x in input().split()]\nNO = False\nwhile NO == False:\n for i in A:\n j=0\n if A[j] == i:\n j += 1\n NO = True\nif NO == True:\n print('NO')\nelse:\n print('YES')\n", "N = int(input())\nA = list(map(int,input().split()))\nS = sorted(A)\nCheck = False\nfor i in range(len(S)-1):\n if S[i] == S[i+1]:\n Check = True\n break\nif Check == True:\n print('NO')\nelse:\n print('YES')\n "]
['Runtime Error', 'Wrong Answer', 'Accepted']
['s090080051', 's778379832', 's346703564']
[7000.0, 25936.0, 26680.0]
[22.0, 101.0, 181.0]
[175, 230, 225]
p02779
u232873434
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['A = input().split()\n\nprint(A[0] in A[1:])', "N = input()\nA = input().split()\n\nif A[0] in A[1:] :\n print('YES')\nelse:\n print('NO')", "N = input()\nA = input().split()\n\nif len(set(A)) == N :\n print('YES')\nelse:\n print('NO')", 'N = input()\nA = input().split()\n\nprint(A[0] in A[1:])', "N = int(input())\nA = input().split()\n\nif len(set(A)) == N :\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s320074512', 's343411327', 's556577149', 's584249406', 's784499249']
[2940.0, 19160.0, 31156.0, 20796.0, 31156.0]
[18.0, 44.0, 70.0, 44.0, 61.0]
[41, 90, 93, 53, 98]
p02779
u236536206
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\na=list(map(int,input().split()))\n\nif len(a)==len(set(a)):\n print("Yes")\nelse:\n print("No")\n', 'n=int(input())\na=list(map(int,input().split()))\n\nif len(a)==len(set(a)):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s722700317', 's203097652']
[26808.0, 26808.0]
[81.0, 83.0]
[112, 111]
p02779
u238940874
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int,input().split()))\ns = set(a)\nif len(s) == n:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int,input().split()))\ncnt = 0\nfor i in range(n):\n for j in range(n):\n if a[i] == a[j]:\n cnt += 1\nif cnt > n:\n print('No')\nelse:\n print('Yes')", "n = int(input())\na = list(map(int,input().split()))\ns = set(a)\nif len(s) == n:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s837121230', 's867443789', 's256956076']
[25172.0, 25172.0, 26808.0]
[91.0, 2104.0, 95.0]
[117, 198, 117]
p02779
u239653493
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import collections\nn=int(input())\nA = list(map(int, input().split\nc=collections.Counter(A)\nif c==len(A):\n print("YES")\nelse:\n print("NO")', 'n=int(input())\nA = list(map(int, input().split()))\nfor i in range(0,n-1):\n for j in range(i+1,n):\n if A[i]==A[j]:\n print("No")\n break\n else:\n continue\n break\nelse:\n print("Yes")', 'n=int(input())\nA = list(map(int, input().split\nc=collections.Counter(A)\nif c==len(A):\n print("YES")\nelse:\n print("NO")', 'n=int(input())\nA = list(map(int, input().split\nc=collections.Counter(A)\nif c=len(A):\n print("YES")\nelse:\n print("NO")', 'import collections\nn=int(input())\nA = list(map(int, input().split()))\nc=collections.Counter(A)\nif c==len(A):\n print("YES")\nelse:\n print("NO")', 'import collections\nn=int(input())\nA = list(map(int, input().split()))\nc=collections.Counter(A)\nif len(c)==len(A):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s313160429', 's361503235', 's455304985', 's719295740', 's951089694', 's022368031']
[2940.0, 26808.0, 2940.0, 2940.0, 33996.0, 33996.0]
[17.0, 2104.0, 17.0, 17.0, 111.0, 109.0]
[143, 225, 124, 123, 147, 152]
p02779
u240768672
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\nList=list(map(int,input().split()))\nSet=set()\nfor i in range(len(List)):\n Set.add(List[i])\nif len(Set)==n :\n print("Yes")\nelse :\n print("No")', 'n=int(input())\nList=list(map(int,input().split()))\nSet=set()\nfor i in range(len(List)):\n Set.add(List[i])\nif len(Set)==n :\n print("YES")\nelse :\n print("NO")']
['Wrong Answer', 'Accepted']
['s484924298', 's769931024']
[26800.0, 26808.0]
[120.0, 119.0]
[165, 165]
p02779
u241544828
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = input()\nA = input().split()\nif n in A:\n print("YES")\nelse:\n print("NO")\nN = int(input())\nA = [int(x) for x in input().split()]\n\nif n in A:\n print("YES")\nelse:\n print("NO")\n提出情報\n提出日時', 'N = input()\nA = input().split()\nif N in A:\n print("NO")\nelse:\n print("YES")', 'N = input()\nA = input().split()\nif int(N) == len(set(A)):\n print("NO")\nelse:\n print("YES")', 'N = int(input())\nA = [int(x) for x in input().split()]\n\nif n in A:\n print("YES")\nelse:\n print("NO")', 'N = input()\nA = input().split()\nif n in A:\n print("YES")\nelse:\n print("NO")', 'N = input()\nA = input().split()\nif int(N) == len(set(A)):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
['s410565704', 's576630219', 's633252583', 's713561632', 's715440540', 's017732639']
[20052.0, 20792.0, 31156.0, 25172.0, 20792.0, 30160.0]
[37.0, 40.0, 68.0, 73.0, 37.0, 62.0]
[205, 77, 92, 101, 77, 92]
p02779
u244070045
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input()) \n\nAn = [int(x) for x in input().split() ]\n\nii = len(An)\n\nif len( set(An) ) == ii:\n print('Yes')\nelse:\n print('No')\n\n", "N = int(input()) \n\nAn = [int(x) for x in input().split() ]\n\nii = len(An)\n\nif len( set(An) ) == ii:\n print('Yes')\nelse:\n print('No')\n", "N = int(input()) \n\nAn = [int(x) for x in input().split() ]\n\nii = len(An)\n\nif len( set(An) ) == ii:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s706986679', 's981373759', 's333745122']
[25268.0, 25172.0, 25936.0]
[90.0, 90.0, 120.0]
[139, 138, 138]
p02779
u244786566
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['a=int(input())\nb=list(input().split())\nc=sorted(b)\nfor i in range (a-1):\n if c[i]==c[i+1]:\n print("No")\n break\n else:print("Yes")\n break\n', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\nfor i in range (a-1):\n if c[i]==c[i+1]:\n print("No")\n break\n else:print("Yes")', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\nans=0\nfor i in range (a-1):\n\tif c[i]==c[i+1]:\n\t\tprint("YES")\n\t\tbreak\n\telse:\n\t\tprint("NO")\n\t\tbreak\n\n', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\nfor i in range (a-1):\n if c[i]==c[i+1]:\n print("No")\n break\n else:\n print("Yes")\n break\n\n', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\nans=0\nfor i in range (a-1):\n if c[i]==c[i+1]:\n ans=1\n break\nif ans==0:\n\tprint("YES")\nelse:print("NO")\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s386377821', 's685064870', 's718772371', 's973554322', 's666585275']
[21944.0, 22500.0, 20308.0, 21944.0, 21944.0]
[170.0, 334.0, 173.0, 170.0, 211.0]
[139, 131, 150, 144, 155]
p02779
u247114740
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["input()\na = [int(x) for x in iput().split()]\nif(len(set(a)) < len(a)):\n print('YES')\nelse:\n print('NO')", "n = int(input())\na = [int(x) for x in input().split()]\nif(n > len(set(a))):\tprint('NO')\nelse:\tprint('YES')"]
['Runtime Error', 'Accepted']
['s735499180', 's705317843']
[3060.0, 25324.0]
[17.0, 93.0]
[105, 106]
p02779
u247830763
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\nls = list(map(int, input().split()))\nfor i in range(0,n-1):\n for u in range(0, n-1):\n if ls(i) == ls(u):\n print("No")\nelse:\n print("Yes")', "n = int(input())\nls = list(map(int,input().split()))\nls.sort()\na = 0\nfor i in range(len(ls)-1):\n if ls[i] == ls[i+1]:\n a += 1\n break\n else:\n continue\nif a >0:\n print('No')\nelse:\n print('Yes')\n \n", "n = int(input())\nls = list(map(int,input().split()))\nls.sort()\na = 0\nfor i in range(len(ls)-1):\n if ls[i] == ls[i+1]:\n a += 1\n break\n else:\n continue\nif a == 1:\n print('No')\nelse:\n print('Yes')\n \n", 'import collections\nn = int(input())\nls = list(map(int,input().split()))\nif len(ls) == len(collections.Counter(ls)):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s025559811', 's795114401', 's917198986', 's850301963']
[26808.0, 26808.0, 26808.0, 33996.0]
[68.0, 179.0, 179.0, 102.0]
[178, 234, 236, 154]
p02779
u249412218
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['from collections import Counter\n\nn=int(input())\n\narr=list(map(int,input().split()))\n\ncc=Counter(arr)\nfor k,v in cc.items():\n if v>1:\n print("NO")\n break\nelse:\nprint("NO")\n', '#from collections import Counter\nn=int(input())\narr=list(map(int,input().split()))\ndi={}\nfor i in arr:\n if i in di:\n print("NO")\n break\n else:\n di[i]=1\nelse:\n print("YES")\n']
['Runtime Error', 'Accepted']
['s340917802', 's739204365']
[2940.0, 32844.0]
[17.0, 117.0]
[178, 184]
p02779
u250061066
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nA = list(map(int, input().split()))\nA.sort()\n#print(A)\nyesno = 'NO'\nfor i in range(len(A)-1):\n if A[i]==A[i+1]:\n yesno = 'YES'\n break\nprint(yesno)", "N = int(input())\nA = list(map(int, input().split()))\nA.sort()\n#print(A)\nyesno = 'No'\nfor i in range(len(A)-1):\n if A[i]==A[i+1]:\n yesno = 'Yes'\n break\nprint(yesno) ", "N = int(input())\nA = list(map(int, input().split()))\nA.sort()\n#print(A)\nyesno = 'YES'\nfor i in range(len(A)-1):\n if A[i]==A[i+1]:\n yesno = 'NO'\n break\nprint(yesno)"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s065022187', 's412334751', 's411712556']
[26808.0, 25424.0, 26808.0]
[177.0, 179.0, 182.0]
[180, 183, 180]
p02779
u250554058
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["from collections import Counter\nn = int(input())\nif(sorted(Counter([i for i in input().split()]).most_common())[0][1] > 1):\n print('No')\nelse:\n print('Yes') \n", "from collections import Counter\nn = int(input())\nif(sorted(Counter([i for i in input().split()]).most_common(), key=lambda x: x[1], reverse = True)[0][1] > 1):\n print('NO')\nelse:\n print('YES') \n"]
['Wrong Answer', 'Accepted']
['s094631621', 's920540717']
[46540.0, 46536.0]
[464.0, 179.0]
[160, 196]
p02779
u250828304
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import sys\n\ndef binary_search(li, item):\n low = 0\n high = len(li) - 1\n \n while low <= high:\n mid = (low + high) // 2\n guess = li[mid]\n if item == guess:\n return True\n if item < guess:\n high = mid-1\n else:\n low = mid+1\n return False\n\nn = int(input())\na_li = list(map(int, input().split()))\na_li.sort()\nfor a in a_li:\n if binary_search(a_li, a) == True:\n print("NO")\n sys.exit()\nprint("YES")', 'import sys\n\n\ndef main():\n input = sys.stdin.readline\n n = int(input())\n a_li = list(input().split())\n a_li = [int(s) for s in a_li]\n\n a_li.sort()\n for i in range(n-1):\n if a_li[i] == a_li[i+1]:\n print("NO")\n sys.exit()\n print("YES")\n \nif __name__ == "__main__":\n main()']
['Wrong Answer', 'Accepted']
['s060101095', 's371108968']
[26808.0, 25244.0]
[148.0, 173.0]
[431, 291]
p02779
u251780079
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = input()\nx = list(map(int, input().split()))\ns = set()\nlist(map(s.add, x))\nif len(s) != len(x):\n print('YES')\nelse:\n print('NO')\n", 'n = input()\nx = list(map(int, input().split()))\ns = set()\nlist(map(s.add, x))\nprint(len(s))\n', "n = input()\nx = list(map(int, input().split()))\ns = set()\nlist(map(s.add, x))\nif len(s) == len(x):\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s358167982', 's568389213', 's090099892']
[26808.0, 26808.0, 26808.0]
[102.0, 103.0, 101.0]
[134, 92, 134]
p02779
u252523823
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\naa = map(int, input().split())\nif len(set(aa)) != N:\n print('NO')\nelse:\n print('YES)", "N = int(input())\naa = map(int, input().split())\nif len(set(aa)) != N:\n print('NO')\nelse:\n print('YES')"]
['Runtime Error', 'Accepted']
['s638581950', 's552442468']
[2940.0, 36660.0]
[18.0, 87.0]
[103, 104]
p02779
u258325541
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = int(input())\nA = list(map(int,input().split(" ")))\nTriger = 0\nif len(A) > 200000:\n print("No")\nelse:\n A.sort()\n for i in range(1,len(A)-1):\n if A[i] == A[i-1]:\n print("No")\n Triger += 1\n break\n if Triger == 0:\n print("Yes")', 'N = int(input())\nA = list(map(int,input().split(" ")))\nTriger = 0\nA.sort()\nif N == 2:\n if A[0] == A[1]:\n print("NO")\n else:\n print("YES")\nelse:\n \n for i in range(1,len(A)-1):\n if A[i] == A[i-1]:\n print("NO")\n Triger += 1\n break\n if Triger == 0:\n print("YES")']
['Wrong Answer', 'Accepted']
['s721290047', 's108991498']
[26680.0, 26808.0]
[182.0, 183.0]
[252, 290]
p02779
u258737855
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\n\na = list(map(int, input().split()))\n\ncount = 0\n\nfor a_item in a:\n ab = a.count(a_item)\n if ab <= 2:\n count += 1\n #print('NO')\n # break\n\n# print('YES')\nif count <= 1:\n print('YES')\nelse:\n print('NO')", "n = int(input())\n\na = list(map(int, input().split()))\n\ncount = 0\n\nfor index, a_item in enumerate(a):\n ab = a[index:].count(a_item)\n print(ab)\n if ab >= 2:\n count += 1\n #print('NO')\n # break\n\n# print('YES')\nif count == 0:\n print('YES')\nelse:\n print('NO')\n", "n = int(input())\n\na = list(map(int, input().split()))\n\ncount = 0\n\nfor index, a_item in enumerate(a):\n ab = a[index:].count(a_item)\n print(ab)\n if ab >= 2:\n count += 1\n break\n #print('NO')\n # break\n\n# print('YES')\nif count == 0:\n print('YES')\nelse:\n print('NO')", "n = int(input())\n\na = list(map(int, input().split()))\n\na.sort()\n\ncount = 0\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n count += 1\n\nif count == 0:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s295576030', 's765086546', 's938218777', 's065545251']
[26808.0, 25936.0, 26808.0, 26680.0]
[2104.0, 2104.0, 2104.0, 183.0]
[248, 289, 302, 193]
p02779
u261103969
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n =int(input())\na = [int(i) for i in input().split()]\nis_same = False\n\nfor i in range(n):\n for j in range(i+1, n+1):\n if a[i] == a[j]:\n is_same = True\n\nif is_same:\n print('NO')\nelse:\n print('YES')", "n = int(input())\na = [int(i) for i in input().split()]\n\na.sort()\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print('NO')\n break\nelse:\n print('YES')"]
['Runtime Error', 'Accepted']
['s509626900', 's283882780']
[25172.0, 25168.0]
[96.0, 189.0]
[223, 166]
p02779
u262750042
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['hoge = int(input())\nn = list(map(int,input().split()))\nans = "YESt"\ncount = 0\n\nfor i in n :\n \n for j in n :\n if i == j :\n count += 1\n \n if count >= 2 :\n ans = "NO"\n \n count = 0\n\nprint(ans)', 'hoge = int(input())\nn = list(map(int,input().split()))\nans = "YESt"\ncount = 0\n\nfor i in n :\n for j in n :\n if i == j :\n count += 1\n if count >= 2 :\n ans = "NO"\n break\n count = 0\n\nprint(ans)', 'hoge = int(input())\nn = list(map(int,input().split()))\n\nans = "YES" if len(n) == len(set(n)) else "NO"\nprint(ans)']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s594671465', 's975950306', 's362102065']
[26808.0, 26808.0, 25172.0]
[2104.0, 2104.0, 85.0]
[231, 230, 113]
p02779
u263660661
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = [int(i) for i in input().split()]\n\na.sort()\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print("No")\n exit()\nprint("Yes")\n', 'n = int(input())\na = [int(i) for i in input().split()]\n\na = sorted(a)\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print("No")\n exit()\nprint("Yes")\n', 'n = int(input())\na = [int(i) for i in input().split()]\na = sorted(a)\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print("NO")\n exit()\nprint("YES")\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s590464491', 's803809178', 's122949369']
[25172.0, 25936.0, 25172.0]
[186.0, 189.0, 214.0]
[158, 163, 162]
p02779
u265118937
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = list(map(int, input().split()))\ndef has_duplicates2(seq):\n seen = []\n unique_list = [x for x in seq if x not in seen and not seen.append(x)]\n return len(seq) != len(unique_list)\nprint("YES" if has_duplicates2(a) else "NO")', 'n = int(input())\na = list(map(int, input().split()))\nb = set(a)\na.sort()\nif len(a) != len(b):\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s761504602', 's009707965']
[30904.0, 31216.0]
[2206.0, 130.0]
[252, 132]
p02779
u266569040
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import math\nfrom functools import reduce\n\nN = int(input())\nA = list(map(int, input().split()))\nprint(A)\ndef gcd_list(numbers):\n return reduce(math.gcd, numbers)\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\n\nif gcd_list(A)==1 and has_duplicates(A) == False:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA = list(map(int, input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\n\nif has_duplicates(A) == False:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s476697966', 's692194154']
[26196.0, 25936.0]
[122.0, 86.0]
[316, 187]
p02779
u269724549
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\ns=list(map(int,input().split()))\nf=sortedlist(s)\nd=set(s)\nif(len(s)==len(d)):\n print("YES")\nelse:\n print("NO")\n', 'n=int(input())\ns=list(map(int,input().split()))\nf=sorted(list(s))\nd=set(s)\nif(len(s)==len(d)):\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Accepted']
['s799374631', 's603743763']
[26808.0, 29872.0]
[67.0, 175.0]
[128, 130]
p02779
u270825463
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input()) \nN = list(map(int,input().split()))\nN.sort()\nfor i in range(0,n-1):\n if N[i] == N[i+1]:\n print('No')\n break\nelse:\n print('Yes')", "n = int(input()) \nN = list(map(int,input().split()))\nN.sort()\nfor i in range(0,n-1):\n if N[i] == N[i+1]:\n print('No')\n break\nelse:\n print('Yes')\n", "n = int(input()) \nN = list(map(int,input().split()))\nN.sort()\nfor i in range(0,n-1):\n if N[i] == N[i+1]:\n print('NO')\n break\nelse:\n print('YES')\n"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s118190402', 's481747933', 's744914990']
[26808.0, 26804.0, 26808.0]
[182.0, 180.0, 181.0]
[164, 165, 165]
p02779
u273010357
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N, K = map(int, input().split())\np = list(map(int, input().split()))\n\nS = [0]*(N+1)\nfor i in range(N):\n S[i+1] = S[i] + (1+p[i])/2\n\nans = 0\nfor i in range(N-K+1):\n diff = S[i+K] - S[i]\n ans = max(ans, diff)\nprint(ans)', "N = int(input())\na = list(map(int, input().split()))\nif len(a)==len(set(a)):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s361463406', 's667161364']
[3064.0, 26808.0]
[17.0, 85.0]
[220, 115]
p02779
u273262677
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['from collections import Counter\nimport sys\nn = int(input())\nl = sys.stdin.read().split()\nc = counter(l)\nm = max(c.values())\n\nif(m==1):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\nflag = 1\nl = []\nfor i in range(n):\n a = int(input())\n if a in l:\n flag = 0\n break\n else:\n l.append(a)\nif(flag==1):\n print("YES")\nelse:\n print("NO")', 'from collections import Counter\nimport sys\nn = int(input())\nl = sys.stdin.read().split()\nc = counter(l)\nm = max(c.value())\n\nif(m==1):\n print("YES")\nelse:\n print("NO")', 'from collections import Counter\nimport sys\nn = int(input())\nl = sys.stdin.read().split()\nc = Counter(l)\nm = max(c.values())\n\nif(m==1):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s090648331', 's402612642', 's722742825', 's605420105']
[19452.0, 7004.0, 19452.0, 39028.0]
[41.0, 29.0, 38.0, 89.0]
[173, 200, 172, 173]
p02779
u273928723
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['\n#include <algorithm>\n#include <cstdio>\n\n#include <math.h>\n#include <iomanip>\n#include <bitset>\n#include <string>\n#include <cstring>\n#include <stdlib.h>\n#include <utility>\n#include <set>\n#include <map>\nusing namespace std;\n//cout << << endl;\ntypedef long long int ll;\ntypedef long double ld;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconst ll INF = 1LL << 60;\n#define MOD 1000000007\n#define MAX_V 100010\n#define MAX_N 1000100\nbool x[MAX_N];\nll num[MAX_N];\nll fibl[MAX_N]={0};\n \nll fib(ll a){\n if (fibl[a]!=0)return fibl[a];\n if (a==0){\n return 0;\n }else if (a==1){\n return 1;\n }\n return fibl[a]=fib(a-1)+fib(a-2);\n}\n \nll eratosthenes(ll n) {\n int p = 0;\n for (ll i=0; i<=n; ++i) x[i] = true;\n x[0] = x[1] = false;\n for(int i=2; i<=n; ++i) {\n if(x[i]) {\n p++;\n for(int j=2*i; j<=n; j+=i) x[j] = false;\n }\n \n num[i] = p;\n }\n return p;\n}\nbool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){\n return firstElof.first < secondElof.first;\n}\n \nll gcd(ll a,ll b){\n if (a%b==0)return(b);\n else return(gcd(b,a%b));\n}\n \nll junnretu(ll n){\n ll ans=1;\n for (ll i=1;i<=n;i++){\n ans*=i;\n }\n return ans;\n}\n \nmap<ll,ll> prime_factor(ll n){\n map<ll,ll> mp;\n for(ll i=2; i*i<=n; i++){\n while(n % i == 0){\n mp[i]++;\n n /= i;\n }\n }\n if(n != 1) mp[n] = 1;\n return mp;\n}\n \nll keta(ll N){\n int tmp{};\n while( N > 0 ){\n tmp += ( N % 10 );\n N /= 10;\n }\n N = tmp;\n return N;\n}\n\nint main(){\n ll s;\n cin >> s;\n ll x[s];\n for (ll i=0;i<s;i++){\n cin >> x[i];\n for (ll j=0;j<=i;j++){\n if (x[i]==x[j]){\n cout << "NO" << endl;\n return 0;\n }\n }\n }\n cout << "YES" << endl;\n return 0;\n}\n', 'import collections\na=input()\na=int(a)\nb=input().split()\nc = collections.Counter(b)\n \nif (len(c)==a):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s748864188', 's915954805']
[2940.0, 39116.0]
[17.0, 83.0]
[2063, 142]
p02779
u274635633
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n=int(input())\na=sorted(list(map(int,input().split())))\nans='YES'\nfor i in range(n):\n if a[i]==a[i+1]:\n ans='NO'\n if ans=='NO':\n break\nprint(ans)", "n=int(input())\na=sorted(list(map(int,input().split())))\nans='YES'\nfor i in range(n-1):\n if a[i]==a[i+1]:\n ans='NO'\n if ans=='NO':\n break\nprint(ans)"]
['Runtime Error', 'Accepted']
['s622317463', 's522226110']
[26808.0, 25172.0]
[192.0, 184.0]
[153, 155]
p02779
u275392848
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=input()\nl=list(map(int,input().split()))\nd={}\nflag=0\n\nfor i in range(n):\n if l[i] in d:\n flag=1\n break\n \nif flag==0:\n print("YES")\nelse:\n print("NO")', 'n=int(input())\nl=list(map(int,input().split()))\nd={}\nflag=0\n\nfor i in range(n):\n if l[i] in d:\n flag=1\n break\n else:\n d[l[i]]=1\n \nif flag==0:\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Accepted']
['s913061224', 's764296702']
[25932.0, 32948.0]
[67.0, 131.0]
[163, 191]
p02779
u280853184
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N=int(input())\nA=list(map(int,input().split()))\ntmp=set(A)\ntmp=list(tmp)\n\n\nif len(tmp)==len(A):\n print ("Yes")\nelse:\n print ("No")', 'N=int(input())\nA=list(map(int,input().split()))\ntmp=set(A)\ntmp=list(tmp)\n\n\nif len(tmp)==len(A):\n print ("YES")\nelse:\n print ("NO")']
['Wrong Answer', 'Accepted']
['s865748706', 's315782388']
[26804.0, 26808.0]
[95.0, 93.0]
[132, 132]
p02779
u283719735
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = list(map(int, input().split(\' \')))\nbucket = [0]*1000000001\n\ndistinct = True\nfor i in a:\n if bucket[i] != 0:\n distinct = False\n break\n bucket[i] += 1\n \nif distinct:\n print("Yes")\nelse:\n print(\'No\')', 'n = int(input())\na = list(map(int, input().split()))\nm = {}\n\ndistinct = True\nfor i in a:\n if i in m:\n distinct = False\n break\n m[i] = 1\n \nif distinct:\n print("YES")\nelse:\n print(\'NO\')']
['Runtime Error', 'Accepted']
['s472515415', 's951936956']
[26804.0, 32848.0]
[67.0, 113.0]
[246, 212]
p02779
u284363684
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['from collections import Counter\n\n# input\nN = int(input())\nA = list(map(int, input().split()))\n\nif [1 ** N] == Counter(A).values():\n print("Yes")\nelse:\n print("No")', '# input\nN = int(input())\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print("Yes")\nelse:\n print("No")', 'from collections import Counter\n\n# input\nN = int(input())\nA = list(map(int, input().split()))\n\nif [1 ** N] == Counter(A).values():\n print("YES")\nelse:\n print("NO")', 'from collections import Counter\n\n# input\nN = int(input())\nA = list(map(int, input().split()))\n\nif [1] * N == list(Counter(A).values()):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s445305102', 's514297198', 's674813792', 's587084004']
[33996.0, 26808.0, 33996.0, 35024.0]
[103.0, 84.0, 96.0, 103.0]
[169, 126, 169, 174]
p02779
u285265363
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = list(map(int, input().split()))\na = sorted(a)\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print("No")\n exit()\nprint(("Yes"))', 'n = int(input())\na = list(map(int, input().split()))\na = sorted(a)\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print("NO")\n exit()\nprint("YES")']
['Wrong Answer', 'Accepted']
['s778927651', 's304472289']
[31084.0, 31092.0]
[134.0, 140.0]
[160, 158]
p02779
u288001809
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['cnt = int(input())\ntar_array = input().split()\ntar_array.sort()\n\nout = "YES"\ntar = ""\nprint(tar_array)\nfor i in range(cnt):\n if tar == tar_array[i]:\n out = "NO"\n break\n tar = tar_array[i]\n\nprint(out)', 'cnt = int(input())\ntar_array = input().split()\ntar_array.sort()\n\nout = "YES"\ntar = ""\nfor i in range(cnt):\n if tar == tar_array[i]:\n out = "NO"\n break\n tar = tar_array[i]\n\nprint(out)']
['Wrong Answer', 'Accepted']
['s123085450', 's681698331']
[24788.0, 19924.0]
[270.0, 203.0]
[207, 190]
p02779
u289288647
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nval = list(input().split())\n \nif len(val) == len(set(val)):\n print('Yes')\nelse:\n print('No')\n", "N = int(input())\nval = list(input().split())\n \nif len(val) == len(set(val)):\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s900982908', 's216204254']
[32692.0, 32688.0]
[63.0, 68.0]
[130, 130]
p02779
u293436958
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['input()\n\na=list(map(int, input().split())) \n\nif int(len([i for i in a if a.count(i) >= 2])) !=0:\n print("No")\nelse :\n print("Yes")', 'input()\n\na=list(map(int, input().split())) \n\nA=set(a)\nif len(A)!=len(a):\n print("NO")\nelse :\n print("YES")']
['Wrong Answer', 'Accepted']
['s714570778', 's449509457']
[26808.0, 26812.0]
[2104.0, 92.0]
[183, 159]
p02779
u294385082
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int,input().split()))\nse = set(n)\n\nif len(se) == len(a):\n print('YES')\nelse:\n print('NO')", "n = int(input())\na = list(map(int,input().split()))\nse = set(a)\n \nif len(se) == len(a):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s016643361', 's717662010']
[25168.0, 26808.0]
[67.0, 92.0]
[121, 122]
p02779
u296101474
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\nlst = list(map(int, input().split()))\nori_lng = len(lst)\naft_lng = len(set(lst))\nif ori_lng == aft_lng:\n print('Yes')\nelse:\n print('No')", "n = int(input())\nlst = list(map(int, input().split()))\nori_lng = len(lst)\naft_lng = len(set(lst))\nif ori_lng == aft_lng:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s451707192', 's120576484']
[26808.0, 26804.0]
[84.0, 84.0]
[159, 160]
p02779
u304058693
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = list(map(int, input().split()))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i] == a[j]:\n print("No")\n exit()\nprint("Yes")\n', 'n = int(input())\na = list(map(int, input().split()))\nan = set(a)\n\nif len(a) == len(an):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s239487813', 's810673922']
[31080.0, 31152.0]
[2206.0, 95.0]
[184, 127]
p02779
u306142032
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\ns = set(input().split())\nif n == s:\n print('YES')\nelse:\n print('NO')", "n = int(input())\ns = len(set(input().split()))\nif n == s:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s403467985', 's394973293']
[31156.0, 30156.0]
[70.0, 66.0]
[87, 92]
p02779
u306718299
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["# -*- coding: utf-8 -*-\nimport numpy as np\n\nn = int(input())\na = np.array(input().split(), dtype='int')\n\nans = ''\ncount_all = 0\n\nfor j in range(n):\n num = a[j]\n if len(a[a == num]) != 1:\n ans == 'NO'\n break\n a = np.delete(a, j)\n\nif ans == 'NO':\n print(ans)\nelse:\n print('YES')", "# -*- coding: utf-8 -*-\nimport numpy as np\n\nn = int(input())\na = np.array(input().split(), dtype='int')\n\na_sort = np.sort(a)\nans = ''\n\nfor i in range(n - 1):\n if a_sort[i] == a_sort[i + 1]:\n ans = 'NO'\n break\n \nif ans == 'NO':\n print(ans)\nelse:\n print('YES')"]
['Runtime Error', 'Accepted']
['s803265549', 's215699944']
[35660.0, 35740.0]
[2109.0, 294.0]
[305, 284]
p02779
u307516601
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int, input().split()))\n\nsa = set(a)\nif len(sa) == len(a):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\n\nsa = set(a)\nif len(sa) == n:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s322980838', 's991477496']
[25172.0, 25172.0]
[93.0, 93.0]
[126, 121]
p02779
u308486530
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int, input().split()))\n\nans = 'YES'\n\nfor i in range(n):\n for j in range(n-i):\n if a[i] == a[j]:\n ans = 'NO'\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nans = 'YES'\n\nfor i in range(n):\n for j in range(i, n-i):\n if a[i] == a[j]:\n ans = 'NO'\n break\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 'YES'\nfor i in range(n):\n for j in range(j, n-i):\n if a[i] == a[j]:\n ans = 'NO'\n break\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 'YES'\nfor i in range(n-1):\n if a[i] == a[i+1]:\n ans = 'NO'\n break\n\nprint(ans)"]
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s145672320', 's148675996', 's671419018', 's678100479']
[26808.0, 26812.0, 26808.0, 25936.0]
[2104.0, 154.0, 67.0, 177.0]
[170, 191, 189, 162]
p02779
u309120194
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nA = list(map(int, input().split()))\n\nif N == len(set(A)): print('Yes')\nelse: print('No')", "N = int(input())\nA = list(map(int, input().split()))\n \n\n\n\n\n\n\nA = sorted(A)\n\nans = 'NO'\nfor i in range(N-1):\n if A[i] == A[i+1]:\n ans = 'YES'\n break\n \nprint(ans)", "N = int(input())\nA = list(map(int, input().split()))\n \nif N == len(set(A)): print('Yes')\nelse: print('No')", "N = int(input())\nA = list(map(int, input.split()))\n\nif N == len(set(A)): print('Yes')\nelse: print('No')\n", "N = int(input())\nA = list(map(int, input().split()))\n \n\n\n\n \n\n\nA = sorted(A)\n \nans = 'YES'\nfor i in range(N-1):\n if A[i] == A[i+1]:\n ans = 'NO'\n break\n \nprint(ans)"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s326987497', 's724759497', 's741281790', 's805516563', 's293086752']
[31092.0, 31000.0, 31184.0, 9160.0, 30880.0]
[93.0, 136.0, 88.0, 26.0, 131.0]
[105, 571, 106, 104, 573]
p02779
u310855433
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import sys\nN = int(input())\nAn = list(map(int,input().split()))\nAn.sort()\nfor i in range(N-1):\n if An[i] == An[i+1]:\n print("NO")\n sys.exit()\nprint("Yes")', 'import sys\nN = int(input())\nAn = sorted(list(map(int,input().split())))\n\nfor i in range(N-1):\n if An[i] == An[i+1]:\n print("NO")\n sys.exit()\nprint("YES")']
['Wrong Answer', 'Accepted']
['s548805430', 's960219923']
[25932.0, 26808.0]
[182.0, 179.0]
[161, 160]
p02779
u311113280
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N=int(input())\nA=set(map(int,input().split()))\nprint('YNeos'[N!=len(A)::2])", "N=int(input())\nA=set(map(int,input().split()))\nprint('YNEOS'[N!=len(A)::2])"]
['Wrong Answer', 'Accepted']
['s816865875', 's699298783']
[36656.0, 36660.0]
[96.0, 94.0]
[75, 75]
p02779
u311488536
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["def main():\n N = int(input())\n List = list(map(int,input().split()))\n Set = set()\n for i in List:\n if i in Set:\n \tprint('No')\n \treturn\n Set.add(i)\n print('Yes')\n return\nmain()", "def main():\n N = int(input())\n List = list(map(int,input(),split()))\n Set = set()\n for i in List:\n if i in Set:\n print('No')\n return\n Set.add(i)\n\tprint('Yes')\nmain()", "def main():\n N = int(input())\n List = list(map(int,input().split()))\n Set = set()\n for i in List:\n if i in Set:\n \tprint('NO')\n \treturn\n Set.add(i)\n print('YES')\n return\nmain()"]
['Wrong Answer', 'Runtime Error', 'Accepted']
['s091457871', 's204875816', 's732399337']
[31048.0, 9008.0, 30868.0]
[98.0, 22.0, 102.0]
[221, 201, 221]
p02779
u314397652
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['input()\nwords = input().split(" ")\nfor i, w in enumerate(words):\n for ii, ww in enumerate(words):\n if i != ii and w == ww:\n print("YES")\n exit()\nprint("NO")', 'len1 = input()\nlen2 = set(input().split(" "))\nif len1 == len2:\n print("YES")\nelse:\n print("NO")\n', 'len1 = input()\nlen2 = len(set(input().split(" ")))\nif len1 == len2:\n print("YES")\nelse:\n print("NO")\n', 'len1 = int(input())\nlen2 = set(input().split(" "))\nif len1 == len2:\n print("YES")\nelse:\n print("NO")\n', 'input()\nwords = input().split(" ")\nfor w in words:\n if words.count(w) >= 2:\n print("YES")\n exit()\nprint("NO")', 'len1 = int(input())\nlen2 = len(set(input().split(" ")))\nif len1 == len2:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s335835910', 's625559648', 's752550333', 's897459530', 's954014880', 's329995556']
[19284.0, 31152.0, 31156.0, 31152.0, 20196.0, 30160.0]
[2104.0, 74.0, 62.0, 74.0, 2104.0, 62.0]
[170, 98, 103, 103, 116, 108]
p02779
u315706001
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["def resolve():\n N = int(input())\n A = list(map(int,input().split()))\n c = collections.Counter(A)\n C = max(c.values())\n if C > 1 :\n print('NO')\n else:\n print('YES')\nresolve()", "import collections\ndef resolve():\n N = int(input())\n A = list(map(int,input().split()))\n c = collections.Counter(A)\n C = max(c.values())\n if C > 1 :\n print('NO')\n else:\n print('YES')\nresolve()"]
['Runtime Error', 'Accepted']
['s804856087', 's806829327']
[25168.0, 33996.0]
[67.0, 123.0]
[205, 225]
p02779
u318127926
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int, input().split()))\n\nb = set(a)\nif len(a)==len(b):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\n\nb = set(a)\nif len(a)==len(b):\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s025233729', 's975237890']
[26808.0, 26804.0]
[88.0, 93.0]
[122, 123]
p02779
u319345083
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na_list = list(map(int, input().split()))\n\nif len(a_list) == len(set(a_list)):\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\na_list = list(map(int, input().split()))\n\nif len(a_list) == len(set(a_list)):\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s878152457', 's453502533']
[26808.0, 25172.0]
[84.0, 92.0]
[134, 134]
p02779
u328067859
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = input().split()\nc=list(map(int, input().split()))\n\n\nif(len(c) != len(set(c))):\n print("No")\nelse:\n print("Yes")\n ', 'N = input().split()\nc = list(map(int, input().split()))\n\nif(len(c) != len(set(c))):\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s502358947', 's073457363']
[26808.0, 26808.0]
[84.0, 84.0]
[126, 122]
p02779
u333139319
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['[n,k] = [int(i) for i in input().split()]\np = [(int(i)+1)/2 for i in input().split()]\n\na = []\n#print(a)\nans = -1\nruiseki = []\nfor i in range(n-k+1):\n ruiseki.append(sum(p[i:i+k]))\nprint(max(ruiseki))\n', 'n = int(input())\na = [int(i) for i in input().split()]\ndic = {}\nfor i in range(n):\n\ttry:\n\t\tdic[a[i]] += 1\n\texcept:\n\t\tdic[a[i]] = 1\nif max(dic.values()) > 1:\n\tprint("Yes")\nelse:\n \tprint("No")\n', 'n = int(input())\na = [int(i) for i in input().split()]\ndic = {}\nfor i in range(n):\n\ttry:\n\t\tdic[a[i]] += 1\n\texcept:\n\t\tdic[a[i]] = 1\nif max(dic.values()) > 1:\n\tprint("No")\nelse:\n \tprint("Yes")\n', 'n = int(input())\na = [int(i) for i in input().split()]\ndic = {}\nfor i in range(n):\n\ttry:\n\t\tdic[a[i]] += 1\n\texcept:\n\t\tdic[a[i]] = 1\nif max(dic.values) > 1:\n\tprint("Yes")\nelse:\n \tprint("No")', 'n = int(input())\na = [int(i) for i in input().split()]\ndic = {}\nfor i in range(n):\n\ttry:\n\t\tdic[a[i]] += 1\n\texcept:\n\t\tdic[a[i]] = 1\nif max(dic.values()) > 1:\n\tprint("NO")\nelse:\n \tprint("YES")\n']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s102720405', 's510579431', 's597326521', 's681994806', 's239316692']
[3060.0, 33000.0, 33612.0, 33608.0, 33612.0]
[18.0, 198.0, 191.0, 187.0, 186.0]
[203, 192, 192, 189, 192]
p02779
u333700164
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\na=list(map(int,input().split()))\nb=[]\nflag=True\nfor i in range(n):\n if a[i] in b:\n flag=False\n break\n else:\n b.append(a[i])\nif flag:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\na=list(map(int,input().split()))\na=set(a)\nif len(set(a))==n:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s247567423', 's146829410']
[30968.0, 35212.0]
[2206.0, 104.0]
[193, 110]
p02779
u334365640
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\ns = set(map(int, input().split()))\nprint("Yes" if len(s) == n else "No")', 'n = int(input())\ns = set(map(int, input().split()))\nprint("YES" if len(s) == n else "NO")']
['Wrong Answer', 'Accepted']
['s937171822', 's420470372']
[36660.0, 36660.0]
[101.0, 90.0]
[89, 89]
p02779
u334703235
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N=int(input())\nli = list(map(int,input().split()))\t\nnum = {}\nfor l in li:\n print(num)\n if str(l) not in num :\n num[l] = 1\n else:\n print("NO")\n break\nelse:\n print("YES")\n\n', 'N=int(input())\nli = list(map(int,input().split()))\t\nnum = {}\nfor l in li:\n if str(l) in num != True:\n num[l] = 1\n else:\n print("NO")\n break\nelse:\n print("YES")\n\n\n\n', 'N=int(input())\nli = list(map(int,input().split()))\t\nnum = {}\nfor l in li:\n if str(l) not in num :\n num[str(l)] = 1\n elif num[str(l)]==1:\n print("NO")\n break\nelse:\n print("YES")\n']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s804643016', 's828732870', 's209654852']
[145768.0, 26808.0, 43432.0]
[1990.0, 68.0, 226.0]
[204, 193, 207]
p02779
u336564899
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = int(input())\nA = list(map(int,input().split()))\n\nimport collections\ncounter = collections.Counter(A)\n\nfor i in list(counter.values()):\n if not i == 1:\n print("No")\n exit()\nelse:\n print("Yes")\n', 'N = int(input())\nA = list(map(int,input().split()))\n\nimport collections\ncounter = collections.Counter(A)\n\nfor i in list(counter.values()):\n if not i == 1:\n print("No")\n exit()\nprint("Yes")\n', 'N = int(input())\nA = list(map(int,input().split()))\n\nimport collections\ncounter = collections.Counter(A)\n\nfor i in list(counter.values()):\n if not i == 1:\n print("NO")\n exit()\nprint("YES")\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s180759954', 's741645786', 's939243879']
[32976.0, 33076.0, 33072.0]
[120.0, 121.0, 119.0]
[216, 206, 206]
p02779
u340781303
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n=int(input())\na=list(map(int, input().split()))\nprint('Yes' if len(set(a))==n else 'No')", "n=int(input())\na=list(map(int, input().split()))\nprint('YES' if len(set(a))==n else 'NO')"]
['Wrong Answer', 'Accepted']
['s564267502', 's313489584']
[31008.0, 31152.0]
[85.0, 94.0]
[89, 89]
p02779
u343523553
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = list(map(int,input().split()))\nb = set(a)\nif b == a:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na = input().split()\nb = set(a)\nif len(a) == len(b):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s824781596', 's693554724']
[26804.0, 30408.0]
[89.0, 75.0]
[112, 108]
p02779
u343977188
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N=int(input())\nA=list(map(int,input().split()))\n\na=0\ni=-1\nwhile True:\n i+=1\n if A.count(A[i])>=2:\n print("NO")\n a=1\n break\n else:\n A.remove(A[i])\n i-=1\n \nif a==0:\n print(A)\n print("YES")', 'N=int(input())\nA=list(map(int,input().split()))\n\nif len(A) != len(set(A)):\n print("YES")\nelse:\n print("NO")', 'N=int(input())\nA=list(map(int,input().split()))\n\na=0\nfor i in A:\n if A.count(i)>=2:\n print("No")\n a=1\n break\n\nif a==0:\n print("Yes")', 'N=int(input())\nA=list(map(int,input().split()))\n\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s268160617', 's423652010', 's876338071', 's462376847']
[25172.0, 25172.0, 25932.0, 26800.0]
[2104.0, 82.0, 2104.0, 83.0]
[209, 109, 143, 109]
p02779
u344959959
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['m = int(input())\nn = list(map(int,input().split))\nprint("YES" if len(set(n)) == m else "NO")', 'm = int(input())\nn = list(map(int,input().split()))\nprint("YES" if len(set(n)) == m else "NO")']
['Runtime Error', 'Accepted']
['s740645733', 's856420097']
[12952.0, 31172.0]
[29.0, 92.0]
[92, 94]
p02779
u347452770
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\n\na = list(map(int, input().split()))\nngcounter = 0\nfor i in range(n):\n if a[i] in a :\n ngcounter += 1\n break\n \nif ngcounter > 0:\n print("No")\nelse:\n print("Yes")', 'n = int(input())\n\na = list(map(int, input().split()))\nngcounter = 0\nfor i in range(n):\n if a[i] in a :\n ngcounter += 1\n break\n \nif ngcounter > 0:\n print("NO")\nelse:\n print("YES")', 'n = int(input())\n\na = list(map(int, input().split()))\nngcounter = 0\na.sort()\nfor i in range(n-1):\n if a[i] == a[i+1]:\n ngcounter += 1\n break\n \nif ngcounter > 0:\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s617141893', 's692574380', 's158635126']
[26804.0, 26808.0, 26804.0]
[67.0, 67.0, 183.0]
[190, 190, 203]
p02779
u347600233
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n, k = map(int, input().split())\np = [int(i) for i in input().split()]\nmaxp = 0\nfor i in range(n - k + 1):\n sump = sum(p[i: i + k])\n if maxp < sump:\n maxp = sump\n j = i\nprint((maxp + k) / 2)', "n = int(input())\na = set(map(int, input().split()))\nprint('YES' if len(a) == n else 'NO')"]
['Runtime Error', 'Accepted']
['s239554249', 's266453109']
[3060.0, 40904.0]
[17.0, 102.0]
[210, 89]
p02779
u349444371
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N=int(input())\nA=input().split()\na=[]\nfor i in range(len(A)):\n x=int(A[i])\n a.append(x)\nfor i in range(N):\n if a[i] in a[i+1:]:\n print("NO")\n else:\n print("YES")', 'N=int(input())\nA=input().split()\na=[]\nfor i in range(len(A)):\n x=int(A[i])\n a.append(x)\nfor i in range(N):\n if a[i] in A[i+1:]:\n print("NO")\n else:\n print("YES")', 'import numpy as np\nN=int(input())\na=list(map(int, input().split()))\nA=np.array(a)\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\ns=has_duplicates(A)\nif s==False:\n print("YES")\nelif s==True:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s574475626', 's925122799', 's992787681']
[28928.0, 29632.0, 39816.0]
[2108.0, 2105.0, 265.0]
[171, 171, 220]
p02779
u349734031
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['i=int(input())\nx=[]\nfor i in range(0,i):\n a=int(input())\n if a in x:\n c=0\n break\n else:\n c=1\nif(c==0):\n print("NO")\nelse: \n print("YES")', 'i=int(input())\nx=[int(x) for x in input().split()]\ny=set(x)\nif(len(y)==len(x)):\n print("YES")\nelse:\n print("NO") ']
['Runtime Error', 'Accepted']
['s389548324', 's253692318']
[8640.0, 25172.0]
[29.0, 96.0]
[150, 122]
p02779
u349888092
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = int(input())\nL = list(map(int,input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif(has_duplicates(L) == False):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nL = list(map(int,input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif(has_duplicates(L) == False):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s730598361', 's728589488']
[26808.0, 26804.0]
[85.0, 88.0]
[186, 186]
p02779
u350093546
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n=int(input())\na=list(map(int,input().split()))\nif a.sort()==set(a):\n print('YES')\nelse:\n print('NO')", "n=int(input())\na=list(map(int,input().split()))\nif len(a)==len(set(a)):\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s502854337', 's019316656']
[26808.0, 25936.0]
[170.0, 85.0]
[103, 107]
p02779
u350578302
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nA = input().split()\nflag = 1\nA.sort()\n\nfor i in range(N):\n\tif A[i] == A[i+1]:\n\t\tflag = 0\n\t\tbreak\nif flag==0:\n\tprint('NO')\nelif flag==1:\n\tprint('YES')\n\n", "N = int(input())\nA = input().split()\nflag = 1\nA.sort()\n\nfor i in range(N-1):\n\tif A[i] == A[i+1]:\n\t\tflag = 0\n\t\tbreak\nif flag==0:\n\tprint('NO')\nelif flag==1:\n\tprint('YES')\n\n"]
['Runtime Error', 'Accepted']
['s970045021', 's950482645']
[19220.0, 19160.0]
[205.0, 208.0]
[168, 170]
p02779
u350836088
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int,input().split()))\nif(len(a) == len(set(a))):\n print('Yes')\nelse:\n print('No')\n\n\n", "n = int(input())\na = list(map(int,input().split()))\nif(len(a) == len(set(a))):\n print('YES')\nelse:\n print('NO')\n\n\n\n"]
['Wrong Answer', 'Accepted']
['s558215069', 's027904303']
[25172.0, 26808.0]
[84.0, 83.0]
[120, 121]
p02779
u353919145
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nA = input().split()\nfor i in range (N) :\n A[i] = int(A[i])\n\nA = sorted(A)\nfl = True\n\nfor i in range (1 , N) :\n if (A[i - 1] == A[i]) :\n fl = False\n break\n\nprint ('Yes' if fl else 'No')\n", 'n=int(input())\na=[int(v) for v in input().split()]\ncheck=1\na.sort()\nfor i in range (0,n-1):\n if a[i]==a[i+1]:\n check=0\n break\nif check==0:\n print("NO")\nelse:\n print("YES")\n']
['Wrong Answer', 'Accepted']
['s695277913', 's119752115']
[19924.0, 31076.0]
[223.0, 140.0]
[222, 195]
p02779
u355649707
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["def main():\n n = int(input())\n a_list = sorted(list(map(int, input().split())))\n\n for i in range(n-1):\n if a_list[i] != a_list[i+1]:\n print('NO')\n break\n else:\n print('YES')\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n n = int(input())\n a_list = list(map(int, input().split()))\n\n print('YES' if len(a_list) == len(set(a_list)) else 'NO')\n\n\nif __name__ == '__main__':\n main()\n"]
['Wrong Answer', 'Accepted']
['s735555216', 's585656891']
[26808.0, 26808.0]
[145.0, 82.0]
[262, 181]
p02779
u357230322
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\na=list(map(int,input().split()))\nx=0\na.sort()\nfor i in range(n-1):\n if a[i]==a[i+1]:\n x+=1\nif x=0:\n print("YES")\nelse:\n print("NO")\n', 'n=int(input())\na=list(map(int,input().split()))\nx=0\na.sort()\nfor i in range(n-1):\n if a[i]=a[i+1]:\n x+=1\nif x=0:\n print("YES")\nelse:\n print("NO")', 'n=int(input())\na=list(map(int,input().split()))\nx=0\na.sort()\nfor i in range(n-1):\n if a[i]==a[i+1]:\n x+=1\nif x==0:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s662726406', 's773914098', 's098661388']
[2940.0, 2940.0, 25932.0]
[17.0, 17.0, 183.0]
[153, 151, 153]
p02779
u368579103
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['b = input().split()\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(b) == 1:\n print("YES")\nelif has_duplicates(b) == 0:\n print("NO")', "n = int(input())\nlis = list(map(int, input().split()))\ndic = {}\nfor i in lis:\n dic[i] = dic.get(i, 0) + 1\nfor j in dic.values():\n if j != 1:\n print('NO')\n break\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s942225765', 's356222889']
[3060.0, 33612.0]
[17.0, 135.0]
[168, 203]
p02779
u370217787
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import numpy as np\n\nN = int(input())\nx = np.array(list(map(int, input().split())))\n\nans = 0\nfor i in range(N):\n\tif x[i] in x[0:i]:\n\t\tans = 1\n\t\tbreak\nif ans == 1:\n\tprint("No")\nelse:\n\tprint("Yes")\n\n\n', 'import numpy as np\n\nN = int(input())\nx = np.array(list(map(int, input().split())))\nx = np.sort(x)\n\nans = 0\nfor i in range(1,N):\n\tif x[i] == x[i-1]:\n\t\tans = 1\n\nif ans == 1:\n\tprint("NO")\nelse:\n\tprint("YES")']
['Wrong Answer', 'Accepted']
['s929951086', 's619644077']
[34204.0, 34188.0]
[2109.0, 311.0]
[197, 204]
p02779
u370721525
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = input()\nwords = list(input().split())\n\nif len(words) == N:\n print('YES')\nelse:\n print('NO')", "N = int(input())\nnumbers = set(map(int, input().split()))\n\nif len(numbers) == N:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s258387554', 's346877576']
[19160.0, 36660.0]
[39.0, 93.0]
[97, 116]
p02779
u371409687
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n=int(input())\nl1=list(map(int,input().split()))\nl2=list(set(l1))\nL2=len(l2)\nprint('Yes' if n==L2 else 'No')", "n=int(input())\nl1=list(map(int,input().split()))\nl2=list(set(l1))\nL2=len(l2)\nprint('YES' if n==L2 else 'NO')"]
['Wrong Answer', 'Accepted']
['s871637075', 's920781183']
[26800.0, 26804.0]
[92.0, 97.0]
[108, 108]
p02779
u372550522
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\nl = [int(i) for i in input().split()]\n\nl.sort()\n\nprint('Yes' if all([l[i]!=l[i+1] for i in range(n-1)]) else 'No')", "n = int(input())\nl = [int(i) for i in input().split()]\n\nl.sort()\n\nprint('YES' if all([l[i]!=l[i+1] for i in range(n-1)]) else 'NO')"]
['Wrong Answer', 'Accepted']
['s934991086', 's530611418']
[25172.0, 25172.0]
[182.0, 187.0]
[131, 131]
p02779
u374372942
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['S=int(input())\nT = input().split()\nU = [int(T(i)) for i in S]\nU.sort\nr = 0\n\nfor i in S-1:\n if(T[i] == T[i+1]):\n r++\n \nif(r==0):\n print("YES")\nelse:\n print("NO")', 'S=int(input())\nT = input().split()\nU = [int(i) for i in T]\nU.sort()\nr = 0\n\nfor i in range(S-1):\n if(U[i] == U[i+1]):\n r+=1\n \nif(r==0):\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Accepted']
['s923207021', 's104764183']
[2940.0, 26704.0]
[17.0, 201.0]
[169, 177]
p02779
u374784428
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n =int(input())\na = list(map(int,input().split()))\t\nl = list()\n\nl = sorted(a)\nanswer = max(x - y for x, y in zip(l, l[1:]))\nif answer == 0:\n print('No')\nelse:\n print('Yes')\n ", "n =int(input())\na = list(map(int,input().split()))\t\nl = list()\n\nl = sorted(a)\nanswer = max(x - y for x, y in zip(l, l[1:]))\nif answer == 0:\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s076532713', 's306131382']
[26808.0, 26804.0]
[181.0, 185.0]
[182, 178]
p02779
u378082660
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\n\nn =int(input())\na =list(map(int, input().split()))\n\nflg = has_duplicates(a)\n\nif flg:\n print('YES')\nelse:\n print('NO')", "def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\n\nn =int(input())\na =list(map(int, input().split()))\n\nflg = has_duplicates(a)\n\nif not flg:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s056499318', 's385866183']
[26808.0, 26808.0]
[86.0, 88.0]
[187, 191]
p02779
u378153116
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["def distinct_or_not(a_list):\n tmp_list = []\n for a in a_list:\n if a not in tmp_list:\n tmp_list.append(a)\n else:\n return 'No'\n return 'Yes'\n\nn = int(input())\na_list = [int(a) for a in input().split()]\n\nprint(distinct_or_not(a_list))", "def distinct_or_not_2(a_list):\n a_list.sort()\n for i in range(len(a_list)-1):\n if a_list[i] == a_list[i+1]:\n return 'NO'\n return 'YES'\n\nn = int(input())\na_list = [int(a) for a in input().split()]\n\nprint(distinct_or_not_2(a_list))"]
['Wrong Answer', 'Accepted']
['s197372077', 's410766325']
[25168.0, 25168.0]
[2105.0, 187.0]
[276, 256]
p02779
u379562612
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import sys\nl= sys.stdin.readline()\ncount = int(l.strip())\nl = sys.stdin.readline()\nnums = list(map(int, l.split()))\ncheck = dict()\nfor n in nums:\n if n in check:\n print("YES")\n \tbreak\n else:\n check[n] = True\nprint("YES")', 'import sys\ndef main():\n l= sys.stdin.readline()\n count = int(l.strip())\n l = sys.stdin.readline()\n nums = list(map(int, l.split()))\n check = dict()\n for n in nums:\n if n in check:\n return "NO"\n \n else:\n check[n] = True\n return "YES"\nif __name__ == "__main__":\n print(main())']
['Runtime Error', 'Accepted']
['s969307496', 's802904256']
[2940.0, 34748.0]
[17.0, 101.0]
[230, 345]
p02779
u381959472
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["import sys\n\nN = int(input())\nAList = list(map(int, input().split()))\nAList.sort()\n\nfor i in range(1, N):\n if AList[i - 1] == AList[i]:\n print('No')\n sys.exit()\n \nprint('Yes')", "import sys\n\nN = int(input())\nAList = list(map(int, input().split()))\nAList.sort()\n\nfor i in range(1, N):\n if AList[i - 1] == AList[i]:\n print('NO')\n sys.exit()\n \nprint('YES')"]
['Wrong Answer', 'Accepted']
['s153494695', 's030984175']
[26808.0, 26808.0]
[177.0, 180.0]
[198, 198]
p02779
u383416302
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["\ndef main():\n n = input()\n an = set(map(int,input().split()))\n \n if n == len(an):\n print('YES')\n else:\n print('NO')\n\nif __name__ == '__main__':\n \tmain()\n\n\n'''\n6\n4 1 3 1 6 2\n'''", "\ndef main():\n n = int(input())\n an = set(map(int,input().split()))\n \n if n == len(an):\n print('YES')\n else:\n print('NO')\n\nif __name__ == '__main__':\n \tmain()\n\n\n'''\n6\n4 1 3 1 6 2\n'''"]
['Wrong Answer', 'Accepted']
['s529608377', 's714680393']
[36660.0, 36660.0]
[87.0, 85.0]
[206, 211]
p02779
u385309449
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int,input().split()))\nb = set(a)\nif len(a) == len(b):\n print('YES')\nelse:\n print('NO')v", "n = int(input())\na = list(map(int,input().split()))\nb = set(a)\nif len(a) == len(b):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s960454595', 's415971145']
[2940.0, 26804.0]
[17.0, 93.0]
[119, 118]
p02779
u388719350
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = int(input())\nA = list(map(int, input().split()))\ns = list(set(A))\nif len(A) == len(s):\n print("Yes")\nelse:\n print("No")\n\n', 'N = int(input())\nA = list(map(int, input().split()))\ns = list(set(A))\nif len(A) == len(s):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s863760820', 's761658816']
[26804.0, 26808.0]
[95.0, 98.0]
[131, 130]
p02779
u390901183
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = int(input())\nA = list(map(int, input().split()))\nA = sorted(A)\n\ndef solution(N, A):\n for i in range(N - 1):\n if A[i] == A[i + 1]:\n return "No"\n return "Yes"\n\nprint(solution(N, A))\n', 'N = int(input())\nA = list(map(int, input().split()))\nA = sorted(A)\n\ndef solution(N, A):\n for i in range(N - 1):\n if A[i] == A[i + 1]:\n return "NO"\n return "YES"\n\nprint(solution(N, A))\n']
['Wrong Answer', 'Accepted']
['s820708798', 's880536894']
[25172.0, 26808.0]
[176.0, 169.0]
[208, 208]
p02779
u391675400
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\nx = list(map(int,input().split()))\ny = len(x)\ny = y - 1\nfor i in range(y):\n for j in range(y):\n if x[i] == x[j]:\n print("NO")\n exit()\nprint("YES")', 'n = int(input())\nx = list(map(int,input().split()))\nx.sort()\n\n\nfor i in range(n-1):\n if x[i] == x[i+1]:\n print("NO")\n exit()\nprint("YES")\n']
['Wrong Answer', 'Accepted']
['s007643385', 's284468289']
[26808.0, 26676.0]
[69.0, 185.0]
[195, 155]
p02779
u392058721
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = list(map(int, input().split()))\nprint("Yes") if len(a) == len(set(a)) else print("No")', 'n = int(input())\na = list(map(int, input().split()))\nprint("YES") if len(a) == len(set(a)) else print("NO")']
['Wrong Answer', 'Accepted']
['s856336199', 's580385545']
[26812.0, 26804.0]
[85.0, 85.0]
[107, 107]
p02779
u394244719
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na = list(map(int, input().split()))\nd = {}\n\nfor x in a:\n d[x] = d.get(x, 0) + 1\n\nt = max(d.values())\n\nprint("Yes") if t == 1 else print("No")\n', 'n = int(input())\na = list(map(int, input().split()))\nd = {}\n\nfor x in a:\n d[x] = d.get(x, 0) + 1\n\nt = max(d.values())\n\nprint("Yes") if t == 1 else print("No")\n', 'n = int(input())\na = list(map(int, input().split()))\nd = {}\n\nfor x in a:\n d[x] = d.get(x, 0) + 1\n\nt = max(d.values())\n\nprint("YES") if t == 1 else print("NO")\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s046237605', 's645191974', 's687895093']
[33004.0, 33740.0, 32948.0]
[131.0, 147.0, 137.0]
[162, 162, 162]
p02779
u394950523
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = int(input())\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s300281706', 's916830784']
[26812.0, 26808.0]
[88.0, 83.0]
[118, 118]
p02779
u395202850
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\naList = list(input().split())\nprint("Yes" if len(aList) == len(set(aList)) else "No")\n', 'n = int(input())\naList = list(input().split())\nprint("YES" if len(aList) == len(set(aList)) else "NO")\n']
['Wrong Answer', 'Accepted']
['s957258600', 's612799785']
[32692.0, 32692.0]
[74.0, 64.0]
[103, 103]
p02779
u396210538
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['from sys import stdin\nimport sys\n\n#S,T = stdin.readline().rstrip().split()\n#A,B = [int(x) for x in stdin.readline().rstrip().split()]\nN = stdin.readline().rstrip().split()\ns = list(map(int,input().split()))\ndict={}\nfor _,i in enumerate(s):\n \n if dict.get(i)==None:\n dict[i]=1\n else :\n print("No")\n sys.exit(0)\nprint("Yes")\n\n', 'from sys import stdin\nimport sys\n\n#S,T = stdin.readline().rstrip().split()\n#A,B = [int(x) for x in stdin.readline().rstrip().split()]\nN = stdin.readline().rstrip().split()\ns = list(map(int,input().split()))\ndict={}\nfor _,i in enumerate(s):\n \n if dict.get(i)==None:\n dict[i]=1\n else :\n print("NO")\n sys.exit(0)\nprint("YES")']
['Wrong Answer', 'Accepted']
['s153081224', 's065540699']
[32844.0, 32844.0]
[142.0, 142.0]
[356, 354]
p02779
u396518935
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nA = input().split()\nif N == len(list(set(A))):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = input().split()\nif N == len(list(set(A))):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s843356278', 's967873768']
[31284.0, 31156.0]
[75.0, 71.0]
[98, 98]
p02779
u396723412
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['a = int(input())\nb = list(map(int,input().split()))\n\nc=b.copy()\nc=set(c)\nif len(b)!=len(c):\n print("YES")\nelse:\n print("NO")\n', 'a = int(input())\nb = list(map(int,input().split()))\n\nc=b.copy()\nc=set(c)\nif len(b)==len(c):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s036423245', 's597902724']
[26808.0, 25936.0]
[91.0, 94.0]
[131, 131]
p02779
u396858476
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\na_list = list(map(int, input().split()))\na_hash = {}\nfor a in a_list:\n if a in a_hash:\n print("No")\n exit()\n a_hash[a] = True\nprint("Yes")\n', 'n = int(input())\na_list = list(map(int, input().split()))\na_hash = {}\nfor a in a_list:\n if a in a_hash:\n print("NO")\n exit()\n a_hash[a] = True\nprint("YES")\n']
['Wrong Answer', 'Accepted']
['s387662439', 's489631215']
[32944.0, 33360.0]
[124.0, 117.0]
[176, 176]
p02779
u397953026
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N=int(input())\na=list(map(int,input().split()))\na.sort()\nfor i in range(N-1):\n if a[i]==a[i+1]:\n print("No")\n break\nelse:\n print("Yes")', 'N=int(input())\na=list(map(int,input().split()))\na.sort()\nfor i in range(N-1):\n if a[i]==a[i+1]:\n print("NO")\n break\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s528209329', 's650670181']
[26808.0, 26808.0]
[204.0, 184.0]
[155, 155]
p02779
u401341173
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N=int(input())\ndata=list(map(int, input().split(' ')))\nA=len(data)\ndata=list(set(data))\nB=len(data)\nif A==B:\n print('Yes')\nelse:\n print('No')", "N=int(input())\ndata=list(map(int, input().split(' ')))\nA=len(data)\ndata=list(set(data))\nB=len(data)\nif A==B:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s483538668', 's775281312']
[26804.0, 25172.0]
[93.0, 97.0]
[147, 147]