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
u401686269
2,000
1,048,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(['No','Yes'][(len(set(A))==len(A))])", "N=int(input())\nA=list(map(int,input().split()))\nprint(['No','Yes'][int(len(set(A))==len(A))])", "N=int(input())\nA=list(map(int,input().split()))\nprint(['NO','YES'][int(len(set(A))==len(A))])"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s159859850', 's873157938', 's260574287']
[31148.0, 30904.0, 31188.0]
[92.0, 90.0, 88.0]
[90, 93, 93]
p02779
u401949008
2,000
1,048,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()))\nb=len(a)\nc=collections.Counter(a)\ne=len(c.values())\nprint(e)\nif b==e:\n print("YES")\nelse:\n print("NO")', 'import collections\nn=int(input())\na=list(map(int,input().split()))\nb=len(a)\nc=collections.Counter(a)\ne=len(c.values())\nprint(e)\nif b==e:\n print("Yes")\nelse:\n print("No")', 'import collections\nn=int(input())\na=list(map(int,input().split()))\nb=len(a)\nc=collections.Counter(a)\ne=len(c.values())\nif b==e:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s560299929', 's986451425', 's805333671']
[33996.0, 33996.0, 33996.0]
[108.0, 114.0, 106.0]
[175, 175, 166]
p02779
u405660020
2,000
1,048,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)\nprint('Yes' if len(a)==len(c) else 'No')", "from collections import Counter\nn=int(input())\na=list(map(int, input().split()))\nc=Counter(a)\nprint('YES' if len(a)==len(c) else 'NO')"]
['Wrong Answer', 'Accepted']
['s387197402', 's965995515']
[33996.0, 33996.0]
[104.0, 104.0]
[134, 134]
p02779
u406405116
2,000
1,048,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()\nn = int(n)\nl = input().split(" ")\ns = set(l)\n\n\nif len(s) == len(l):\n print(\'Yes\')\nelse:\n print(\'No\')', 'n = input()\nl = input().split(" ")\ns = set(l)\n\nif len(s) == len(l):\n print(\'YES\')\nelse:\n print(\'NO\')']
['Wrong Answer', 'Accepted']
['s580783766', 's985613453']
[31156.0, 31156.0]
[70.0, 76.0]
[114, 102]
p02779
u406984840
2,000
1,048,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 = []\n\ntmp = input().split()\n\nfor i in range(N):\n A.append(int(tmp[i]))\n \nA.sort()\n\nhantei = True\n\nfor i in range(N):\n tmp = i\n if i == tmp:\n hantei = False\n \nif hantei == True:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA = []\n\ntmp = input().split()\n\nfor i in range(N):\n A.append(int(tmp[i]))\n \nA.sort()\n\nhantei = True\n\nfor i in range(N-1):\n if A[i] == A[i+1]:\n hantei = False\n \nif hantei == True:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s709461497', 's570880451']
[25940.0, 26812.0]
[208.0, 225.0]
[242, 240]
p02779
u408071652
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['N =int(input())\nA = list(map(int,input().split()))\nif len(set(A)) ==N:\n print("Yes")\nelse:\n print("No")', 'N =int(input())\nA = list(map(int,input().split()))\nif len(set(A)) ==N:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s999611727', 's993610945']
[26800.0, 26800.0]
[82.0, 88.0]
[109, 109]
p02779
u408262366
2,000
1,048,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 = []\n\nfor i in range(N):\n A_list.append(int(input()))\n \nlen_org = len(A_list)\nlen_uniq = len(list(set(A_list)))\n\nif len_org == len_uniq:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA_list = []\n\nhoge = input().split()\n\nfor i in range(N):\n A_list.append(int(hoge[i]))\n \nlen_org = len(A_list)\nlen_uniq = len(list(set(A_list)))\n\nif len_org == len_uniq:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s711254930', 's607111305']
[7004.0, 39092.0]
[29.0, 124.0]
[197, 221]
p02779
u410118019
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\ns = set(map(int,input().split()))\nprint('YNeos'[n!=len(s)::2])", "n = int(input())\ns = set(map(int,input().split()))\nprint('YNEOS'[n!=len(s)::2])\n"]
['Wrong Answer', 'Accepted']
['s831926298', 's047248101']
[36660.0, 36660.0]
[91.0, 98.0]
[79, 80]
p02779
u411353821
2,000
1,048,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, *D, = [list(map(int, s.split())) for s in open(0)]\nn, D = n[0], D[0]\nif n == len(set(D)):\n print("Yes")\nelse:\n print("No")', 'def main():\n N = int(input())\n nums = list(map(int, input().split()))\n\n if len(set(nums)) == N:\n print("YES")\n else:\n print("NO")\n\n\nif __name__ == "__main__":\n main()\n']
['Wrong Answer', 'Accepted']
['s036299139', 's251578403']
[27108.0, 26804.0]
[84.0, 86.0]
[133, 196]
p02779
u413165887
2,000
1,048,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 = set(a)\nif n == len(a):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = list(input().split())\na = set(a)\nif n == len(a):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s504908345', 's951558067']
[32696.0, 32692.0]
[86.0, 75.0]
[108, 108]
p02779
u414050834
2,000
1,048,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()))\nans=0\na=sorted(a)\nfor i in range(n):\n if a[i]==a[i+1]:\n ans=1\n break\nif ans==1:\n print('NO')\nelse:\n print('YES')", "n=int(input())\na=list(map(int,input().split()))\nans=0\nb=sorted(a)\nfor i in range(n):\n if b[i]==b[i+1]:\n ans=1\n break\nif ans==1:\n print('NO')\nelse:\n print('YES')\n", "n=int(input())\na=list(map(int,input().split()))\nans=0\nb=sorted(a)\nfor i in range(n-1):\n if b[i]==b[i+1]:\n ans=1\n break\nif ans==1:\n print('NO')\nelse:\n print('YES')\n"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s440403979', 's539733695', 's286913691']
[26812.0, 26808.0, 26808.0]
[191.0, 193.0, 182.0]
[169, 170, 172]
p02779
u416458858
2,000
1,048,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\ndef hash(a):\n return a%10\n\n\ndef check(A):\n for i in range(len(A)):\n for j in range(i, len(A)):\n if(j+1 < len(A)):\n if(A[i] == A[j+1]):\n #print("%d=%d"%(A[i], A[j]))\n flag = True\n return \'NO\'\n\n return \'YES\'\n\narr = [[] for i in range(10)]\n\nfor i in A:\n arr[hash(i)].append(i)\n\nfor i in arr:\n flag = False\n if(check == \'YES\'):\n print("YES")\n flag = True\n break\nif(not flag):\n print("NO")', 'N = (int)(input())\nA = list(map(int, input().split()))\n\nA.sort()\n# print(A)\nflag = False\nfor i in range(len(A)):\n if(i+1 < len(A)):\n if(A[i] == A[i+1]):\n print("NO")\n flag = True\n break\nif(not flag):\n print("YES")']
['Wrong Answer', 'Accepted']
['s906265985', 's122864819']
[25936.0, 26804.0]
[117.0, 211.0]
[572, 259]
p02779
u418420470
2,000
1,048,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) == N:\n print('Yes')\nelse:\n print('No')\n", "N = int(input())\nA = list(map(int,input().split()))\na = set(A)\nif len(a) == N:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s229443442', 's296324395']
[26808.0, 26804.0]
[93.0, 92.0]
[114, 113]
p02779
u419963262
2,000
1,048,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()\nprint(len(set(A)))\nif len(set(A))-1==N:\n print("Yes")\nelse:\n print("No")', 'N=int(input())\nA=input().split()\nif len(set(A))==N:\n print("Yes")\nelse:\n print("No")', 'N=int(input())\nA=input().split()\nif len(set(A))==N:\n print("Yes")\nelse:\n print("No")', 'N=int(input())\nA=input().split()\nif len(set(A))==N:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s141717772', 's220126658', 's813245939', 's862761512']
[8640.0, 30160.0, 31152.0, 30160.0]
[125.0, 69.0, 65.0, 62.0]
[103, 90, 90, 90]
p02779
u423966555
2,000
1,048,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 defaultdict\nn = int(input())\nd = defaultdict(int)\nA = list(map(int,input().split()))\n\nfor a in A:\n if d[a] == 1:\n print('No')\n exit()\n else:\n d[a] += 1\n\nprint('Yes')\n", "n = int(input())\nprint('YES' if n==len(set(list(map(int,input().split())))) else 'NO')"]
['Wrong Answer', 'Accepted']
['s406523269', 's417486705']
[33996.0, 26804.0]
[170.0, 86.0]
[217, 86]
p02779
u425762225
2,000
1,048,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())\nxs = set(map(int,input().split()))\n\nif lrn(cs) == n:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\nxs = set(map(int,input().split()))\n\nif len(xs) == n:\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Accepted']
['s001668865', 's261037346']
[36656.0, 36660.0]
[91.0, 92.0]
[104, 105]
p02779
u427163848
2,000
1,048,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)\nvalues,counts = zip(*c.most_common())\nprint(counts)\nif counts[0] != 1:\n print('NO')\nelse :\n print('YES')", "import collections\nN = int(input())\nA = list(map(int, input().split()))\nc = collections.Counter(A)\nvalues,counts = zip(*c.most_common())\nif counts[0] != 1:\n print('No')\nelse :\n print('Yes')", "import collections\nN = int(input())\nA = list(map(int, input().split()))\nc = collections.Counter(A)\nvalues,counts = zip(*c.most_common())\nif counts[0] != 1:\n print('NO')\nelse :\n print('YES')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s604742084', 's778072888', 's551633479']
[54472.0, 54472.0, 54472.0]
[295.0, 309.0, 271.0]
[209, 195, 195]
p02779
u428747123
2,000
1,048,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()\ns = list(map(int,input().split()))\nif len(s) == len(set(s)):\n print('Yes')\nelse:\n print('No')\n", "n = input()\ns = input().split()\n_set = set(s)\nif len(s) == len(_set):\n print('Yes')\nelse:\n print('No')\n\n\n# abc132A\n", "n = input().split()\ns = list(map(int,input().split()))\n\nif len(s) == len(set(s)):\n print('Yes')\nelse:\n print('No')\n", "n = input()\ns = input().split()\n_set = set(s)\nif int(n) == len(_set):\n print('Yes')\nelse:\n print('No')\n\n\n# abc132A\n\n", "n = input()\ns = input().split()\n_set = set(s)\nif int(n) == len(_set):\n print('Yes')\nelse:\n print('No')\n\n\n# abc132A\n\n", "n = int(input())\ns = list(map(int,input().split()))\n\nif len(s) == len(set(s)):\n print('Yes')\nelse:\n print('No')\n", "n = input()\ns = input().split()\n_set = set(s)\nprint(_set)\nprint(len(_set))\nif int(n) == len(_set):\n print('Yes')\nelse:\n print('No')\n\n\n# abc132A", "n = int(input())\ns = list(map(int,input().split()))\n\nif len(s) == len(set(s)):\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s030693506', 's041971994', 's253748424', 's269470063', 's406020586', 's495996406', 's942212733', 's108212136']
[25936.0, 31156.0, 25936.0, 31156.0, 31152.0, 26808.0, 36272.0, 25172.0]
[84.0, 72.0, 83.0, 72.0, 73.0, 84.0, 106.0, 84.0]
[112, 278, 121, 279, 279, 118, 306, 118]
p02779
u429029348
2,000
1,048,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()))\naa=set(a)\nif len(a)==len(aa):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\na=list(map(int,input().split()))\naa=set(a)\nif len(a)==len(aa):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s501815325', 's737657280']
[25172.0, 26808.0]
[95.0, 89.0]
[112, 112]
p02779
u430201779
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import sys\nN = int(input())\nA = [int(i) for i in input().split()]\nfor i,a in enumerate(A):\n if a in A[i+1:]\n print("NO")\n sys.exit(0)\nprint("YES")', 'N = int(input())\nA = [int(i) for i in input().split()]\ndef test(A):\n return len(A)!= len(set(A))\nif test(A)==False:\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s384671345', 's621421688']
[2940.0, 25172.0]
[17.0, 90.0]
[163, 157]
p02779
u431484963
2,000
1,048,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\ns = list(map(int, input().split()))\nprint(s)\nt = set(s)\nif len(t) == len(s):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\n\ns = list(map(int, input().split()))\n#print(s)\nt = set(s)\nif len(t) == len(s):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s862790637', 's089752716']
[30880.0, 25172.0]
[114.0, 90.0]
[174, 175]
p02779
u432853936
2,000
1,048,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()))\nacount = Counter(a)\nif n == (len(list(acount.keys()))):\n print("Yes")\nelse:\n print("No")\n', 'from collections import Counter\nn = int(input())\na = list(map(int,input().split()))\nacount = Counter(a)\nif n == (len(list(acount.keys()))):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s742614168', 's795431300']
[33996.0, 33996.0]
[116.0, 110.0]
[189, 189]
p02779
u433380437
2,000
1,048,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()))\nif len(m) == len(list(set(m))):\n print('Yes')\nelse:\n print('No')", "n =input()\nm = list(map(int,input().split()))\nif len(m) == len(list(set(m))):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s859487311', 's981913020']
[31040.0, 31244.0]
[97.0, 96.0]
[116, 116]
p02779
u436664080
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['from sys import stdin\n\nn = int(stdin.readline().rstrip())\nd = [int(x) for x in stdin.readline().rstrip().split()]\n\nm = [0] * 100\n\nfor i in d:\n m[i] += 1\n\nresult = 0\nfor i in m:\n if (i > 1):\n result += 1\n\nif (result > 0):\n print("No")\nelse:\n print("Yes")', 'from sys import stdin\n\nn = int(stdin.readline().rstrip())\nd = [int(x) for x in stdin.readline().rstrip().split()]\n\nm = [0] * 1000000000\n\nfor i in d:\n m[i] += 1\n\nresult = 0\nfor i in m:\n if (i > 1):\n result += 1\n\nif (result > 0):\n print("No")\nelse:\n print("Yes")', 'from sys import stdin\n\nn = int(stdin.readline().rstrip())\nd = [int(x) for x in stdin.readline().rstrip().split()]\n\nm = [0] * 100\n\nfor i in d:\n m[i] += 1\n\nfor i in m:\n if (i > 1):\n print("No")\n else:\n print("Yes")', "from sys import stdin\nimport math\n\nn = int(stdin.readline().rstrip())\na = [int(x) for x in stdin.readline().rstrip().split()]\n\nd = {}\nfor aa in a:\n if aa in d.keys():\n d[aa] += 1\n else:\n d[aa] = 1\n\nresult = 'YES'\nfor key, value in d.items():\n if value > 1:\n result = 'NO'\n\nprint(result)"]
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s153259103', 's236287935', 's968556188', 's091017529']
[25812.0, 25168.0, 25172.0, 33616.0]
[76.0, 75.0, 75.0, 159.0]
[272, 279, 235, 316]
p02779
u436982376
2,000
1,048,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\nn_list = map(int,input().split())\nn_set = set(n_list)\n\nif len(n_set) == n:\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\n\nn_list = map(int,input().split())\nn_set = set(n_list)\n\nif len(n_set) == n:\n print('YES')\nelse:\n print('NO')\n"]
['Wrong Answer', 'Accepted']
['s738510014', 's195587538']
[36660.0, 35788.0]
[95.0, 97.0]
[132, 132]
p02779
u437215432
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["import numpy as np\ndef f(n, a):\n if len(np.unique(a)) == a:\n print('YES')\n else:\n print('NO')\n\nn = input()\na = list(map(int, input().split()))\n\nf(n, a)\n", "def f(n, a):\n if len(np.unique(a)) == a:\n print('YES')\n else:\n print('NO')\n\nn = input()\na = list(map(int, input().split()))\n\nf(n, a)\n", "import numpy as np\ndef f(n, a):\n if len(np.unique(a)) == n:\n print('YES')\n else:\n print('NO')\n\nn = input()\na = list(map(int, input().split()))\n\nf(n, a)\n", "import numpy as np\ndef f(n, a):\n if len(np.unique(a)) == n:\n print('YES')\n else:\n print('NO')\n\nn = int(input())\na = list(map(int, input().split()))\n\nf(n, a)\n"]
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s379261087', 's593523978', 's888282049', 's472572026']
[34468.0, 25936.0, 34464.0, 49080.0]
[267.0, 68.0, 260.0, 183.0]
[172, 153, 172, 177]
p02779
u437727817
2,000
1,048,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 = len(set(a))\nif len(a)== len(b):\n\tprint('YES')\nelse:\n\tprint('NO')", "n = int(input())\na = list(map(int,input().split()))\n\nb = list(set(a))\nif len(a)== len(b):\n\tprint('YES')\nelse:\n\tprint('NO')"]
['Runtime Error', 'Accepted']
['s902278042', 's627392083']
[25936.0, 26804.0]
[83.0, 98.0]
[121, 122]
p02779
u440129511
2,000
1,048,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 exit()\nprint('Yes')", "n=int(input())\na=list(map(int,input().split()))\nif n==len(set(a)):\n print('Yes')\nelse:print('No')", "n=int(input())\na=list(map(int,input().split()))\nif len(a)==len(set(a)):\n print('Yes')\nelse:print('No')", "n=int(input())\ns=list(map(int,input().split()))\nprint('YES' if len(set(s))==n else 'NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s088219547', 's589840205', 's888507669', 's318235108']
[26680.0, 26808.0, 26808.0, 26804.0]
[186.0, 84.0, 83.0, 85.0]
[146, 100, 105, 88]
p02779
u440161695
2,000
1,048,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()))\nc=set(b)\nif len(c)==len(b):\n print("NO")\nelse:\n print("Yes")', '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']
['s868246678', 's348944513']
[26808.0, 26808.0]
[91.0, 92.0]
[110, 110]
p02779
u442581202
2,000
1,048,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 = set()\nn = input()\nfor i in map(int,input().split()):\n if i in s:\n print("YES")\n exit(0)\n else:\n s.add(i)\nprint("NO")', 's = set()\nn = input()\nfor i in map(int,input().split()):\n if i in s:\n print("NO")\n exit(0)\n else:\n s.add(i)\nprint("YES")\n\n']
['Wrong Answer', 'Accepted']
['s032296950', 's836846218']
[36660.0, 36660.0]
[135.0, 138.0]
[131, 133]
p02779
u442877951
2,000
1,048,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().split() for i in range(N))]\ndup = [j for j in set(A) if A.count(j) > 1]\nif dup == True:\n print("NO")\nelse:\n print("YES")', 'N = int(input())\nA = [list(map(int,input().split())) for i in range(N)]\ndup = [i for i in set(A) if A.count(i) > 1]\nif not dup:\n print("YES")\nelse:\n print("NO")', 'N = map(int,input())\nA = [list(map(int,input().split())) for i in range(N)]\ndup = [i for i in set(A) if A.count(i) > 1]\nprint("NO" if dup else "YES")\n', 'N = int(input())\nA = list(map(int,input().split()))\nif len(A) == len(list(set(A))):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = [input().split() for i in range(N)]\ndup = [j for j in set(A) if A.count(j) > 1]\nif dup == True:\n print("NO")\nelse:\n print("YES")', 'N = int(input())\nA = list(map(int,input().split()))\nif len(A) == len(list(set(A))):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s125941599', 's140951229', 's814880490', 's946226552', 's967916957', 's523468183']
[3060.0, 26808.0, 3060.0, 26808.0, 19160.0, 26808.0]
[17.0, 69.0, 17.0, 91.0, 36.0, 92.0]
[156, 162, 150, 118, 151, 118]
p02779
u444722572
2,000
1,048,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 gcd\nN=int(input())\nA=list(map(int,input().split()))\nflg=1\nfor i in range(N):\n for j in range(i+1,N):\n if gcd(A[i],A[j])!=1:\n flg=0\nprint("YES" if flg else "NO") \n ', 'N=int(input())\nA=list(map(int,input().split()))\nflg=0\nif len(set(A))==N:\n flg=1\nprint("YES" if flg else "NO")\n ']
['Runtime Error', 'Accepted']
['s760421945', 's100424035']
[2940.0, 26804.0]
[17.0, 84.0]
[215, 121]
p02779
u446371873
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\nA = list(map(int,input().split()))\nfor a in A:\n if A.count(a) != 1:\n print('No')\n break\nelse:\n print('Yes')", "n = int(input())\nA = list(map(int,input().split()))\nfor a in A:\n if A.count(a) != 1:\n print('No')\n break\nelse:\n print('Yes')", "n = int(input())\nA = list(map(int,input().split()))\nA.sort()\nfor i in range(n-1):\n if A[i] == A[i+1]:\n print('NO')\n break\nelse:\n print('YES')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s766319723', 's976457325', 's438246157']
[25172.0, 26808.0, 26808.0]
[2104.0, 2104.0, 180.0]
[132, 132, 161]
p02779
u446460730
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na_list = list(map(int, input().split()))\n\nif len(a_list) == len(set(a_list)):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na_list = list(map(int, input().split()))\n\nif len(set(a_list)) == n:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na_list = list(map(int, input().split()))\n\nif len(set(a_list)) == n:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s368361151', 's732334777', 's769609654']
[26808.0, 26804.0, 26808.0]
[83.0, 83.0, 84.0]
[133, 123, 123]
p02779
u453137963
2,000
1,048,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()\nnums=list(map(int, input().split()))\nnums.sort()\nres = True\nprev = None\nfor i in nums:\n if i == prev:\n res = False\n else:\n prev = i\nif res:\n "YES"\nelse:\n "NO"', 'n=input()\nnums=list(map(int, input().split()))\nnums.sort()\nres = True\nprev = None\nfor i in nums:\n if i == prev:\n res = False\n else:\n prev = i\nif res:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s873398568', 's795929600']
[25932.0, 26804.0]
[173.0, 176.0]
[194, 208]
p02779
u453623947
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\n\nan = list(map(int, input().split()))\n\nif len(set(an)) == len(an) :\n print("Yes")\n\nelse :\n print("No")\n', '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()\nprint("Yes")', 'n = int(input())\n\nan = list(map(int, input().split()))\n\nan.sort()\n\nfor i in range(n-1) :\n if an[i] == an[i+1] :\n print("No")\n exit()\n\nelse :\n print("Yes")\n', 'n = int(input())\n\nan = map(int, input().split())\n\nan = list(an)\n\nif len(set(an)) == n :\n print("Yes")\n\nelse :\n print("No")\n', 'n = int(input())\n\nan = list(map(int, input().split()))\n\nan.sort()\n\nfor i in range(n-1) :\n if an[i] == an[i+1] :\n print("No")\n exit()\nprint("Yes")\n', 'n = int(input())\n\nan = map(int, input().split())\n\nif len(set(an)) == n :\n print("YES")\nelse :\n print("NO")\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s086755023', 's111338554', 's183239580', 's227662441', 's498678035', 's872823888']
[26808.0, 26808.0, 25936.0, 25172.0, 26808.0, 35792.0]
[85.0, 184.0, 182.0, 85.0, 182.0, 88.0]
[126, 155, 175, 129, 163, 113]
p02779
u455809703
2,000
1,048,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())\n\nA = set(map(int,input().split()))\n\nif N == len(A):\n print("YES")\nelse:\n print("NO")', 'N = int(input())\n\nA = set(map(int,input().split()))\n\nif N == len(A):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s814792603', 's361966440']
[35788.0, 36660.0]
[94.0, 95.0]
[111, 107]
p02779
u455957070
2,000
1,048,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() for _ in range(n)]\nif ( a(i) != a(i+1) ):\n print("Yes)\nelse:\n print("No")\n', 'n = int (input())\na = [input() for _ in range(n)]\nif ( a(i) != a(i+1) ):\n print("Yes")\nelse:\n print("No")\n', "n = int (input())\na = [input() for _ in range(n)]\nif ( a(i) != a(i+1) ):\n print('Yes')\nelse:\n print('No')\n", 'n = int(input())\na = set(map(int, input().split()))\nans = "YES"\nif len(a) != n: \n ans = "NO"\n \nprint(ans)\n\n']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s205979258', 's653484740', 's865035951', 's823222482']
[2940.0, 8636.0, 8352.0, 35788.0]
[17.0, 21.0, 21.0, 91.0]
[107, 108, 108, 143]
p02779
u457423258
2,000
1,048,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()))\nA.sort()\nfor i in range(N-1):\n if A[i] == A[i+1]:\n print('NO')\n exit()\nprint('YES')\n ", "N = int(input())\nA =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()\nprint('YES')"]
['Runtime Error', 'Accepted']
['s311869714', 's044039128']
[7000.0, 26804.0]
[21.0, 179.0]
[148, 151]
p02779
u459798349
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\na=[int(i) for i in input().split()]\n\ns=set(a)\n\nif len(s)==n:\n print("Yes")\nelse:\n print("No")\n \n', 'n=int(input())\na=[int(i) for i in input().split()]\n\ns=set(a)\n\nif len(s)==n:\n print("YES")\nelse:\n print("NO")\n \n']
['Wrong Answer', 'Accepted']
['s909346266', 's069760044']
[25936.0, 25172.0]
[102.0, 99.0]
[120, 120]
p02779
u460375306
2,000
1,048,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_all_distinct(A):\n already_seen_chars = list()\n for character in A:\n if character not in already_seen_chars:\n already_seen_chars.append(character)\n print(already_seen_chars)\n else: return "NO"\n return "YES"\n\n\nif __name__ == "__main__":\n N = int(input())\n A = input().split()\n print(check_all_distinct(A))', 'N = int(input())\nA = input().split()\nif len(A) != len(set(A)):\n print("NO")\nelse:\n print("YES")']
['Runtime Error', 'Accepted']
['s853303052', 's628903938']
[149944.0, 31152.0]
[1352.0, 65.0]
[335, 97]
p02779
u460386402
2,000
1,048,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()\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()\nprint("YES")']
['Wrong Answer', 'Accepted']
['s965774795', 's259261252']
[31088.0, 31100.0]
[127.0, 138.0]
[137, 137]
p02779
u464032595
2,000
1,048,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(reverse=True)\nf = False\nfor i in range(n-1):\n if a[i+1] - a[i] == 0:\n f = True\n break\n\nif f == True:\n print('No')\nelse:\n print('Yes')", "n = int(input())\na = list(map(int, input().split()))\n\na.sort(reverse=True)\nf = False\nfor i in range(n-1):\n if a[i+1] - a[i] == 0:\n f = True\n break\n\nif f == True:\n print('NO')\nelse:\n print('YES')\n"]
['Wrong Answer', 'Accepted']
['s781809551', 's993571154']
[25684.0, 26808.0]
[187.0, 183.0]
[217, 218]
p02779
u464244643
2,000
1,048,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 itertools import groupby\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef solve():\n N = int(input())\n A = list(map(int, input().split()))\n if len(set(A)) == N:\n print(\'Yes\')\n else:\n print(\'No\')\n\n\nif __name__ == "__main__":\n solve()\n', 'import sys\nfrom itertools import groupby\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef solve():\n N = int(input())\n A = list(map(int, input().split()))\n if len(set(A)) == N:\n print(\'YES\')\n else:\n print(\'NO\')\n\n\nif __name__ == "__main__":\n solve()\n']
['Wrong Answer', 'Accepted']
['s481933144', 's905593383']
[25548.0, 25548.0]
[83.0, 90.0]
[286, 286]
p02779
u464823755
2,000
1,048,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())\nche={}\nans='Yes'\na = list(map(int, input().split()))\nfor i in a:\n if i in che.keys():\n ans='No'\n else:\n che[i]=0\nprint(ans)\n \n ", "n= int(input())\nche={}\nans='YES'\na = list(map(int, input().split()))\nfor i in a:\n if i in che.keys():\n ans='NO'\n else:\n che[i]=0\nprint(ans)\n \n "]
['Wrong Answer', 'Accepted']
['s814343149', 's703767008']
[35136.0, 35252.0]
[120.0, 122.0]
[153, 153]
p02779
u468522925
2,000
1,048,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()\nnums = input().split(" ")\nnums = [int(i) for i in nums]\n\nif len(set(nums)) == N:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nnums = input().split(" ")\nnums = [int(i) for i in nums]\n\nif len(set(nums)) == N:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s155531068', 's677095403']
[25324.0, 25172.0]
[91.0, 91.0]
[131, 136]
p02779
u470618774
2,000
1,048,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 = input().split()\nmydict = {}\nfor i in range(len(b)):\n mydict[b[i]] = 1\nprint(mydict)\nif len(mydict) == a:\n print('YES')\nelse:\n print('NO')", "a = int(input())\nb = input().split()\nmydict = {}\nfor i in range(len(b)):\n mydict[b[i]] = 1\n\nif len(mydict) == a:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s671443174', 's827148167']
[40368.0, 38836.0]
[152.0, 91.0]
[167, 154]
p02779
u470735879
2,000
1,048,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()))\nans = "Yes" if len(a) == len(set(a)) else "No"\nprint(ans)\n', 'n = int(input())\na = list(map(int, input().split()))\nans = "YES" if len(a) == len(set(a)) else "NO"\nprint(ans)\n']
['Wrong Answer', 'Accepted']
['s636532011', 's927271780']
[25936.0, 26808.0]
[82.0, 83.0]
[111, 111]
p02779
u471593927
2,000
1,048,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 = set(input().split())\n\nif len(A) == N:\n print("YES")\nelse:\n print("NO")\n', 'N = int(input())\nA = set(input().split())\n\nif len(A) == N:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s997890693', 's336309903']
[31156.0, 31156.0]
[81.0, 73.0]
[93, 98]
p02779
u472197237
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\n\ndef main():\n n = int(input())\n if has_duplicates(list(map(int, input().split(' ')))):\n print('No')\n else:\n print('Yes')\n\n\nif __name__ == '__main__':\n main()\n", "def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\n\ndef main():\n n = int(input())\n if has_duplicates(list(map(int, input().split(' ')))):\n print('NO')\n else:\n print('YES')\n\n\nif __name__ == '__main__':\n main()\n"]
['Wrong Answer', 'Accepted']
['s240932985', 's293783111']
[25684.0, 25936.0]
[84.0, 83.0]
[247, 247]
p02779
u475189661
2,000
1,048,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()\nans = 'Yes'\nfor i in range(n-1):\n if a[i] == a[i+1]:\n ans = 'No' \nprint(ans)", "n = int(input())\na = list(map(int,input().split()))\na.sort()\nans = 'Yes'\nfor i in range(n-1):\n if a[i] == a[i+1]:\n ans = 'No'\n \nprint(ans)", "n = int(input())\na = list(map(int,input().split()))\na.sort()\nans = 'YES'\nfor i in range(n-1):\n if a[i] == a[i+1]:\n ans = 'NO' \nprint(ans)"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s016142235', 's085598958', 's972201513']
[31016.0, 30908.0, 31020.0]
[139.0, 136.0, 131.0]
[150, 155, 150]
p02779
u477650749
2,000
1,048,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", "n = int(input())\na = set((list(map(int, input().split()))))\n\nif len(a)==n:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = sorted(list(map(int, input().split())))\n\ncount = 0\n\nfor i in range(n-1):\n if a[i] == a[i + 1]:\n count += 1\nif count == 0:\n print('Yes')\nelse:\n print('No')\n", "n=int(input())\na=list(map(int,input().split()))\n\nif len(a)==len(set(a)):\n print('Yes')\nelse:\n print('No')\n\n", "n = int(input())\na = sorted(list(map(int, input().split())))\n\ncount = 0\n\nfor i in range(len(a)-1):\n if a[i] == a[i + 1]:\n count += 1\nif count == 0:\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\na = set((list(map(int, input().split()))))\n\nif len(a)==n:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s149095981', 's301761647', 's609476246', 's714255521', 's926104000', 's610250342']
[25324.0, 25936.0, 26804.0, 26812.0, 25684.0, 26808.0]
[93.0, 89.0, 183.0, 83.0, 195.0, 96.0]
[115, 113, 192, 113, 197, 113]
p02779
u477915050
2,000
1,048,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\nc = [0]*n\nflag = 0\nc[0] = a[0]\nfor i in range(n):\n for j in range(i):\n if c[j] == a[i]:\n flag = 1\n break\n if flag == 1:\n break\n else:\n c[i] = a[i]\n\nprint(c)\nif flag == 0:\n print("YES")\nelse:\n print("NO")\n ', 'n = int(input())\na = list(map(int,input().split()))\n\nc = [0]*n\nflag = 0\nc[0] = a[0]\nfor i in range(n):\n for j in range(i):\n if c[j] == a[i]:\n flag = 1\n break\n else:\n c[i] = a[i]\n\nprint(c)\nif flag == 0:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na = list(map(int,input().split()))\n\nc = [0]*n\nflag = 0\nc[0] = a[0]\nfor i in range(n):\n for j in range(i):\n if c[j] == a[i]:\n flag = 1\n break\n if flag == 1:\n break\n else:\n c[i] = a[i]\n\nprint(c)\nif flag == 0:\n print("YES")\nelse:\n print("NO")\n ', 'n = int(input())\na = list(map(int,input().split()))\n\na.sort()\nflag = 0\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n flag = 1\n break\n \nif flag == 0:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s220864388', 's654619048', 's685032469', 's766255900']
[26804.0, 26804.0, 26808.0, 25172.0]
[2104.0, 2104.0, 2104.0, 177.0]
[283, 258, 283, 190]
p02779
u479484272
2,000
1,048,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()]\nmySet = set()\nfor i in A:\n if i in mySet:\n print('NO')\n exit()\n else:\n mySet.add(i)\nprint('YES')", "N = int(input())\nA = [int(x) for x in input().split()]\nmySet = set()\nfor i in A:\n if i in mySet:\n print('NO')\n exit()\n else:\n mySet.add(i)\nprint('YES')"]
['Runtime Error', 'Accepted']
['s438255862', 's916837422']
[2940.0, 25932.0]
[17.0, 126.0]
[166, 164]
p02779
u485979475
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n=int(input())\nalist=list(map(int,input().split()))\n\naset=set(alist)\n\nif len(aset) == n:\n\tprint("Yes")\nelse:\n\tprint("No")', 'n=int(input())\nAsetttt=list(map(int,input().split()))\n\nAsett=set(Asetttt)\n\nif len(Asett) == n:\n\tFlag ="YES"\nelse:\n\tFlag="NO"\nprint(Flag)']
['Wrong Answer', 'Accepted']
['s917879635', 's134015445']
[26808.0, 26812.0]
[91.0, 92.0]
[121, 136]
p02779
u487044452
2,000
1,048,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 = set(a)\nif len(a) > len(a_set):\n print('No')\nelse:\n print('Yes')", "n = int(input())\na = list(map(int,input().split()))\na_set = set(a)\nif len(a) > len(a_set):\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Accepted']
['s920320045', 's659969633']
[26800.0, 25324.0]
[93.0, 90.0]
[129, 129]
p02779
u490489966
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['import numpy as np\n\nn=int(input())\na=list(map(int,input().split()))\nans=\'Yes\'\nfor i in range(len(a)):\n for j in range(i+1,len(a)):\n if a[i]==a[j]:\n ans="No"\n break\nprint(ans)', 'n=int(input())\na=list(map(int,input().split()))\nans=\'Yes\'\nfor i in range(len(a)):\n for j in range(i+1,len(a)):\n if a[i]==a[j]:\n print(a[i],a[j])\n ans="No"\n break\nprint(ans)', 'n=int(input())\na=list(map(int,input().split()))\na.sort()\nans=\'Yes\'\nfor i in range(1,len(a)):\n if a[i-1]==a[i]:\n ans="No"\n break\n\nprint(ans)', 'n,k=map(int,input().split())\na=list(map(int,input().split()))\nb=[]\nfor i in range(len(a)):\n b.append((a[i]+1)/2)\nfor i in range(len(a)-k+1):\n sum=0\n for j in range(i,i+k):\n sum+=b[j]\n if max<=sum:\n max=sum\nprint(max)', 'n=int(input())\na=list(map(int,input().split()))\na.sort()\nans=\'YES\'\nfor i in range(1,len(a)):\n if a[i-1]==a[i]:\n ans="NO"\n break\n\nprint(ans)']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s412474237', 's720712160', 's804006443', 's829125550', 's505062976']
[34176.0, 26680.0, 26808.0, 3316.0, 25172.0]
[2110.0, 2104.0, 184.0, 19.0, 188.0]
[206, 215, 156, 242, 156]
p02779
u491330513
2,000
1,048,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()\n\nflag = True\nfor i in range(len(A) - 1):\n if A[i] == A[i + 1]:\n flag = False\n break\n \nif flag:\n print("Yes")\nelse:\n print("No")', 'N = input()\nA = list(map(int, input().split()))\n\nA.sort()\n\nflag = True\nfor i in range(len(A) - 1):\n if A[i] == A[i + 1]:\n flag = False\n \nif flag:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int, input().split()))\n\nA.sort()\n\nflag = True\nfor i in range(len(A) - 1):\n if A[i] == A[i + 1]:\n flag = False\n break\n \nif flag:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s300647175', 's340912464', 's774694460']
[26808.0, 25936.0, 25172.0]
[185.0, 194.0, 178.0]
[216, 197, 216]
p02779
u496009935
2,000
1,048,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\ncnt=0\nfor i in range(n):\n for j in range(i+1,n):\n if A[j]!=A[i]:\n cnt+=1\n\nif cnt>1:\n print("No")\nelse:\n print("Yes")', 'n=int(input())\nA=list(map(int,input().split()))\n\ncnt=0\nfor i in range(n):\n for j in range(i+1,n):\n if A[i]==A[j]:\n cnt+=1\n\nif cnt>1:\n print("No")\nelse:\n print("Yes")', "n = int(input())\nA = list(map(int, input().split()))\n\nA = list(set(A))\n\nif len(A) == n:\n print('Yes')\nelse :\n print('No')", 'n=int(input())\nA=list(map(int,input().split()))\n\ncnt=0\nfor i in range(n):\n for j in range(i+1,n):\n if A[j]!=A[i]:\n cnt+=1\nprint(cnt)\nif cnt>1:\n print("No")\nelse:\n print("Yes")', 'n=int(input())\nA=list(map(int,input().split()))\n\ncnt=0\nfor i in range(n):\n for j in range(i+1,n):\n if A[i]==A[j]:\n cnt+=1\n break\n\nif cnt==1:\n print("YES")\nelse:\n print("NO")', "n = int(input())\nA = list(map(int, input().split()))\n\nA = list(set(A))\n\nif len(A) == n:\n print('YES')\nelse :\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s065885208', 's565049302', 's694181252', 's928065289', 's949256016', 's883620518']
[30868.0, 31192.0, 31220.0, 30916.0, 31028.0, 30920.0]
[2206.0, 2206.0, 99.0, 2206.0, 2206.0, 98.0]
[192, 192, 127, 202, 211, 127]
p02779
u497952650
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = int(input())\nA = list(map(int,input().split()))\n\nif len(set(a)) == N:\n print('YES')\nelse:\n print('NO')", 'N = int(input())\na = list(map(int,input().split()))\n\nif set(a)==N:\n print("Yes")\nelse:\n print("No")', "N = int(input())\nA = list(map(int,input().split()))\n \nif len(set(A)) == N:\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Wrong Answer', 'Accepted']
['s202633643', 's635357207', 's404963908']
[26808.0, 25932.0, 25932.0]
[68.0, 84.0, 85.0]
[108, 101, 109]
p02779
u498575211
2,000
1,048,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 = A\nif len(B) == len(list(set(A))):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int, input().split()))\nB = A\nif len(B) == len(list(set(A))):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s018518899', 's976454737']
[25684.0, 25936.0]
[89.0, 90.0]
[125, 125]
p02779
u498620941
2,000
1,048,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 = [int(i) for i in input().split()]\n s = set()\n for i in range(N):\n s.add(A[i])\n\n if N == len(s):\n print("Yes")\n else:\n print("No")\n\nif __name__ == \'__main__\':\n main()', 'def main():\n N = int(input())\n A = [int(i) for i in input().split()]\n s = set()\n for i in range(N):\n s.add(A[i])\n\n if N == len(s):\n print("YES")\n else:\n print("NO")\n\nif __name__ == \'__main__\':\n main()']
['Wrong Answer', 'Accepted']
['s101961052', 's681531609']
[25168.0, 25812.0]
[109.0, 106.0]
[242, 242]
p02779
u499106786
2,000
1,048,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())\nstr_list = input.split(" ")\n\nyes = True\n\nfor index, s in enumerate(str_list):\n\tif s in str_list[:index]:\n \tyes = False\n \t\tbreak\nif yes:\n\tprint("YES")\nelse:\n\tprint("NO")', 'num = int(input())\nstr_list = input.split(" ")\n \nnum_dict = {}\nyes = True\nfor s in str_list:\n if s in num_dict:\n yes = False\n break\n else:\n num_dict[s] = 1\nif yes:\n print("YES")\nelse:\n print("NO")', 'num = int(input())\nstr_list = input.split(" ")\n\nnum_dict = {}\nfor s in str_list:\n if s in num_dict:\n print("NO")\n return\n else:\n num_dict[s] = 1\nprint("YES")', 'num = input()\nstr_list = input.split(" ")\n \nyes = True\n\nfor index, s in enumerate(str_list):\n\tif s in str_list[:index]:\n\t\tyes = False\n\t\tbreak\nif yes:\n\tprint("YES")\nelse:\n\tprint("NO")', 'num = int(input())\nstr_list = input.split(" ")\n\nyes = True\n \nfor index, s in enumerate(str_list):\n\tif s in str_list[:index]:\n \tyes = False\n\t\tbreak\nif yes:\n\tprint("YES")\nelse:\n\tprint("NO")', 'num = int(input())\nstr_list = input.split(" ")\n\nyes = True\n \nfor index, s in enumerate(str_list):\n\tif s in str_list[:index]:\n\t\tyes = False\n\t\tbreak\nif yes:\n\tprint("YES")\nelse:\n\tprint("NO")', 'num = input()\nstr_list = input().split(" ")\n \nyes = True\nnum_dict = {}\nfor s in str_list:\n\tif s in num_dict:\n\t\tyes = False\n\t\tbreak\n\telse:\n\t\tnum_dict[s] = 1\nif yes:\n\tprint("YES")\nelse:\n\tprint("NO")']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s027949871', 's064295487', 's090804255', 's336493009', 's902415084', 's980183226', 's654962778']
[2940.0, 3060.0, 2940.0, 3060.0, 2940.0, 3060.0, 38732.0]
[17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 91.0]
[192, 209, 168, 182, 190, 187, 196]
p02779
u499832992
2,000
1,048,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()\ntmp = 0\nflag = True\nfor i in range(n):\n if a[i] == tmp:\n flag = False\n break\n tmp = a[i]\n\nif flag:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ntmp = 0\nflag = True\nfor i in range(n):\n if a[i] == tmp:\n flag = False\n break\n tmp = a[i]\n\nif flag:\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s234200241', 's562623527']
[26808.0, 26804.0]
[185.0, 180.0]
[219, 219]
p02779
u507113442
2,000
1,048,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())\nans="Yes"\nfor i in range(n):\n for j in range(n):\n if a[i]==a[j]:\n ans="No"\nprint(ans)', 'n=int(input())\na=list(input())\nans="Yes"\nfor i in range(n-1):\n if a[i]==a[i+1]:\n ans="No"\nprint(ans)\n', 'n=int(input())\na=set(map(int,input().split()))\nprint("Yes") if len(a)==n else print("No")', 'n=int(input())\na=set(map(int,input().split()))\nprint("YES") if len(a)==n else print("NO")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s107198012', 's905277657', 's990368725', 's538687410']
[22588.0, 23484.0, 36660.0, 35916.0]
[2108.0, 84.0, 109.0, 100.0]
[125, 105, 89, 89]
p02779
u508164527
2,000
1,048,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()]\nla = len(A)\nB = set(A)\nlb = len(B)\nif la == lb:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = [int(x) for x in input().split()]\nla = len(A)\nB = set(A)\nlb = len(B)\nif la == lb:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s937525313', 's572331179']
[25936.0, 25452.0]
[100.0, 99.0]
[137, 137]
p02779
u508934152
2,000
1,048,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\nL = []\n\nfor i in range(N):\n if A[i] not in L:\n L.append(A[i])\n if i == N-1:\n print('Yes')\n else:\n print('No')\n break", "N = int(input())\nA = input().split()\n\nL = []\n\nfor i in range(N):\n if A[i] not in L:\n L.append(A[i])\n if i == N-1:\n print('Yes')\n else:\n print('No')\n break", "N = int(input())\nseq = input().split()\n\nif len(seq) != len(set(seq)):\n print('YES')\nelse:\n print('NO')", "N = int(input())\nseq = input().split()\n \nif len(seq) != len(set(seq)):\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s051380029', 's264320836', 's803136429', 's647505322']
[20792.0, 20796.0, 31156.0, 30156.0]
[2104.0, 2105.0, 64.0, 62.0]
[173, 173, 104, 105]
p02779
u509830642
2,000
1,048,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\nimport numpy as np', "def print_ans(N, ar):\n print(1)\nif __name__ == '__main__':\n N = int(input().rstrip())\n ar = list(map(int,input().rstrip().split()))\n print_ans(N, ar)", 'import sys\ninput = sys.stdin.readline\nimport numpy as np\ndef print_ans(N, ar):\n """Test Case\n >>> print_ans(5, [2, 6, 1, 4, 5])\n YES\n >>> print_ans(6, [4, 1, 3, 1, 6, 2])\n NO\n >>> print_ans(2, [10000000, 10000000])\n NO\n """\n br = set(ar)\n print("YES" if len(br) == N else "NO")\n \n\nif __name__ == \'__main__\':\n N = int(input().rstrip())\n ar = list(map(int,input().rstrip().split()))\n print_ans(N, ar)\n\n\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s516382186', 's720430005', 's024261597']
[12424.0, 26808.0, 34460.0]
[154.0, 68.0, 223.0]
[56, 161, 443]
p02779
u510434738
2,000
1,048,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\nfor i in range(N):\n a = A.pop(0)\n if a in A:\n print("No")\n break\n\nif i == N-1:\n print("Yes")', 'N = int(input())\nA = input().split()\nA.sort()\nf = 0\n\nfor i in range(N - 1):\n if A[i] == A[i+1]:\n print("NO")\n f += 1\n break\n\nif f==1:\n print("YES")', 'N = int(input())\nA = input().split()\nA.sort()\nf = 0\n\nfor i in range(N - 1):\n if A[i] == A[i+1]:\n print("NO")\n f += 1\n break\n\nif f==0:\n print("YES")\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s327164471', 's481861638', 's363730195']
[20796.0, 20052.0, 20796.0]
[2104.0, 232.0, 208.0]
[153, 174, 175]
p02779
u511824539
2,000
1,048,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_dice, n_choice = map(int, input().split())\ndice_list = tuple(map(int, input().split()))\nsumofarea_list = [sum(dice_list[i:i+n_choice]) for i in range(n_dice - n_choice + 1)]\nprint(max(sumofarea_list)/2 + n_choice / 2)', "list_len = int(input())\ninteger_list = map(int ,input().split())\nif list_len == len(set(integer_list)):\n print('YES')\nelse:\n print('NO')"]
['Runtime Error', 'Accepted']
['s287592043', 's373600515']
[3060.0, 36656.0]
[17.0, 88.0]
[219, 142]
p02779
u511854420
2,000
1,048,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\ndef check(seq):\n if len(seq) != len(set(seq)):\n return "YES"\n else:\n return "NO"\n\nprint(check(A))', 'N = int(input())\nA = list(map(int, input().split()))\n\ndef check(seq):\n if len(seq) != len(set(seq)):\n return "NO"\n else:\n return "YES"\n\nprint(check(A))']
['Wrong Answer', 'Accepted']
['s703077175', 's202932672']
[25452.0, 26808.0]
[85.0, 84.0]
[171, 171]
p02779
u512099209
2,000
1,048,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()\n\nfor i in range(N - 1):\n if A[i] == A[i + 1]:\n print('NO')\n return\n\nprint('YES')\n", "N = int(input())\nA = list(map(int, input().split()))\n\nA.sort()\n\nfor i in range(N - 1):\n if A[i] == A[i + 1]:\n print('NO')\n break\nelse:\n print('YES')\n"]
['Runtime Error', 'Accepted']
['s588659260', 's577129501']
[2940.0, 26808.0]
[17.0, 181.0]
[161, 169]
p02779
u514118270
2,000
1,048,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()))\nA = Counter(a)\nfor v in A.values():\n if v >= 2:\n print('No')\n exit()\nprint('Yes')", "from collections import Counter\nN = int(input())\na = list(map(int,input().split()))\nA = Counter(a)\nfor v in A.values():\n if v >= 2:\n print('NO')\n exit()\nprint('YES')"]
['Wrong Answer', 'Accepted']
['s153541175', 's285004576']
[33996.0, 33996.0]
[118.0, 120.0]
[172, 172]
p02779
u514390882
2,000
1,048,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()))\nlst = []\nflug = True\nfor i in range(n):\n if a[i] in lst:\n flug = False\n break\n lst.append(a[i])\nif flug: print("Yes")\nelse: print("No")', 'import time\nstart = time.time()\n\nn = int(input())\na = list(map(int, input().split()))\n\n# st = set()\n\n# st.add(a[i])\n# if len(st) == n: print("YES")\n# else: print("NO")\n\n# print(time.time() - start)\n\na.sort()\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print("NO")\n break\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s470222131', 's466572198']
[26808.0, 26800.0]
[2104.0, 181.0]
[208, 361]
p02779
u515052479
2,000
1,048,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())\nnum_list = list(map(int,input().split()))\n\nbase = len(set(num_list))\n\nif base == num:\n ans = "No"\nelif not base == num:\n ans = "Yes"\n\nprint(ans)\n', 'num = int(input())\nnum_list = list(map(int,input().split()))\n\nbase = len(set(num_list))\n\nif base == num:\n ans = "Yes"\nelif not base == num:\n ans = "No"\n\nprint(ans)\n', 'num = int(input())\nnum_list = list(map(int,input().split()))\n\nbase = len(set(num_list))\n\nif base == num:\n ans = "Yes"\nelif not base == num:\n ans = "No"\n\nprint(ans)\n', 'num = int(input())\nnum_list = list(map(int,input().split()))\n\nbase = len(set(num_list))\n\nif base == num:\n ans = "YES"\nelif not base == num:\n ans = "NO"\n\nprint(ans)\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s255120065', 's277703618', 's400430099', 's191067697']
[26804.0, 25172.0, 25172.0, 26808.0]
[83.0, 83.0, 84.0, 83.0]
[166, 166, 166, 166]
p02779
u516554284
2,000
1,048,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\ninput=sys.stdin.readline\n\nn=int(input())\na=list(map(int,input().split()))\n\nc=Counter(a)\nif n==a:\n print('YES')\n \nelse:\n print('NO')", "import sys\nfrom collections import Counter\ninput=sys.stdin.readline\n\nn=int(input())\na=list(map(int,input().split()))\n\nc=Counter(a)\nif n==c:\n print('YES')\n \nelse:\n print('NO')", "import sys\nfrom collections import Counter\ninput=sys.stdin.readline\n\nn=int(input())\na=list(map(int,input().split()))\n\nc=len(Counter(a))\nif n==c:\n print('YES')\n \nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s064910388', 's333831425', 's777773208']
[35320.0, 35448.0, 35204.0]
[101.0, 98.0, 100.0]
[177, 177, 182]
p02779
u518085378
2,000
1,048,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()))\na = sum(p[0:k])\nl = [a]\nfor i in range(n-k):\n a = a-p[i]+p[i+k]\n l.append(a)\nprint((max(l)+k)/2)', 'n, k = map(int, input().split())\np = list(map(int, input().split()))\na = sum(p[0:k])\nl = [a]\nfor i in range(n-k):\n a = a-p[i]+p[i+k]\n l.append(a)\nprint(l)\nprint((max(l)+k)/2)\n', 'n=int(input())\ns=list(map(int,input().split()))\nd=list(set(s))\nif len(s)==len(d):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s404563109', 's411826359', 's431610644']
[3060.0, 3060.0, 26808.0]
[17.0, 19.0, 95.0]
[171, 181, 116]
p02779
u518386853
2,000
1,048,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\na1 = sorted(a)\n\nfor i in range(1, n):\n if a1[i] == a1[i-1]:\n print("No")\n break\n elif i == n-1:\n print("Yes")', 'n = int(input())\na = list(map(int, input().split()))\n\na1 = sorted(a)\n\nfor i in range(1, n):\n if a1[i] == a1[i-1]:\n print("NO")\n break\n elif i == n-1:\n print("YES")']
['Wrong Answer', 'Accepted']
['s376727000', 's508485943']
[25932.0, 26680.0]
[197.0, 201.0]
[174, 174]
p02779
u518891382
2,000
1,048,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()))\nst = set(s)\n\nif len(st) == n:\n \tprint("Yes")\nelse:\n\tprint("No")', 'n = int(input())\ns = list(map(int, input().split()))\n\nst = set(s)\n\nif len(st) == n:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s259358314', 's772211463']
[31152.0, 31016.0]
[94.0, 93.0]
[116, 123]
p02779
u519339498
2,000
1,048,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()\nans=0\nfor x in range(N-1):\n if A[x]==A[x+1]:\n ans += 1\n break\nif ans==0:\n print("Yes")\nelse:\n print("No")', 'N=int(input())\nA=list(map(int,input().split()))\nA.sort()\nans=0\nfor x in range(N-1):\n if A[x]==A[x+1]:\n ans += 1\n break\nif ans==0:\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s968444482', 's783223705']
[30964.0, 30976.0]
[136.0, 131.0]
[171, 171]
p02779
u519968172
2,000
1,048,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()\ns=""\nr=0\nfor m in a:\n if m == s:\n r=1\n s=m\nif r ==1:\n print("No")\nelse:\n print("Yes")\n', 'n=int(input())\na=list(map(int,input().split()))\na.sort()\ns=""\nr=0\nfor m in a:\n if m == s:\n r=1\n s=m\nif r ==1:\n print("NO")\nelse:\n print("YES")\n']
['Wrong Answer', 'Accepted']
['s526067756', 's520214989']
[26808.0, 26676.0]
[178.0, 173.0]
[150, 150]
p02779
u521271655
2,000
1,048,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()))\nx = 0\nlis.sort()\nfor i in range(0,N+1):\n if lis[i] == lis[i+1]:\n x = 1\n break\nif x == 0:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nlis = list(map(int,input().split()))\nx = 0\nlis.sort()\nfor i in range(0,N):\n if lis[i] == lis[i+1]:\n x = 1\n break\nif x == 0:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nlis = list(map(int,input().split()))\nx = 0\nfor i in range(N):\n for j in range(i,N):\n if lis[i] == lis[j]:\n x = 1\nif x == 0:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nlis = list(map(int,input().split()))\nlis.sort()\njudge = 0\nfor i in range(1,N):\n if lis[i-1] == lis[i]:\n judge = 1\nif judge == 0:\n print("YES")\nelse:\n print("NO")\n']
['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s009425968', 's833127284', 's946960761', 's254726394']
[26808.0, 26676.0, 25172.0, 26808.0]
[179.0, 182.0, 2104.0, 186.0]
[226, 224, 232, 195]
p02779
u523087093
2,000
1,048,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\ncount_list = []\nfor a in A_list:\n count = 0\n for i in range(N):\n if a == A_list[i]:\n count += 1\n count_list.append(count)\n\nif max(count_list) == 1:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA_list = list(map(int, input().split()))\nA_set = set(A_list)\n\nif len(A_list) == len(A_set):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Accepted']
['s742127383', 's605566920']
[25172.0, 26808.0]
[2104.0, 90.0]
[272, 147]
p02779
u523545435
2,000
1,048,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_sorted=sorted(A)\n\nans='Yes'\n\nfor i in range(N-1):\n if A_sorted[i]==A_sorted[i+1]:\n ans='No'\n break\n\nprint(ans)", "N=int(input())\nA=list(map(int,input().split()))\n\nA_sorted=sorted(A)\n\nans='YES'\n\nfor i in range(N-1):\n if A_sorted[i]==A_sorted[i+1]:\n ans='NO'\n break\n\nprint(ans)"]
['Wrong Answer', 'Accepted']
['s128669943', 's852218126']
[25172.0, 26804.0]
[185.0, 182.0]
[178, 178]
p02779
u524489226
2,000
1,048,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_n = []\nfor i in range(n):\n list_n.append(int(input()))\n\nif len(list_n) == len(set(list_n)):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\nlist_n = list(map(int, input().split()))\n\nif len(list_n) == len(set(list_n)):\n print("YES")\nelse:\n print("NO")']
['Runtime Error', 'Accepted']
['s555318508', 's083929404']
[7004.0, 26804.0]
[30.0, 83.0]
[155, 133]
p02779
u524534026
2,000
1,048,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):\n if A[i]==A[i+1]:\n print('NO')\n sys.exit()\nprint('YES')", "import sys\nN=int(input())\nA=list(map(int,input().split()))\nA.sort()\nfor i in range(1,N):\n if A[i-1]==A[i]:\n print('NO')\n sys.exit()\nprint('YES')"]
['Runtime Error', 'Accepted']
['s926687647', 's812007416']
[26808.0, 25936.0]
[189.0, 182.0]
[159, 161]
p02779
u527993431
2,000
1,048,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()))\nif N==set(L):\n print("YES")\nelse:\n print("NO")', 'N=int(input())\nL=list(map(int,input().split()))\nif N==len(set(L)):\n print("YES")\nelse:\n print("NO")']
['Wrong Answer', 'Accepted']
['s118117807', 's627223219']
[26800.0, 26808.0]
[84.0, 84.0]
[96, 101]
p02779
u529243496
2,000
1,048,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\nflag = True\n\nwhile flag:\n for i in range(N-1):\n for j in range(i+1, N):\n if A[i] == A[j]:\n print('No') \n flag = False \nwhile flag:\n print('Yes')\n ", "N = int(input())\nA = [int(x) for x in input().split()]\n\nflag = True\n\nwhile flag:\n for i in range(N-1):\n for j in range(i+1, N):\n if A[i] == A[j]:\n print('NO') \n flag = False \nwhile flag:\n print('YES')", "N = int(input())\nA = [int(x) for x in input().split()]\n\nif len(A) != len(set(A)):\n print('NO')\nelse:\n print('YES')"]
['Wrong Answer', 'Time Limit Exceeded', 'Accepted']
['s120699172', 's898793338', 's110075258']
[25172.0, 25172.0, 25812.0]
[2108.0, 2104.0, 93.0]
[268, 263, 120]
p02779
u530883476
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['a=int(input())\nb=list(input().split())\nc=sorted(b)\ncount=0\nfor i in range (a-1):\n\tif c[i]==c[i+1]:\n\t\tcount=1\n\t\tbreak\n\t\nif count==1:\n\tprint("No")\t\nelse:print("Yes")', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\ncount=0\nfor i in range (a-1):\n\tif c[i]==c[i+1]:\n\t\tcount=1\n\t\tbreak\n\telse:count=0\n\t\nif count==1:\n\tprint("No")\t\nelse:print("Yes")', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\nfor i in range (a-1):\n\tif c[i]==c[i+1]:\n\t\tprint("No")\n\t\tbreak\n\telse:print("Yes")', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\nfor i in range (a):\n\tif c[i]==c[i+1]:\n\t\tprint("No")\n\t\tbreak\n\telse:print("Yes")\n\t', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\nfor i in range (a-1):\n\tif c[i]==c[i+1]:\n\t\tprint("NO")\n\t\tbreak\n\telse:print("YES")', 'a=int(input())\nb=list(input().split())\nc=sorted(b)\ncount=0\nfor i in range (a-1):\n\tif c[i]==c[i+1]:\n\t\tcount=1\n\t\tbreak\n\t\nif count==1:\n\tprint("NO")\t\nelse:print("YES")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s457648320', 's518267554', 's760759292', 's899449843', 's981847272', 's500254535']
[21940.0, 21944.0, 22872.0, 22856.0, 22872.0, 21940.0]
[210.0, 217.0, 322.0, 349.0, 315.0, 204.0]
[163, 177, 131, 131, 131, 163]
p02779
u531220228
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['_ = int(input())\nA = list(map(int, input().split()))\n\nimport collections\nc = collections.Counter(A)\n\nif max(c.values()) > 1:\n print("No") \nelse:\n print("Yes")', '_ = int(input())\nA = list(map(int, input().split()))\n\nimport collections\nc = collections.Counter(A)\n\nif max(c.values()) > 1:\n print("NO") \nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s433603919', 's506369384']
[33132.0, 33076.0]
[112.0, 118.0]
[164, 164]
p02779
u531599639
2,000
1,048,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()}\nprint('YNEOS'[len(A)==N::2]", "N = int(input())\nA = {input().split()}\nprint('YNEOS'[len(A)==N::2])\n", "n = int(input())\nprint('YNEOS'[len(set(input().split()))!=n::2])"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s138561672', 's187567909', 's610562891']
[2940.0, 19160.0, 30160.0]
[17.0, 36.0, 67.0]
[66, 68, 64]
p02779
u531813438
2,000
1,048,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)\nf=0\nfor i in c.values():\n if i>1:\n f+=1\n break\nif f==1:\n print("No")\nelse:\n print("Yes")', 'import collections\nN = int(input())\nA = list(map(int, input().split()))\nc = collections.Counter(A)\nf=0\nfor i in c.values():\n if i>1:\n f+=1\n break\nif f==1:\n print("NO")\nelse:\n print("YES")']
['Wrong Answer', 'Accepted']
['s960606100', 's822925678']
[33996.0, 33996.0]
[125.0, 116.0]
[210, 210]
p02779
u534308356
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
['n = int(input())\ndata = list(map(int, input().split()))\n\ndata.sort()\n\nans = "Yes"\nfor i in range(len(data) - 1):\n if data[i] == data[i+1]:\n ans = "No"\n break\n\nprint(ans)\n', 'n = int(input())\ndata = list(map(int, input().split()))\n\ndata.sort()\n\nans = "YES"\nfor i in range(len(data) - 1):\n if data[i] == data[i+1]:\n ans = "NO"\n break\n\nprint(ans)\n']
['Wrong Answer', 'Accepted']
['s901946579', 's597562902']
[25936.0, 25168.0]
[180.0, 181.0]
[177, 177]
p02779
u534953209
2,000
1,048,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(list)\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")']
['Runtime Error', 'Accepted']
['s258905255', 's101630495']
[26808.0, 26808.0]
[66.0, 90.0]
[122, 119]
p02779
u536034761
2,000
1,048,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)\nprint("Yes" if len(A) == len(B) else "No")', 'N = int(input())\nA = list(map(int, input().split()))\nB = set(A)\nprint("YES" if len(A) == len(B) else "NO")']
['Wrong Answer', 'Accepted']
['s780246839', 's860799719']
[25936.0, 25172.0]
[92.0, 91.0]
[106, 106]
p02779
u536450775
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["n = int(input())\na = list(map(int, input().split()))\n\nfor i in range(n):\n if a[i] in a:\n print('NO')\n break\nelse:\n print('YES')\n", "n = int(input())\na = list(map(int, input().split()))\na.sort()\n\ntmp = a[0]\nfor i in range(1,n):\n if a[i] == tmp:\n print('NO')\n break\n else:\n tmp = a[i]\nelse:\n print('YES')\n"]
['Wrong Answer', 'Accepted']
['s558413258', 's514997264']
[26804.0, 26808.0]
[67.0, 186.0]
[148, 201]
p02779
u537070292
2,000
1,048,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())\nabc = list(map(int, input().split()))\nans = 'YES'\nabc = sorted(abc)\nfor i in range(n):\n if abc[i] = abc[i+1]\n ans ='NO'\n\nprint(ans)\n", "n = int(input())\nabc = list(map(int, input().split()))\nans = 'YES'\nabc = sorted(abc)\nfor i in range(n-1):\n if abc[i] == abc[i+1]:\n \tans ='NO'\n\nprint(ans)"]
['Runtime Error', 'Accepted']
['s610907098', 's783018731']
[2940.0, 26808.0]
[17.0, 187.0]
[151, 155]
p02779
u537550206
2,000
1,048,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_2 = set(a)\nif len(a) == len(a_2):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = list(map(int, input().split()))\na_2 = set(a)\nif len(a) == len(a_2):\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s688848369', 's265718984']
[26804.0, 26808.0]
[90.0, 92.0]
[127, 128]
p02779
u538361257
2,000
1,048,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\ns = set(A_list)\n\nif len(s) == N:\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nA_list = list(map(int, input().split()))\n\ns = set(A_list)\n\nif len(s) == N:\n print("YES")\nelse:\n print("NO")\n']
['Wrong Answer', 'Accepted']
['s931165951', 's076701339']
[26800.0, 26808.0]
[95.0, 91.0]
[131, 131]
p02779
u538844871
2,000
1,048,576
Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`.
["N = input()\nA = list(map(int, input().split()))\n\nif N == len(set(A)):\n print('YES')\nelse:\n print('NO')\n", "N = input()\nA = list(map(int, input().split()))\n\nval = True\nfor i in A:\n if i == N:\n val = False\n break\n else:\n continue\n\nif val == False:\n print('No')\nelse:\n print('Yes')\n ", "N = input()\nA = list(map(int, input().split()))\n\nif N == len(set(A)):\n print('Yes')\nelse:\n print('No')\n", "N = int(input())\nA = list(map(int, input().split()))\n\nif N == len(set(A)):\n print('YES')\nelse:\n print('NO')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s418628781', 's760436382', 's982094379', 's009133509']
[26808.0, 26808.0, 26804.0, 26808.0]
[83.0, 86.0, 84.0, 84.0]
[105, 187, 105, 109]