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
u814986259
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(list(map(Int, input().split())))\nif len(A) == N:\n print("YES")\nelse:\n print("NO")\n', 'N = int(input())\nA = set((map(int, input().split())))\n\nif len(A) == N:\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Accepted']
['s369315949', 's129599864']
[2940.0, 36660.0]
[17.0, 90.0]
[113, 110]
p02779
u819407764
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\ns = {}\nflag = 0\n\nfor i in range(n):\n t = a[i]\n s.setdefault(t, 0)\n if s[t] == 0:\n s[t] = 1\n else:\n print("No")\n flag = 1\n break\n\nif flag == 0:\n print("Yes")', 'n = int(input())\na = list(map(int, input().split()))\n\ns = {}\nflag = 0\n\nfor i in range(n):\n t = a[i]\n s.setdefault(t, 0)\n if s[t] == 0:\n s[t] = 1\n else:\n print("No")\n flag = 1\n break\n\nif flag == 0:\n print("Yes")', 'n = int(input())\na = list(map(int, input().split()))\n\ns = {}\nflag = 0\n\nfor i in range(n):\n t = a[i]\n s.setdefault(t, 0)\n if s[t] == 0:\n s[t] = 1\n else:\n print("No")\n flag = 1\n break\n\nif flag == 0:\n print("Yes")', 'n = int(input())\na = list(map(int, input().split()))\n\ns = {}\nflag = 0\n\nfor i in range(n):\n t = a[i]\n s.setdefault(t, 0)\n if s[t] == 0:\n s[t] = 1\n else:\n print("NO")\n flag = 1\n break\n\nif flag == 0:\n print("YES")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s340881891', 's433241680', 's567125681', 's646965550']
[32844.0, 32944.0, 32848.0, 32844.0]
[172.0, 174.0, 162.0, 169.0]
[253, 253, 253, 253]
p02779
u819465503
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`.
["all_num = int(input())\nnum_list = [int(i) for i in input().split()]\n\nif len(num_list) == set(num_list):\n print('YES')\nelse:\n print('NO')", "all_num = int(input())\nnum_list = [int(i) for i in input().split()]\n\nif len(num_list) == len(set(num_list)):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s190714790', 's980890912']
[25168.0, 25172.0]
[91.0, 91.0]
[142, 147]
p02779
u819593641
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 = map(int, input().split())\nif len(set(S)) == N:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nS = map(int, input().split())\nif len(set(S)) == N:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s039613998', 's324086026']
[36660.0, 36656.0]
[88.0, 94.0]
[102, 103]
p02779
u824237520
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(set(a)) == n:\n print('YES')\nelse:\n print('NO')", "n = int(input())\na = list(map(int, input().split()))\nif len(set(a)) == n:\n print('YES')\nelse:\n print('NO')\n"]
['Runtime Error', 'Accepted']
['s345423448', 's158665135']
[2940.0, 25936.0]
[17.0, 83.0]
[121, 113]
p02779
u827261928
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\nN=int(input())\nA=list(map(int,input().split()))\nif has_duplicates(A):\n print('No')\nelse:\n print('Yes')", "N=int(input())\nA=list(map(int,input().split()))\nl=[]\nfor i in range(N):\n if A[i] in l:\n print('No')\n exit()\n l.append(A[i])\nprint('Yes')", "def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nN=int(input())\nA=list(map(int,input().split()))\nif has_duplicates(A):\n print('No')\nelse:\n print('Yes')", "def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nN=int(input())\nA=list(map(int,input().split()))\nif has_duplicates(A):\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s037605728', 's042181287', 's954886718', 's510198359']
[31136.0, 30836.0, 31116.0, 31112.0]
[96.0, 2206.0, 89.0, 97.0]
[171, 156, 171, 171]
p02779
u829364446
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()]\n\nif len(set(a))!=len(a):\n print("No")\nelse:\n print("Yes")', 'n=int(input())\na=[int(x) for x in input().split()]\n\nif len(set(a))!=len(a):\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s650360697', 's687323837']
[25936.0, 25936.0]
[90.0, 90.0]
[114, 114]
p02779
u829932632
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 = [int(x) for x in input().split(\' \')]\n\ndistinct = True\ndic = {}\n\nfor x in a:\n if x in dic:\n distinct = False\n break\n dic[x] = True\n\nif distinct:\n print("Yes")\nelse:\n print("No")', 'n = input()\na = [x for x in input().split(\' \')]\na.sort();\n\nisDistinct = True\nfor i in range(len(a)):\n if(a[i] == a[i - 1]):\n isDistinct = False\n break;\n\nif isDistinct:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s772039407', 's450571762']
[32848.0, 20796.0]
[121.0, 212.0]
[218, 223]
p02779
u832459318
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()\ny = map(int, input().split())\nk = list(y)\nt = len(set(k))\nq = len(k)\n\nif q > t:\n print("No")\nelse:\n print("Yes")', 'n = input()\ny = map(int, input().split())\nk = list(y)\nt = len(set(k))\nq = len(k)\n\nif q > t:\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s844294348', 's774296110']
[26808.0, 27056.0]
[82.0, 82.0]
[130, 130]
p02779
u839954363
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`.
['x = int(input(""))\nl = list()\nflag = 0\nfor i in range(0, x):\n temp = input("")\n if temp in l:\n flag = 1\n if temp not in l:\n l.append(temp)\nif flag == 1:\n print("NO")\nelse:\n print("YES")\n\n', 'x = int(input(""))\nl = list()\nflag = 0\narr = [int(x) for x in input().split()]\narr2=set(arr)\nl=len(arr)\nl2=len(arr2)\nif l!=l2:\n print("NO")\nelse:\n print("YES")\n\n']
['Runtime Error', 'Accepted']
['s035106550', 's447286391']
[7004.0, 25452.0]
[21.0, 101.0]
[216, 167]
p02779
u845847173
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(str, input().split()))\n\nif len(set(A)) == N:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(str, input().split()))\n\nif len(set(A)) == N:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s565333490', 's823638117']
[32688.0, 31056.0]
[77.0, 82.0]
[113, 113]
p02779
u847165882
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\n\nN=input()\nA=[int(s) for s in input().split(" ")]\n\nB=collections.Counter(A)\n\nprint("No" if len(A)!=len(B) else "Yes")', 'import collections\n\nN=input()\nA=[int(s) for s in input().split(" ")]\n\nB=collections.Counter(A)\n\nprint("NO" if len(A)!=len(B) else "YES")']
['Wrong Answer', 'Accepted']
['s863154820', 's788160370']
[33996.0, 33996.0]
[114.0, 110.0]
[136, 136]
p02779
u848535504
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(set(A)) == len(A):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int,input().split()))\n\nif len(set(A)) == N:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s259313854', 's100566517']
[31024.0, 31136.0]
[92.0, 90.0]
[117, 112]
p02779
u851035514
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-1):\n for j in range(N-i):\n if A[i] == A[i+j+1]:\n print("NO")\n exit()\n\nprint("YES")', 'N = int(input())\nA = list(map(int, input().split()))\nA.sort()\n\nfor i in range(N-1):\n if A[i] == A[i+1]:\n print("NO")\n exit()\n\nprint("YES")']
['Runtime Error', 'Accepted']
['s663084415', 's937869065']
[25936.0, 26808.0]
[106.0, 177.0]
[185, 155]
p02779
u851319680
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())\nAn = np.array(map(int, input().split()))\n\nif len(np.unique(An)) == n:\n print('YES')\nelse:\n print('NO')\n", "import numpy as np\n\nn = int(input())\nAn = list(map(int, input().split()))\nAn = np.array(An)\n\nif len(np.unique(An)) == n:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s173717765', 's694786716']
[28212.0, 35140.0]
[167.0, 384.0]
[142, 156]
p02779
u852386636
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)):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = list(map(int, input().split()))\n\nif N == len(set(A)):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s827653191', 's469531306']
[31060.0, 31052.0]
[85.0, 89.0]
[113, 113]
p02779
u854685063
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(k) for k in input().split()]\nb=0\nfor j in range(n):\n for k in range(n):\n if a[j]==a[k] and j!=k:\n b+=1\n break\n break\nif b==0:\n print('YES')\nelse:\n print('NO')\n", 'n = int(input())\na = [int(k) for k in input().split()]\na.sort()\nfor i in range(n-1):\n if a[i] < a[i+1]:\n pass\n else:\n print("NO")\n exit()\nprint("YES")']
['Runtime Error', 'Accepted']
['s156094989', 's728772204']
[2940.0, 25168.0]
[17.0, 201.0]
[214, 177]
p02779
u857070771
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*a,=map(int,input().split())\nif len(set(a)) == len(a):\n print("Yes")\nelse:\n print("No")\n ', 'n=int(input())\n*a,=map(int,input().split())\nif len(set(a)) == len(a):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s170663972', 's521247984']
[26800.0, 26812.0]
[85.0, 83.0]
[113, 108]
p02779
u860002137
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\nfrom collections import defaultdict\n\nn = int(input())\na = np.array(list(map(int, input().split())))\n\nd = defaultdict(int)\n\nfor i in range(n):\n d[a[i]] += 1\n\nprint("Yes") if max(d.values()) == 1 else print("No")', 'import numpy as np\nfrom collections import defaultdict\n\nn = int(input())\na = np.array(list(map(int, input().split())))\n\nd = defaultdict(int)\n\nfor i in range(n):\n d[a[i]] += 1\n\nprint("YES") if max(d.values()) == 1 else print("NO")']
['Wrong Answer', 'Accepted']
['s378073606', 's825977668']
[38108.0, 38104.0]
[372.0, 361.0]
[232, 232]
p02779
u860966226
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())\nnum = input().split()\n\ndef check():\n for s in num:\n if(num.count(s) >= 2):\n print("No")\n return\n print("Yes")\n\ncheck()\n', 'n = int(input())\nnum = input().split()\n\nif len(set(num)) == n:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s528209778', 's831190384']
[20916.0, 30160.0]
[2105.0, 60.0]
[151, 98]
p02779
u861109991
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())\nA = list(map(int, input().split()))\n\nres = np.zeros(N)\nfor i in range(N):\n res[i] = (A==A[i]).sum()\n\nif (res>1).sum() > 0:\n ans = 'NO'\nelse:\n ans = 'YES'\n \nprint(str(ans))", "import numpy as np\n\nN = int(input())\nA = list(map(int, input().split()))\nA = np.array(A)\n\nA_uni = np.unique(A)\nif len(A_uni) < N:\n ans = 'NO'\nelse:\n ans = 'YES'\nprint(str(ans))"]
['Runtime Error', 'Accepted']
['s937868630', 's710511229']
[34192.0, 34192.0]
[208.0, 229.0]
[212, 182]
p02779
u866124363
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 = map(int, input().split())\nA = sorted(A)\nb = 0\n\nfor a in A:\n if b == a:\n print('No')\n exit()\n else:\n b = a\nprint('Yes')\n", "N = int(input())\nA = map(int, input().split())\nA = sorted(A)\nb = 0\n\nfor a in A:\n if b == a:\n print('NO')\n exit()\n else:\n b = a\nprint('YES')\n"]
['Wrong Answer', 'Accepted']
['s604091516', 's823679120']
[25936.0, 26680.0]
[167.0, 176.0]
[167, 167]
p02779
u867826040
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()))\nans = 0\nfor i in range(n-k+1):\n x = 0\n for j in p[i:i+k]:\n z = 0\n for a in range(1,j+1):\n z+=a*(1/j)\n x+=z\n ans = max(x,ans)\nprint(ans)', 'n = int(input())\na = input().split()\nif n == len(set(a)):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s201541668', 's796333380']
[3060.0, 30160.0]
[18.0, 62.0]
[242, 92]
p02779
u869474504
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()\nAn = input()\nlist_An=[]\na = 0\nfor i in range(len(An)):\n if An[i]==" ":\n list_An.append(An[a:i])\n a = i\nlist_An.append(An[a+1:len(An)])\nA =0\nfor i in range(len(list_An)):\n for j in range(len(list_An)):\n if list_An[i]==list_An[j]:\n A+=1\nif A == len(list_An)+2:\n print("YES")\nelse:\n print("NO")', 'N=input()\nAn = input()\nlist_An=[]\na = 0\nfor i in range(len(An)):\n if An[i]==" ":\n list_An.append(int(An[a:i]))\n a = i+1\nlist_An.append(int(An[a:len(An)]))\nlist_An.sort()\nA = 0\nprint(list_An)\nfor i in range(len(list_An)):\n if list_An[i-1]==list_An[i]:\n print("NO")\n A = 1\n break \nif A == 0:\n print("YES")\n', 'N=input()\nAn = input()\nlist_An=[]\na = 0\nfor i in range(len(An)):\n if An[i]==" ":\n list_An.append(int(An[a:i]))\n a = i+1\nlist_An.append(int(An[a:len(An)]))\nA =0\nprint(list_An)\nfor i in range(len(list_An)):\n for j in range(len(list_An)):\n if list_An[i]-list_An[j]==0:\n A+=1\nif A == len(list_An):\n print("YES")\nelse:\n print("NO")', 'N=input()\nAn = input()\nlist_An=[]\na = 0\nfor i in range(len(An)):\n if An[i]==" ":\n list_An.append(int(An[a:i]))\n a = i+1\nlist_An.append(int(An[a:len(An)]))\nlist_An.sort()\nA = 0\nfor i in range(len(list_An)):\n if list_An[i-1]==list_An[i]:\n print("NO")\n A = 1\n break \nif A == 0:\n print("YES")\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s310983135', 's380586165', 's663808487', 's439405869']
[21204.0, 19260.0, 19160.0, 13628.0]
[2105.0, 459.0, 2104.0, 444.0]
[345, 351, 370, 336]
p02779
u870518235
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 -*-\n\n# Input\ns = [input() for i in range(2)]\nN = int(s[0])\nAs = sorted(list(s[1].split()))\n\n# Proccess\nfor i in range(0,N-1):\n\tif As[i] == As[i+1]:\n\t\tAnser = "No"\n\t\tbreak\n\telse:\n\t\tAnser = "Yes"\n\t\t\n# Output\t\t\t\t\t\t\t\nprint(Anser)', '# -*- coding: utf-8 -*-\n\n# Input\ns = [input() for i in range(2)]\nN = int(s[0])\nAs = sorted(list(s[1].split()))\n\n# Proccess\nfor i in range(N):\n\tif As[i] == As[i+1]:\n\t\tAnser = "No"\n\t\tbreak\n\telse:\n\t\tAnser = "Yes"\n\t\t\n# Output\t\t\t\t\t\t\t\nprint(Anser)', '# -*- coding: utf-8 -*-\n\n# Input\ns = [input() for i in range(2)]\nN = int(s[0])\nAs = sorted(list(s[1].split()))\n\n# Proccess\nfor i in range(0,N):\n\tif As[i] == As[i+1]:\n\t\tAnser = "No"\n\t\tbreak\n\telse:\n\t\tAnser = "Yes"\n\t\t\n# Output\t\t\t\t\t\t\t\nprint(Anser)', '# C - Distinct or Not\nN = int(input())\nA = list(map(int, input().split()))\n\nM = len(set(A))\n\nif N == M:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
['s254204535', 's259231243', 's367410326', 's468204304']
[24644.0, 23868.0, 23864.0, 31216.0]
[224.0, 228.0, 225.0, 87.0]
[245, 241, 243, 142]
p02779
u870559097
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 = sort(list(map(int, input().split())))\nfor i in range (N):\n for j in range (i+1, N):\n if List[j] == List[i]:\n print("NO")\n break\n else:\n continue\n break\nelse:\n print("YES")', 'N = int(input())\nList = sorted(list(map(int, input().split())))\nfor i in range(N):\n if List[i] == List[i + 1]:\n print("NO")\n break\nelse:\n print("YES")', 'N = int(input())\nList = sorted(list(map(int, input().split())))\nfor i in range(N-1):\n if List[i] == List[i + 1]:\n print("NO")\n break\nelse:\n print("YES")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s535232927', 's656634862', 's284698856']
[3060.0, 26808.0, 26804.0]
[17.0, 184.0, 180.0]
[215, 158, 160]
p02779
u870684607
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 = list(set(A))\nif b == A: print ('YES')\nelse: print ('NO')", "N = int(input())\nA = list(map(int,input().split()))\nB = set(A)\nif len(B) == len(A): print ('YES')\nelse: print ('NO')\n"]
['Wrong Answer', 'Accepted']
['s693036371', 's481846286']
[26808.0, 25936.0]
[101.0, 89.0]
[112, 117]
p02779
u871980676
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(list(map(int,input().split())))\nif len(a)==N:\n print('Yes')\nelse:\n print('No')\n", "N=int(input())\na=set(list(map(int,input().split())))\nif len(a)==N:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s535574721', 's475895403']
[26808.0, 26808.0]
[94.0, 96.0]
[106, 106]
p02779
u875541136
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(input().split())\n\nif len(set(A)) == N:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = list(input().split())\n\nif len(set(A)) == N:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s903629440', 's460123621']
[32692.0, 32692.0]
[67.0, 68.0]
[99, 99]
p02779
u877415670
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\n\nn=input()\na=list(map(int,input().split()))\n\nc=collections.Counter(a)\n\nans=True\nfor i,m in c.items():\n if m>1:\n ans=False\n break\nif ans:\n print("Yes")\nelse:\n print("No")', 'import collections\n\nn=input()\na=list(map(int,input().split()))\n\nc=collections.Counter(a)\n\nans=True\nfor i,m in c.items():\n if m>1:\n ans=False\n break\nif ans:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s027895393', 's499301257']
[33996.0, 33996.0]
[176.0, 133.0]
[211, 211]
p02779
u877428733
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()\nlist_1 = list(map(int,input().split()))\n\nlist_2 = list(set(list_1))\n\nlist_1.sort()\n\nif list_1 == list_2:\n print('Yes')\nelse:\n print('No')", "N = input()\nlist_1 = list(map(int,input().split()))\n\nnum = len(list_1)\nnum_2 = len(set(list_1))\n\nif num == num_2:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nlist_1 = list(map(int,input().split()))\n\n\nnum_2 = len(set(list_1))\n\nif N == num_2:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s530201034', 's874854282', 's213277732']
[25936.0, 25932.0, 26804.0]
[172.0, 83.0, 83.0]
[155, 152, 138]
p02779
u878545651
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 try:\n if A[i] == A[i+1]-1:\n print("YES")\n else:\n print("NO")\n except:\n pass\n', 'N = int(input())\nA = list(map(int, input().split()))\nS = set(A)\nif len(S)==len(A):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s922721831', 's994023319']
[25172.0, 25932.0]
[120.0, 93.0]
[193, 121]
p02779
u878654696
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 = input().split()\n\nx = {}\nfor i in a:\n\tif x.get(i, False):\n\t\tprint("No")\n\t\tbreak\n x[i] = True\nelse:\n\tprint("Yes")', 'input()\na = input().split()\n\nans = "Yes"\nx = {}\nfor i in a:\n if x.get(i, False):\n ans = "No"\n break\n x[i] = True\n\nprint(ans)\n', 'input()\na = input().split()\n\nx = {}\nfor i in a:\n if x.get(i, False):\n print("No")\n break\n x[i] = True\nelse:\n print("Yes")\n', 'input()\na = input().split()\n\nx = {}\nfor i in a:\n if x.get(i, False):\n print("No")\n break\n x[i] = True\nelse:\n print("Yes")\n', 'input()\na = input().split()\n\nx = {}\nfor i in a:\n\tif x.get(i, False):\n\t\tprint("No")\n\t\tbreak\n x[i] = True\nelse:\n\tprint("Yes")\n', 'input()\na = input().split()\n\nans = "YES"\nx = {}\nfor i in a:\n if x.get(i, False):\n ans = "NO"\n break\n x[i] = True\n\nprint(ans)\n']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s363124911', 's612190336', 's699828713', 's829696744', 's911252998', 's349935755']
[2940.0, 38832.0, 38836.0, 38836.0, 2940.0, 38856.0]
[17.0, 103.0, 112.0, 111.0, 17.0, 99.0]
[126, 145, 145, 145, 127, 145]
p02779
u879248892
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,*a = map(int, open(0).read().split())\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(a) == True:\n print("YES")\nelse:\n print("NO")', 'n,*a = map(int, open(0).read().split())\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(a) == True:\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s235561999', 's676517573']
[25068.0, 25068.0]
[83.0, 85.0]
[168, 168]
p02779
u880480312
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 if len(seq) == len(set(seq)):\n print("Yes")\n else:\n print("No")\n \nN = int(input())\nA = list(map(int,input().split()))\nhas_duplicates(A)\n', 'def has_duplicates(seq):\n if len(seq) == len(set(seq)):\n print("YES")\n else:\n print("NO")\n \nN = int(input())\nA = list(map(int,input().split()))\nhas_duplicates(A)\n\n\n']
['Wrong Answer', 'Accepted']
['s275150313', 's223170665']
[26808.0, 26808.0]
[83.0, 85.0]
[218, 220]
p02779
u881816188
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())\na = [int(i) for i in input().split()]\nfor i in range(len(a)-1):\n for j in range(i+1,len(a)):\n if a[i]==a[j]:\n print('Yes')\n sys.exit()\nprint('No')", "n=int(input())\na = [int(i) for i in input().split()]\nif len(a)==len(set(a)):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s423668876', 's560251231']
[25812.0, 25168.0]
[2104.0, 88.0]
[204, 115]
p02779
u884323674
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([int(i) for i in input().split()])\n\nmatch = False\nfor i in range(1, N):\n if A[i] == A[i-1]:\n match = True\n break\n\nif not match:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\n\nA = []\nans = True\nfor i in input().split():\n if int(i) in A:\n ans = False\n break\n else:\n A.append(int(i))\n\nif ans:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = sorted([int(i) for i in input().split()])\n\nmatch = False\nfor i in range(1, N):\n if A[i] == A[i-1]:\n match = True\n break\n\nif not match:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s095073216', 's401967407', 's090562609']
[25168.0, 21424.0, 25172.0]
[188.0, 2105.0, 191.0]
[211, 198, 211]
p02779
u886459614
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\nL=list(map(int, input().split()))\n\nS=set(L)\n\nif n==len(S):\n\tprint('Yes')\n\nelse:\n\tprint('NO')", "n = int(input())\n\nL=list(map(int, input().split()))\n\nS=set(L)\n\nif n==len(S):\n\tprint('YES')\n\nelse:\n\tprint('NO')"]
['Wrong Answer', 'Accepted']
['s502285816', 's104660139']
[26804.0, 25172.0]
[90.0, 91.0]
[110, 110]
p02779
u886655280
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_list_len = len(A_list)\n\nA_set = set(A_list)\nA_set_len = len(A_set)\n\nif int(A_list_len) == int(A_set_len):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA_list = list(map(int, input().split()))\nA_list_len = len(A_list)\n\nA_set = set(A_list)\nA_set_len = len(A_set)\n\nif A_list_len == A_set_len:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA_list = list(map(int, input().split()))\nA_list_len = len(A_list)\n\nA_set = set(A_list)\nA_set_len = len(A_set)\n\nif A_list_len == A_set_len:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA_list = list(map(int, input().split()))\nA_list_len = len(A_list)\n\nA_set = set(A_list)\nA_set_len = len(A_set)\n\nif int(A_list_len) == int(A_set_len):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s083604318', 's309258504', 's778697571', 's727432889']
[26800.0, 26808.0, 25936.0, 26800.0]
[90.0, 88.0, 91.0, 91.0]
[204, 194, 194, 204]
p02779
u891217808
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())\nif n = len(set(input().split())):\n print('YES')\nelse:\n print('NO')", "n = int(input())\nif n == len(set(input().split())):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s647850367', 's815313417']
[2940.0, 31156.0]
[17.0, 65.0]
[89, 90]
p02779
u891876269
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.sort()\nfrag = None\nfor i in range(N-1):\n if A[i] ==A[i+1]:\n print('NO')\n frag = 1\n break\nif frag == None:\n print('Yes')\n", "N = int(input())\nA = input().split()\nA.sort()\nfrag = None\nfor i in range(N-1):\n if A[i] ==A[i+1]:\n print('NO')\n frag = 1\n break\nif frag == None:\n print('YES')\n"]
['Wrong Answer', 'Accepted']
['s646594300', 's243127386']
[20796.0, 20796.0]
[212.0, 262.0]
[170, 170]
p02779
u898428248
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())\nA = list(map(int,input().split()))\n\ndef main():\n new_A = sorted(A)\n\n for i in range(S-1):\n if new_A[i] == new_A[i+1]:\n flag = 1\n break\n else:\n continue\n \n if flag == 0:\n print(\'YES\')\n else:\n print(\'NO\')\n\n\nif __name__ == "__main__":\n main()\n ', 'S = int(input())\nA = list(map(int,input().split()))\n\ndef main():\n flag = 0\n new_A = sorted(A)\n\n for i in range(S-1):\n if new_A[i] == new_A[i+1]:\n flag = 1\n break\n else:\n continue\n\n if flag == 0:\n print(\'YES\')\n else:\n print(\'NO\')\n\n\nif __name__ == "__main__":\n main()\n ']
['Runtime Error', 'Accepted']
['s339449915', 's211286746']
[26808.0, 26808.0]
[171.0, 166.0]
[344, 349]
p02779
u900848911
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 heapq\n\nN = int(input())\nA = list(int(x) for x in input().split())\nheapq.heapify(A)\ncom1 = heapq.heappop(A)\nans = True\n\nfor _ in range(N-1):\n com2 = heapq.heappop(A)\n\n if com1 == com2:\n ans = False\n break\n\n com1 = com2\n\nif ans:\n print('Yes')\nelse:\n print('No')\n", "import heapq\n\nN = int(input())\nA = list(int(x) for x in input().split())\nheapq.heapify(A)\ncom1 = heapq.heappop(A)\nans = True\n\nfor _ in range(N-1):\n com2 = heapq.heappop(A)\n\n if com1 == com2:\n ans = False\n break\n\n com1 = com2\n\nif ans:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s255480302', 's640844258']
[25172.0, 25172.0]
[264.0, 262.0]
[296, 296]
p02779
u901060001
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()]\nA.sort()\nfor i in range(1, len(A)):\n if A[i - 1] != A[i]:\n continue\n k = True\n else:\n k = False\n break\n\nif k:\n print("Yes")\nelse:\n print("No")', 'from collections import Counter\nN = int(input())\nA = [int(x) for x in input().split()]\n\nk = Counter(A)\n\nif len(k) == len(A):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = [int(x) for x in input().split()]\nA.sort()\nfor i in range(1, len(A)):\n if A[i - 1] != A[i]:\n k = True\n else:\n k = False\n break\n\nif k:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = [int(x) for x in input().split()]\nA.sort()\nfor i in range(1, len(A)):\n if A[i - 1] != A[i]:\n k = True\n else:\n k = False\n break\n\nif k:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s384858071', 's700671240', 's900938300', 's994006211']
[25172.0, 33996.0, 25936.0, 25936.0]
[189.0, 112.0, 201.0, 203.0]
[237, 163, 220, 220]
p02779
u901598613
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()))\nm=set(l)\nif len(l)==len(m):\n print("Yes")\nelse:\n print("No")\n', 'n=int(input())\nl=list(map(int,input().split()))\nm=set(l)\nif len(l)==len(m):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s368486493', 's691365592']
[26064.0, 25324.0]
[93.0, 93.0]
[115, 115]
p02779
u903699277
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(map(int,input().split()))\n B = set(A)\n C = len(B)\n if N == len(set(A)):\n print("Yes")\n else:\n print("No")\n \n \n \n\nmain()', 'def main():\n N = int(input())\n A = list(map(int,input().split()))\n #B = set(A)\n \n if N == len(set(A)):\n print("YES")\n else:\n print("NO")\n \n \n \n\nmain()']
['Wrong Answer', 'Accepted']
['s581350127', 's330919236']
[36296.0, 26808.0]
[100.0, 82.0]
[251, 253]
p02779
u904081717
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())\nnumlist = list(map(int, input().split()))\n\nnumlist.sort()\nfor i in range(N-1):\n if numlist[i] == numlist[i+1]:\n print('No')\n sys.exit()\n\nprint('Yes')\n", "import sys\nN = int(input())\nnumlist = list(map(int, input().split()))\n\nnumlist.sort()\nfor i in range(N-1):\n if numlist[i] == numlist[i+1]:\n print('No')\n sys.exit()\n\nprint('Yes')\n", "import sys\nN = input()\nnumlist = list(map(int, input().split()))\n\nfor i in range(N):\n if numlist[0] == numlist[i]:\n print('No')\n sys.exit()\n\nprint('Yes')", "import sys\nN = int(input())\nnumlist = list(map(int, input().split()))\n\nnumlist.sort()\nfor i in range(N-1):\n if numlist[i] == numlist[i+1]:\n print('NO')\n sys.exit()\n\nprint('YES')\n"]
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s192153137', 's251241979', 's630870766', 's707740659']
[26808.0, 26804.0, 26808.0, 25684.0]
[181.0, 179.0, 68.0, 178.0]
[195, 195, 160, 195]
p02779
u904331908
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())\nan = list(map(int,input().split()))\nan.sort()\n\nfor x in range(n-1):\n if an[i+1]-an[i] == 0:\n print("NO")\n break\n\nelse:\n print("YES")\n ', 'n = int(input())\nan = list(map(int,input().split()))\nan.sort()\n\nfor x in range(n-1):\n if an[x+1]-an[x] == 0:\n print("NO")\n break\n\nelse:\n print("YES")\n ']
['Runtime Error', 'Accepted']
['s478913261', 's724639202']
[31204.0, 31076.0]
[102.0, 145.0]
[160, 160]
p02779
u905974390
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()))\nans="Yes"\nfor i in range(n):\n for j in range(i+1, n):\n if li[i]==li[j]:\n ans="No"\n break\n else:\n continue\n break\nprint(ans)', 'n=int(input())\nli=list(map(int, input().split()))\nif n==len(set(li)):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s725900763', 's772302693']
[25684.0, 25172.0]
[2104.0, 85.0]
[192, 104]
p02779
u906481659
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()))\ncnt = 0\nfrom collections import Counter\n\nif A.most_common[0][1] <= 1:\n\tprint('YES')\nelse:\n\tprint('NO')", "N = int(input())\nA = list(map(int, input().split()))\ncnt = 0\nfrom collections import Counter\nB=A.Counter\nif B.most_common[0][1] <= 1:\n\tprint('YES')\nelse:\n\tprint('NO')", "N = int(input())\nA = list(map(int, input().split()))\ncnt = 0\nfrom collections import Counter\nB=Counter(A)\nC=B.most_common()\nif C[0][1] <= 1:\n\tprint('YES')\nelse:\n\tprint('NO')"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s160021856', 's529631970', 's716624221']
[26808.0, 26804.0, 40880.0]
[72.0, 72.0, 195.0]
[155, 166, 173]
p02779
u906769651
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 = list(map(int,input().split()))\n\nflag=0\nfor i in range(N):\n\tcount=0\n\tfor j in range(N):\n\t\tif a[i]==a[j] and i!=j:\n\t\t\tcount+=1\n\t\t\tprint("No")\n\t\t\tflag+=count\n\t\t\tbreak\n\t\telse:\n\t\t\tcontinue\n\tif count>=1:\n\t\tbreak\nif flag==0:\n\tprint("Yes")', '# coding: utf-8\n# Your code here!\nn=int(input())\ns=set(input().split())\nif len(s)==n:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s723835268', 's088790896']
[3060.0, 36276.0]
[17.0, 91.0]
[235, 124]
p02779
u906858931
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())\nli = list(map(int,input().split()))\n\ncount = 0\n\nfor i in range(a):\n # if li[-1] == li[i]:\n # continue\n if i == a-1:\n continue\n else:\n if li[-5] == li[i]:\n count += 1\n for j in li[i+1:]:\n if li[i] == j:\n count += 1\n else:\n pass\n\nif count > 0:\n print(\'NO\')\nelse:\n print("YES")', "N = int(input())\nA = list(map(int,input().split(' ')))\n\nis_break = False\nseen = set()\nfor a in A:\n if a not in seen:\n seen.add(a)\n else:\n is_break=True\n break\n\nif is_break:\n print('NO')\nelse:\n print('YES')"]
['Runtime Error', 'Accepted']
['s742506695', 's799937071']
[25168.0, 26808.0]
[2104.0, 118.0]
[377, 238]
p02779
u907668975
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())\na = sorted(list(map(lambda x: int(x),input().split())))\nfor i in range(n - 1):\n if a[i] == a[i+1] :\n print('NO')\n sys.exit()\nprint('Yes')\n", "n = int(input())\na = sorted(list(map(lambda x: int(x),input().split())))\nflag = 0\nfor i in range(n - 1):\n if a[i] == a[i+1] :\n print('NO')\n flag = 1\n break\n\nif flag == 0 :\n print('Yes')\n", "n = int(input())\na = sorted(list(map(lambda x: int(x),input().split())))\n\nfor i in range(n - 1):\n if a[i] == a[i+1] :\n print('NO')\n flag = 1\n break\n flag = 0\n\nif flag == 0 :\n print('Yes')", "import sys\nn = int(input())\na = sorted(list(map(lambda x: int(x),input().split())))\nfor i in range(n - 1):\n if a[i] == a[i+1] :\n print('NO')\n sys.exit()\nprint('YES')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s057346940', 's242161808', 's874326768', 's977478524']
[25168.0, 26808.0, 25936.0, 26680.0]
[203.0, 201.0, 210.0, 206.0]
[183, 213, 217, 182]
p02779
u910270473
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\nimport collections\n\nN = int(input())\nA_i = list(map(int, input().split()))\nA_i = [i for i in A_i if 1 <= i and i <= 10**9]\n\nif not 2 <= N or not N <= 2*10**5:\n print("error:N")\n sys.exit()\nif len(A_i) != N:\n print("error")\n sys.exit()\n\nif len(collections.Counter(A_i)) == len(A_i):\n print("Yes")\nelse:\n print("No")', 'import sys\nimport collections\n\nN = int(input())\nA_i = list(map(int, input().split()))\nA_i = [i for i in A_i if 1 <= i and i <= 10**9]\n\nif not 2 <= N or not N <= 2*10**5:\n print("error:N")\n sys.exit()\n\n\nif len(collections.Counter(A_i)) == len(A_i):\n print("Yes")\nelse:\n print("No")', 'import sys\n\nN = int(input())\nA_i = list(map(int, input().split()))\nA_i = [i for i in A_i if 1 <= i and i <= 10**9]\n\nif not 2 <= N or not N <= 2*10**5:\n print("error:N")\n sys.exit()\nif len(A_i) != N:\n print("error")\n sys.exit()\n\nif len(list(set(A_i))) == len(A_i):\n print("Yes")\nelse:\n print("No")', 'import sys\n\nN = int(input())\nA_i = list(map(int, input().split()))\nA_i = [i for i in A_i if 1 <= i and i <= 10**9]\n\nif not 2 <= N or not N <= 2*10**5:\n print("error:N")\n sys.exit()\nif len(A_i) != N:\n print("error")\n sys.exit()\n\nif len(list(set(A_i))) == len(A_i):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s194186958', 's420118548', 's451307871', 's529322558']
[33352.0, 33360.0, 26324.0, 26936.0]
[115.0, 113.0, 106.0, 107.0]
[343, 363, 314, 314]
p02779
u913662443
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`.
["stdin = open(0).read().split('\\n')\nN = int(stdin[0])\nA = list(map(int,stdin[1].split()))\nB = set(A)\nprint('Yes' if len(A)==len(B) else'No')", "stdin = open(0).read().split('\\n')\nN = int(stdin[0])\nA = list(map(int,stdin[1].split()))\nprint('Yes' if len(A)==len(B) else'No')", "stdin = open(0).read().split('\\n')\nN = int(stdin[0])\nA = list(map(int,stdin[1].split()))\nB = set(A)\nprint('YES' if len(A)==len(B) else 'NO')"]
['Wrong Answer', 'Runtime Error', 'Accepted']
['s332039532', 's788422917', 's773691159']
[27112.0, 26988.0, 27112.0]
[89.0, 67.0, 95.0]
[139, 128, 140]
p02779
u913863402
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()))\n\ndef dup(seq):\n return len(seq) != len(set(seq))\n\nif(dup(li)): \n print("No")\nelse:\n print("Yes")\n\n\n', 'n=int(input())\nli = list(map(int, input().split()))\n\ndef dup(seq):\n return len(seq) != len(set(seq))\n\nif(dup(li)): \n print("NO")\nelse:\n print("YES")\n\n\n']
['Wrong Answer', 'Accepted']
['s015606353', 's908197971']
[26808.0, 26804.0]
[88.0, 85.0]
[161, 161]
p02779
u914330401
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`.
['#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int n;\n bool ans = 1;\n cin >> n;\n vector<int> vec(n);\n for (int i = 0; i < n; i++)\n cin >> vec[i];\n sort(vec.begin(), vec.end());\n\n for (int i = 0; i < n - 1; i++)\n {\n if (vec[i] == vec[i + 1])\n {\n ans = 0;\n break;\n }\n }\n if (ans)\n cout << "YES" << endl;\n else\n cout << "NO" << endl;\n}', 'n = int(input())\nA = list(map(int, input().split()))\n\nif (len(set(A)) == len(A)):\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Accepted']
['s863624204', 's837412839']
[2940.0, 26808.0]
[17.0, 85.0]
[385, 117]
p02779
u914797917
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=sorted(list(input().split()))\n\nprint(A)\n\nflag=1\nfor i in range(N-1):\n if A.count(A[i])>1:\n flag=0\n break\nif flag==1:\n print('YES')\nelse:\n print('NO')\n", "N= int(input())\n\nA=sorted(list(input().split()))\nflag=1\nfor i in range(N-1):\n if A[i]==A[i+1]:\n flag=0\n break\nif flag==1:\n print('YES')\nelse:\n print('NO')\n\n\n"]
['Wrong Answer', 'Accepted']
['s599045115', 's084755714']
[28500.0, 21944.0]
[2108.0, 209.0]
[178, 166]
p02779
u915879510
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`.
['l = int(input())\ns_nums = input().split(" ")\nnums = []\nfor i in range(len(s_nums)):\n if s_nums[i] not in nums:\n nums.append(s_nums[i])\n\nif len(s_nums)==l:\n print("NO")\nelse:\n print("YES")', 'l = int(input())\ns_nums = set(input().split(" "))\nif len(s_nums)==l:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s030184157', 's869999330']
[20796.0, 30412.0]
[2105.0, 80.0]
[193, 103]
p02779
u916560554
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 = list(map(int, input().split()))\nif len(A) == len(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')"]
['Wrong Answer', 'Accepted']
['s893552596', 's060222894']
[26808.0, 25172.0]
[84.0, 85.0]
[108, 112]
p02779
u916662650
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()]\n\nresult = True\n\na.sort()\n\nfor i in range(len(a)-1):\n if a[i] == a[i+1]:\n result = False\n break\n\nif result:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = [int(x) for x in input().split()]\n\nresult = True\n\na.sort()\n\nfor i in range(len(a)-1):\n if a[i] == a[i+1]:\n result = False\n break\n\nif result:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s142068165', 's542735115']
[25168.0, 25932.0]
[186.0, 186.0]
[217, 217]
p02779
u917558625
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=list(map(int,input().split()))\nt.sort()\na=0\nfor i in range(len(t)-1):\n if t[i]==t[i+1]:\n a+=1\n break\nif a==1:\n print('No')\nelse:\n print('Yes')", "s=int(input())\nt=list(map(int,input().split()))\nt.sort()\nu=set(t)\nif len(t)!=len(u):\n print('No')\nelse:\n print('Yes')", "s=int(input())\nt=list(map(int,input().split()))\nt.sort()\na=0\nfor i in range(len(t)-1):\n if t[i]==t[i+1]:\n a=1\n break\nif a==1:\n print('No')\nelse:\n print('Yes')", "s=int(input())\nt=list(map(int,input().split()))\nt.sort()\nu=set(t)\na=len(t)\nb=len(u)\nif a!=b:\n print('Yes')\nelse:\n print('No')", "s=int(input())\nt=list(map(int,input().split()))\nt.sort()\nu=set(t)\na=len(t)\nb=len(u)\nif a!=b:\n print('No')\nelse:\n print('Yes')", "s=int(input())\nt=list(map(int,input().split()))\nt.sort()\na=0\nfor i in range(len(t)-1):\n if t[i]==t[i+1]:\n a=1\n break\nif a==1:\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s045397835', 's357062800', 's380628945', 's468552274', 's948663926', 's715199404']
[25168.0, 26804.0, 26808.0, 26808.0, 26808.0, 26808.0]
[183.0, 174.0, 182.0, 174.0, 176.0, 185.0]
[168, 119, 167, 127, 127, 167]
p02779
u917872021
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()))\nans = 'Yes'\ncheacked = []\n\nfor i in a_list:\n if i in cheacked:\n ans = 'No'\n break\n else:\n cheacked.append(i)\n \nprint(ans)", "n = int(input())\na_list = list(map(int, input().split()))\nans = 'YES'\ncheacked = {}\n\nfor i in a_list:\n if i in cheacked.keys():\n ans = 'NO'\n break\n else:\n cheacked[i] = 0\n \nprint(ans)"]
['Wrong Answer', 'Accepted']
['s878139616', 's463231842']
[26808.0, 32944.0]
[2104.0, 127.0]
[213, 217]
p02779
u918601425
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=[int(s) for s in input().split()]\ns=set(ls)\nif len(s)==N:\n print('Yes')\nelse:\n print('No')", "N=int(input())\nls=[int(s) for s in input().split()]\ns=set(ls)\nif len(s)==N:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s623765372', 's952863491']
[25172.0, 25172.0]
[97.0, 98.0]
[110, 110]
p02779
u918817732
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 quick_sort(list):\n stand=list[0]\n over=[]\n same=[]\n under=[]\n for i in list:\n if(i>stand):\n over.append(i)\n elif(i<stand):\n under.append(i)\n else:\n same.append(i)\n \n if(len(over)>1):\n over=quick_sort(over)\n else:\n pass\n if(len(under)>1):\n under=quick_sort(under)\n else:\n pass\n\n return over+same+under\n\nN=int(input())\nA=list(map(int,input().split()))\nA=quick_sort(A)\nans="Yes"\nif(len(A)>1):\n for i in range(len(A)):\n if(A[i-1]==A[i]):\n ans="NO"\n break\n else:\n pass\nelse:\n pass\nprint(ans)', 'def quick_sort(list):\n stand=list[0]\n over=[]\n same=[]\n under=[]\n for i in list:\n if(i>stand):\n over.append(i)\n elif(i<stand):\n under.append(i)\n else:\n same.append(i)\n \n if(len(over)>1):\n over=quick_sort(over)\n else:\n pass\n if(len(under)>1):\n under=quick_sort(under)\n else:\n pass\n\n return over+same+under\n\nN=int(input())\nA=list(map(int,input().split()))\nA=quick_sort(A)\nans="Yes"\nif(len(A)>1):\n for i in range(len(A)):\n if(A[i-1]==A[i]):\n ans="NO"\n break\n else:\n pass\nelse:\n pass\nprint(ans)', 'def quick_sort(list):\n stand=list[0]\n over=[]\n same=[]\n under=[]\n for i in list:\n if(i>stand):\n over.append(i)\n elif(i<stand):\n under.append(i)\n else:\n same.append(i)\n \n if(len(over)>1):\n over=quick_sort(over)\n else:\n pass\n if(len(under)>1):\n under=quick_sort(under)\n else:\n pass\n\n return over+same+under\n\nN=int(input())\nA=list(map(int,input().split()))\nA=quick_sort(A)\nans="Yes"\nfor i in range(len(A)):\n if(A[i-1]==A[i]):\n ans="NO"\n break\n else:\n pass\nprint(ans)', 'def quick_sort(list):\n stand=list[0]\n over=[]\n same=[]\n under=[]\n for i in list:\n if(i>stand):\n over.append(i)\n elif(i<stand):\n under.append(i)\n else:\n same.append(i)\n if(len(over)>1):\n over=quick_sort(over)\n else:\n pass\n if(len(under)>1):\n under=quick_sort(under)\n else:\n pass\n\n return over+same+under\n\nN=int(input())\nA=list(map(int,input().split()))\nA=quick_sort(A)\nans="YES"\nif(len(A)>1):\n for i in range(len(A)):\n if(A[i-1]==A[i]):\n ans="NO"\n break\n else:\n pass\nelse:\n pass\nprint(ans)']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s038861223', 's658529836', 's926183939', 's984885144']
[25548.0, 25548.0, 25676.0, 25548.0]
[778.0, 786.0, 747.0, 764.0]
[658, 658, 605, 653]
p02779
u920103253
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=map(int,input().split())\nif len(a)==list(set(a)):\n print("Yes")\nelse:\n print("No")', 'def n0():return int(input())\ndef n1():return [int(x) for x in input().split()]\ndef n2(n):return [int(input()) for _ in range(n)]\ndef n3(n):return [[int(x) for x in input().split()] for _ in range(n)]\n\nn=n0()\na=n1()\n\nprint("YES" if len(a)==len(list(set(a))) else "NO")']
['Runtime Error', 'Accepted']
['s300867550', 's227578700']
[20792.0, 25932.0]
[39.0, 104.0]
[101, 267]
p02779
u920340928
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())\nAn = list(map(int, input().split()))\n\nduplicate_list = [x for x in set(An) if An.count(x) > 1]\n\nif duplicate_list:\n print('NO')\nelse:\n print('YES'", "N = int(input())\nAn = list(map(int, input().split()))\n\nduplicate_list = [x for x in set(An) if An.count(x) > 1]\n\nif duplicate_list:\n print('No')\nelse:\n print('Yes')", 'N = int(input())\nAn = list(map(int, input().split()))\nBn = sorted(An)\n\ny = -1\ncount = 0\nfor x in Bn:\n if x == y:\n count += 1\n y = x\n\nif count == 0:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s231106929', 's271597829', 's812199267']
[2940.0, 26808.0, 25172.0]
[17.0, 2104.0, 168.0]
[169, 170, 199]
p02779
u924783770
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())\nA=list(map(int,input().split()))\n\nA.sort()\nfor i in range(N-1):\n if A[i]==A[i+1]:\n print("No")\n sys.exit()\n\nprint("Yes")\n', 'import sys\nN=int(input())\nA=list(map(int,input().split()))\n\nA.sort()\nfor i in range(N-1):\n if A[i]==A[i+1]:\n print("NO")\n sys.exit()\n\nprint("YES")\n']
['Wrong Answer', 'Accepted']
['s557279563', 's605392203']
[26808.0, 26808.0]
[178.0, 181.0]
[164, 164]
p02779
u926080943
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=input;print(['YES','NO'][int(i())==len(set(i().split()))])", "i=input;print(['NO','YES'][int(i())==len(set(i().split()))])"]
['Wrong Answer', 'Accepted']
['s142859855', 's079607623']
[36112.0, 36176.0]
[85.0, 78.0]
[60, 60]
p02779
u926412290
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(input().split())\n\nif A == sorted(list(set(A))):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = sorted(input().split())\n\nif A == sorted(list(set(A))):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s486157903', 's132903867']
[32692.0, 32688.0]
[370.0, 372.0]
[114, 114]
p02779
u928480992
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\nn = int(input())\nai = list(map(int, input().split()))\nc = max(Counter(ai).values())\n\n# Calculating if the input is pairwise distinct or not\nif c > 1:\n print('No')\nelse:\n print('Yes')\n", "from collections import Counter\n\n\nintNums = int(input())\nintList = list(map(int, input().split()))\nc = max(Counter(intList).values())\n\n# Calculating if the input is pairwise distinct or not\nif c > 1:\n print('NO')\nelse:\n print('YES')\n\n# Check out my Youtube channel! https://www.youtube.com/channel/UCMOKVyAbTZOpKikTrX5dy_A\n"]
['Wrong Answer', 'Accepted']
['s279852021', 's899758604']
[33996.0, 33996.0]
[102.0, 103.0]
[247, 353]
p02779
u931462344
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()))\nAset = set(A)\nif len(A) == len(Aset):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int, input().split()))\nAset = set(A)\nif len(A) == len(Aset):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s443466199', 's686828641']
[26808.0, 26804.0]
[89.0, 91.0]
[129, 129]
p02779
u932864155
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')", "N = int(input())\nA = list(map(int,input().split()))\nB = set(A)\nprint(A)\nif len(A)==len(B):\n print('Yes')\nelse:\n 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')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s217240501', 's575505718', 's068298671']
[26804.0, 28980.0, 25936.0]
[88.0, 111.0, 91.0]
[116, 125, 116]
p02779
u933341648
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(input().split())\n\nprint('YES' if len(s) == n else 'NO')", "n = int(input())\na = set(input().split())\n\nprint('YES' if len(a) == n else 'NO')"]
['Runtime Error', 'Accepted']
['s369913371', 's689168104']
[31156.0, 31156.0]
[76.0, 69.0]
[80, 80]
p02779
u933717615
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 = list(map(int, input().split()))\nA_set = set(A)\n\nif len(A)==len(A_set):\n print('Yes')\nelse:\n print('No')", "N=input()\nA = list(map(int, input().split()))\nA_set = set(A)\n\nif len(A)==len(A_set):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s498654588', 's266994484']
[26800.0, 26808.0]
[90.0, 89.0]
[119, 119]
p02779
u934788990
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()]\na1 = set(a)\nif len(a) != len(a1):\n print('No')\nelse:\n print('Yes')", "n = int(input())\na = [int(i) for i in input().split()]\na1 = set(a)\nif len(a) != len(a1):\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s383748452', 's268145570']
[25448.0, 25936.0]
[97.0, 100.0]
[128, 128]
p02779
u936735179
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()\na =set(a)\nfor idx, i in enumerate(a[:-1]):\n if i == a[idx+1]:\n print('NO')\n break\nif idx == n - 2:\n print('YES')", "n = int(input())\na = list(map(int,input().split()))\na = sorted(a)\nflag = True\nfor idx, i in enumerate(a[:-1]):\n if i == a[idx+1]:\n print('NO')\n flag= False\n break\nif flag:\n print('YES')"]
['Runtime Error', 'Accepted']
['s357123333', 's786381103']
[26808.0, 26804.0]
[171.0, 187.0]
[193, 212]
p02779
u938256038
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()]\n\njudge = True\nif len(A) != len(set(A)):\n judge = False\nif judge == True:\n print('Yes')\nelse:\n print('No')", "n = int(input())\nA = [int(x) for x in input().split()]\n\njudge = True\nif len(A) != len(set(A)):\n judge = False\n\nif judge == True:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s162743639', 's547221742']
[25172.0, 25172.0]
[90.0, 93.0]
[169, 170]
p02779
u940831163
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`.
['function Main(input) {\n\tvar str = input;\n\tvar ans = "YES";\n\tstr = str.split("\\n");\n\tvar l = str[1].split(" "); \n\tloop:\n\tfor(var j =0;j< l.length-1;j++){\t\n \t\tfor(var i =1; i<l.length;i++){\n \t\t\t if(l[j]===l[i]){\n\t \t\t\tans = "NO";\n\t \t\t\tbreak loop;\n \t\t\t}\t \t\n \t\t}\n\t} \t\n\tconsole.log(ans);\n}\n //*おまじない\nMain(require("fs").readFileSync("/dev/stdin", "utf8"));\n', "n = int(input())\na = list(map(int, input().split()))\na.sort()\nfor i in range(len(a)-1):\n if a[i] == a[i+1]:\n print('NO')\n exit()\nprint('YES')\n"]
['Runtime Error', 'Accepted']
['s284346564', 's780209352']
[2940.0, 26808.0]
[17.0, 186.0]
[360, 159]
p02779
u942051624
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`.
["\nN=int(input())\nflag=True\ninList=list(map(int,input().split()))\nfor i in range(len(inList)):\n for j in range(i,len(inList)):\n if inList[j]==inList[i]:\n print('NO')\n flag=False\n break\n if not flag:\n break\n\nif flag:\n print('YES')", "from collections import Counter\nN=int(input())\nflag=True\ninList=list(map(int,input().split()))\n\nc=Counter(inList)\ncv=list(c.values())\nfor i in cv:\n if i!=1:\n print('NO')\n flag=False\n break\nif flag:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s387698899', 's021780052']
[25936.0, 33996.0]
[69.0, 118.0]
[283, 238]
p02779
u944643608
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 yabaton(A):\n for i in range(0,N-1):\n for j in range(i+1,N):\n if A[i] == A[j]:\n return 'NO'\n return 'YES'\nyabaton(A)\n", "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 return 'NO'\nreturn 'YES'", 'N = int(input())\nP = list(map(int, input().split()))\ncount = 1\nfor i in range(1, N):\n if P[i] <= min(P[0:i]):\n count += 1\nprint(count)\n', "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\nprint(ans)\n", "N = int(input())\nA = list(map(int,input().split()))\ndef yabaton(A):\n for i in range(0,n-1):\n for j in range(i+1,n):\n if A[i] == A[j]:\n return 'NO'\n return 'YES'\nyabaton(A)\n", "N = int(input())\nA = list(map(int,input().split()))\nA.sort()\ndef yabaton(a):\n n = len(a)\n for i in range(n-1):\n if a[i] != a[i+1]:\n return 'NO'\n return 'YES'", "N = int(input())\nA = list(map(int,input().split()))\nA.sort()\ndef yabaton(a):\n n = len(a)\n for i in range(n-1):\n if a[i] != a[i+1]:\n return 'NO'\n return 'YES'\nyabaton(A)", "N = int(input())\nA = list(map(int,input().split()))\ndef yabaton(A):\n n = len(A)\n for i in range(0,n-1):\n for j in range(i+1,n):\n if A[i] == A[j]:\n return 'NO'\n return 'YES'\nyabaton(A)\n", "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\nprint(ans)\n", "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 return 'NO'\nreturn 'YES'\n", "N = int(input())\nA = list(map(int,input().split()))\nA.sort()\ndef yabaton(a):\n n = len(a)\n for i in range(n-1):\n if a[i] == a[i+1]:\n return 'NO'\n return 'YES'\nyabaton(A)", "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\nprint(ans)\n"]
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s049514397', 's113583852', 's115256761', 's276515896', 's300263907', 's537630660', 's804783134', 's912237133', 's928480682', 's951273878', 's993244146', 's349694920']
[26804.0, 2940.0, 26808.0, 26808.0, 26680.0, 26808.0, 26808.0, 26808.0, 26808.0, 2940.0, 26804.0, 26804.0]
[2104.0, 17.0, 2104.0, 149.0, 68.0, 153.0, 153.0, 2104.0, 146.0, 17.0, 171.0, 178.0]
[189, 151, 139, 151, 189, 168, 179, 202, 151, 152, 179, 151]
p02779
u945641805
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\nh = {}\nans = 'Yes'\nfor i in range(N):\n a = h.get(A[i], 0)\n if a != 0:\n ans = 'No'\n break\n h[A[i]] = A[i]\nprint(ans)", "N = int(input())\nA = list(map(int, input().split()))\n\nh = {}\nans = 'YES'\nfor i in range(N):\n a = h.get(A[i], 0)\n if a != 0:\n ans = 'NO'\n break\n h[A[i]] = A[i]\n\nprint(ans)"]
['Wrong Answer', 'Accepted']
['s223161043', 's081064856']
[32848.0, 32844.0]
[162.0, 164.0]
[192, 193]
p02779
u946433121
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 main():\n\n \n\n n = int(input())\n a = list(map(int, input().split()))\n \n if len(a) == len(set(a)):\n print('Yes')\n else:\n print('No')\n\nif __name__ == '__main__':\n main()\n", "import sys\n\ndef main():\n\n \n\n n = int(input())\n a = list(map(int, input().split()))\n \n if len(a) == len(set(a)):\n print('YES')\n else:\n print('NO')\n\nif __name__ == '__main__':\n main()\n"]
['Wrong Answer', 'Accepted']
['s671075018', 's538877477']
[25452.0, 26808.0]
[82.0, 82.0]
[252, 252]
p02779
u948911484
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()))\nfor i in range(n-1):\n for j in range(i+1,n):\n if a[i]==a[j]:\n print("No")\n quit()\nprint("Yes")', 'n = int(input())\na = list(map(int,input().split()))\ncheck = set(a)\nif len(a) == len(check):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = list(map(int,input().split()))\ncheck = set(a)\nif len(a) == len(check):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s486358790', 's733880063', 's995146909']
[25684.0, 25932.0, 26808.0]
[2104.0, 92.0, 89.0]
[159, 126, 127]
p02779
u949115942
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())\nan = list(map(int, input().split()))\n\ndef distinct_or_not(an):\n an_dict = {}\n for a in an:\n if a in an_dict:\n return False\n else:\n an_dict[a] = 1\n return True\n \nif distinct_or_not(an):\n print('Yes')\nelse:\n print('No')", "n = int(input())\nan = list(map(int, input().split()))\n \ndef distinct_or_not(an):\n an_dict = {}\n for a in an:\n if a in an_dict:\n return False\n else:\n an_dict[a] = 1\n return True\n \nif distinct_or_not(an):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s238277922', 's471521493']
[32948.0, 32948.0]
[104.0, 99.0]
[286, 287]
p02779
u950129527
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()))\n\nli0 = sorted(li)\n\nprint(li)\nprint(li0)\n\nj = 0\nfor i in range(n):\n if li0[i-1]==li0[i]:\n j = 1\n\nif j == 0:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\nli = list(map(int,input().split()))\n\nli0 = sorted(li)\n\nj = 0\nfor i in range(n):\n if li0[i-1]==li0[i]:\n j = 1\n\nif j == 0:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s172110548', 's045937439']
[25684.0, 25936.0]
[243.0, 181.0]
[198, 177]
p02779
u951401193
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())\nm = list(map(int,input().split()))\nm.sort()\nfor i in range(n):\n if m[i] == m[i+1]:\n print('NO')\n exit()\n \nprint('YES')", "n = int(input())\nm = list(map(int,input().split()))\nm.sort()\nfor i in range(n-1):\n if m[i] == m[i+1]:\n print('NO')\n exit()\n \nprint('YES')"]
['Runtime Error', 'Accepted']
['s657313215', 's771211021']
[25172.0, 26808.0]
[182.0, 180.0]
[145, 147]
p02779
u952669998
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\nflg = 1\nfor i in range(N):\n if A[i] in A[i+1:]:\n print("No")\n flg= 0\n break\nif flg:\n print("Yes")\n', 'N = int(input())\nA = list(map(int,input().split()))\nA.sort()\n\nflg = 1\nfor i in range(N-1):\n if A[i]==A[i+1]:\n print("NO")\n flg= 0\n break\nif flg:\n print("YES")\n']
['Wrong Answer', 'Accepted']
['s150599485', 's482237661']
[25172.0, 26804.0]
[2104.0, 204.0]
[162, 170]
p02779
u952854963
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 = list(map(int, input().split()))\nb = len(list(map(int, input().split())))\ns = set(a)\nif len(a) == len(s):\n print('YES')\nelse:\n print('NO')", "n = input()\na = list(map(int, input().split()))\ns = set(a)\nif len(a) == len(s):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s069585008', 's728963687']
[26808.0, 26808.0]
[67.0, 90.0]
[159, 118]
p02779
u955547613
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(map(int, input().split()))\n tmp = {}\n is_unique = True\n for i in range(n):\n if not a[i] in tmp:\n is_unique = False\n break\n tmp[a[i]] = a[i]\n \n if is_unique:\n print("YES")\n else:\n print("NO")\n\n\nif __name__=="__main__":\n main()\n', 'def main():\n n = int(input())\n a = list(map(int, input().split()))\n tmp = {}\n is_unique = True\n for i in range(n):\n if a[i] in tmp:\n is_unique = False\n break\n tmp[a[i]] = a[i]\n \n if is_unique:\n print("YES")\n else:\n print("NO")\n\n\nif __name__=="__main__":\n main()\n']
['Wrong Answer', 'Accepted']
['s904777130', 's415661737']
[25936.0, 32948.0]
[67.0, 111.0]
[343, 339]
p02779
u956433805
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)\n\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)\n\nif len(A) == len(B):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s140770913', 's262910117']
[25452.0, 26808.0]
[96.0, 92.0]
[124, 124]
p02779
u958053648
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())\nA=list(map(int, input().split()))\ncount=0\nB=Counter(A)\nfor i in B.values():\n\tif i!=1:\n\t\tcount+=1\n\t\tbreak\nif count==1:\n\tprint('No')\nelse:\n\tprint('Yes')", "from collections import Counter\nN=int(input())\nA=list(map(int, input().split()))\nB=Counter(A)\nif len(A)==len(B):\n\tprint('Yes')\nelse:\n\tprint('No')", "from collections import Counter\nN=int(input())\nA=list(map(int, input().split()))\nB=Counter(A)\nprint(len(A))\nprint(len(B))\nif len(A)==len(B):\n\tprint('YES')\nelse:\n\tprint('NO')", "from collections import Counter\nN=int(input())\nA=list(map(int, input().split()))\ncount=0\nB=Counter(A)\nfor i in B.values():\n\tif i!=1:\n\t\tcount+=1\nif count==0:\n\tprint('Yes')\nelse:\n\tprint('No')", "from collections import Counter\nN=int(input())\nA=list(map(int, input().split()))\nB=Counter(A)\nif len(A)==len(B):\n\tprint('YES')\nelse:\n\tprint('NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s077907603', 's492989174', 's572913912', 's942529343', 's713629469']
[33996.0, 33996.0, 33996.0, 33996.0, 33996.0]
[115.0, 107.0, 106.0, 116.0, 105.0]
[197, 145, 173, 189, 145]
p02779
u960637522
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())\nlist = list(map(int, input().split()))\n \nfor i in range(N):\n for j in range(N):\n if list[i] == list[j]:\n print("NO")\n sys.exit()\nprint("YES")', 'N = int(input())\nlist = list(map(int, input().split()))\n\n\n\nif ((len(list)) == (len(set(list)))) == True:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s273292552', 's397395501']
[26808.0, 26804.0]
[68.0, 85.0]
[184, 139]
p02779
u961945062
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()))\nj = True\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")\n']
['Wrong Answer', 'Accepted']
['s211328346', 's846386231']
[25452.0, 25936.0]
[85.0, 84.0]
[127, 119]
p02779
u963128036
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\n\nimport collections\n\nn=int(input())\na_list=list(map(int,input().split()))\n\nif len(collections.Counter(a_list))==len(a_list):\n print("Yes")\nelse:\n print("No")', '# coding: utf-8\n\nn=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")']
['Wrong Answer', 'Accepted']
['s674802091', 's488076911']
[33996.0, 26808.0]
[98.0, 87.0]
[179, 143]
p02779
u966836999
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`.
["#154\nN = int(input())\nA = [int(input()) for i in range(N)]\nA_set = set(A)\nif(len(A)==len(A_set)):\n print('YES')\nelse:\n print('NO')", "#154\nN = int(input())\nA = map(int,input().split())\nA_set = set(A)\nif(len(A)==len(A_set)):\n print('YES')\nelse:\n print('NO')", "#154\nN = int(input())\nA = list(map(int,input().split()))\nA_set = set(A)\nif(len(A)==len(A_set)):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s052951124', 's830159653', 's277182364']
[8640.0, 35788.0, 26804.0]
[29.0, 96.0, 92.0]
[136, 128, 134]
p02779
u969708690
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=map(int,input().split())\nA=list(map(int,input().split()))\nT=set(A)\nif len(A)==len(T):\n print("Yes")\nelse:\n print("No")', 'a=input()\nA=list(map(int,input().split()))\nT=set(A)\nif len(A)==len(T):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s633301500', 's514708559']
[25172.0, 25936.0]
[91.0, 93.0]
[122, 105]
p02779
u970267139
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()\n\nfor a in A:\n if a in s:\n print('No')\n break\n s.add(a)\nelse:\n print('Yes')", "n = int(input())\nA = list(map(int, input().split()))\ns = set()\n\nfor a in A:\n if a in s:\n print('NO')\n break\n s.add(a)\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s485126207', 's595449317']
[30924.0, 30952.0]
[115.0, 122.0]
[160, 160]
p02779
u970407071
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 = list(map(int, input().split()))\n\nprint('Yes' if N == len(set(A)) else 'No')", "N = input()\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print('Yes')\nelse:\n print('No')", "N = input()\nA = list(map(int, input().split()))\n\nprint('Yes' if len(A) == len(set(A)) else 'No')", "N = input()\nA = list(map(int, input().split()))\n\nprint('YES' if len(A) == len(set(A)) else 'NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s212448235', 's298493449', 's449519792', 's474369545']
[26804.0, 26808.0, 26808.0, 26808.0]
[83.0, 85.0, 84.0, 82.0]
[91, 113, 96, 96]
p02779
u970809473
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`.
['r = 0\nn = int(input())\na = sorted(list(map(int, input().split())))\nfor i in range(n - 1):\n if a[i] == a[i + 1]:\n r = 1\nif r == 1:\n print("No")\nelse:\n print("Yes")', 'r = 0\nn = int(input())\na = sorted(list(map(int, input().split())))\nfor i in range(n - 1):\n if a[i] == a[i + 1]:\n r = 1\nif r == 1:\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s822219290', 's422744437']
[25936.0, 26808.0]
[180.0, 181.0]
[169, 169]