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
u074687136
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_list = list(map(int, input().split()))\nnum_list = sorted(num_list)\n\nfor i in range(len(num_list)):\n if num_list[i] == num_list[i+1]:\n print('NO')\n exit()\nprint('YES')", "N = int(input())\nnum_list = list(map(int, input().split()))\nnum_list = sorted(num_list)\n\nfor i in range(len(num_list)):\n if i == N-1:\n print('YES')\n elif num_list[i] == num_list[i+1]:\n print('NO')\n exit()"]
['Runtime Error', 'Accepted']
['s335749904', 's209511395']
[25172.0, 26804.0]
[180.0, 213.0]
[194, 215]
p02779
u078181689
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())\narr = list(map(int,input().split()))\n\narrset = set(arr)\n\nif len(arr) == len(arrset):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\narr = list(map(int,input().split()))\n\narrset = set(arr)\n\nif len(arr) == len(arrset):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s172693918', 's794430686']
[25936.0, 26808.0]
[94.0, 91.0]
[140, 140]
p02779
u078932560
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 nrange(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()))\n\nfor i in range(N):\n if A[i] in A[i+1:]:\n print('NN)\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\')']
['Runtime Error', 'Runtime Error', 'Accepted']
['s608564480', 's954646284', 's011550766']
[25172.0, 2940.0, 26808.0]
[161.0, 17.0, 180.0]
[151, 130, 150]
p02779
u079182025
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\ni = 0\nwhile i < n:\n j = i+1\n while j < n:\n if a_list[i] == a_list[j]:\n print("No")\n exit()\n j += 1\n i += 1\n\nprint("Yes")', 'import collections\n\nn = int(input())\na_list = list(map(int, input().split()))\n\na_counter = collections.Counter(a_list)\n\nans = "YES"\nfor value in a_counter.values():\n if value > 1:\n ans = "NO"\n break\n\nprint(ans)']
['Wrong Answer', 'Accepted']
['s929294218', 's066593957']
[25932.0, 33996.0]
[2104.0, 117.0]
[198, 217]
p02779
u080608919
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\n# a = [1,2,3,3,2,2,1]\n\n# print(s)\n# >>[1,2,3]\n\nif len(set(a)) == n:\n print("Yes")\nelse:\n print("No")', 'import collections\nn = int(input())\na = map(int,input().split())\nx = list(a)\nx.sort()\n\nc = collections.Counter(x)\n# print(c)\nw = c.values()\n# print(w)\nfor i in w:\n # print(i)\n if i >= 2:\n print("No")\n break\n else:\n print("Yes")\n break\n ', 'n = int(input())\na = list(map(int,input().split()))\n\nif len(set(a)) == n:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = list(map(int,input().split()))\n\n\nif len(set(a)) == n:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s527385733', 's744648794', 's923317822', 's421696706']
[26812.0, 34252.0, 26808.0, 26808.0]
[82.0, 195.0, 85.0, 85.0]
[171, 276, 112, 113]
p02779
u081193942
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_set = set(list(map(int, input().split())))\n\nprint("Yes" if len(a_set) == n else "No")', 'n = int(input()) \n\na_set = set(list(map(int, input().split())))\n\nprint("YES" if len(a_set) == n else "NO")']
['Wrong Answer', 'Accepted']
['s268389045', 's648948397']
[26808.0, 26812.0]
[91.0, 91.0]
[106, 106]
p02779
u082978753
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())\nlisA = [int(i) for i in input().split()]\nif len(set(lisA)) == len(lisA):\n print('Yes')\nelse :\n print('No')", 'def calc_exp(x:str)->float:\n return (int(x) + 1)/2\n\nNK = input().split()\nN, K = int(NK[0]), int(NK[1])\n#lis_p = list(map(lambda x: int(x), input().split()))\nlis_exp = list(map(calc_exp, input().split()))\ndp=0\nfor i in range(N):\n dp = max(sum(lis_exp[i:i+K]), dp)\nprint(dp)', 'def calc_exp(x):\n return (int(x) + 1)/2\n\nNK = input().split()\nN, K = int(NK[0]), int(NK[1])\n#lis_p = list(map(lambda x: int(x), input().split()))\nlis_exp = list(map(calc_exp, input().split()))\ndp=0\nfor i in range(N):\n dp = max(sum(lis_exp[i:i+K]), dp)\nprint(dp)', "N = int(input())\nlisA = [int(i) for i in input().split()]\nif len(set(lisA)) == len(lisA):\n print('YES')\nelse :\n print('NO')"]
['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
['s372817755', 's426148795', 's585717177', 's346116152']
[25448.0, 3064.0, 3060.0, 25812.0]
[92.0, 17.0, 17.0, 92.0]
[129, 278, 267, 129]
p02779
u083997787
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())\nl = [int(n) for n in input().split()]\nl = sorted(l)\nflag = 0\nprint(l)\nfor i in range(len(l)- 1):\n if l[i] == l[i+1]:\n print("NO")\n flag = 1\n \nif flag == 0:\n print("YES")\n ', 's = int(input())\nl = [int(n) for n in input().split()]\nl = sorted(l)\nflag = 0\n\nfor i in range(len(l)- 1):\n if l[i] == l[i+1]:\n print("NO")\n flag = 1\n break\n \nif flag == 0:\n print("YES")\n ']
['Wrong Answer', 'Accepted']
['s138381052', 's495206086']
[25300.0, 25172.0]
[236.0, 189.0]
[199, 201]
p02779
u084320347
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']
['s514492352', 's633507478']
[26808.0, 25936.0]
[85.0, 86.0]
[117, 117]
p02779
u085595890
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`.
['t=input().split()\nn=int(t.pop(0))\nif len(set(n))==n:\n print("YES")\nelse:\n print("NO")\n', 't=input().split()\nn=int(t.pop(0))\nt.sort()\np=0\nfor i in range(n-1):\n if t[i]==t[i+1]:\n p+=1\n \nif p>0:\n print("NO")\nelse:\n print("YES")', 't=input().split()\nm=t.pop\nn=int(m)\nif len(set(t))==n:\n print("YES")\nelse:\n print("NO")\n', 'n=input()\nt=input().split()\nif len(set(t))==n:\n print("YES")\nelse:\n print("NO")\n', 't=input().split()\nm=t.pop(0)\nn=int(m)\nif len(set(t))==n:\n print("YES")\nelse:\n print("NO")\n', 't=input().split()\nn=int(t.pop(0))\nif len(set(t))==n:\n print("YES")\nelse:\n print("NO")', 't=input().split()\nm=t.pop(0)\nn=int(m)\nif len(set(t))==n:\n print("YES")\nelse:\n print("NO")', 'n=int(input())\nt=input().split()\nif len(set(t))==n:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s042581967', 's310734466', 's666196008', 's743890581', 's843572658', 's896698711', 's919649240', 's197489348']
[2940.0, 3060.0, 3060.0, 30160.0, 2940.0, 3060.0, 3060.0, 31156.0]
[17.0, 17.0, 17.0, 62.0, 17.0, 17.0, 17.0, 61.0]
[92, 157, 93, 86, 96, 91, 95, 90]
p02779
u089925107
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())\ncc = list(map(int,input().split()))\ndic = set()\nfor i in cc:\n if i in dic:\n print('NO')\n sys.exit()\n else:\n dic.append(i)\nprint('YES')\n\n ", "import sys\nN = int(input())\ncc = list(map(int,input().split()))\ndic = set()\nfor i in cc:\n if i in dic:\n print('NO')\n sys.exit()\n else:\n dic.add(i)\nprint('YES')"]
['Runtime Error', 'Accepted']
['s214279622', 's433090551']
[31056.0, 31012.0]
[71.0, 120.0]
[179, 170]
p02779
u090406054
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=int(input())\na=[int(input()) for i in range(n)]\nif len(a)==len(set(a)):\n print('Yes')\nelse:\n print('No')\n ", "n=int(input())\na=list(map(int,input().split()))\nA=set(a)\nif len(a)==len(A):\n print('Yes')\nelse:\n print('No')\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=int(input())\na=list(map(int,input().split()))\nA=set(a)\nif len(a)==len(A):\n print('No')\nelse:\n print('Yes')\n ", "n=int(input())\na=list(map(int,input().split()))\nif len(set(a))==len(a):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s008356350', 's020596931', 's294018159', 's532917410', 's806742528', 's558768301']
[26808.0, 8636.0, 26808.0, 25172.0, 26808.0, 31024.0]
[85.0, 29.0, 90.0, 83.0, 89.0, 91.0]
[109, 111, 113, 109, 113, 106]
p02779
u091217940
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\nfrom collections import Counter\nN=int(input())\nl=input().split()\nl=Counter(l)\nl=l.most_common()\nfor i in l:\n if i[1]==1:\n continue\n else:\n print('No')\n sys.exit()\nprint('yes')\n ", "import sys\nfrom collections import Counter\nN=int(input())\nl=input().split()\nl=Counter(l)\nl=l.most_common()\n\nc=len(l)\nd=0\n\nfor i in l:\n if i[1]==1:\n d+=1\nif d==c:\n print('Yes')\nelse:\n print('No')", "import sys\nfrom collections import Counter\nN=int(input())\nl=input().split()\nl=Counter(l)\nl=l.most_common()\n\nc=len(l)\nd=0\n\nfor i in l:\n if i[1]==1:\n d+=1\nif d==c:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s253177808', 's412388212', 's609311710']
[45644.0, 45644.0, 45644.0]
[164.0, 191.0, 185.0]
[222, 210, 210]
p02779
u092387689
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 itertools import combinations as comb\nn = int(input())\na = list(map(int,input().split()))\n\nisBad = False\nfor x,y in comb(a,2):\n if(x==y):\n isBad = True\n\nif(isBad):\n print('No')\nelse:\n print('Yes')", "n = int(input())\na = list(map(int,input().split()))\n\na.sort()\nisBad = False\npre = -1\nfor i in range(n):\n if(pre==a[i]):\n isBad=True\n break\n pre = a[i]\n\n\nif(isBad):\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s138906937', 's564695212']
[25548.0, 26808.0]
[2104.0, 187.0]
[217, 222]
p02779
u092646083
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()\nB = set(A)\nif len(B) == N:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = input().split()\nB = set(A)\nif len(B) == N:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = input().split()\nB = set(A)\nif len(B) == N:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s863600930', 's873457942', 's767248814']
[31156.0, 31156.0, 31156.0]
[74.0, 78.0, 76.0]
[98, 98, 98]
p02779
u094191970
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`.
['2\n10000000 10000000', "n=int(input())\na=list(map(int,input().split()))\nprint('YES' if len(set(a))==n else 'NO')"]
['Runtime Error', 'Accepted']
['s429970809', 's837712490']
[2940.0, 26808.0]
[17.0, 83.0]
[19, 88]
p02779
u094425865
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())\nsuuretu = list(map(int,input().split()))\nnn = frg = 0\nwhile nn <= n-2:\n mm = nn+1\n while mm <= n-1:\n if suuretu[nn] == suuretu[mm]:\n frg = 1\n print('NO')\n break\n else:\n mm +=1\n \n if nn >= n-1:\n print('YES')\n break\n else:\n nn += 1", "n = input()\nli = list(map(int,input().split()))\n\nif len(li) == len(set(li)):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s049707390', 's740684238']
[26804.0, 26808.0]
[2104.0, 84.0]
[340, 115]
p02779
u096294926
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()\nM = list(map(int,input().split()))\nX = set(M)\nY = len(X)\n\nif N == Y:\n print("YES")\n \nelse:\n print("NO")', 'N = input()\nM = list(map(int,input().split()))\nX = set(M)\nY = len(X)\n\nif N == Y:\n print("YES")\n \nelse:\n print("NO")', 'N = input()\nM = list(map(int,input().split()))\nX = set(M)\nY = len(X)\nif M == X:\n print("YES")\n\nelse:\n print("NO")', 'N = input()\nM = list(map(int,input().split()))\nprint(M)\nX = set(M)\nprint(X)\nY = len(X)\nZ = len(M)\nif Y == Z:\n print("YES")\n\nelse:\n print("NO")', 'N = input()\na = input()\nM = list(map(int, a.split()))\n\nX = set(M)\nY = len(X)\n\nif N == Y:\n print("YES")\nelse:\n print("NO")', 'N = input()\nM = list(map(int,input().split()))\nX = set(M)\nY = len(X)\nif N == Y:\n print("YES")\n\nelse:\n print("NO")', 'N = input()\na = input()\nM = list(map(int, a.split()))\n\nX = set(M)\nY = len(X)\n\nif N == Y:\n print("YES")\nelse:\n print("NO")', 'N = input()\nM = list(map(int,input().split()))\nX = set(M)\nY = len(X)\nZ = len(M)\nif Y == Z:\n print("YES")\n\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s082579234', 's089495264', 's147085883', 's177440255', 's613051176', 's650496876', 's697772800', 's609240059']
[25936.0, 26808.0, 25172.0, 33312.0, 28732.0, 26808.0, 28732.0, 25172.0]
[92.0, 93.0, 90.0, 144.0, 89.0, 92.0, 92.0, 90.0]
[124, 124, 119, 148, 127, 119, 127, 130]
p02779
u098165618
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 = input().split(' ')\n\nc = max(collections.Counter(A).values())\nif c = = 1:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "import collections\nN = int(input())\nA = input().split(' ')\n\nc = max(collections.Counter(A).values())\nif c == 1:\n\tprint('YES')\nelse:\n\tprint('NO')\n"]
['Runtime Error', 'Accepted']
['s463763379', 's979879523']
[3064.0, 39116.0]
[17.0, 79.0]
[146, 145]
p02779
u100277898
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")\n']
['Wrong Answer', 'Accepted']
['s393140405', 's967598501']
[26808.0, 26808.0]
[85.0, 84.0]
[113, 114]
p02779
u102275718
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\ninput = sys.stdin.readline\n\nn = int(input())\n*a, = map(int, input().split())\n\nif len(set(a)) == n:\n print('Yes')\nelse:\n print('No')", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\n*a, = map(int, input().split())\n\nif len(set(a)) == n:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s879988137', 's438793190']
[26808.0, 26156.0]
[92.0, 83.0]
[148, 148]
p02779
u104005543
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()))\nfor i in range(n - 1):\n for j in range(n - i - 2):\n if List[i] == List[i + j]:\n print('NO')\n exit()\n\nprint('YES')\n", "n = int(input())\nList = list(map(int, input().split()))\nfor i in range(n - 1):\n for j in range(n - i - 1):\n if List[i] == List[i + j]:\n print('NO')\n exit()\n\nprint('YES')", "n = int(input())\nList = list(map(int, input().split()))\n\nfor i in range(n - 1):\n for j in range(n - i - 1):\n if List[i] == List[i + j + 1]:\n ans = 'NO'\n\nprint(ans)ß", "n = int(input())\nList = list(map(int, input().split()))\nSorted = sorted(List)\nans = 'YES'\nfor i in range(n - 1):\n if Sorted[i] == Sorted[i + 1]:\n ans = 'NO'\n break\n\nprint(ans)"]
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s318661589', 's595626537', 's947265543', 's290565194']
[26680.0, 25172.0, 2940.0, 26808.0]
[68.0, 67.0, 19.0, 185.0]
[202, 201, 186, 192]
p02779
u106181248
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 collection\n\nn = int(input())\na = list(map(int, input().split()))\nc = collections.Counter(a)\n\nif c.most_common()[0][1] == 1:\n print("Yes")\nelse:\n print("No")', 'import collections\n\nn = int(input())\na = list(map(int, input().split()))\nc = collections.Counter(a)\n\nif c.most_common()[0][1] == 1:\n print("Yes")\nelse:\n print("No")', 'import collections\n\nn = int(input())\na = list(map(int, input().split()))\nc = collections.Counter(a)\n\nif c.most_common()[0][1] == 1:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s224616738', 's240708845', 's228396859']
[2940.0, 40136.0, 40136.0]
[18.0, 182.0, 173.0]
[169, 170, 170]
p02779
u106778233
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\nif len(seq) != len(set(seq)):\n print('NO')\nelse:\n print('YES')", "a=int(input())\nb=list(map(int, input().split()))\n\nif len(b) != len(set(b)):\n print('NO')\nelse:\n print('YES')"]
['Runtime Error', 'Accepted']
['s890640006', 's785413298']
[26808.0, 26804.0]
[68.0, 86.0]
[118, 114]
p02779
u107269063
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())\nl = list(map(int,input().split()))\n\nc = collections.Counter(l)\nif c.most_common()[0][1] > 1:\n print('No')\nelse:\n print('Yes')", "import collections\nN = int(input())\nl = list(map(int,input().split()))\n\nc = collections.Counter(l)\nif c.most_common()[0][1] > 1:\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s246283334', 's476633439']
[40136.0, 40136.0]
[209.0, 182.0]
[167, 167]
p02779
u108072608
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(input()) for _ in range(n)]\nA_set = set(A)\nif len(A_set) == n:\n print('YES')\nelse:\n print('NO')", "n = int(input())\nA = [int(a) for a in input().split()]\nA_set = set(A)\nif len(A_set) == n:\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s162893617', 's388497440']
[8644.0, 25932.0]
[29.0, 94.0]
[127, 128]
p02779
u115877451
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\na=int(input())\nb=list(map(str,input().split()))\nn=[]\nfor i in b:\n x=i.replace(' ',',')\n n.append(x)\nc=collections.Counter(n)\nn,values=zip(*c.most_common())\nd=list(values)\nprint(d)\nif d.count(1)==a:\n print('YES')\nelse:\n print('NO')", "import collections\na=int(input())\nb=list(map(str,input().split()))\nn=[]\nfor i in b:\n x=i.replace(' ',',')\n n.append(x)\nc=collections.Counter(n)\nn,values=zip(*c.most_common())\nd=list(values)\n\nif d.count(1)==a:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s879473091', 's674575574']
[62664.0, 62536.0]
[344.0, 357.0]
[261, 253]
p02779
u118760114
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()]\nd = []\np = 0\nfor i in range(N):\n d.append(A[i])\n if A[i] in d:\n p = 1\n break\nif p == 0:\n print("YES")\nelse:\n print("NO")\n', 'N = int(input())\nA = [int(x) for x in input().split()]\nA.sort()\np = 0\nfor i in range(N-1):\n if A[i] == A[i+1]:\n p = 1\n break\nif p == 0:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s125884998', 's831556169']
[25812.0, 25172.0]
[73.0, 190.0]
[202, 192]
p02779
u119947188
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())\nA = list(map(int,input().split()))\n\nA.sort()\ni = 0\nwhile i<N-1:\n if A[i]==A[i+1]:\n print('No')\n sys.exit()\n else:\n i = i+1\nprint('Yes')\n", "import sys\n\nN = int(input())\nA = list(map(int,input().split()))\n\nA.sort()\ni = 0\nwhile i<N-1:\n if A[i]==A[i+1]:\n print('NO')\n sys.exit()\n else:\n i = i+1\nprint('YES')"]
['Wrong Answer', 'Accepted']
['s152176816', 's167814036']
[26680.0, 26808.0]
[208.0, 211.0]
[192, 191]
p02779
u122495382
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\nl.sort()\n\nfor i in range(n-1):\n if l[i] == l[i + 1] :\n print("No")\n exit()\nprint("Yes")\n ', 'n = int(input())\nl = list(map(int, input().split()))\n\nl.sort()\n\nfor i in range(n-1):\n if l[i] == l[i + 1] :\n print("NO")\n exit()\nprint("YES")\n ']
['Wrong Answer', 'Accepted']
['s449618496', 's758615370']
[31032.0, 30908.0]
[131.0, 132.0]
[151, 151]
p02779
u123579949
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())\nfrom collections import Counter\nif max(Counter([int(x) for x in input().split()]).values())==1:\n print("Yes")\nelse:\n print("No")', 'from collections import Counter\nif max(Counter([int(x) for x in input().split()]).values())==1:\n print("Yes")\nelse:\n print("No")', 'N=int(input())\nfrom collections import Counter\nif max(Counter([int(x) for x in input().split()]).values())==1:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s654892950', 's719496463', 's049791027']
[35548.0, 9460.0, 35524.0]
[102.0, 32.0, 109.0]
[145, 130, 145]
p02779
u123745130
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()))\ndic_a={}\nfor i in range(len(lst)):\n if lst[i] in dic_a:\n dic_a[lst[i]]=1\n else:\n print("NO")\nelse:print("YES")', 'n=int(input())\nlst=list(map(int,input().split()))\ndic_a={}\nfor i in range(len(lst)):\n if lst[i] in dic_a:\n dic_a[lst[i]]=1\n else:\n print("NO")\n break\nelse:print("YES")', 'n=int(input())\nlst=list(map(int,input().split()))\ndic_a={}\nfor i in range(len(lst)):\n if lst[i] not in dic_a:\n dic_a[lst[i]]=1\n else:\n print("NO")\n break\nelse:print("YES")\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s255519908', 's256028105', 's249975344']
[26804.0, 26808.0, 33608.0]
[194.0, 70.0, 140.0]
[168, 178, 183]
p02779
u123849536
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`.
["#154c\nn = int(input())\na = [input() for _ in range(n)]\n\nif len(list(set(a))) != len(a):\n print('NO')\nelse:\n print('YES')", "#154c\nn = int(input())\na = list(input().split())\n\nif len(list(set(a))) != len(a):\n print('NO')\nelse:\n print('YES')"]
['Runtime Error', 'Accepted']
['s169685956', 's607749651']
[8640.0, 32692.0]
[22.0, 76.0]
[122, 116]
p02779
u125090409
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())\n\nprint('YNeos'[len(set(a))!=n::2])", "n = int(input())\na = map(int, input().split())\n\nprint('YNEOS'[len(set(a))!=n::2])"]
['Wrong Answer', 'Accepted']
['s584718544', 's685261364']
[35788.0, 35792.0]
[87.0, 87.0]
[81, 81]
p02779
u131267733
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\ncnt = set(a)\nprint(cnt)\nprint(len(cnt))\nif n == int(len(cnt)):\n print('YES')\nelse:\n print('NO')", "n=int(input())\na=list(input().split())\n\ncnt = set(a)\nif n == int(len(cnt)):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s296060358', 's007814818']
[37936.0, 32692.0]
[114.0, 75.0]
[137, 110]
p02779
u131881594
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())\ndic=Counter(a)\nfor val in dic.values():\n if val>=2:\n print("NO")\n exit()\nprint("YES")', 'from collections import Counter\nn=int(input())\na=list(map(int,input().split()))\ndic=Counter(a)\nfor val in dic.values():\n if val>=2:\n print("NO")\n exit()\nprint("YES")']
['Runtime Error', 'Accepted']
['s625634036', 's322795096']
[8968.0, 35948.0]
[29.0, 105.0]
[181, 182]
p02779
u131944095
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()))\nfor i in range(n):\n for j in range(i+1, n):\n if A[i]==A[j]:\n print('No')\n sys.exit()\nprint('Yes')", "import sys\nn = int(input())\nA = list(map(int, input().split()))\nset_A = set(A)\nif len(A) == len(set_A):\n print('Yes')\nelse:\n print('No')", "import sys\nn = int(input())\nA = list(map(int, input().split()))\nset_A = set(A)\nif len(A) == len(set_A):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s282776490', 's601510049', 's020340179']
[26808.0, 26808.0, 26800.0]
[2104.0, 92.0, 94.0]
[175, 138, 138]
p02779
u135116520
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=0\nfor i in range(N-1):\n for j in range(i+1,N):\n if all(A[i]!=A[j]):\n print("YES")\n else:\n print("NO")', 'N=int(input())\nA=list(map(int,input().split()))\ns=0\nfor i in range(N-1):\n for j in range(i+1,N):\nif all(A[i]!=A[j]):\n print("YES")\nelse:\n print("NO")', 'N=int(input())\nA=map(int,input().split())\nn=len(set(A))\nif N!=n:\n print("NO")\nelse:\n print("YES")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s344820338', 's506823864', 's536312665']
[26808.0, 2940.0, 36660.0]
[67.0, 17.0, 93.0]
[168, 152, 99]
p02779
u135265051
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())\n# b=input()\n# c=[]\n\n# c.append(a[i])\na = list(map(int,input().split()))\n#b = list(map(int,input().split()))\n\nc = {i for i in a} \n\nif a==s:\n print("YES")\nelse:\n print("NO") ', 's=int(input())\n# b=input()\n# c=[]\n\n# c.append(a[i])\na = list(map(int,input().split()))\n#b = list(map(int,input().split()))\ncount=0\nfor i in range(s):\n for k in range(s):\n if a[i]==a[k]:\n count+=1\n print(count)\n\nif count<=s:\n print("YES")\nelse:\n print("NO")', 's=int(input())\n# b=input()\n# c=[]\n\n# c.append(a[i])\na = list(map(int,input().split()))\n#b = list(map(int,input().split()))\n\nc = {i for i in a} \n\nif len(a)==len(c):\n print("YES")\nelse:\n print("NO") ']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s578228206', 's631047982', 's934732876']
[31128.0, 31028.0, 31064.0]
[104.0, 2234.0, 103.0]
[218, 315, 228]
p02779
u136279532
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(k) for k in input().split()]\n\nresult = True\n\nfor char in A:\n if(A.count(char) != 1):\n result = False\n break\n\nif (result == True):\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nA = [int(k) for k in input().split()]\n\nresult = True\n\n# for char in A:\n# if(A.count(char) != 1):\n# result = False\n# break\n\n# for j in range(i+1, N):\n# # print("A[i]= "+str(A[i])+", A[j]= "+str(A[j]))\n# if A[i] == A[j]:\n# result = False\nA.sort()\n\nfor i in range(N-1):\n if (A[i] == A[i+1]):\n result = False\n break\n\nif (result == True):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s651105144', 's181517150']
[25168.0, 25172.0]
[2104.0, 188.0]
[207, 479]
p02779
u136282556
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 copy\n\nN = int(input())\nlist1 = list(map(int, input().split()))\nlist2 = copy.copy(list1)\nlist3 = set(list1)\n\nx=len(list2)\ny=len(list3)\n\nif x==y:\n print('Yes')\nelse:\n print('No')\n", "import copy\n\nN = input()\nlist1 = list(map(int, input().split()))\nlist2 = copy.copy(list1)\nlist3 = set(list1)\n\nx=len(list2)\ny=len(list3)\n\nif x==y:\n print('Yes')\nelse:\n print('No')", "import copy\n\nN = int(input())\nlist1 = list(map(int, input().split()))\nlist2 = copy.copy(list1)\nlist3 = set(list1)\n\n\n\nx=len(list2)\ny=len(list3)\n\n\nif x==y:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s188469106', 's820561150', 's129070326']
[31836.0, 31884.0, 31820.0]
[97.0, 103.0, 99.0]
[190, 184, 192]
p02779
u136843617
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\ndef solve():\n N = int(input())\n A = set(map(int,input().split()))\n if N == len(A):\n print("Yes")\n else:\n print("No")\n\n\nif __name__ == \'__main__\':\n solve()\n', 'def solve():\n N = int(input())\n A = set(map(int,input().split()))\n if N == len(A):\n print("YES")\n else:\n print("NO")\n\n\nif __name__ == \'__main__\':\n solve()\n']
['Wrong Answer', 'Accepted']
['s857607910', 's010539413']
[36172.0, 36656.0]
[91.0, 92.0]
[216, 184]
p02779
u139282395
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 = input()\na = map(int, input().lower().split())\nif list(a) == list(set(a)):\n \tprint("YES")\nelse:\n \tprint("NO")\n', 's = input()\na = map(int, input().lower().split())\n\nif int(s) == len(set(a)):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s560051271', 's066625905']
[27064.0, 38580.0]
[74.0, 93.0]
[115, 112]
p02779
u140191608
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 len(c) == N:\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) == N:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s810435259', 's465525424']
[33996.0, 33996.0]
[108.0, 108.0]
[154, 154]
p02779
u145915236
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\nfrom sys import exit\n\nN = int(input())\nA = list(map(int,input().split()))\n\ncnt = Counter(A)\n\nfor i in cnt.values():\n if i != 1:\n print("No")\n exit(0)\n\nprint("Yes")', 'from collections import Counter\nfrom sys import exit\n\nN = int(input())\nA = list(map(int,input().split()))\n\ncnt = Counter(A)\n\nfor i in cnt.values():\n if i != 1:\n print("NO")\n exit(0)\n\nprint("YES")']
['Wrong Answer', 'Accepted']
['s891271492', 's044686937']
[35828.0, 35656.0]
[107.0, 103.0]
[212, 212]
p02779
u150272898
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())\narr=set(map(int,input().split())\nprint("YES" if n==len(arr) else "NO")', 'n=int(input())\narr=set(map(int,input().split()))\nprint("YES" if n==len(arr) else "NO")']
['Runtime Error', 'Accepted']
['s366109970', 's696974015']
[2940.0, 35788.0]
[17.0, 92.0]
[85, 86]
p02779
u150517577
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())\nnumbers = list(map(int,input().split()))\nnumbers = set(numbers)\nif N == len(numbers):\n print('Yes')\nelse :\n print('No')", "N = int(input())\nnumbers = list(map(int,input().split()))\nnumbers = set(numbers)\nif N == len(numbers):\n print('YES')\nelse :\n print('NO')"]
['Wrong Answer', 'Accepted']
['s766852521', 's195070769']
[26808.0, 26804.0]
[98.0, 88.0]
[142, 142]
p02779
u150664457
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())) \n\nList.sort()\n\nfor i in range(N-1):\n if List[i] == List[i+1]:\n result = 'NO'\n break\n \nprint(result)", "N = int(input()) \nList = list(map(int,input().split())) \n\nList.sort()\nresult = 'YES'\n\nfor i in range(N-1):\n if List[i] == List[i+1]:\n result = 'NO'\n break\n \nprint(result)"]
['Runtime Error', 'Accepted']
['s239577892', 's924653815']
[25172.0, 25172.0]
[185.0, 186.0]
[243, 258]
p02779
u152614052
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_set = set(input().split())\nif n == len(l_set):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl_set = set(input().split())\nif n == len(l_set):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s936008106', 's262738059']
[31156.0, 31152.0]
[75.0, 73.0]
[104, 104]
p02779
u153968927
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 = input().split()\nP = input().split()\nmax_sum = 0\nfor i in range(int(N)-int(K) + 1):\n sum = 0\n for k in range(i, i + int(K)):\n print(k)\n p = int(P[k])\n sum += (p / 2) + 0.5\n if max_sum < sum:\n max_sum = sum\nprint(float(max_sum))\n', "N = input()\nA = input().split()\na = []\nfor s in A:\n\ta.append(int(s))\nif len(set(a)) == len(a):\n print('YES')\nelse:\n print('NO')\n"]
['Runtime Error', 'Accepted']
['s673528472', 's395529923']
[3060.0, 39092.0]
[17.0, 113.0]
[253, 130]
p02779
u156383602
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()\na=[int(x) for x in input().split()]\nif a==list(set(a)):\n print("YES")\nelse:\n print("NO")', 'b=input()\na=sorted([int(x) for x in input().split()])\nc=0\nwhile True:\n if a[c]==a[c+1]:\n ANS=False\n break\n if c==len(a)-2:\n ANS=True\n break\n c+=1\nif ANS:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s901087058', 's651554528']
[25172.0, 25172.0]
[104.0, 226.0]
[104, 230]
p02779
u157232135
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 print("Yes" if n == len(set(map(int, input().split()))) else "No")\n \nif __name__ == \'__main__\':\n main()', 'n = int(input())\n print("Yes" if n == len(set(map(int, input().split()))) else "No")', 'def main():\n n = int(input())\n print("YES" if n == len(set(map(int, input().split()))) else "NO")\n \nif __name__ == \'__main__\':\n main()']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s485337226', 's736607231', 's425961757']
[36660.0, 2940.0, 36788.0]
[92.0, 18.0, 88.0]
[146, 87, 146]
p02779
u159144188
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 check(seq):\n return len(seq) != len(set(seq))\n\ndef main():\n N = int(input())\n A = list(map(int, input.split()))\n ans = check(A)\n if ans:\n print("NO")\n else:\n print("Yes")\nmain()', 'def check(seq):\n return len(seq) != len(set(seq))\n\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n ans = check(A)\n if ans:\n print("NO")\n else:\n print("YES")\nmain()']
['Runtime Error', 'Accepted']
['s352539565', 's159845547']
[9180.0, 30992.0]
[23.0, 93.0]
[195, 197]
p02779
u159994501
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 = 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']
['s978799090', 's489038374']
[26808.0, 26800.0]
[83.0, 84.0]
[118, 118]
p02779
u161712560
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())\ninList = list(map(int, input().split()))\n\ninList.sort()\n\nnoFlag = 0\n\nfor indx in range(len(inList) - 1):\n if inList[indx] == inList[indx + 1]:\n print("No")\n noFlag = 1\n break\n\nif noFlag == 0:\n print("Yes")', 'N = int(input())\ninList = list(map(int, input().split()))\n\ninList.sort()\n\nnoFlag = 0\n\nfor indx in range(len(inList) - 1):\n if inList[indx] == inList[indx + 1]:\n print("NO")\n noFlag = 1\n break\n\nif noFlag == 0:\n print("YES")']
['Wrong Answer', 'Accepted']
['s240288965', 's156978387']
[26808.0, 26808.0]
[177.0, 185.0]
[233, 233]
p02779
u163320134
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()\narr=list(map(int,input().split()))\narr=sorted(arr)\nfor i in range(n-1):\n if arr[i]==arr[i+1]:\n print('NO')\n break\nelse:\n print('YES')", "n=int(input())\narr=list(map(int,input().split()))\narr=sorted(arr)\nfor i in range(n-1):\n if arr[i]==arr[i+1]:\n print('NO')\n break\nelse:\n print('YES')"]
['Runtime Error', 'Accepted']
['s280415976', 's734136576']
[25168.0, 26676.0]
[151.0, 185.0]
[151, 156]
p02779
u163529815
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 return "No"\n else:\n return "Yes"\n\nN = int(input())\nA = input().split()\nprint(has_duplicates(A))\n', 'def has_duplicates(seq):\n if len(seq) != len(set(seq)):\n return "NO"\n else:\n return "YES"\n\nN = int(input())\nA = input().split()\nprint(has_duplicates(A))\n']
['Wrong Answer', 'Accepted']
['s163046064', 's956202390']
[30160.0, 30160.0]
[65.0, 64.0]
[173, 173]
p02779
u165368960
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")']
['Runtime Error', 'Accepted']
['s747300373', 's694989690']
[2940.0, 25936.0]
[17.0, 83.0]
[95, 95]
p02779
u168416324
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())\nlis=list(map(int,input().split()))\nout="Yes"\nfor i in range(n):\n for j in range(i+1,n):\n #print("{}{}".format(i,j))\n if lis[i]==lis[j]:\n out="No"\n break\n if out =="No":\n break\nprint(out)\n', 'n=int(input())\nlis=list(map(int,input().split()))\nout="Yes"\nfor i in range(n):\n for j in range(i+i,n):\n if lis[i]==lis[j]:\n out="No"\n break\n if out =="No":\n break\nprint(out)\n', 'n=int(input())\nli=sorted(list(map(int,input().split())))\nbef=-1\n\nfor i in li:\n if bef==i:\n print("NO")\n break\n bef=i\nelse:\n print("YES")\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s387239198', 's858352135', 's750005894']
[26804.0, 26804.0, 31104.0]
[2105.0, 67.0, 124.0]
[223, 192, 146]
p02779
u169702930
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 = dict()\nfor i in range(n):\n d.setdefault(a[i])\nif len(d) != n :\n print("No")\nelse:\n print("Yes")', 'n = int(input())\na = list(map(int, input().split()))\nd = dict()\nfor i in range(n):\n d.setdefault(a[i])\nif len(d) != n :\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s654615555', 's856126446']
[32848.0, 33612.0]
[131.0, 128.0]
[161, 161]
p02779
u173178698
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']
['s932143578', 's257301838']
[26808.0, 26800.0]
[85.0, 84.0]
[117, 117]
p02779
u174181999
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\nfor i in range(N-1):\n if A[i] == A[i+1]:\n print('No')\n exit()\n else:\n pass\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 else:\n pass\nprint('YES')"]
['Wrong Answer', 'Accepted']
['s718309627', 's892323538']
[26676.0, 25172.0]
[182.0, 183.0]
[161, 161]
p02779
u175207279
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 -*-\ndef main():\n StringN = input();\n listA = input();\n newlistA = sorted(listA);\n\n for i in range(int(StringN)-1):\n if newlistA[i] == newlistA[i+1]:\n print('No');\n return 0;\n else:\n print('Yes');\n return 0;\n\n\nmain();", "# -*- coding: utf-8 -*-\ndef main():\n listA = input();\n newlistA = sorted(listA);\n\n for i in range(len(newlistA)-1):\n if newlistA[i] == newlistA[i+1]:\n print('No');\n return 0;\n else:\n print('Yes');\n return 0;\n\n\nmain();\n", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input();\n newlistA = listA.split();\n duplicateA = set(newlistA);\n\n if int(StringN) != len(newlistA):\n print('No');\n return 0;\n if int(StringN) == len(duplicateA):\n print('Yes');\n else :\n print('No');\n\n\nmain();\n", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input();\n newlistA = sorted(listA);\n\n for i in range(len(newlistA)-1):\n if newlistA[i] == newlistA[i+1]:\n print('No');\n return 0;\n else:\n print('Yes');\n return 0;\n\n\nmain();", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input();\n newlistA = sorted(listA);\n\n for i in range(int(StringN)-1):\n if newlistA[i] == newlistA[i+1]:\n print('No');\n return 0;\n print('Yes');\n\n\nmain();\n", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input();\n newlistA = listA.split();\n duplicateA = set(newlistA);\n\n if int(StringN) == len(duplicateA):\n print('Yes');\n else :\n print('No');\n\n\nmain();\n", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input().split();\n lsitA.sort();\n\n# print(newlistA);\n\n for i in range(int(StringN)-1):\n# print(newlistA[i]);\n# print(newlistA[i+1]);\n if lsitA[i] == lsitA[i+1]:\n print('No');\n# print (i)\n return 0;\n print('Yes');\n\n\nmain();", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input().split();\n newlistA = sorted(listA);\n# print(newlistA);\n\n for i in range(int(StringN)-1):\n# print(newlistA[i]);\n# print(newlistA[i+1]);\n if newlistA[i] == newlistA[i+1]:\n print('No');\n return 0;\n print('Yes');\n\n\nmain();\n", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input();\n newlistA = listA.split();\n duplicateA = set(newlistA);\n\n if int(StringN) != len(newlistA):\n print('No');\n return 0;\n if int(StringN) == len(duplicateA):\n print('Yes');\n else :\n print('No');\n\nmain();", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input().split();\n listA.sort();\n\n# print(newlistA);\n\n for i in range(int(StringN)-1):\n# print(newlistA[i]);\n# print(newlistA[i+1]);\n if listA[i] == listA[i+1]:\n print('No');\n# print (i)\n return 0;\n print('Yes');\n\n\nmain();\n", "# -*- coding: utf-8 -*-\ndef main():\n StringN = input();\n listA = input().split();\n listA.sort();\n\n# print(newlistA);\n\n for i in range(int(StringN)-1):\n# print(newlistA[i]);\n# print(newlistA[i+1]);\n if listA[i] == listA[i+1]:\n print('NO');\n# print (i)\n return 0;\n print('YES');\n\n\nmain();\n"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s054734147', 's203833378', 's206908212', 's260458756', 's573729512', 's618755497', 's672405254', 's684535799', 's696640211', 's985075723', 's184037411']
[30236.0, 3060.0, 33076.0, 31752.0, 32136.0, 32084.0, 19160.0, 20792.0, 33080.0, 20796.0, 20796.0]
[388.0, 17.0, 64.0, 390.0, 390.0, 63.0, 36.0, 190.0, 63.0, 192.0, 188.0]
[306, 285, 334, 307, 263, 247, 388, 353, 332, 389, 389]
p02779
u175590965
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 n = len(set(a)):\n print("Yes")\nelse:\n print("No")', 'n =int(input())\na = list(map(int,input().split()))\nif n == len(set(a)):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\n\na = list(map(int,input().split())))\nif n ==len(set(a)):\n print("YES")\nelse:\n print("NO")', 'n = int(input()\n\na = list(map(int,input().split())))\nif n ==len(set(a)):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na = list(map(int,input().split()))\nif set(a) == n:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\n\na = list(map(int,input().split()))\nif n ==len(set(a)):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s188094567', 's524472739', 's626143750', 's775085100', 's846083426', 's250598300']
[8844.0, 31052.0, 9004.0, 8948.0, 26808.0, 31076.0]
[24.0, 91.0, 27.0, 24.0, 86.0, 87.0]
[109, 110, 112, 111, 106, 111]
p02779
u176165272
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 = input().split()\nif N == set(S):\n print("YES")\nelse:\n print("NO")\n ', 'N = int(input())\nS = input().split()\nif N == len(set(S)):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s420055887', 's384545073']
[31152.0, 31152.0]
[64.0, 61.0]
[96, 92]
p02779
u177388368
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=[]\na=list(map(int,input().split()))\n\na.sort()\n\nans="Yes"\nfor i in range(n-1):\n if a[i]==a[i+1]:\n ans="No"\n break\nprint(ans)', 'n=int(input())\na=[]\na=list(map(int,input().split()))\n\na.sort()\n\nans="YES"\nfor i in range(n-1):\n if a[i]==a[i+1]:\n ans="NO"\n break\nprint(ans)']
['Wrong Answer', 'Accepted']
['s215045496', 's602136616']
[26808.0, 26812.0]
[184.0, 189.0]
[157, 157]
p02779
u178079174
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()))\nif len(set(LI)) == N:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nLI = list(map(int,input().split()))\nif len(set(LI)) == N:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s787432160', 's284082711']
[26812.0, 25452.0]
[82.0, 84.0]
[113, 113]
p02779
u178110837
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\n# N=6\n# A = [4,1,3,1,6,2]\n\n\nif N != len(set(A)):\n print('YES')\nelse:\n print('NO')\n", "N = int(input())\nA = list(int,input().split())\n\nif N != len(set(A)):\n print('YES')\nelse:\n print('NO')\n", "N = int(input())\nA = [int(x) for x in input().split()]\n\n# N=6\n# A = [4,1,3,1,6,2]\n\n\nif N == len(set(A)):\n print('YES')\nelse:\n print('NO')\n\n\n"]
['Wrong Answer', 'Runtime Error', 'Accepted']
['s020616394', 's663995962', 's936717107']
[25172.0, 20796.0, 25172.0]
[90.0, 35.0, 90.0]
[144, 108, 146]
p02779
u179335173
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`.
['num = input()\nlist = list(map(int,input().split()))\nflg = False\nfor i in list:\n if list.count(i) >= 2:\n \tflg = True\n \nif flg:\n print("Yes")\nelse:\n print("No")\n', 'num = input()\nlist = list(map(int,input().split()))\nflg = False\nfor i in list:\n if list.count(i) >= 2:\n\tflg = True\n\tbreak\nprint("NO") if flg else print("YES")\n', 'list = list(input().split())\n', 'num = input()\nlist = list(map(int,input().split()))\nlist2 = set(list) \nprint("NO") if len(list) == len(list2) else print("YES")\n', 'num = input()\nlist = list(map(int,input().split()))\nflg = False\nfor i in list:\n if list.count(i) >= 2:\n \tflg = True\n \nif flg:\n print("No")\nelse:\n print("Yes")\n', 'num = input()\nlist = list(map(int,input().split()))\nlist2 = set(list) \nprint("YES") if len(list) == len(list2) else print("NO")\n']
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s323441863', 's532618027', 's586671956', 's633402831', 's697764937', 's208256383']
[26808.0, 2940.0, 2940.0, 26800.0, 26808.0, 25936.0]
[2104.0, 17.0, 17.0, 91.0, 2104.0, 93.0]
[167, 161, 29, 128, 167, 128]
p02779
u183432736
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\nintLen=int(input())\nintList=sorted(list(map(int,input().split())))\n\nresult="Yes"\n\n\n\nfor i in range(len(intList)-1):\n if intList[i]==intList[i+1]:\n result="No"\n\n\nprint(result)\n\n ', '\n\nintLen=int(input())\nintList=sorted(list(map(int,input().split())))\n\nresult="YES"\n\n\n\nfor i in range(len(intList)-1):\n if intList[i]==intList[i+1]:\n result="NO"\n\n\nprint(result)\n\n ']
['Wrong Answer', 'Accepted']
['s931977760', 's431334271']
[26808.0, 26808.0]
[198.0, 181.0]
[263, 263]
p02779
u183657342
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_a = set(a)\nif n == len(s_a):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int,input().split()))\ns_a = set(a)\n\nif n == len(s_a):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s103240514', 's663656702']
[26808.0, 25172.0]
[98.0, 91.0]
[121, 122]
p02779
u183976155
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()))\nans = "YES"\nfor i in range (len(A)):\n for j in range(i, len(A)):\n if A[i] == A[j]:\n ans = "NO"\nprint(ans)', 'N = input()\nA = sorted(list(map(int,input().split())))\nans = "YES"\nfor i in range (1,len(A)):\n if A[i] == A[i-1]:\n ans = "NO"\nprint(ans)']
['Wrong Answer', 'Accepted']
['s242083778', 's081245674']
[25932.0, 26808.0]
[2105.0, 192.0]
[173, 146]
p02779
u186729829
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 = int(input())\na = list(map(int, input().split()))\n\na_dict = collections.Counter(a)\n\nif max(a_dict.values()) > 1:\n print('No')\nelse:\n print('Yes')", "import collections\n\nn = int(input())\na = list(map(int, input().split()))\n\na_dict = collections.Counter(a)\n\nif max(a_dict.values()) > 1:\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s664580585', 's827993221']
[33996.0, 33996.0]
[114.0, 111.0]
[174, 174]
p02779
u188827677
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 = list(set(a))\n\nif sorted(a) == sorted(b):\n print('Yes')\nelse:\n print('No')", '# -*- coding:utf-8 -*-\nn = int(input())\nnumbers = []\n\nfor i in input().split():\n numbers.append(i)\n\nif set(numbers) == numbers:\n print("Yes")\nelse:\n print("No")\n ', '# -*- coding:utf-8 -*-\nn = int(input())\nnumbers = []\n\nfor i in map(int,input().split()):\n numbers.append(i)\n\na = sorted(list(set(numbers)))\nb = sorted(numbers)\n \nif a == b:\n print("Yes")\nelse:\n print("No")\n', 'n = int(input())\na = list(map(int, input().split()))\n\nb = list(set(a))\nif len(a) == len(b):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s029958900', 's270575926', 's751638184', 's872624319']
[26808.0, 31152.0, 25936.0, 25172.0]
[253.0, 83.0, 289.0, 93.0]
[133, 166, 210, 126]
p02779
u189326411
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()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(lst)==True:\n print("No")\nelse:\n print("Yes")\n', 'n = int(input())\nlst = list(map(int, input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(lst)==True:\n print("NO")\nelse:\n print("YES")\n']
['Wrong Answer', 'Accepted']
['s065072317', 's871295818']
[26808.0, 25936.0]
[93.0, 86.0]
[188, 188]
p02779
u189479417
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()\nSET_A = set(A)\nprint(A)\nprint(SET_A)\nif len(A)==len(SET_A):\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA = list(input())\nSET_A = set(A)\nif len(A)==len(SET_A):\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA = input().split()\nSET_A = set(A)\nif len(A)==len(SET_A):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s792397680', 's984421024', 's327660834']
[39600.0, 22844.0, 31152.0]
[129.0, 83.0, 75.0]
[135, 111, 113]
p02779
u193222738
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)\nif len(a) == len(b):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s356443066', 's264176845']
[26808.0, 26804.0]
[90.0, 92.0]
[119, 119]
p02779
u195210605
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()))\ndic = {}\nprint(len(A))\nj = True\n\nfor i in range(0, len(A)):\n if str(A[i]) in dic:\n print("NO")\n j = False\n break\n else:\n dic.setdefault(str(A[i]), A[i])\n\nif j:\n print("YES")\n\n', 'n = int(input())\nA = list(map(int, input().split()))\ndic = {}\nj = True\n\nfor i in range(0, len(A)):\n if str(A[i]) in dic:\n print("NO")\n j = False\n break\n else:\n dic.setdefault(str(A[i]), A[i])\n\nif j:\n print("YES")\n\n']
['Wrong Answer', 'Accepted']
['s907921148', 's942097665']
[43556.0, 43428.0]
[252.0, 252.0]
[243, 229]
p02779
u196507615
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())\narr=[int(x) for x in input().split()]\narr1=set(arr)\nif arr1==arr:\n print("YES")\nelse:\n print("NO")', 'n=int(input())\narr=[int(x) for x in input().split()]\nl=set(arr)\nl=list(l)\nl.sort()\narr.sort()\nif arr==l:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s299941674', 's814850278']
[25172.0, 25936.0]
[96.0, 257.0]
[115, 139]
p02779
u197955752
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\n\nN = int(input())\nA = [int(x) for x in input().split()]\n\nC = dict(Counter(A))\nfor a in C:\n if C[a] > 1:\n print('No')\n sys.exit()\nprint('Yes')", "from collections import Counter\nimport sys\nN = int(input())\nA = [int(x) for x in input().split()]\n\nC = dict(Counter(A))\nfor a in C:\n if C[a] > 1:\n print('NO')\n sys.exit()\nprint('YES')"]
['Wrong Answer', 'Accepted']
['s616153844', 's900873278']
[40136.0, 40140.0]
[148.0, 156.0]
[201, 200]
p02779
u198062737
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()\nsame = False\nfor i in range(N - 1):\n if A[i] == A[i + 1]:\n same |= True\nprint(\'YES\' if same else \'NO\')', 'N = int(input())\nA = list(map(int, input().split(" ")))\nA.sort()\nsame = False\nfor i in range(N - 1):\n if A[i] == A[i + 1]:\n same |= True\nprint(\'NO\' if same else \'YES\')\n']
['Wrong Answer', 'Accepted']
['s953470084', 's243999250']
[25936.0, 26808.0]
[182.0, 186.0]
[171, 172]
p02779
u201387466
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()))\nmax = 0\nfor i in range(N-K+1):\n s = 0\n for j in range(i,i+K):\n s += p[j]\n if s > max:\n max = s\nprint((max+K)/2)', 'N = int(input())\nc = 0\nA = list(map(int,input().split()))\nans = {}\nfor i in range(N):\n a = A[i]\n if a not in ans:\n ans[a] = 1\n else:\n c = 1\n break\nif c == 0:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nc = 0\nA = list(map(int,input().split()))\nans = {}\nfor i in range(N):\n a = A[i]\n if a not in ans:\n ans[a] = 1\n else:\n c = 1\n break\nif c == 0:\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s116976974', 's255363955', 's965348173']
[3060.0, 33612.0, 32944.0]
[17.0, 126.0, 128.0]
[200, 226, 227]
p02779
u201928947
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())\nfor i in range(n):\n for k in range(i+1,n):\n if a[i] == a[k]:\n print("No")\n exit()\nprint("Yes")', 'n = int(input())\na = list(input().split())\nif n == len(list(set(a))):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s183103603', 's707268575']
[20796.0, 32692.0]
[2106.0, 72.0]
[151, 104]
p02779
u207137484
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()))\nif len(list) == len(set(list)):\n\tprint("Yes")\nelse:\n\tprint("No")', 'n = int(input())\nlist = list(map(int, input().split()))\nif len(list) == len(set(list)):\n\tprint("YES")\nelse:\n\tprint("NO")']
['Wrong Answer', 'Accepted']
['s852169558', 's160196311']
[25172.0, 26812.0]
[88.0, 84.0]
[120, 120]
p02779
u207326980
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\na.sort()\n\nfor i in range(1,len(a)):\n if(a[i]==a[i-1]):\n print('No')\n break\n \nelse: print('Yes')", "n = int(input())\na = [ int(x) for x in input().split()]\n \na.sort()\n \nfor i in range(1,len(a)):\n if(a[i]==a[i-1]):\n print('NO')\n break\n \nelse: print('YES')"]
['Wrong Answer', 'Accepted']
['s526744451', 's530506289']
[25168.0, 25168.0]
[189.0, 186.0]
[162, 164]
p02779
u209631375
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 pairwise_distinct():\n n = int(input())\n k = []\n for i in range(0,n):\n k.append(int(input()))\n if (len(set(k)) == len(k)):\n return "YES"\n else:\n return "NO"\n\n return k\n \n \n\nprint(pairwise_distinct())', 'def pairwise_distinct():\n n = int(input())\n k = list(input().split()) #input based on n\n if not len(k) == n:\n return "==== pleas input based on n times in one line ===="\n else:\n if (len(set(k)) == len(k)):\n return "YES"\n else:\n return "NO"\n\nprint(pairwise_distinct())']
['Runtime Error', 'Accepted']
['s830056029', 's433834646']
[8640.0, 31056.0]
[29.0, 61.0]
[255, 322]
p02779
u211805975
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 Distinct or not\nn = int(input())\na = list(map(int,input().split())\nb = set(a)\n\nif len(a) == b:\n print('YES')\nelse:\n print('NO')", "#154 Distinct or not\nn = int(input())\na = list(map(int,input().split()))\nb = len(set(a))\n\nprint(len(a),b)\n\nif len(a) == b:\n print('YES')\nelse:\n print('NO')", "#154 Distinct or not\nn = int(input())\na = list(map(int,input().split()))\nb = set(a)\n\nif len(a) == b:\n print('YES')\nelse:\n print('NO')", "#154 Distinct or not\nn = int(input())\na = list(map(int,input().split()))\nb = len(set(a))\n\nif len(a) == b:\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s616611051', 's715509498', 's921169177', 's730457166']
[2940.0, 26808.0, 25936.0, 25172.0]
[17.0, 85.0, 95.0, 84.0]
[143, 161, 139, 144]
p02779
u212786022
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 = input()\nA = list(map(int, input().split()))\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s636445195', 's886272636']
[25172.0, 26808.0]
[93.0, 87.0]
[112, 112]
p02779
u214561383
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\nn = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 1\ni_before = a[0]\nfor i in a:\n ans *= (i - i_before)\n i_before=i\nif i ==0:\n print('No')\nelse:\n print('Yes')", "n = int(input())\na = list(map(int, input().split()))\nimport collections\na_c = collections.Counter(a)\nif sum(a_c.values()) == len(a_c.values()):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s616455719', 's295727375']
[26804.0, 33036.0]
[183.0, 110.0]
[199, 182]
p02779
u214864255
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\n if i==N-2:\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\n if i==N-2:\n print("YES")']
['Wrong Answer', 'Accepted']
['s632669831', 's388064489']
[31048.0, 30852.0]
[140.0, 143.0]
[168, 168]
p02779
u215286521
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 math import floor,ceil,sqrt,factorial,log\nfrom collections import Counter, deque\nfrom functools import reduce\nimport numpy as np\ndef S(): return input()\ndef I(): return int(input())\ndef MS(): return map(str,input().split())\ndef MI(): return map(int,input().split())\ndef FLI(): return [int(i) for i in input().split()]\ndef LS(): return list(MS())\ndef LI(): return list(MI())\ndef LLS(): return [list(map(str, l.split() )) for l in input()]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef LLSN(n: int): return [LS() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\n\nn = I()\n\nA = FLI()\n\ncnt = Counter(A)\nflg = False\nfor a in A:\n if A.count(a) > 1:\n flg = True\n\nif not flg:\n print("Yes")\nelse:\n print("No")\n', 'from math import floor,ceil,sqrt,factorial,log\nfrom collections import Counter, deque\nfrom functools import reduce\nimport numpy as np\ndef S(): return input()\ndef I(): return int(input())\ndef MS(): return map(str,input().split())\ndef MI(): return map(int,input().split())\ndef FLI(): return [int(i) for i in input().split()]\ndef LS(): return list(MS())\ndef LI(): return list(MI())\ndef LLS(): return [list(map(str, l.split() )) for l in input()]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef LLSN(n: int): return [LS() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\n\nn = I()\n\nA = FLI()\nprint(A)\n\ncnt = Counter(A)\nflg = False\nfor a in A:\n if A.count(a) > 1:\n flg = True\n\nif not flg:\n print("Yes")\nelse:\n print("No")', 'from math import floor,ceil,sqrt,factorial,log\nfrom collections import Counter, deque\nfrom functools import reduce\nimport numpy as np\ndef S(): return input()\ndef I(): return int(input())\ndef MS(): return map(str,input().split())\ndef MI(): return map(int,input().split())\ndef FLI(): return [int(i) for i in input().split()]\ndef LS(): return list(MS())\ndef LI(): return list(MI())\ndef LLS(): return [list(map(str, l.split() )) for l in input()]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef LLSN(n: int): return [LS() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\n\nn = I()\n\nA = FLI()\n\nflg = len(set(A)) == n\n\nprint("YES" if flg else "NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s042006821', 's926484256', 's399055362']
[41872.0, 44528.0, 34200.0]
[2110.0, 2109.0, 225.0]
[756, 764, 681]
p02779
u221580805
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())\nnums = list(map(int, input().split()))\nnum_set = set(nums)\nif len(nums) == len(num_set):\n print('Yes')\nelse:\n print('No')", "n = int(input())\nnums = list(map(int, input().split()))\nnum_set = set(nums)\nif len(nums) == len(num_set):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s294760351', 's386083662']
[25936.0, 26800.0]
[92.0, 92.0]
[140, 140]
p02779
u222668979
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\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\n\nlen_a = len(a)\nset_a = len(set(a))\n\nif len_a == set_a:\n print('Yes')\nelse:\n print('No')\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\n\nlen_a = len(a)\nset_a = len(set(a))\n\nif len_a == set_a:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s802721125', 's288334467']
[26808.0, 25684.0]
[82.0, 85.0]
[187, 187]
p02779
u223555291
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\na=int(input())\nb=list(map(int,input().split()))\nfor i in range(a):\n for j in range(1,a):\n if b[i]==b[j]:\n print('NO')\n sys.exit()\nprint('YES')", "import sys\na=int(input())\nb=list(map(int,input().split()))\nc=[]\nfor i in range(a):\n c+=b[i]\n for i in range(len(c)):\n if b[i]==c[i]:\n print('NO')\n sys.exit()\nprint('YES')", "import sys\na=int(input())\nb=list(map(int,input().split()))\nc=[]\nfor i in range(a):\n c+=str(b[i])\n for i in range(len(c)):\n if int(c[i+1])==b[i]:\n print('YES')\n sys.exit()\nprint('NO')\n \n ", "a=int(input())\nb=list(map(int,input().split()))\nd=len(b)\nc=set(b)\nif len(c)==d:\n print('NO')\nelse:\n print('YES')", "import sys\na=int(input())\nb=list(map(int,input().split()))\nc=[]\nfor i in range(a):\n c+=str(b[i])\n for i in range(len(c)):\n if i==len(c)-1:\n break\n if int(c[i+1])==b[i]:\n print('YES')\n sys.exit()\nprint('NO')\n \n ", "a=int(input())\nb=list(map(int,input().split()))\nd=len(b)\nc=len(set(b))\nif c==d:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s097456338', 's210231725', 's419221465', 's699388293', 's923943370', 's796419172']
[26808.0, 26808.0, 25172.0, 26808.0, 26808.0, 26808.0]
[90.0, 68.0, 68.0, 92.0, 2104.0, 83.0]
[167, 185, 209, 114, 241, 115]
p02779
u224007104
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\niranai =input()\nl = input()\nprint(has_duplicates(l))\n', 'def has_duplicates(seq):\n return len(seq) == len(set(seq))\n\n\niranai =input()\nl = input()\nprint(has_duplicates(l))\n', 'def has_duplicates(seq):\n return len(seq) == len(set(seq))\n\niranai =input()\nl = input()\nprint(has_duplicates(l))', 'def has_duplicates(seq):\n return len(seq) == len(set(seq))\n\niranai =input()\nl = input()\nif has_duplicates(l)== "TRUE":\n\tprint("YES")\nelse:\n \tprint("NO")\n', 'def has_duplicates(seq):\n return len(seq) == len(set(seq))\n\n\niranai =input()\nl = input()\naa = l.split(sep=" ")\nif has_duplicates(aa):\n print("YES")\nelse:\n print("NO")\n\n\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s032610487', 's298453309', 's329113311', 's863611190', 's511699476']
[7004.0, 8640.0, 8352.0, 7004.0, 32332.0]
[72.0, 64.0, 62.0, 64.0, 68.0]
[121, 122, 120, 162, 186]
p02779
u224119985
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=set(a)\nif len(a)==len(A):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\na=list(map(int,input().split()))\nA=set(a)\nif n==len(A):\n print("Yes")\nelse:\n print("No")', "n=int(input())\na=list(map(int,input().split()))\nans='Yes'\nfor i in range(1,n):\n for j in range(i):\n if a[i]==a[j]:\n ans='No'\n break\nprint(ans)", 'n=int(input())\na=list(map(int,input().split()))\nA=set(a)\nif len(a)==len(A):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\na=list(map(int,input().split()))\nA=set(a)\nif n==len(A):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s325897913', 's567518499', 's662901996', 's908334247', 's722296515']
[25168.0, 26808.0, 26804.0, 25172.0, 26800.0]
[90.0, 89.0, 2105.0, 90.0, 95.0]
[114, 109, 174, 114, 109]
p02779
u224522483
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 solve():\n N = int(input())\n array = list(map(int, input().split()))\n if array == list(set(array)):\n print("YES")\n else:\n print("NO")\n\nsolve()', 'def solve():\n N = int(input())\n array = sorted(map(int, input().split()))\n for index in range(1, N):\n if array[index] == array[index - 1]:\n print("NO")\n return\n print("YES")\nsolve()']
['Wrong Answer', 'Accepted']
['s095237083', 's664955176']
[25172.0, 25936.0]
[91.0, 161.0]
[171, 222]
p02779
u225388820
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 len(set(map(int,input().split())))==n:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nif len(set(map(int,input().split())))==n:\n print("No")\nelse:\n print("Yes")\n', 'n=int(input())\nb=len(set((map(int,input().split()))))\nif n==b:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s329981029', 's869593797', 's101698041']
[35788.0, 36660.0, 36660.0]
[99.0, 84.0, 87.0]
[95, 96, 101]
p02779
u227907942
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())\na.sort()\nflag = True\nfor i in range(1,N):\n if a[i]==a[i-1]:\n print('No')\n flag=False\n break\nif flag ==True:\n print('Yes')", "N,*a = map(int,open(0).read().split())\na.sort()\nflag = True\nfor i in range(1,N):\n if a[i]==a[i-1]:\n print('NO')\n flag=False\n break\nif flag ==True:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s932795386', 's060111946']
[31560.0, 31572.0]
[128.0, 128.0]
[171, 171]
p02779
u230900948
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`.
['if __name__ == "__main__":\n N = int(input())\n A = list(map(int, input().split()))\n \nf len(set(A)) == len(A):\n print(\'Yes\')\nelse:\n print(\'No\')', 'if __name__ == "__main__":\n N = int(input())\n A = list(map(int, input().split()))\n\nif len(set(A)) == N:\n print(\'Yes\')\nelse:\n print(\'No\')', 'if __name__ == "__main__":\n N = int(input())\n A = list(map(int, input().split()))\n \nif len(set(A)) == len(N):\n print(\'Yes\')\nelse:\n print(\'No\')', 'if __name__ == "__main__":\n N = int(input())\n A = list(map(int, input().split()))\n \nif len(A) == N:\n print(\'Yes\')\nelse:\n print(\'No\')', 'if __name__ == "__main__":\n N = int(input())\n A = list(map(int, input().split()))\n \nif len(set(A)) == N:\n print(\'Yes\')\nelse:\n print(\'No\')', 'if __name__ == "__main__":\n N = int(input())\n A = list(map(int, input().split()))\nif len(set(A)) == N:\n print(\'YES\')\nelse:\n print(\'NO\')']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s012567980', 's086512472', 's276096657', 's515368655', 's724700293', 's437118598']
[2940.0, 26804.0, 25936.0, 26808.0, 26812.0, 26800.0]
[17.0, 84.0, 84.0, 65.0, 83.0, 82.0]
[154, 148, 155, 145, 150, 147]