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
p02778
u753092134
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['g=str(input())\nprint("x"*len(s))', 'g=str(input())\nprint("x"*len(g))\n']
['Runtime Error', 'Accepted']
['s567881413', 's012254617']
[2940.0, 2940.0]
[17.0, 17.0]
[32, 33]
p02778
u755313517
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s=input()\ns=list(s)\nprint("X"*len(s))', 's=input()\ns=list(s)\nprint("x"*len(s))']
['Wrong Answer', 'Accepted']
['s300403348', 's375349361']
[2940.0, 2940.0]
[17.0, 17.0]
[37, 37]
p02778
u768559443
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s=input()\nans=""\n\nfor i in range(len(a)):\n\tans+="x"\n\nprint(ans)', 's=input()\nans=""\n\nfor i in range(len(s)):\n\tans+="x"\n\nprint(ans)']
['Runtime Error', 'Accepted']
['s669070553', 's342510090']
[2940.0, 3064.0]
[17.0, 17.0]
[63, 63]
p02778
u772588522
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s = input()\n\nprint(x * len(s))', "s = input()\n \nprint('x' * len(s))"]
['Runtime Error', 'Accepted']
['s750283941', 's968123259']
[2940.0, 2940.0]
[17.0, 17.0]
[30, 33]
p02778
u774985302
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['A = input()\nB = len(A)\nprint(x*B)', 'A = input()\nB = len(A)\nprint("x"*B)']
['Runtime Error', 'Accepted']
['s635701393', 's738801884']
[3064.0, 2940.0]
[18.0, 18.0]
[33, 35]
p02778
u777241657
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["s=input()\nans=''\nfor _ in len(s):\n ans+='x'", "s=input()\nans=''\nfor _ in s:\n ans+='x'\nprint(ans)"]
['Runtime Error', 'Accepted']
['s208838474', 's911516923']
[2940.0, 2940.0]
[17.0, 17.0]
[44, 50]
p02778
u779327980
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S = input()\n\nl = len(S)\nK = ""\nfor x in l:\n K += x\n \nprint(K)', 'S = len(input())\nprint("x" * S)']
['Runtime Error', 'Accepted']
['s628487855', 's810823508']
[2940.0, 2940.0]
[20.0, 18.0]
[63, 31]
p02778
u796649186
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['def areDistinct(arr) : \n \n n = len(arr) \n \n s = set() \n for i in range(0, n): \n s.add(arr[i]) \n \n\n return (len(s) == len(arr)) \n \n\nN = int(input())\nS = [int(x) for x in input().split()]\n \nif (areDistinct(S)): \n print("YES") \n \nelse : \n print("NO")', "S = input()\nprint('x'*len(S))"]
['Runtime Error', 'Accepted']
['s086237094', 's599168175']
[3060.0, 2940.0]
[18.0, 17.0]
[286, 29]
p02778
u798260206
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s = input()\nS = len(s)\n\nprint(x*S)', 's = input()\nS = len(s)\n\nprint("x"*S)']
['Runtime Error', 'Accepted']
['s314903497', 's909637999']
[2940.0, 2940.0]
[17.0, 17.0]
[34, 36]
p02778
u810066979
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['n=int(input())\na=list(map(int,input().split()))\na.sort()\nfor i in range(n-1):\n\tif a[i]==a[i+1]:\n\t\tprint("NO")\n\t\tbreak\nelse:\n\tprint("YES")', 's=input()\nprint("x"*len(s))\n']
['Runtime Error', 'Accepted']
['s587841195', 's133872762']
[3060.0, 2940.0]
[17.0, 17.0]
[137, 28]
p02778
u810378370
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["s = str(input()).lower()\ns.translate(str.maketrans({'a': 'x', 'b': 'x', 'c': 'x', 'd': 'x', 'e': 'x', 'f': 'x', 'g': 'x', 'h': 'x', 'i': 'x', 'j': 'x', 'k': 'x', 'l': 'x', 'm': 'x', 'n': 'x', 'o': 'x', 'p': 'x', 'q': 'x', 'r': 'x', 's': 'x', 't': 'x', 'u': 'x', 'v': 'x', 'w': 'x', 'y': 'x', 'z': 'x'}))\nprint(s)", "s = str(input()).lower()\nresult = s.translate(str.maketrans({'a': 'x', 'b': 'x', 'c': 'x', 'd': 'x', 'e': 'x', 'f': 'x', 'g': 'x', 'h': 'x', 'i': 'x', 'j': 'x', 'k': 'x', 'l': 'x', 'm': 'x', 'n': 'x', 'o': 'x', 'p': 'x', 'q': 'x', 'r': 'x', 's': 'x', 't': 'x', 'u': 'x', 'v': 'x', 'w': 'x', 'y': 'x', 'z': 'x'}))\nprint(result)"]
['Wrong Answer', 'Accepted']
['s749956420', 's263034691']
[3064.0, 3064.0]
[17.0, 17.0]
[312, 326]
p02778
u811202694
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["print(len(input()) * '*')\n", "print(len(input()) * 'x')\n"]
['Wrong Answer', 'Accepted']
['s193325214', 's029026907']
[2940.0, 2940.0]
[17.0, 17.0]
[26, 26]
p02778
u813298504
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s= input()\nfor i in range(len(s)):\n puts("x")', 's= input()\nx = "x" * len(s)\nprint(x)']
['Runtime Error', 'Accepted']
['s573963533', 's328929422']
[2940.0, 2940.0]
[17.0, 17.0]
[46, 36]
p02778
u813452457
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["n = input()\nprint('*'*len(n))", "print('x'*len(input()))"]
['Wrong Answer', 'Accepted']
['s220294978', 's750987619']
[2940.0, 3064.0]
[17.0, 18.0]
[29, 23]
p02778
u824144553
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['def resolve():\n import sys\n input = sys.stdin.readline\n \n S = input()\n res = "x" * len(S)\n print(res)\n\n\nif __name__ == "__main__":\n resolve()', 'def resolve():\n S = input()\n res = "x" * len(S)\n print(res)\n\n\nif __name__ == "__main__":\n resolve()']
['Wrong Answer', 'Accepted']
['s312920253', 's970078870']
[2940.0, 2940.0]
[17.0, 17.0]
[162, 111]
p02778
u825078825
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["a=input()\nA=len(a)\nb=x\nfor i in A-1:\n b=b+'x'\nprint(b)", 'a=input()\nA=len(a)\nb="x"\nfor i in range(A-1):\n b=b+"x"\nprint(b)']
['Runtime Error', 'Accepted']
['s844759527', 's573285385']
[2940.0, 2940.0]
[17.0, 17.0]
[55, 64]
p02778
u825378567
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S=input()\nfor i in range(len(S)):\n S[i]="x"\nprint(S)', 'S=input()\nans=""\nfor i in range(len(S)):\n ans+="x"\nprint(ans)\n']
['Runtime Error', 'Accepted']
['s348553309', 's099891284']
[2940.0, 3064.0]
[17.0, 17.0]
[53, 63]
p02778
u827261928
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["S=input()\nfor i in range(len(S)):\n S[i]='×'\nprint(S)", "S=input()\na=[]\nfor i in range(len(S)):\n a.append('×')\nprint(''.join(a))", "S=input()\na=[]\nfor i in range(len(S)):\n a.append('x')\nprint(''.join(a))"]
['Runtime Error', 'Wrong Answer', 'Accepted']
['s404537748', 's766552911', 's192076845']
[9024.0, 9064.0, 9008.0]
[26.0, 28.0, 27.0]
[56, 75, 74]
p02778
u829416877
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["1 s = input()\n2 print('x' * len(s))", "1 s = input().rstrip()\n2 print('x' * len(s))", 's = input()\nprint("x" * len(s))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s182774924', 's883023173', 's267336172']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[35, 44, 31]
p02778
u840570107
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['n = input()\n\nprint("×"*len(n))', 's = input()\nt = ""\n\nfor _ in range(len(s)):\n t += "x"\n \nprint(t)']
['Wrong Answer', 'Accepted']
['s991473369', 's101004239']
[2940.0, 9048.0]
[17.0, 28.0]
[31, 66]
p02778
u844196583
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S=input()\nlist_s = list(S)\nfor i in range(0, len(list_s)):\n list_s[i] = "x"\nprint(list_s)', 'S=input()\nlist_s = list(S)\nfor i in range(0, len(list_s)):\n list_s[i] = "x"\n\nprint(\'\'.join(list_s))']
['Wrong Answer', 'Accepted']
['s949912456', 's974731393']
[9088.0, 9036.0]
[31.0, 29.0]
[92, 102]
p02778
u847033024
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['print(x * len(input()))', "print('x' * len(input()))"]
['Runtime Error', 'Accepted']
['s268964348', 's420706946']
[8824.0, 8988.0]
[24.0, 25.0]
[23, 25]
p02778
u851319680
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["s = str(input())\nfor i in range(len(s)):\n s[i] = 'x'\n \nprint(s)", "s = str(input())\nfor i in range(len(s)):\n s = s.replace(s[i], 'x')\n \nprint(s)"]
['Runtime Error', 'Accepted']
['s524174155', 's021936623']
[2940.0, 2940.0]
[17.0, 17.0]
[65, 81]
p02778
u853547292
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['a = input()\nif a:\n print("*"*len(a))', "S = input()\nprint('x'* len(S))"]
['Wrong Answer', 'Accepted']
['s229625901', 's807366619']
[3064.0, 3068.0]
[18.0, 17.0]
[39, 30]
p02778
u857070771
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s=input()\nfor i in range(len(s)):\n s[i]="x"\nprint(s)', 's=input()\nprint("x"*len(s))']
['Runtime Error', 'Accepted']
['s184663877', 's317948268']
[2940.0, 2940.0]
[19.0, 17.0]
[55, 27]
p02778
u869267486
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S=input()\ns=str(S)\nfor i in range(len(s)):\n s.replace("x",s[i])\n\nprint(s)\n\n\n', 'S=input()\ns=str(S)\nfor i in range(len(s)):\n s.replace("x",s[i])\n\n\n', 's=input()\nans=str()\nfor i in range(len(s)):\n ans+="x"\nprint(ans)']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s016392745', 's816536207', 's953476907']
[2940.0, 3064.0, 2940.0]
[17.0, 24.0, 17.0]
[79, 69, 67]
p02778
u884601206
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["s=input()\nl=len(s)\nt=[]\nfor i in range(l):\n t.append(x)\n\nn=''.join(t)\nprint(n)\n", "s=input()\nl=len(s)\nt=[]\nfor i in range(l):\n t.append('x')\n\nn=''.join(t)\nprint(n)\n\n"]
['Runtime Error', 'Accepted']
['s967947998', 's485916977']
[2940.0, 2940.0]
[17.0, 18.0]
[80, 83]
p02778
u888092736
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['print(“x” * len(input()))', 'print("x" * len(input()))\n']
['Runtime Error', 'Accepted']
['s898306249', 's192733340']
[8988.0, 9068.0]
[28.0, 28.0]
[29, 26]
p02778
u889914341
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['print("x" * len(int(input())))', 'print("x" * len(input()))']
['Runtime Error', 'Accepted']
['s611497181', 's255972569']
[2940.0, 2940.0]
[17.0, 17.0]
[30, 25]
p02778
u891422384
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["print('×'*len(input()))", "print('x'*len(input()))"]
['Wrong Answer', 'Accepted']
['s542602960', 's933412128']
[2940.0, 2940.0]
[17.0, 18.0]
[24, 23]
p02778
u904081717
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["S = str(input())\nresult = []\n\nfor i in range(len(S)):\n result.append(x)\n\nresult = ''.join(result)\nprint(result)", "S = str(input())\nresult = []\n \nfor i in range(len(S)):\n result.append('x')\n \nresult = ''.join(result)\nprint(result)"]
['Runtime Error', 'Accepted']
['s246402412', 's358941124']
[2940.0, 2940.0]
[17.0, 17.0]
[112, 116]
p02778
u904995051
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s = input()\nprint("x"**len(s))', 's = input()\nprint("x"*len(s))']
['Runtime Error', 'Accepted']
['s154853233', 's373155413']
[9072.0, 8928.0]
[26.0, 29.0]
[30, 29]
p02778
u906858931
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["a = input()\nnum = len(a)\nprint('*'*num)", "a = input()\nnum = len(a)\nprint('x'*num)"]
['Wrong Answer', 'Accepted']
['s556615256', 's845613715']
[2940.0, 2940.0]
[17.0, 17.0]
[39, 39]
p02778
u907223098
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s=input()\na=""\nfor i i range(len(s)):\n a+="x"\nprint(a)', 's=input()\na=""\nfor i in range(len(s)):\n a+="x"\nprint(a)']
['Runtime Error', 'Accepted']
['s579223688', 's724706866']
[2940.0, 2940.0]
[19.0, 17.0]
[55, 56]
p02778
u907515644
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["S = input()\nprint(S[0])\nans = ''\nfor i in range(len(S)):\n ans += 'x'\nprint(ans)", "S = input()\nprint(S[0])\ns = []\nfor i in range(len(S)):\n s.append('x')\nprint(''.join(s))", "S = input()\nans = ''\nfor i in range(len(S)):\n ans += 'x'\nprint(ans)"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s507439843', 's670256114', 's658104586']
[9032.0, 8964.0, 9092.0]
[29.0, 30.0, 25.0]
[80, 88, 68]
p02778
u923270446
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S = input()\nans = "X" * len(S)\nprint(ans)', 'S = input()\nans = "x" * len(S)\nprint(ans)']
['Wrong Answer', 'Accepted']
['s872188165', 's708149504']
[2940.0, 2940.0]
[17.0, 17.0]
[41, 41]
p02778
u924828749
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s = input()\nfor i in range(len(s)):\n s[i] = x\nprint(s)', 's = input()\nfor i in range(len(s)):\n s[i] = "x"\nprint(s)', 's = input()\na = ""\nfor i in range(len(s)):\n a += "x"\nprint(a)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s033054962', 's939748879', 's751397882']
[8984.0, 9004.0, 9084.0]
[25.0, 26.0, 22.0]
[55, 57, 62]
p02778
u927807968
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['mozi = str(input())\ns = str(x)\nfor i in range(len(mozi)):\n s += "x"\nprint(s)', 'mozi = str(input())\nfor i in mozi:\n i == chr(x)\n print(i)', 'mozi = str(input())\ns = str()\nfor i in range(len(mozi)):\n s += str("x")\nprint(s)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s014331978', 's675125971', 's843970241']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 18.0]
[77, 59, 81]
p02778
u932868243
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["string=input()\nfor s in string:\n s='x'\nprint(string)", "string=input()\nfor s in string:\n s='x'\nprint(string)", "string=input()\nfor s in string:\n s='x'\nprint(string)", "list=list(input())\nfor s in list:\n s='x'\nprint(*list sep='')\n", "string=input()\nfor m in string:\n m='x'\nprint(string)", "string=input()\nlist=[]\nfor s in string:\n s='x'\n list.append(s)\nprint(''.join(list))\n"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s243905627', 's356331188', 's548925254', 's812754623', 's956234154', 's753179784']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0, 17.0, 18.0, 18.0]
[55, 53, 53, 62, 53, 86]
p02778
u934442292
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S = input()\nN = len(N)\nans = "x" * N\nprint(ans)', 'import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n S = input().rstrip()\n\n N = len(S)\n ans = "x" * N\n\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n']
['Runtime Error', 'Accepted']
['s981830772', 's509623805']
[2940.0, 2940.0]
[17.0, 19.0]
[47, 168]
p02778
u934788990
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['n = int(input())\na = [int(i) for i in input().split()]\ncount1 =0\ncount2 = 0\nfor i in a:\n if i%2==0:\n count1+=1\n if i%3==0 or i%5 == 0:\n count2+=1\n else:\n pass\nif count1 == count2:\n print(\'APPROVED\')\nelse:\n print("DENIED")', 's = input()\n\nprint("x"*len(s))']
['Runtime Error', 'Accepted']
['s747475132', 's545227840']
[3064.0, 2940.0]
[17.0, 17.0]
[265, 30]
p02778
u944643608
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["S = input()\nN = len(S)\nprint('x*N')", "S = input()\nN = len(S)\nprint('x'*N)\n"]
['Wrong Answer', 'Accepted']
['s198107552', 's070692845']
[2940.0, 2940.0]
[18.0, 17.0]
[35, 36]
p02778
u945140822
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S, T = input().split()\nA, B = map(int, input().split())\nU = input()\nif U == S: A -= 1\nelse: B -= 1\nprint(A, B)', 'S, a = input(), ""\nfor x in range(len(S)):\n a += "x"\nprint(a)']
['Runtime Error', 'Accepted']
['s483510042', 's363823403']
[2940.0, 3068.0]
[17.0, 17.0]
[113, 64]
p02778
u955042909
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['import re\nS = int(input())\nprint(re.sub(r"[a-z]", "x", S)) ', 'import re\ns = input()\nprint(re.sub(r"[a-z]", "x", s)) ']
['Runtime Error', 'Accepted']
['s222130049', 's380602948']
[3316.0, 3188.0]
[20.0, 19.0]
[59, 54]
p02778
u963944915
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S=input()\nfor i in range(len(S)):\n S[i]=x\nprint(S)\n ', 'S=input()\nprint("x"*len(S))']
['Runtime Error', 'Accepted']
['s215380550', 's907416319']
[2940.0, 2940.0]
[17.0, 17.0]
[54, 27]
p02778
u964521959
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['S = input()\nS_list = list(S)\n\nfor i in range(len(S_list)):\n S_list[i] = "x"\n\nS = str(S_list)\n \n \nprint(S)', 'S = input()\nS_list = list(S)\n\nfor i in range(len(S_list)):\n S_list[i] = "x"\n\nprint(*S_list)\n', 'S = input()\nS_list = list(S)\n\nfor i in range(len(S_list)):\n S_list[i] = "x"\n\nprint(*S_list, sep="")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s531174212', 's698321312', 's816562740']
[2940.0, 2940.0, 3060.0]
[17.0, 17.0, 17.0]
[108, 93, 100]
p02778
u967864815
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
["s = input()\n\nprint(['x']*len(s))\n", "s = input()\n\nprint('x'*len(s))\n"]
['Wrong Answer', 'Accepted']
['s700851492', 's146067369']
[8776.0, 8944.0]
[29.0, 30.0]
[33, 31]
p02778
u975820355
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['import re\ns = input()\n\nprint(re.sub("[a-z]", "x"))', 'import re\ns = input()\n\nprint(re.sub("[a-z]", "x", s))\n']
['Runtime Error', 'Accepted']
['s345857927', 's537622615']
[3188.0, 3188.0]
[21.0, 19.0]
[50, 54]
p02778
u986237475
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s = readline()\n \nans = "x" * len(s)\n\nprint(ans)', 's = input()\n \nans = "x" * len(s)\n\nprint(ans)']
['Runtime Error', 'Accepted']
['s444946242', 's579084826']
[2940.0, 2940.0]
[17.0, 17.0]
[48, 45]
p02778
u994527877
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['s = input()\nprint("x"*len(s)-2)', 's = input()\nprint("x"*len(s)-1)', 's = input()\nprint("x"*len(s))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s229853858', 's277708507', 's219099227']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[31, 31, 29]
p02778
u995163736
2,000
1,048,576
Given is a string S. Replace every character in S with `x` and print the result.
['print("x"*len(input())', 'print("x"*len(input()))']
['Runtime Error', 'Accepted']
['s517391984', 's439594195']
[8896.0, 8940.0]
[26.0, 27.0]
[22, 23]
p02779
u006251926
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['# C\nimport numpy as np\nN = int(input())\nA = list(map(int,input().split()))\n\nAll_diff=[A[i]-A[j] for i,j in zip(range(N),range(N)) if i<j] \n\nprod=np.prod(All_diff)\n\nif prod==0:\n print("No")\nelse:\n print("Yes")', '# C\nimport numpy as np\nimport itertools\nN = int(input())\nA = list(map(int,input().split()))\n\nA.sort()\n\nlist_tmp=[ A[i+1]-A[i] for i in range(N-1)]\n\nif 0 in list_tmp:\n print("No")\nelse:\n print("Yes")', '# C\nimport numpy as np\nN = int(input())\nA = list(map(int,input().split()))\n\nAll_diff=[A[i]-A[j] for i,j in zip(range(N),range(N)) if i<j] \n\nprod=np.prod(All_diff)\n\nif prod > 0 or prod < 0:\n print("No")\nelse:\n print("Yes")', '# C\nimport numpy as np\nimport itertools\nN = int(input())\nA = list(map(int,input().split()))\n\nAll_diff=[A[i]-A[j] for i,j in itertools.product(range(N),range(N)) if i<j] \n\nprod=np.prod(All_diff)\n\nif int(prod)==0:\n print("No")\nelse:\n print("Yes")', '# C\nimport numpy as np\nimport itertools\nN = int(input())\nA = list(map(int,input().split()))\n\nA.sort()\n\nlist_tmp=[ A[i+1]-A[i] for i in range(N-1)]\n\nif 0 in list_tmp:\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s224345570', 's398111756', 's525421312', 's749942025', 's841263107']
[34196.0, 34188.0, 34188.0, 555776.0, 34176.0]
[213.0, 317.0, 211.0, 2144.0, 347.0]
[216, 204, 229, 252, 204]
p02779
u006962308
2,000
1,048,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\nAuni = set(A)\n\nif len(A) == len(Auni):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int,input().split()))\n\nAuni = set(A)\n\nif len(A) == len(Auni):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s277454423', 's667409884']
[25932.0, 25936.0]
[90.0, 90.0]
[130, 130]
p02779
u010178026
2,000
1,048,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(list(set(a))) == n else 'No')", "n =int(input())\na = list(map(int, input().split()))\nprint('Yes' if len(list(set(a))) == n else 'No')", "n =int(input())\na = list(map(int, input().split()))\nprint('YES' if len(list(set(a))) == n else 'NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s057098059', 's860841324', 's358060393']
[26804.0, 25936.0, 26808.0]
[88.0, 90.0, 90.0]
[100, 100, 100]
p02779
u011555727
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\nl1=list(map(int,input().split()))\nl2=set(l1)\nif(len(l1)==len(l2)):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nl1=list(map(int,input().split(\' \')))\n\nif(len(l1)==len(set(l1))):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nl1=list(map(int,input().split(\' \')))\n\nif(len(l1)==len(set(l1))):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nl1=list(map(int,input().split()))\n\nif(len(l1)==len(set(l1))):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nl1=list(map(int,input().split()))\nl2=set(l1)\nif len(l1)==len(l2):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nl1=list(map(int,input().split()))\n\nif(len(l1)==len(set(l1))):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s074867382', 's506167635', 's548166779', 's918017947', 's996916894', 's041776672']
[31072.0, 31056.0, 31044.0, 31096.0, 31192.0, 31124.0]
[94.0, 88.0, 87.0, 94.0, 103.0, 89.0]
[120, 118, 118, 115, 119, 115]
p02779
u013513417
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N=int(input())\nS=list(map(int,input().split()))\n\nS.sort()\nbanpei=0\nfor i in range(N):\n if banpei==S[i]:\n print("No")\n exit()\n else:\n banpei=S[i]\n \nprint("Yes")', 'N=int(input())\nS=list(map(int,input().split()))\ndic={}\nfor i in range(N):\n dic[S[i]]=1\n\nif len(dic)==N:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s382538681', 's414294605']
[25172.0, 33612.0]
[185.0, 112.0]
[189, 145]
p02779
u014779044
2,000
1,048,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()\n\nmyset = set(A)\n# print(myset)\n# print(len(myset))\n# print(N)\nif len(myset) == N:\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nA = input().split()\n\nmyset = set(A)\n\nif len(myset) == N:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s204600949', 's876540553']
[30408.0, 31156.0]
[74.0, 70.0]
[158, 113]
p02779
u015418292
2,000
1,048,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()))\nc = Counter(a)\n\nif c.most_common()[0][1] == 1:\n print("Yes")\nelse:\n print("No")', 'from collections import Counter\nn = int(input())\na = list(map(int.input().split()))\nc = Counter(a)\n\nif c.most_common()[0][1] == 1:\n print("Yes")\nelse:\n print("No")', 'from collections import Counter\nn = int(input())\na = list(map(int,input().split()))\nc = Counter(a)\n\nif c.most_common()[0][1] == 1:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s208336202', 's662035188', 's121969214']
[40136.0, 3316.0, 40488.0]
[172.0, 21.0, 174.0]
[169, 169, 169]
p02779
u015593272
2,000
1,048,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())\na = len(collections.Counter(A))\nn = len(A)\n\nif (a == n):\n print('Yes')\nelse:\n print('No')", "import collections\n\nN = int(input())\nA = list(input().split())\na = len(collections.Counter(A))\nn = len(A)\n\nif (a == n):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s103502404', 's580817212']
[19220.0, 39884.0]
[38.0, 75.0]
[138, 158]
p02779
u017624958
2,000
1,048,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\ntable = {}\nanswer = 'Yes'\nfor i in range(0, len(A)):\n Ai = A[i]\n count = table.get(Ai) + 1 if table.get(Ai) else 1\n table[Ai] = count\n\n if table.get(Ai) >= 2:\n answer = 'No'\n break\n\nprint(answer)\n", "N = int(input())\nA = list(map(int, input().split()))\n\ntable = {}\nanswer = 'Yes'\nfor i in range(0, len(A)):\n Ai = A[i]\n count = table.get(Ai) + 1 if table.get(Ai) else 1\n table[Ai] = count\n\n if table.get(Ai) >= 2:\n answer = 'No'\n break\n\nprint(answer)\n", "N = int(input())\nA = list(map(int, input().split()))\n\ntable = {}\nanswer = 'Yes'\nfor i in range(0, len(A) + 1):\n\n Ai = A[i]\n count = table.get(Ai) + 1 if table.get(Ai) else 1\n table[Ai] = count\n\n if table.get(Ai) >= 2:\n answer = 'No'\n break\n\nprint(answer)\n", "N = int(input())\nA = list(map(int, input().split()))\n\ntable = {}\nanswer = 'YES'\nfor i in range(0, len(A)):\n Ai = A[i]\n count = table.get(Ai) + 1 if table.get(Ai) else 1\n table[Ai] = count\n\n if table.get(Ai) >= 2:\n answer = 'NO'\n break\n\nprint(answer)\n"]
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s018579661', 's253989498', 's364923235', 's500885452']
[32844.0, 32948.0, 32948.0, 32844.0]
[192.0, 188.0, 186.0, 191.0]
[276, 276, 317, 276]
p02779
u018771977
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int, input().split()))\n\na_set = set(a)\nif len(a) == len(a_set):\n print('Yes')\nelse:\n print('No')\n ", "n = int(input())\na = list(map(int, input().split()))\n\na_set = set(a)\nif len(a) == len(a_set):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\n\na_set = set(a)\nif len(a) == len(a_set):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s144677473', 's340834496', 's490741590']
[26800.0, 25172.0, 25932.0]
[91.0, 91.0, 92.0]
[137, 132, 132]
p02779
u021916304
2,000
1,048,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 ii():return int(input())\ndef iim():return map(int,input().split())\ndef iil():return list(map(int,input().split()))\ndef ism():return map(str,input().split())\ndef isl():return list(map(str,input().split()))\nn = ii()\nA = iil()\n\nif len(A) == len(set(A)):\n print('Yes')\nelse:\n print('No')", "def ii():return int(input())\ndef iim():return map(int,input().split())\ndef iil():return list(map(int,input().split()))\ndef ism():return map(str,input().split())\ndef isl():return list(map(str,input().split()))\n\nn = ii()\nA = iil()\nB = set(A)\nif len(A) == len(B):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s707221322', 's215985909']
[25928.0, 26612.0]
[86.0, 96.0]
[293, 299]
p02779
u022979415
2,000
1,048,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 numbers = []\n answer = "Yes"\n for a in A:\n if not a in numbers:\n numbers.append(a)\n else:\n answer = "No"\n break\n print(answer)\n\n\nif __name__ == \'__main__\':\n main()', 'def main():\n N = int(input())\n A = list(map(int, input().split(" ")))\n A.sort()\n answer = "YES"\n for i in range(N - 1):\n if A[i] == A[i + 1]:\n answer = "NO"\n break\n print(answer)\n\n\nif __name__ == \'__main__\':\n main()']
['Wrong Answer', 'Accepted']
['s562499760', 's886698876']
[26808.0, 26808.0]
[2104.0, 163.0]
[302, 265]
p02779
u023229441
2,000
1,048,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))==len(A) else "NO")\n', 'n=int(input())\nA=list(map(int,input(),split()))\nprint("YES" if len(list(set(A)))==len(A) else "NO")\n', 'n=int(input())\nA=list(int,input(),split())\nprint("YES" if len(set(A))==len(A) else "NO")', 'n=int(input())\nA=list(int,input(),split())\nprint("YES" if len(list(set(A)))==len(A) else "NO")\n', 'n=int(input())\nA=list(map(int,input().split()))\nprint("YES" if len(set(A))==len(A) else "NO")\n']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s697494445', 's714083550', 's753542804', 's785653337', 's629716820']
[8640.0, 8640.0, 8180.0, 8352.0, 25932.0]
[21.0, 22.0, 21.0, 20.0, 85.0]
[94, 100, 88, 95, 94]
p02779
u024383312
2,000
1,048,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()))\nsetA = set(A)\nprint("Yes" if len(setA)==len(A) else "No")', 'n = int(input())\nA = list(map(int, input().split()))\nsetA = set(A)\nprint("YES" if len(setA)==len(A) else "NO")']
['Wrong Answer', 'Accepted']
['s541516327', 's119154129']
[26808.0, 26808.0]
[92.0, 89.0]
[110, 110]
p02779
u024782094
2,000
1,048,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 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")', '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=list(set(a))\nif len(a)==len(b):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s003910236', 's574356435', 's895158047', 's605772400']
[25936.0, 26808.0, 26808.0, 26808.0]
[95.0, 91.0, 88.0, 98.0]
[116, 110, 110, 116]
p02779
u026862065
2,000
1,048,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()))\ns = list(set(l))\nif len(l) == len(s):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = list(map(int, input().split()))\ns = list(set(l))\nif len(l) == len(s):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s210852009', 's092715893']
[25936.0, 25936.0]
[93.0, 96.0]
[129, 129]
p02779
u027929618
2,000
1,048,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 fractions\nn=int(input())\na=list(map(int,input().split()))\nans=a[0]\ncnt=0\nif ans==1:\n cnt+=1\nfor i in range(1,n):\n if a[i]==1:\n cnt+=1 \n ans=fractions.gcd(ans,a[i])\nif cnt > 1:\n print("NO")\nelif ans==1:\n print("YES")\nelse:\n print("NO")', 'n=int(input())\na=list(map(int,input().split()))\nl=set(a)\nif len(l)==len(a):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s758242893', 's126429139']
[27308.0, 26804.0]
[170.0, 89.0]
[250, 110]
p02779
u031115006
2,000
1,048,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())\nlist = list(map(int, input().split()))\n\ni=0\nr="NO"\n\nwhile(i<l):\n j=0\n while(j<l):\n if(i!=j):\n if(list[i]==list[j]):\n r="YES"\n j+=1\n i+=1\n\nprint(r)', 'l=int(input())\nlist = list(map(int, input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nr=has_duplicates(list)\nprint(r)\n\nif(str(r)=="False"):\n print("YES")\nelse:\n print("NO")', 'l=int(input())\nlist = list(map(int, input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nr=has_duplicates(list)\n\nif(str(r)=="False"):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s025851933', 's907589219', 's476260402']
[26808.0, 26808.0, 25172.0]
[2104.0, 84.0, 89.0]
[182, 206, 197]
p02779
u032222383
2,000
1,048,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()))\nc=0\nfor i in range(n-1):\n for j in range(i, n):\n if a[i]==a[j]:\n c+=1\n break\n\nif c==0:\n print("YES")\nelse:\n print("NO")', 'n=int(input())\na=list(map(int, input().split()))\na.sort()\nc=0\nfor i in range(n-1):\n if a[i]==a[i+1]:\n c+=1\n break\nif c==0:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s445032521', 's712207114']
[26808.0, 26808.0]
[199.0, 181.0]
[206, 178]
p02779
u033524082
2,000
1,048,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="NO"\nfor i in range(n):\n for j in range(i+1,n):\n if a[i]==s[j]:\n s="YES"\n break\nprint(s)', 'n=int(input())\na=list(map(int,input().split()))\ns="NO"\nfor i in range(n):\n for j in range(i+1,n):\n if a[i]==a[j]:\n s="YES"\n break\nprint(s)', 'n=int(input())\na=list(map(int,input().split()))\na.sort()\ns="YES"\nfor i in range(n-1):\n if a[i]==a[i+1]:\n s="NO"\n break\nprint(s)']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s318086194', 's661598464', 's737862468']
[26808.0, 26808.0, 26808.0]
[68.0, 2104.0, 178.0]
[170, 170, 144]
p02779
u034777138
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N = int(input())\nA = list(map(int,input().split()))\n\nA.sort()\nflag = False\nfor count in range(0,len(A-1)):\n if A[count] == A[count+1]:\n flag = True\n break\n\nif flag == False:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA = list(map(int,input().split()))\n\nA.sort()\nflag = False\nfor count in range(0,len(A)-1):\n if A[count] == A[count+1]:\n flag = True\n break\n\nif flag == False:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s073868348', 's887124654']
[25936.0, 26808.0]
[149.0, 184.0]
[229, 229]
p02779
u035453792
2,000
1,048,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()\nc=0\nfor i in range(n-1):\n if a[i]==a[i-1]:\n print("No")\n c+=1\n break\nif c==0:\n print(\'Yes\')', 'n = int(input())\na = list(map(int,input().split()))\nb = [0 for _ in range (max(a)+1)]\nfor i in a:\n b[i]+=1\n if b[i]==2:\n print("No")\n exit()\nprint("Yes")', 'n = int(input())\na = list(map(int,input().split()))\na.sort()\nc=0\nfor i in range(n-1):\n if a[i]==a[i-1]:\n print("NO")\n c+=1\n break\nif c==0:\n print(\'YES\')\n \n\n \n ']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s053173042', 's645268081', 's903622947']
[30840.0, 656088.0, 31088.0]
[141.0, 2226.0, 133.0]
[179, 173, 199]
p02779
u038132197
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = input()\na = input().split()\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n \nb = has_duplicates(a)\nif b == True:\n print('YES')\nif b == False:\n print('NO')", "N = input()\na = input().split()\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n \nb = has_duplicates(a)\nif b == True:\n print('NO')\nif b == False:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s280101750', 's998271518']
[30412.0, 30412.0]
[70.0, 66.0]
[177, 177]
p02779
u038216098
2,000
1,048,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()))\nA.sort()\nfor i in range(N):\n if(A[i]==A[i+1]):\n print("NO")\n sys.exit()\nprint("YES")', 'import sys\n\nN=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 sys.exit()\nprint("YES")']
['Runtime Error', 'Accepted']
['s086975111', 's267442503']
[30884.0, 31032.0]
[131.0, 130.0]
[151, 153]
p02779
u038408819
2,000
1,048,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(input().split())\n\nimport collections\nc = collections.Counter(a)\n\nflag = True\nfor i in c.values():\n #print(i)\n if i!=1:\n flag = False\n break\nif flag == False:\n print('No')\nelse:\n print('Yes')\n \n", "N = input()\na = list(input().split())\n\nimport collections\nc = collections.Counter(a)\n\nflag = True\nfor i in c.values():\n #print(i)\n if i!=1:\n flag = False\n break\nif flag == False:\n print('NO')\nelse:\n print('YES')\n"]
['Wrong Answer', 'Accepted']
['s265395927', 's441697908']
[39088.0, 39092.0]
[101.0, 127.0]
[247, 238]
p02779
u039065404
2,000
1,048,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 = [map(int,input().split())]\nif len(set(L)) = N:\n print('YES')\nelse:\n print('NO')", "N = int(input())\nL = [map(int,input().split())]\nif len(set(L)) == N:\n print('YES')\nelse:\n print('NO')", "N = int(input())\nL = list(map(int, input().split()))\nif len(set(L)) == N:\n print('YES')\nelse:\n print('NO')\n"]
['Runtime Error', 'Wrong Answer', 'Accepted']
['s430048291', 's853160177', 's254096378']
[2940.0, 20796.0, 25172.0]
[17.0, 37.0, 86.0]
[102, 103, 109]
p02779
u039189422
2,000
1,048,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()))\nA.sort()\nfor i in range(n-1):\n\tif A[i]==A[i+1]:\n\t\tprint("No")\n\t\tsys.exit()\nprint("Yes")', 'import sys\nn = int(input())\nA = list(map(int,input().split()))\nA.sort()\nfor i in range(n-1):\n\tif A[i]==A[i+1]:\n\t\tprint("NO")\n\t\tsys.exit()\nprint("YES")']
['Wrong Answer', 'Accepted']
['s727214178', 's749277997']
[26808.0, 26808.0]
[179.0, 181.0]
[150, 150]
p02779
u039355749
2,000
1,048,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('No')\nelse:\n print('Yes')", "n = int(input())\na = list(map(int, input().split()))\n\nif(len(a) != len(set(a))):\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s555394259', 's626312980']
[26808.0, 26808.0]
[84.0, 83.0]
[117, 117]
p02779
u041046014
2,000
1,048,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 collecttions\nl=list(map(int,input().split()))\nfor i in l:\n if l.count(i)!=1:\n print("NO")\n exit(0)\nprint("YES")\n \n', 's=input()\nl=input().split()\nfrom collections import Counter\nl=Counter(l)\nif len(l)!=s:\n print("NO")\n exit(0)\nprint("YES")', 'N=int(input())\na=[int(input() ) for i in range(N)]\nfor i in range(N-1):\n if a[i]==a[i+1]:\n print("NO")\n exit(0)\nprint("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 exit(0)\nprint("YES")']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s490016790', 's582469979', 's719837050', 's632287247']
[2940.0, 39092.0, 8640.0, 26676.0]
[17.0, 105.0, 29.0, 186.0]
[129, 127, 131, 137]
p02779
u043844098
2,000
1,048,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 nums = input().split(' ')\n s = set()\n result = 'YES'\n\n for i in range(n):\n num = nums[i]\n if num in s:\n result = 'NO'\n break\n s.add(num)\n\n return result\n\n\nif __name__ == '__main__':\n main()\n", "from typing import List\n\n\ndef main():\n n = int(input())\n nums = input().split(' ')\n r = don(n, nums)\n if r:\n print('YES')\n else:\n print('NO')\n\n\ndef don(n: int, nums: List[str]) -> bool:\n s = set()\n result = True\n\n for i in range(n):\n num = nums[i]\n if num in s:\n result = False\n break\n s.add(num)\n\n return result\n\n\nif __name__ == '__main__':\n main()\n"]
['Wrong Answer', 'Accepted']
['s590043911', 's829007766']
[36024.0, 38380.0]
[101.0, 94.0]
[285, 437]
p02779
u044220565
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['# coding: utf-8\nimport sys\nsysread = sys.stdin.readline\nread = sys.stdin.read\nsys.setrecursionlimit(10**7)\n\ndef run():\n N = int(input())\n A = list(map(int, sysread().split()))\n A = sorted(A)\n for i in range(N-1):\n if A[i] == A[i+1]:\n print(\'No\')\n return None\n print(\'Yes\')\n\n\nif __name__ == "__main__":\n run()', '# coding: utf-8\nimport sys\n#from operator import itemgetter\nsysread = sys.stdin.readline\nread = sys.stdin.read\n#from heapq import heappop, heappush\n#from collections import defaultdict\nsys.setrecursionlimit(10**7)\n#import math\n#from itertools import combinations\n\n#import numpy as np\ndef run():\n N = int(input())\n A = list(map(int, sysread().split()))\n A = sorted(A)\n for i in range(N-1):\n if A[i] == A[i+1]:\n print(\'NO\')\n return None\n print(\'YES\')\n\n\nif __name__ == "__main__":\n run()']
['Wrong Answer', 'Accepted']
['s967756253', 's567813731']
[25680.0, 25688.0]
[169.0, 171.0]
[355, 562]
p02779
u045235021
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = input()\na = input().split()\nn = int(n)\na = [int(s) for s in a]\na.sort()\n#print(a)\ns=0\n\nfor i in range(len(a)-1):\n #print(a[i],a[i+1])\n \n if a[i]==a[i+1]:\n print("YES")\n s=s+1\n break\n \nif s == 0: print("NO")', 's =0\n\nprint(n,a)\n\nfor f in range(n):\n \n for g in range(n):\n\n if g != f:\n \tif a[f] == a[g]:\n \t\t#print(a[f], a[g])\n \t\ts = s+1\n \nif s>0: print("NO")\nelse: print(\'YES\')', 'n = input()\na = input().split()\nn = int(n)\na = [int(s) for s in a]\ns =0\n\nprint(n,a)\n\nfor f in range(n):\n \n for g in range(n):\n\n if g != f:\n \tif a[f] == a[g]:\n \t\t#print(a[f], a[g])\n \t\ts = s+1\n \nif s>0: print("NO")\nelse: print(\'YES\')', 'n = input()\na = input().split()\nn = int(n)\na = [int(s) for s in a]\na.sort()\n\ns=0\n\nfor i in range(len(a)-1):\n if a[i]==a[i+1]:\n print("YES")\n s=s+1\n \nif s == 0: print("NO")', 'n = input()\na = input().split()\nn = int(n)\na = [int(s) for s in a]\na.sort()\n#print(a)\ns=0\n\nfor i in range(len(a)-1):\n #print(a[i],a[i+1])\n \n if a[i]==a[i+1]:\n print("NO")\n s=s+1\n break\n \nif s == 0: print("YES")']
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s110211345', 's259650925', 's398341818', 's461651885', 's132081841']
[25168.0, 2940.0, 25812.0, 25936.0, 25812.0]
[190.0, 17.0, 2108.0, 190.0, 194.0]
[247, 187, 254, 195, 247]
p02779
u051174463
2,000
1,048,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()])\nans = 'Yes'\nfor i in range(1, n):\n if a[i-1] == a[i]:\n ans = 'No'\n break\nprint(ans)", "n = int(input())\na = sorted([int(i) for i in input().split()])\nans = 'YES'\nfor i in range(1, n):\n if a[i-1] == a[i]:\n ans = 'NO'\n break\nprint(ans)"]
['Wrong Answer', 'Accepted']
['s823160302', 's885133620']
[31152.0, 31144.0]
[138.0, 140.0]
[153, 153]
p02779
u051331793
2,000
1,048,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())\nP = list(map(int,input().split()))\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\nans = has_duplicates(P)\nif ans == 'True':\n print('YES')\nif ans == 'False':\n print('NO')", "N = int(input())\nP = list(map(int,input().split()))\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\nif has_duplicates(P) == 'False':\n print('YES')\nelif has_duplicates(P) == 'True':\n print('NO')", "N = int(input())\nP = list(map(int,input().split()))\ndef has_duplicates(seq):\n return str(len(seq) != len(set(seq)))\nif has_duplicates(P) == 'False':\n print('YES')\nelif has_duplicates(P) == 'True':\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s046383426', 's154423924', 's672867629']
[26808.0, 27208.0, 27364.0]
[84.0, 109.0, 100.0]
[203, 213, 214]
p02779
u053909865
2,000
1,048,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())\nli = list(map(int,input().split()))\n\n\nS = 0\nfor i in range(9):\n if li.count(i) <2:\n S = S\n else:\n S = S + 1\nif S == 0:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nli = list(map(int, input().split()))\nli.sort()\n\n\nS = 1\nfor i in range(N-1):\n if li[i+1] == li[i]:\n S = S*0\n else:\n S = S\nif S == 0:\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s054770749', 's730194786']
[26808.0, 25172.0]
[89.0, 208.0]
[202, 208]
p02779
u054825571
2,000
1,048,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()))\nB=[]\np=True\nfor a in A:\n if a in B:\n p = False\n break\n else:\n B.append(a)\nprint("Yes" if p else "No")', 'N=int(input())\nA=list(map(int,input().split()))\nB=[]\np=True\nfor a in A:\n if a in B:\n p = False\n break\n else:\n B.append(a)\nprint("Yes" if p else "No")', 'N=int(input())\nA=list(map(int,input()))\nS=set(A)\nprint("YES" if len(A)==len(S) else "NO")', 'N=int(input())\nA=list(map(int,input().split()))\nS=set(A)\nprint("YES" if len(A)==len(S) else "NO")\n']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s034126555', 's129848660', 's599822013', 's883672254']
[12872.0, 30912.0, 12744.0, 31144.0]
[28.0, 2206.0, 29.0, 95.0]
[152, 160, 89, 98]
p02779
u054931633
2,000
1,048,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()))\nd = {}\nfor i in l:\n if i in d:\n d[i] += 1\n if i not in d:\n d[i] = 1\nlength = len(d)\nif length ==n:\n print("YES")\nelse:\n print("NO")\nprint(d)', 'n = int(input())\nl = list(map(int,input().split()))\nd = {}\nfor i in l:\n if i in d:\n d[i] += 1\n if i not in d:\n d[i] = 1\nlength = len(d)\nif length ==n:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = list(map(int,input().split()))\nd = {}\nfor i in l:\n if i in d:\n d[i] += 1\n if i not in d:\n d[i] = 1\nlength = len(d)\nif length ==n:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s097890451', 's870887885', 's707720518']
[35232.0, 35380.0, 35244.0]
[149.0, 115.0, 124.0]
[218, 209, 209]
p02779
u057993957
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\nS = list(map(int, input().split()))\nsetS = list(set(S))\n\nprint('Yes' if len(S) == len(setS) else 'No')", "n = int(input())\nS = list(map(int, input().split()))\nsetS = list(set(S))\n\nprint('Yes' if len(S) == len(setS) else 'No')", "n = int(input())\nS = list(map(int, input().split()))\nsetS = list(set(S))\n\nprint('YES' if len(S) == len(setS) else 'NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s453322188', 's594175659', 's770190012']
[25932.0, 26800.0, 26808.0]
[98.0, 97.0, 97.0]
[119, 119, 119]
p02779
u059407991
2,000
1,048,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()\ns = set()\n\ndup = False\nfor i in a:\n if i in s:\n dup = True\n else:\n s.add(i)\n\nif dup:\n print("No")\nelse:\n print("Yes")\n', 'n = int(input())\na = input().split()\ns = set()\n\ndup = False\nfor i in a:\n if i in s:\n dup = True\n else:\n s.add(i)\n\nif dup:\n print("NO")\nelse:\n print("YES")\n']
['Wrong Answer', 'Accepted']
['s387981889', 's665039832']
[31152.0, 31152.0]
[98.0, 98.0]
[181, 181]
p02779
u060736237
2,000
1,048,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 = int(input()), list(map(int, input().split()))\nprint("Yes" if len(set(A)) == len(A) else "No")', 'N, A = int(input()), list(map(int, input().split()))\nprint("YES" if len(set(A)) == len(A) else "NO")']
['Wrong Answer', 'Accepted']
['s077486866', 's475275375']
[26808.0, 26804.0]
[86.0, 82.0]
[100, 100]
p02779
u060793972
2,000
1,048,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"]
['Wrong Answer', 'Accepted']
['s939538940', 's562041342']
[26808.0, 26808.0]
[83.0, 83.0]
[112, 113]
p02779
u064445353
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["flag = True\nn = int(input())\n\na = input().split()\n\na.sort()\n\nstart = 0\nfor i in a:\n start += 1\n for j in a[start-1:start+1]:\n if i == j:\n flag = False\n break\n \nif flag:\n print('YES')\nelse:\n print('NO')\n ", "flag = True\nn = int(input())\n\na = input().split()\n\na.sort()\nstart = 0\nfor i in a:\n for j in a[start-1:start+1:2]:\n if i == j:\n flag = False\n break\n start += 1\n \nif flag:\n print('YES')\nelse:\n print('NO')\n "]
['Wrong Answer', 'Accepted']
['s532424721', 's478940652']
[20796.0, 19160.0]
[275.0, 288.0]
[262, 255]
p02779
u068692021
2,000
1,048,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\nimport sys\n\nm=10**9 + 7 \nsys.setrecursionlimit(1000010)\nN=int(input())\nA = list(map(int,input().split()))\n\n# print(A)\ndictA={}\n\nfor i in A:\n if i in dictA: \n print("NO")\n exit(0)\n dictA[i]=1\nprint("YES"\n)\n[myoden@ubuntu002 C]$ cat testC.py ;echo \nimport math\nimport sys\n\nm=10**9 + 7 \nsys.setrecursionlimit(1000010)\nN=int(input())\nA = list(map(int,input().split()))\n\n# print(A)\ndictA={}\n\nfor i in A:\n if i in dictA: \n print("NO")\n exit(0)\n dictA[i]=1\nprint("YES")\n', 'import math\nimport sys\n\nm=10**9 + 7 \nsys.setrecursionlimit(1000010)\nN=int(input())\nA = list(map(int,input().split()))\n\n# print(A)\ndictA={}\n\nfor i in A:\n if i in dictA: \n print("NO")\n exit(0)\n dictA[i]=1\nprint("YES")\n']
['Runtime Error', 'Accepted']
['s596237929', 's034845073']
[2940.0, 33740.0]
[17.0, 127.0]
[518, 237]
p02779
u068944955
2,000
1,048,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)\n\nif len(A) == len(B):\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nA = list(map(int, input().split()))\nB = set(A)\n\nif len(A) == len(B):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s459424544', 's556955322']
[26808.0, 26808.0]
[93.0, 99.0]
[125, 125]
p02779
u069868485
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N=input()\nA=(input()).split()\nA.sort()\n\nfor i in range(N-1):\n if A[i]==A[i+1]:\n print('NO')\n if i==N-2:\n print('YES')\n \n\t", "N=(int)(input())\nA=(input()).split()\nA.sort()\n \nfor i in range(N-1):\n if A[i]==A[i+1]:\n print('NO')\n break\n elif i==N-2:\n print('YES')"]
['Runtime Error', 'Accepted']
['s265350375', 's546328084']
[20796.0, 20796.0]
[167.0, 224.0]
[132, 161]
p02779
u071361440
2,000
1,048,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=map(int,input())\nlst=len(set(map(int,input(split))))\nif n==lst:\n print("YES")\nelse: print("NO")', 'n=map(int,input())\nlst=len(set(map(int,input().split())))\nif n==lst:\n print("YES")\nelse: print("NO")', 'n=input()\nlst=len(set(input().split()))\nif n==lst:\n print("YES")\nelse: print("NO")', 'n=input()\nlst=input().split()\nif len(lst)==len(set(lst)):\n print("YES")\nelse: print("NO")']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s082625486', 's395894389', 's787620906', 's123677181']
[3060.0, 35916.0, 30412.0, 31156.0]
[17.0, 92.0, 68.0, 60.0]
[101, 104, 86, 92]
p02779
u072606168
2,000
1,048,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())\nb = len(a)\nc = len(set(a))\nif b == c:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na = list(map(int, input().split()))\nb = len(a)\nc = len(set(a))\nif b == c:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s238165078', 's745276328']
[19924.0, 26804.0]
[36.0, 86.0]
[119, 125]
p02779
u073139376
2,000
1,048,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()) == len(set(map(int, input().split())))\nif N:\n print("Yes")\nelse:\n print("No")', 'N = int(input()) == len(set(map(int, input().split())))\nif N:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s216739577', 's811819849']
[36660.0, 36788.0]
[88.0, 87.0]
[96, 96]
p02779
u073606136
2,000
1,048,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 = int(input())\ntable = list(map(int, input().split()))\nprint(table)\ncount = 0\nlist.sort(table)\nprint(table)\nfor i in range(1, num-1):\n if num == 2:\n if table[i-1] == table[i]:\n count += 1\n elif table[i] == table[i+1] or table[i-1] == table[i]:\n count += 1\n else:\n continue\nif count == 0:\n print('YES')\nelse:\n print('NO')", "num = int(input())\ntable = list(map(int, input().split()))\nprint(table)\ncount = 0\nlist.sort(table)\nfor i in range(num-1):\n if table[i] == table[i+1]:\n count += 1\n else:\n continue\nif count == 0:\n print('YES')\nelse:\n print('NO')", "num = int(input())\ntable = list(map(int, input().split()))\ncount = 0\nlist.sort(table)\nif num == 2:\n if table[0] == table[1]:\n count += 1\nelse:\n for i in range(1, num-1):\n if num == 2:\n if table[0] == table[1]:\n count += 1\n elif table[i] == table[i+1] or table[i-1] == table[i]:\n count += 1\n else:\n continue\nif count == 0:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s444992031', 's732564495', 's279131302']
[30924.0, 30920.0, 30868.0]
[208.0, 150.0, 168.0]
[371, 252, 450]