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 | u674052742 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['# -*- coding: utf-8 -*-\n"""\nCreated on Wed Mar 4 17:27:29 2020\n\n@author: Kanaru Sato\n"""\n\nN = int(input())\nA = input().split()\nflag = 0\n\nfor i in range(0,N):\n for j in range(0,N):\n if A[i] == A[j]:\n flag = 1\n\nif flag == 0:\n print("YES")\nelse:\n print("NO")', '# -*- coding... | ['Wrong Answer', 'Accepted'] | ['s997034035', 's248322051'] | [19280.0, 38836.0] | [2104.0, 126.0] | [283, 418] |
p02779 | u674190122 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['\'\'\'\nSample Input 1 \n\n5\n2 6 1 4 5\nSample Output 1 \n\nYES\n\'\'\'\nlens = int(input())\narrs = [int(x) for x in input(),split()]\nprint(["NO", "YES"][len(arrs) == len(set(arrs))])', '\'\'\'\nSample Input 1\n\n5\n2 6 1 4 5\nSample Output 1\n\nYES\n\'\'\'\nlens = int(input())\narrs = [int(x) for x in input().spl... | ['Runtime Error', 'Accepted'] | ['s814516291', 's506074964'] | [2940.0, 25936.0] | [17.0, 90.0] | [169, 167] |
p02779 | u674347990 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['length = int(input())\nnumArr = [int(str_num) for str_num in input().split(\' \')]\n\nnumArr.sort()\n\nfor i in range(0, length - 1):\n if numArr[i] == numArr[i + 1]:\n print("No")\n exit()\n\nprint("Yes")', 'length = int(input())\nnumArr = [int(str_num) for str_num in input().split(\' \')]\n\nnumArr.sort()\n\... | ['Wrong Answer', 'Accepted'] | ['s971704264', 's909002085'] | [25936.0, 25812.0] | [188.0, 179.0] | [200, 256] |
p02779 | u674588203 | 2,000 | 1,048,576 | 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=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'] | ['s670100161', 's903920210'] | [26808.0, 25936.0] | [89.0, 89.0] | [109, 109] |
p02779 | u681811488 | 2,000 | 1,048,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)\n\nif c.most_common()[0][1] > 2:\n print('YES')\nelse:\n print('NO')", "import collections\nN = int(input())\nA = list(map(int, input().split())) \nc = collections.Counter(A)\n\nif c.most_common()[0][1] >= 2:\n p... | ['Wrong Answer', 'Accepted'] | ['s649223075', 's182133903'] | [40136.0, 40136.0] | [171.0, 181.0] | [165, 166] |
p02779 | u683406607 | 2,000 | 1,048,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\nN1 = int(input())\nA = np.array(map(int, input().split()))\nN2 = np.unique(A).size\n\nif N1 == N2:\n print('YES')\nelse:\n print('NO')", "import numpy as np\n\nN1 = int(input())\nA = np.array(map(int, input().split()))\n\nN2 = np.unique(A).size\n\nif N1 == N2:\n print('YES')\nelse:\n pri... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s049748525', 's617218797', 's921313338'] | [28204.0, 28204.0, 26808.0] | [173.0, 1382.0, 92.0] | [153, 150, 125] |
p02779 | u684204084 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['# = map(int, input().split())\nn = int(input())\n# = input()\na = list(map(int, input().split()))\n\na.sort()\n\nnow = a[0]\nfor i in range(1, n):\n\tif now == a[i]:\n\t\tprint("No")\n\t\texit(0)\n\telse:\n\t\tnow = a[i]\nprint("Yes")', '# = map(int, input().split())\nn = int(input())\n# = input()\na = list(map(int, ... | ['Wrong Answer', 'Accepted'] | ['s140295971', 's090312370'] | [26676.0, 26808.0] | [178.0, 182.0] | [212, 212] |
p02779 | u684305751 | 2,000 | 1,048,576 | 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()))\nprint("YES" if len(set(a))==len(a) else "NO"', 'n=input()\na=list(map(int,input().split()))\nprint("YES" if len(set(a))==len(a) else "NO")'] | ['Runtime Error', 'Accepted'] | ['s040351581', 's747788557'] | [2940.0, 26808.0] | [17.0, 84.0] | [87, 88] |
p02779 | u688219499 | 2,000 | 1,048,576 | 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=[0]*(10**9)\nfor i in range(N):\n if B[A[i]-1]>=1: \n print("NO")\n exit(0)\n else:\n B[A[i]-1]+=1\nprint("YES")', 'N=int(input())\nA=list(map(int,input().split()))\nlist.sort(A)\nfor i in range(N-1):\n if A[i]-A[i+1]==0:\n print... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s034805309', 's087594880', 's329657921', 's919293688', 's954882316', 's395388465'] | [26804.0, 26804.0, 26808.0, 26808.0, 25172.0, 26808.0] | [66.0, 181.0, 190.0, 67.0, 183.0, 182.0] | [182, 180, 180, 182, 153, 149] |
p02779 | u690536347 | 2,000 | 1,048,576 | 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*l = map(int, input().split())\nprint("YES" if len(l)==len(set(l)) else "NO")', 'N = int(input())\n*l, = map(int, input().split())\nprint("YES" if len(l)==len(set(l)) else "NO")'] | ['Runtime Error', 'Accepted'] | ['s835795215', 's530714471'] | [3064.0, 25684.0] | [17.0, 82.0] | [93, 94] |
p02779 | u693378622 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = list(map(int, input().split()))\ns = list(set(a))\n\nif len(a) == len(s):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = list(map(int, input().split()))\ns = list(set(a))\n\nif len(a) == len(s):\n print("YES")\nelse:\n print("NO")\n'] | ['Wrong Answer', 'Accepted'] | ['s642554120', 's349232232'] | [25936.0, 26804.0] | [94.0, 94.0] | [130, 131] |
p02779 | u693933222 | 2,000 | 1,048,576 | 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\nflag = 0\nfor i in range(0, n - 1):\n if (flag == 1):\n break\n for j in range(i+1, n):\n if (a[i] == a[j]):\n flag = 1\n break\n\nif(flag == 1):\n print("No")\nelse:\n print("Yes")\n', 'n = int(input())\na = list... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s056954484', 's793690311', 's935564758', 's864419635'] | [26804.0, 26808.0, 26808.0, 26804.0] | [2104.0, 191.0, 180.0, 183.0] | [272, 210, 214, 210] |
p02779 | u694233896 | 2,000 | 1,048,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())\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print("Yes")\nelse:\n print("No")\n', '\nN = int(input())\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")\n'] | ['Wrong Answer', 'Accepted'] | ['s453151002', 's434928978'] | [31084.0, 31104.0] | [91.0, 88.0] | [120, 120] |
p02779 | u695261159 | 2,000 | 1,048,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()))\ncnt = collections.Counter(A)\n\nif cnt.most_common()[0][1] > 1:\n print('No')\nelse:\n print('Yes')", "import collections\nN = int(input())\nA = list(map(int, input().split()))\ncnt = collections.Counter(A)\n \nif cnt.most_common()[0][1]... | ['Wrong Answer', 'Accepted'] | ['s328419054', 's097497925'] | [40136.0, 40136.0] | [178.0, 177.0] | [172, 173] |
p02779 | u696805736 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = set(map(int, input().split()))\nprint('Yes' if len(a) == n else 'No')\n", "n = int(input())\na = set(map(int, input().split()))\nprint('YES' if len(a) == n else 'NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s743584041', 's786981850'] | [36660.0, 36660.0] | [90.0, 90.0] | [90, 90] |
p02779 | u697101155 | 2,000 | 1,048,576 | 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\ncount = 0\nfor i in range(N):\n if A[i] == A[i+1]:\n count += 1\n break\n\nif count == 0:\n print('YES')\nelse:\n print('NO') ", "N = int(input())\nA = list(map(int, input().split()))\n\nA.sort()\n\ncount = 0\nfor i in rang... | ['Runtime Error', 'Accepted'] | ['s490052381', 's936680305'] | [26812.0, 25172.0] | [178.0, 178.0] | [207, 209] |
p02779 | u697601622 | 2,000 | 1,048,576 | 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())\nflag=0\n\nfor i in range(N): \n for i1 in range(N): \n if i != i1: \n if A[i] == A[i1]: \n break\n else:\n flag+=1\n\nif flag>0:\n print("YES")\nelse:\n print("NO")', 'N = int(input()... | ['Runtime Error', 'Accepted'] | ['s794816053', 's356732013'] | [20796.0, 25936.0] | [36.0, 98.0] | [284, 121] |
p02779 | u697968316 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nList = list(map(int, input().split()))\n\ncount = 'Yes'\nfor i in range(N-1):\n for j in range(N-1-i):\n if List[i] == List[i+1+j]:\n count = 'No'\n\nprint(count)", "N = int(input())\nList = list(map(int, input().split()))\n\nList.sort()\ncount = 'YES'\nfor i in range(N-1):\n ... | ['Wrong Answer', 'Accepted'] | ['s816526052', 's741104380'] | [26808.0, 26804.0] | [2104.0, 210.0] | [192, 175] |
p02779 | u698868214 | 2,000 | 1,048,576 | 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\ncheck = True\nfor i in range(A):\n if A.count(A[i]) > 1:\n check = False\n \nprint("Yes" if check else "No")', 'N = int(input())\nA = list(map(int,input().split()))\nA.sort()\n\ncheck = True\nfor i in range(N-1):\n if A[i] == A[i+1]:\n check = False\n... | ['Runtime Error', 'Accepted'] | ['s860095441', 's049061381'] | [31112.0, 31044.0] | [75.0, 139.0] | [163, 171] |
p02779 | u698919163 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int,input().split()))\n\nimport collections\n\nc = collections.Counter(A)\nvalues, counts = zip(*c.most_common())\n\nif counts[0] != 1:\n print("NO")\nelse:\n print("Yes")', 'N = int(input())\nA = list(map(int,input().split()))\n\nimport collections\n\nc = collections.Counter(A)\n... | ['Wrong Answer', 'Accepted'] | ['s947018839', 's971340934'] | [53580.0, 55088.0] | [272.0, 283.0] | [197, 197] |
p02779 | u699696451 | 2,000 | 1,048,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()))\n\nK = collections.Counter(A)\nB = len(K)\n\nif N == len(K):\n print("Yes")\nelse:\n print("No")', 'import collections\nN = int(input())\nA = list(map(int,input().split()))\n\nK = collections.Counter(A)\nB = len(K)\n\nif N == len(K):\n ... | ['Wrong Answer', 'Accepted'] | ['s281843112', 's751422420'] | [33996.0, 33996.0] | [106.0, 104.0] | [165, 165] |
p02779 | u699944218 | 2,000 | 1,048,576 | 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 = kist(map(int,input().split()))\na.sorted\ni for i in range(n):\n if a[i-1] == a[i] or a[i] == a[i+1]:\nprint('No')\n else:\nprint('Yes')", "N = int(input())\nA = list(map(int,input().split()))\nif len(A) == len(set(A)):\n print('YES')\nelse:\n print('NO')"] | ['Runtime Error', 'Accepted'] | ['s710142307', 's862547275'] | [2940.0, 26804.0] | [17.0, 92.0] | [153, 112] |
p02779 | u700805562 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = input()\na = list(map(int, input().split()))\na.sort()\nflag = False\nfor i in range(len(a)-1):\n if a[i] == a[i+1]:\n flag = True\n break\nif flag:\n print("No")\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... | ['Wrong Answer', 'Accepted'] | ['s824934106', 's255087300'] | [26808.0, 26808.0] | [179.0, 190.0] | [200, 153] |
p02779 | u703528810 | 2,000 | 1,048,576 | 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"\nfor i in range(N-1):\n if A[i] in A[i+1:N]:\n ans="No"\nprint(ans)', 'N=int(input())\nA=list(map(int,input().split()))\nans="Yes"\nA.sort()\nfor i in range(N-1):\n if A[i]==A[i+1]:\n ans="No"\n break\nprint(ans)', 'N=int(input())\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s000931201', 's622103716', 's793019070'] | [26808.0, 26808.0, 26808.0] | [2104.0, 181.0, 192.0] | [131, 150, 150] |
p02779 | u706330549 | 2,000 | 1,048,576 | 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 = list(map(int, input().split()))\n\nb_n = sorted(a_n)\nflg = 0\n\nfor i in range(n - 1):\n if b_n[i] == b_n[i + 1]:\n flg = 1\n\nif flg == 1:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na_n = list(map(int, input().split()))\n\nb_n = sorted(a_n)\nflg = 0\n\nfor i in ... | ['Wrong Answer', 'Accepted'] | ['s735412264', 's375492595'] | [26808.0, 25172.0] | [181.0, 190.0] | [203, 203] |
p02779 | u706786134 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = set(input().split())\nprint('Yes' if len(a) == n else 'No')\n", "n = int(input())\na = set(input().split())\nprint('YES' if len(a) == n else 'NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s955633305', 's274539580'] | [31156.0, 31152.0] | [79.0, 76.0] | [80, 80] |
p02779 | u707030679 | 2,000 | 1,048,576 | 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()))\n\n\nS={}\nans="Yes"\nfor p in P:\n if p in S:\n ans = "No"\n break\n else:\n S[p]=1\n\nprint(ans)\n\n', 'n = int(input())\nP = list(map(int,input().split()))\n\n\nS={}\nans="YES"\nfor p in P:\n if p in S:\n ans = "NO"\n ... | ['Wrong Answer', 'Accepted'] | ['s952037062', 's041397960'] | [35052.0, 35060.0] | [111.0, 111.0] | [167, 167] |
p02779 | u707808519 | 2,000 | 1,048,576 | 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\ncnt = dict()\nfor i in range(N):\n cnt[A[i]] = cnt.get(A[i], 0) + 1\n\nif max(cnt.values()) > 1:\n print('No')\nelse:\n print('Yes')", "N = int(input())\nA = [int(x) for x in input().split()]\n\ncnt = dict()\nfor i in range(N):\n cnt[A[i]] = cnt.g... | ['Wrong Answer', 'Accepted'] | ['s517448618', 's447858543'] | [35276.0, 35352.0] | [139.0, 145.0] | [190, 191] |
p02779 | u709799578 | 2,000 | 1,048,576 | 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 has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nprint('No' if has_duplicates(A) else 'Yes')", "N = int(input())\nA = list(map(int, input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nprint('NO' if has_duplica... | ['Wrong Answer', 'Accepted'] | ['s389743584', 's121311066'] | [26808.0, 25172.0] | [86.0, 84.0] | [160, 160] |
p02779 | u713228137 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import collections\n\nN = int(input())\nn = list(map(int, input().split()))\nc = collections.Counter(n)\n\ncnt = c.most_common()\n\nfor c in cnt:\n if (c[1]>1):\n \tprint('No')\n else:\n print('Yes')\n break\n ", "import collections\n\nN = int(input())\nn = list(map(int, input().split()))\nc = collections.Cou... | ['Wrong Answer', 'Accepted'] | ['s552444054', 's743093355'] | [40136.0, 40132.0] | [183.0, 178.0] | [203, 203] |
p02779 | u716117006 | 2,000 | 1,048,576 | 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_set) == N:\n print("YES")\n else:\n print("NO")', 'N = int(input())\nA = list(map(int, input().split()))\nA_set = set(A)\nif len(A_set) == N:\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Accepted'] | ['s477961561', 's042150635'] | [2940.0, 25936.0] | [18.0, 93.0] | [138, 126] |
p02779 | u718949306 | 2,000 | 1,048,576 | 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\nres = True\nfor n in range(N):\n for i in range(N):\n if n != i:\n if A[n] == A[i]:\n res = False\nif res:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = list(map(int, input().split()))\nA.sort()\nres = A[... | ['Wrong Answer', 'Accepted'] | ['s537508811', 's826781571'] | [26676.0, 26804.0] | [2104.0, 180.0] | [229, 206] |
p02779 | u720124072 | 2,000 | 1,048,576 | 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 set(a) == len(a):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na = map(int, input().split())\n\nif set(a) == len(a):\n print("NO")\nelse:\n print("YES")', 'n = int(input())\na = list(map(int, input().split()))\n\nif len(set(a)) == n:\n print... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s150914096', 's458106244', 's993645818'] | [31184.0, 41108.0, 31036.0] | [89.0, 93.0, 88.0] | [109, 103, 109] |
p02779 | u721425712 | 2,000 | 1,048,576 | 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\nl = [0]*(10**9+10)\nfor i in range(n):\n l[a[i]] += 1\n\nbool = True\nfor j in range(len(l)):\n if l[j] > 1:\n bool = False\n else:\n continue\n \nif bool:\n print('YES')\nelse:\n print('NO')", "n = int(input())\na = list(map... | ['Runtime Error', 'Accepted'] | ['s548480689', 's872328103'] | [25172.0, 25172.0] | [72.0, 83.0] | [267, 142] |
p02779 | u723345499 | 2,000 | 1,048,576 | 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(len(a)):\n if a[i] == a[i-1]\n print("NO")\nelse:\n print("YES")', 'n = int(input())\na = list(map(int, input().split()))\nlength1 = len(a)\nlength2 = len(set(a))\nprint(length1, length2)\nif length1 == length2:\n print("YES... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s162773511', 's274772635', 's385485946'] | [2940.0, 25172.0, 25168.0] | [17.0, 82.0, 182.0] | [147, 177, 166] |
p02779 | u723503495 | 2,000 | 1,048,576 | 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(e) for e in input().split()]\nif len(A) == len(list(set(A))):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = [int(e) for e in input().split()]\nB = len(A)\nC = len(list(set(A)))\nif B == C:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = [int(e) for e ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s362757286', 's658484688', 's844478534', 's777883324'] | [25172.0, 25320.0, 25936.0, 25452.0] | [104.0, 100.0, 2104.0, 98.0] | [125, 137, 303, 125] |
p02779 | u723583932 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['#154 c\nn=int(input())\na=list(map(int,input().split()))\nnum=dict()\nflag=True\nfor x in a:\n if x not in num:\n a[x]=1\n else:\n flag=False\n if flag==False:\n break\nif flag:\n print("YES")\nelse:\n print("NO")\n', '#154 c\nn=int(input())\na=list(map(int,input().split()))\nnum=s... | ['Runtime Error', 'Accepted'] | ['s996151871', 's709453941'] | [26680.0, 26808.0] | [67.0, 90.0] | [235, 125] |
p02779 | u723711163 | 2,000 | 1,048,576 | 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("No")\nelse:\n print("Yes")', 'N = int(input())\nA = list(map(int, input().split()))\n\nif len(set(A)) != N:\n print("NO")\nelse:\n print("YES")'] | ['Wrong Answer', 'Accepted'] | ['s324644570', 's232546771'] | [26800.0, 26808.0] | [86.0, 84.0] | [109, 109] |
p02779 | u724844363 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['from collections import Counter\n\nn = int(input())\na = list(map(int, input().split()))\ncnt = Counter(a)\nflag = [i for i in cnt.values()]\nif len(set(flag)) == 1:\n print("Yes")\nelse:\n print("No")', 'from collections import Counter\n\nn = int(input())\na = list(map(int, input().split()))\ncnt = Counter(a)\... | ['Wrong Answer', 'Accepted'] | ['s736342783', 's185160326'] | [33996.0, 33996.0] | [123.0, 119.0] | [198, 217] |
p02779 | u725107050 | 2,000 | 1,048,576 | 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_line = map(int, input().split())\n\nA_flags = [0] * pow(10, 8)\n\nfor A in A_line:\n A_flags[A-1] += 1\n\nres = 'YES'\nfor A_flag in A_flags:\n if A_flag >= 2:\n res = 'NO'\n\nprint(res)", 'N = int(input())\nA_line = list(map(int, input().split()))\n\nA_line.sort()\n\nres = "YES"\nfor i in ra... | ['Runtime Error', 'Accepted'] | ['s620433526', 's937625203'] | [800056.0, 26808.0] | [2106.0, 184.0] | [198, 178] |
p02779 | u725133562 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = input().split()\nb = len(set(a))\nprint(b)', "n = int(input())\na = input().split()\nb = len(set(a))\nprint('YES' if b==n else 'NO')"] | ['Wrong Answer', 'Accepted'] | ['s254662202', 's739402817'] | [31156.0, 30412.0] | [61.0, 63.0] | [61, 83] |
p02779 | u725359833 | 2,000 | 1,048,576 | 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(" ")))\ndeta=[]\ntry:\n for i in range(n):\n if a[i] in deta:\n\traise "err"\nexcept err:\n\tprint("NO")\nprint("YES")', 'n=int(input())\na=list(map(int,input().split(" ")))\ndeta=[]\nerror=False\n\nfor i in range(n):\n if len(deta)==0:\n pass\n elif error:\n bre... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s315046187', 's410004306', 's468133030', 's576085229', 's622671566', 's721178344', 's763312618', 's546245917'] | [3060.0, 25172.0, 2940.0, 25172.0, 2940.0, 2940.0, 26808.0, 25932.0] | [18.0, 85.0, 17.0, 199.0, 20.0, 17.0, 2108.0, 140.0] | [154, 245, 312, 253, 331, 212, 271, 286] |
p02779 | u728120584 | 2,000 | 1,048,576 | 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 = []\nfor i in range(N):\n A = int(input())\n if A in l:\n print("NO")\n exit()\n l.append(i)\nprint("YES")', 'N = int(input())\nA = set(map(int, input().split()))\nprint("YES" if len(A) == N else "NO")'] | ['Runtime Error', 'Accepted'] | ['s542803376', 's950942302'] | [7004.0, 36660.0] | [28.0, 92.0] | [142, 89] |
p02779 | u728318205 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n =int(input())\nlist = list(input().split())\n\n\nset = set(list)\n\nif len(set) == n:\n print('Yes')\nelse:\n print('No')\n ", "n =int(input())\nlist = list(input().split())\n\n\nset = set(list)\n\nif len(set) == n:\n print('Yes')\nelse:\n print('No')\n ", "n =int(input())\nlist = list(input().spl... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s605531694', 's648615235', 's661251660', 's471962482'] | [31056.0, 31948.0, 32688.0, 32688.0] | [75.0, 75.0, 78.0, 84.0] | [125, 125, 125, 125] |
p02779 | u729939940 | 2,000 | 1,048,576 | 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())\ncnt = {}\nfor a in A:\n if cnt.get(a):\n cnt[a] = cnt[a] + 1\n else:\n cnt[a] = 1\nfor v in cnt.values():\n if v != 1:\n print('No')\n exit()\nprint('Yes')", "N = int(input())\nA = list(map(int, input().split()))\nif len(A) == len(set(A)):\n print('YES'... | ['Wrong Answer', 'Accepted'] | ['s020221217', 's771440458'] | [44340.0, 26808.0] | [172.0, 84.0] | [207, 113] |
p02779 | u731362892 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n=int(input())\nli = list(map(int,input().split()))\nif n==set(li):\n print("YES")\nelse:\n print("NO")', 'n=int(input())\nli = list(map(int,input().split()))\nif n==len(set(li)):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s560381332', 's859006953'] | [26804.0, 26808.0] | [91.0, 84.0] | [100, 105] |
p02779 | u735335967 | 2,000 | 1,048,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 n = int(input())\n num = [int(i) for i in input().split()]\n if len(num) <= 1:\n return "YES"\n else:\n for i in range(len(num)+1):\n if num[i] == num[i + 1]:\n return "YES"\n else:\n return "NO"\nprint(main())\n', 'def main... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s048422831', 's561890170', 's834474898', 's904079330', 's601762902'] | [25168.0, 25168.0, 25168.0, 25172.0, 25172.0] | [73.0, 73.0, 76.0, 75.0, 89.0] | [293, 291, 293, 219, 127] |
p02779 | u736443076 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['def solve():\n N = int(input())\n A = set(map(int,input().split()))\n\n if len(A) == N:\n print("Yes")\n else:\n print("No")\n\n\nif __name__ == \'__main__\':\n solve()\n', 'def solve():\n N = int(input())\n A = set(map(int,input().split()))\n if len(A) >= N:\n print("Yes"... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s009576319', 's076167216', 's212222286', 's234087282', 's362649492', 's373565435', 's626461611', 's887038004', 's196126340'] | [36660.0, 36656.0, 26808.0, 31160.0, 26804.0, 26808.0, 26808.0, 36660.0, 31156.0] | [89.0, 88.0, 85.0, 64.0, 84.0, 84.0, 81.0, 85.0, 66.0] | [185, 184, 122, 197, 120, 205, 199, 184, 197] |
p02779 | u737451238 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = input()\nl = list(map(int,input().split()))\nl.sort()\n\nif len(l) == len(set(l)):\n print('Yes')\nelse:\n print('No')", "n = input()\nl = list(map(int,input().split()))\nl.sort()\n\nif len(l) == len(set(l)):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s225448562', 's816689121'] | [25936.0, 25168.0] | [186.0, 173.0] | [121, 121] |
p02779 | u740267532 | 2,000 | 1,048,576 | 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 x in A:\n if A.count(x) > 1:\n print("NO")\n break\n elif N == x:\n print("YES")\n break\n else:\n print("NO")\n break', 'N = int(input())\nA = list(map(int, input().split()))\nfor x in A:\n if A.count(x) ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s729325167', 's812496497', 's904426575'] | [26676.0, 25168.0, 31156.0] | [69.0, 68.0, 75.0] | [217, 224, 96] |
p02779 | u740909619 | 2,000 | 1,048,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\nimport sys\nN = input()\nA = input().split()\nA1 = map(int,collections.Counter(A).values())\nfor i in A1:\n if i >= 2:\n print('No')\n sys.exit()\nprint('Yes')", "import sys\nN = int(input())\nA = input().split()\nif N > len(set(A)):\n print('NO')\n sys.exit()\nprint('YES')"... | ['Wrong Answer', 'Accepted'] | ['s022968992', 's889667390'] | [39116.0, 31152.0] | [111.0, 66.0] | [187, 111] |
p02779 | u741495664 | 2,000 | 1,048,576 | 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\nB = set(A)\n\nif len(A) == len(B):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = [int(x) for x in input().split()]\n\nB = set(A)\n\nif len(A) == len(B):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s887677806', 's436717234'] | [25932.0, 25172.0] | [98.0, 97.0] | [123, 123] |
p02779 | u743164083 | 2,000 | 1,048,576 | 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()))\nsa = set(a)\nprint("Yes") if len(a) == len(sa) else print("No")\n', 'n = int(input())\na = list(map(int, input().split()))\nsa = set(a)\nprint("YES") if len(a) == len(sa) else print("NO")\n'] | ['Wrong Answer', 'Accepted'] | ['s224935932', 's775200604'] | [31204.0, 31156.0] | [93.0, 94.0] | [116, 116] |
p02779 | u744683641 | 2,000 | 1,048,576 | 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 = set(map(int, inpt.split()))\n\nif n==len(a_n):\n print("YES")\nelse:\n print("NO")', 'n =int(input())\na_n = set(map(int, input().split()))\n\nif n==len(a_n):\n print("YES")\nelse:\n print("NO")\n'] | ['Runtime Error', 'Accepted'] | ['s287132841', 's280703519'] | [3060.0, 36660.0] | [18.0, 93.0] | [105, 109] |
p02779 | u744695362 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = set( map(int,input().split()) )\nif len(a)==n :\n print('Yes')\nelse :\n print('No') ", "n = int(input())\na = set( map(int,input().split()) )\nif len(a)==n :\n print('YES')\nelse :\n print('NO') "] | ['Wrong Answer', 'Accepted'] | ['s314336169', 's548387618'] | [36656.0, 36656.0] | [90.0, 95.0] | [110, 109] |
p02779 | u744920373 | 2,000 | 1,048,576 | 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(map(int,input().split()))\n\nfor i in range(len(A)-1):\n if A[i]==A[i+1]:\n print('No')\n exit()\n\nprint('Yes')", "N = int(input())\nA = sorted(map(int,input().split()))\n\nfor i in range(len(A)-1):\n if A[i]==A[i+1]:\n print('NO')\n exit()\n\nprint('YES... | ['Wrong Answer', 'Accepted'] | ['s759768279', 's784544234'] | [25684.0, 26808.0] | [181.0, 191.0] | [150, 150] |
p02779 | u746419473 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\n*a, = map(int, input().split())\nprint("Yes" if n == len(set(a)) else "No")\n', 'n = int(input())\n*a, = map(int, input().split())\nprint("YES" if len(set(a)) == n else "NO")\n'] | ['Wrong Answer', 'Accepted'] | ['s265208327', 's316707992'] | [26808.0, 26808.0] | [82.0, 86.0] | [92, 92] |
p02779 | u750058957 | 2,000 | 1,048,576 | 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 = {i for i in input().split()}\nprint("Yes" if N==len(A) else "No")', 'N = int(input())\nA = {i for i in input().split()}\nprint("YES" if N==len(A) else "NO")'] | ['Wrong Answer', 'Accepted'] | ['s126765707', 's765130269'] | [36100.0, 36088.0] | [85.0, 94.0] | [85, 85] |
p02779 | u750120744 | 2,000 | 1,048,576 | 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 has_duplicates(A):\n print('NO')\nelse:\n print('YES')\n", "def has_no_duplicates(seq):\n return len(seq) == len(set(seq))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nif has_no_duplicates==True:\n print('YES')\nelse:\n print('NO')", "def... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s216365028', 's814601937', 's131881187'] | [26808.0, 26812.0, 26804.0] | [66.0, 68.0, 87.0] | [111, 180, 177] |
p02779 | u751077930 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(str,input().split()))\nans = 'Yes'\nfor i in range(n):\n if a.count(a[i]) != 1:\n ans = 'No'\n break\nprint(ans)", "n = int(input())\na = list(map(str,input().split()))\na.sort()\nans = 'YES'\nfor i in range(n):\n if a[i] == a[i+1]:\n ans = 'NO'\n break... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s035405058', 's437580275', 's044384493'] | [24980.0, 25024.0, 25028.0] | [2206.0, 183.0, 169.0] | [153, 158, 160] |
p02779 | u756693875 | 2,000 | 1,048,576 | 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\nx = len(a)\ny = len(set(a))\n\nif x == y:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int,input().split()))\n\nx = len(a)\ny = len(set(a))\n\nif x == y:\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s397235161', 's683798216'] | [25172.0, 26804.0] | [85.0, 85.0] | [130, 130] |
p02779 | u757274384 | 2,000 | 1,048,576 | 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(list(set(A))) == n:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nA = list(map(int, input().split()))\n\nif len(A) == len(list(set(A))):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s511308084', 's506493624'] | [26804.0, 25684.0] | [96.0, 93.0] | [114, 120] |
p02779 | u759518460 | 2,000 | 1,048,576 | 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()))\nset_a = set(a)\n\nif len(set_a) == n:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = list(map(int, input().split()))\nset_a = set(a)\n\nif len(set_a) == n:\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s031357560', 's725033004'] | [25936.0, 26804.0] | [90.0, 93.0] | [127, 127] |
p02779 | u759718348 | 2,000 | 1,048,576 | 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*l, = map(int, input().split())\nL = sorted(l)\nS = 0\nfor i in range(n):\n for l in range(n):\n if L[i] == L[l]:\n S = 1\nif S == 0:\n print('YES')\nelif S == 1:\n print('NO')", "n = int(input())\n*l, = map(int, input().split())\nL = sorted(l)\nS = 0\nfor i in range(n):\n for l in range... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s091316007', 's239004573', 's550051280', 's679319092', 's463895467'] | [26808.0, 25172.0, 26808.0, 26812.0, 26808.0] | [2104.0, 2104.0, 2104.0, 84.0, 83.0] | [194, 194, 194, 208, 208] |
p02779 | u759726213 | 2,000 | 1,048,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())\nAs = list(map(int, input().split()))\n\nAs.sort()\nfor i in range(N):\n for j in range(i + 1, N):\n if As[i] == As[j]:\n print('NO')\n sys.exit(0)\n if As[j] > As[i]:\n print('break!')\n break\n\nprint('YES')", "import sys\n\... | ['Wrong Answer', 'Accepted'] | ['s571780948', 's129609779'] | [26808.0, 26808.0] | [411.0, 179.0] | [286, 177] |
p02779 | u759938562 | 2,000 | 1,048,576 | 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()\nprint(A)\nfor i in range(N // 2 + 1):\n # print(A[i])\n # print(A[i+1])\n \n if A[i] == A[i+1]:\n print("NO")\n exit()\n elif A[-1-i] == A[-2-i]:\n print("NO")\n exit()\n\nprint("YES")\n', 'N = int(input())\n... | ['Runtime Error', 'Accepted'] | ['s030401388', 's773258261'] | [26808.0, 26804.0] | [213.0, 183.0] | [279, 306] |
p02779 | u760760982 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\nm = list(map(int,input().split()))\nif len(set(m)) == len(m):\n print("Yes")\nelse:\n print("No")\n', 'n = int(input())\nm = list(map(int,input().split()))\nif len(set(m)) == len(m):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s955436657', 's014955526'] | [31056.0, 31008.0] | [91.0, 91.0] | [117, 116] |
p02779 | u761676084 | 2,000 | 1,048,576 | 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()))\ncount = 0\n\na.sort()\nfor i in range(len(a)-1):\n if(a[i] == a[i+1]):\n print("NO")\n elif(i == len(a)-1):\n print("YES")', 'n = int(input())\na = list(map(int,input().split()))\ncount = 0\n\na.sort()\n\nprint(a)\n\nfor i in range(len(a)-1):\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s346445329', 's832654318', 's845202946'] | [26676.0, 26808.0, 26804.0] | [222.0, 249.0, 199.0] | [187, 212, 203] |
p02779 | u761720628 | 2,000 | 1,048,576 | 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()}\nif N == len(A):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = {int(i) for i in input().split()}\nif N == len(A):\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s555564745', 's420305754'] | [35916.0, 36660.0] | [98.0, 101.0] | [109, 110] |
p02779 | u763249708 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\narr = list(map(int, input().split()))\n\n# arr = list(filter(lambda x: x == n, arr))\n# print(arr)\nflag = False\nfor i in arr:\n tmp_arr = list(filter(lambda x: x == i, arr))\n if arr.count(i) >= 2:\n flag = True\n break\n\nif flag: print("No")\nelse: print("Yes")', 'n = int(inp... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s362305005', 's384805877', 's833232546', 's892744341', 's049251266'] | [26804.0, 26680.0, 26804.0, 25936.0, 26804.0] | [2104.0, 182.0, 2104.0, 179.0, 199.0] | [290, 210, 183, 172, 172] |
p02779 | u763654362 | 2,000 | 1,048,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 -*-\nN = input()\ninput_line = input()\nAi = input_line.split(" ")\nComment = "Yes"\nN = int(N)\n#print(type(N))\nfor i in range(N):\n for j in range(i+1,N):\n if(Ai[i] == Ai[j]):\n Comment = "No"\n break\n \nprint(Comment)', '# -*- coding: utf-8 -*-\nN = input()\ninput_line = i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s007339940', 's432368088', 's009547466'] | [21200.0, 21972.0, 57588.0] | [2105.0, 2105.0, 250.0] | [249, 232, 250] |
p02779 | u768174784 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n=int(input())\nm=int(input())\nif (str(n) in str(m)) == True:\n print("Yes")\nelse:\n print("No")', 'n =int(input())\na = list(map(int,input().split()))\nx=0\nfor i in range(n):\n if a.count(a[i]) != 1:\n print("NO")\n x=1\n break\n \nif x == 0:\n print("Yes")', 'n = int(input())\nb = int(x) for x in... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wr... | ['s030812979', 's056444188', 's111059359', 's341177951', 's392040113', 's394474551', 's400571033', 's413455869', 's420295759', 's435088319', 's436562200', 's447946678', 's452406044', 's506580785', 's549727924', 's560498198', 's657203911', 's721491494', 's807295995', 's829322888', 's968893739', 's970004849', 's349962764... | [8640.0, 26808.0, 2940.0, 26808.0, 8508.0, 26808.0, 2940.0, 25172.0, 26808.0, 26804.0, 25172.0, 26804.0, 8640.0, 20796.0, 26808.0, 26676.0, 26804.0, 3064.0, 2940.0, 8512.0, 25932.0, 8636.0, 26804.0] | [29.0, 2104.0, 17.0, 2106.0, 23.0, 80.0, 17.0, 2104.0, 85.0, 2104.0, 2105.0, 118.0, 29.0, 38.0, 2104.0, 2104.0, 2104.0, 18.0, 17.0, 21.0, 2104.0, 28.0, 194.0] | [95, 163, 193, 196, 73, 219, 194, 188, 196, 200, 245, 213, 171, 230, 200, 212, 245, 146, 230, 73, 196, 95, 213] |
p02779 | u768195631 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = list(map(int,input().split()))\nx = 0\nfor i in range(n):\n if a.count(a[i]) != 1:\n print("No")\n x = 1\n break\n \nif x == 0:\n print("Yes")', 'n = int(input())\na = list(map(int,input().split()))\nans = "YES"\na.sort()\nfor i in range(n-1):\n if a[i] == a[... | ['Wrong Answer', 'Accepted'] | ['s127515689', 's914471784'] | [26808.0, 25684.0] | [2104.0, 189.0] | [188, 144] |
p02779 | u772969943 | 2,000 | 1,048,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())\nx=list(map(int,input().split()))\na=defaultdict(int)\nf=True\n\nfor y in x:\n if a[y]==1:\n f=False\n break\n a[y]=1\n \nif f:\n print("yes")\nelse:\n print("no")', 'from collections import defaultdict\nn=int(input())\nx=list(map(int,in... | ['Wrong Answer', 'Accepted'] | ['s415753791', 's269686786'] | [33996.0, 33996.0] | [164.0, 157.0] | [229, 230] |
p02779 | u773265208 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import sys\n\nn = int(input())\na = list(map(int,input().split()))\n\nd = {}\n\nfor i in range(n):\n if a[i] not in d.keys():\n d[a[i]] = 1\n else:\n print('NO')\n sys.exit()\n\nprint('Yes')\n", "import sys\n\nn = int(input())\na = list(map(int,input().split()))\n\nd = {}\n\nfor i in range(n):\n if a[i] n... | ['Wrong Answer', 'Accepted'] | ['s067668727', 's256595341'] | [32948.0, 32848.0] | [143.0, 149.0] | [188, 188] |
p02779 | u773686010 | 2,000 | 1,048,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\nN = int(input())\nif N != len(set(list(map(int,input().split())))):\n print("No")\nelse:\n print("Yes")\n', 'import numpy as np\nN = int(input())\nif N != len(set(list(map(int,input().split())))):\n print("NO")\nelse:\n print("YES")\n'] | ['Wrong Answer', 'Accepted'] | ['s649614449', 's664694607'] | [49172.0, 49020.0] | [177.0, 170.0] | [125, 125] |
p02779 | u777028980 | 2,000 | 1,048,576 | 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()\nhoge=list(map(int,input().split()))\nhoge=set(hoge)\nif(n==len(hoge)):\n print("Yes")\nelse:\n print("No")', 'n=input()\nhoge=list(map(int,input().split()))\nhoge=set(hoge)\nif(n==len(hoge)):\n print("YES")\nelse:\n print("NO")', 'n=int(input())\nhoge=list(map(int,input().split()))\nhoge=set(hoge)\nif(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s230575918', 's930527001', 's025634830'] | [26808.0, 25936.0, 26808.0] | [96.0, 90.0, 93.0] | [113, 113, 118] |
p02779 | u777241657 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['length=input()\n#len-1\nNarray=sorted(input().split())\nn=0\nwhile n<int(length)-2:\n\tif Narray[n] == Narray[n+1]:\n\t\tprint("NO")\n\t\tbreak\n\telif n==int(length)-2:\n\t\tprint("YES")\n\t\tbreak\n\telse:\n\t\tn+=1\n \t', 'len=input()\n#len-1\nNarray=sorted(input().split())\nn=0\nwhile True\n\tif not Narray[n] ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s563163848', 's821337347', 's895606997', 's705911116'] | [20792.0, 2940.0, 26808.0, 26676.0] | [334.0, 17.0, 97.0, 185.0] | [198, 158, 207, 213] |
p02779 | u779293207 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = list(map(int,input().split()))\nfor i in range (N):\n if A[i] in A:\n print('NO')\n exit()\n \nprint('YES')\n \n\n", "N = int(input())\nA = list(map(int,input().split()))\nfor i in range (N):\n for j in range (i+1,N):\n if A[i]==A[j]:\n print('No')\n exit()\n \npri... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s336035146', 's372970716', 's424476158'] | [26680.0, 26680.0, 26804.0] | [68.0, 2104.0, 95.0] | [138, 169, 123] |
p02779 | u779728630 | 2,000 | 1,048,576 | 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\nB = {}\nfor i in A_list:\n B.add(i)\n\nif len(B) == N:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA_list = list(map(int, input().split()))\n\nB = set()\nfor i in A_list:\n B.add(i)\n\nif len(B) == N:\n print("YES")\nelse:\n print("NO")\... | ['Runtime Error', 'Accepted'] | ['s646663368', 's671529440'] | [26808.0, 26808.0] | [67.0, 119.0] | [145, 149] |
p02779 | u781758937 | 2,000 | 1,048,576 | 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 = [int(i) for i in input().split()].sort()\n\nflg = 0\nfor i in range(1,N):\n if S[i] = S[i-1]:\n flg = 1\n \nif flg == 1:\n print("NO")\nelse:\n print("YES") \n', 'N = int(input())\nS = [int(i) for i in input().split()]\nS.sort()\n\nflg = 0\nfor i in range(1,N):\n if S[i] == S[i-1]:\n ... | ['Runtime Error', 'Accepted'] | ['s049713835', 's174064830'] | [2940.0, 25172.0] | [17.0, 195.0] | [179, 181] |
p02779 | u782616557 | 2,000 | 1,048,576 | 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(it,input().split()))\nA.sort()\nfor i in range(N-1):\n if A[i]=A[i+1]:\n print('NO')\n break\nelse:\n print('YES')\n ", "N=int(input())\nA=list(map(it,input().split()))\nA.sort()\nfor i in range(N-1):\n if A[i]==A[i+1]:\n print('NO')\n break\nelse:\n print('YES')\n \n", "N... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s229236793', 's886374157', 's133174286'] | [2940.0, 3060.0, 25172.0] | [17.0, 17.0, 190.0] | [144, 146, 147] |
p02779 | u788068140 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['# N = 5\n# ARR = [2, 6, 1, 4, 5]\n\n# N = 6\n# ARR = [4, 1, 3, 1, 6, 2]\n#\n#\n# N = 2\n# ARR = [10000000, 10000000]\n\nN = int(input())\nARR = list(map(int,input().split()))\n\ndef calculate(n,arr):\n\n dict = {}\n result = True\n for i in range(n):\n item = arr[i]\n if dict.get(item) == None:... | ['Wrong Answer', 'Accepted'] | ['s151630464', 's657354200'] | [32948.0, 32944.0] | [144.0, 139.0] | [491, 491] |
p02779 | u791977205 | 2,000 | 1,048,576 | 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\nflag = True\nfor i in range(N):\n target = A_list[i]\n for j in range(i+1, N):\n if target == A_list[j]:\n flag = False\n break\n if flag == False:\n break\n\nif flag:\n print('Yes')\nelse:\n print('No')", "\n\... | ['Wrong Answer', 'Accepted'] | ['s572588142', 's518096824'] | [26808.0, 26808.0] | [2108.0, 187.0] | [295, 270] |
p02779 | u795928154 | 2,000 | 1,048,576 | 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()\ninp = input()\nlistA = inp.split(' ')\ncount = 0\nfor moji in lintA:\n youso = listA.count(moji)\n if youso == 1:\n count += 1\n else:\n print('NO')\n break\nif count == len(listA):\n print('YES')", "N = input()\ninp = input()\nlistA = inp.split(' ')\nout = YES\nfor k in listA:\n count = 0\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s219089079', 's845892420', 's218445255'] | [20796.0, 20796.0, 20796.0] | [37.0, 36.0, 228.0] | [210, 202, 189] |
p02779 | u796708718 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nlst = [int(n) for n in input().split(" ")]\nst = set(lst)\nif len(lst) == len(st):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nlst = [int(n) for n in input().split(" ")]\nst = set(lst)\nprint(lst)\nprint(st)\nprint(len(lst))\nprint(len(st))\nif len(lst) == len(st):\n print("YES")\nel... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s554067805', 's752625103', 's651755614'] | [25936.0, 31688.0, 25172.0] | [97.0, 153.0, 99.0] | [132, 184, 132] |
p02779 | u797550216 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\nnums = list(map(int,input().split()))\nc = 0\nnums = sorted(nums)\n\nfor i in range(n-1):\n if nums[i] == nums[i+1]:\n c += 1\n break\n \nif c != 0:\n print('No')\n\nelse:\n print('Yes')", "n = int(input())\nnums = list(map(int,input().split()))\n\nl = [0]*200001\n\nfor num... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s778688676', 's807197721', 's377799069'] | [25936.0, 26808.0, 26808.0] | [179.0, 70.0, 180.0] | [216, 164, 216] |
p02779 | u798675549 | 2,000 | 1,048,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\ninput()\nlst=list(map(int,input().split()))\ndic=dict(Counter(lst))\nx=max(list(dic.values()))-1\nif x:\n print('No')\nelse:\n print('Yes')", "from collections import Counter\ninput()\nlst = input().split()\ndic = dict(Counter(lst))\nx = max(list(dic.values())) - 1\nif x:\n print... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s396274479', 's642548531', 's830167573', 's926759286', 's754502073'] | [40136.0, 45256.0, 40136.0, 45256.0, 45256.0] | [140.0, 106.0, 114.0, 108.0, 115.0] | [166, 163, 165, 151, 163] |
p02779 | u799978560 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int,input().split()))\nif len(A) == len(list(set(A))):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int,input().split()))\nif len(A) == len(list(set(A))):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s441273738', 's456474563'] | [26808.0, 26808.0] | [90.0, 98.0] | [122, 122] |
p02779 | u800058906 | 2,000 | 1,048,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())\nx=list(map(int,input().split()))\n\nc=[]\n\nfor i in x:\n if i not in c:\n c.append(i)\n else:\n print('No')\n sys.exit()\n\nprint('Yes')", "import sys\nn=int(input())\nx=list(map(int,input().split()))\nx.sort()\n\nfor i in range(n-1):\n if x[i]==x[i+1]:\n ... | ['Wrong Answer', 'Accepted'] | ['s905851106', 's223456824'] | [30912.0, 31032.0] | [2206.0, 133.0] | [179, 171] |
p02779 | u801049006 | 2,000 | 1,048,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\n is_break = False\n seen = []\n for a in A:\n if a not in seen:\n seen.append(a)\n else:\n is_break = True\n break:\n \n if is_break:\n print("NO")\n else:\n ... | ['Runtime Error', 'Accepted'] | ['s338375440', 's340973095'] | [2940.0, 25172.0] | [17.0, 97.0] | [354, 353] |
p02779 | u802581810 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | [" n = int(input())\n a = list(map(int, input().split()))\n seta = set(a)\n ans = 'YES' if len(a) == len(seta) else 'NO'\n print(ans) ", " n = int(input())\n a = list(map(int, input().split()))\n seta = set(a)\n ans = 'YES' if len(a) == len(seta) else 'NO'\n print(ans) ", 'n = int(input())... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s071026163', 's586012545', 's713599589'] | [2940.0, 2940.0, 26808.0] | [17.0, 17.0, 90.0] | [143, 143, 124] |
p02779 | u806403461 | 2,000 | 1,048,576 | 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\nlen2 = len(set(A))\n\nif N == len2:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = map(int,input().split())\n\nlen2 = len(set(A))\n\nif N == len2:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = list(map(int, input().spl... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s173623126', 's618404216', 's986758405'] | [25452.0, 35788.0, 25932.0] | [83.0, 89.0, 88.0] | [152, 119, 151] |
p02779 | u808799019 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = input().split(" ")\nb = set(a)\nprint "YES" if len(b) > len(a) else "NO"', 'n = int(input())\na = input().split(" ")\nb = set(a)\nif len(b)<len(a):\n print("NO")\nelse:\n print("YES")\n'] | ['Runtime Error', 'Accepted'] | ['s267904672', 's046667416'] | [2940.0, 30412.0] | [17.0, 77.0] | [91, 108] |
p02779 | u810066979 | 2,000 | 1,048,576 | 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()))\nlist=[]\nfor i in a:\n\tif a in list:\n\t\tprint("NO")\n\t\tbreak\n\tlist.append(a)\nelse:\n\tprint("YES")\n', '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")'] | ['Wrong Answer', 'Accepted'] | ['s579429066', 's734618143'] | [25936.0, 26804.0] | [67.0, 182.0] | [141, 137] |
p02779 | u811202694 | 2,000 | 1,048,576 | 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(v) for v in input().split()]\na.sort()\n\nflag = True\n\nfor i in range(n-1):\n if a[i] == a[i+1]: flag = False\n\nif flag:\n print("Yes")\nelse:\n print("No")\n', 'n = int(input())\na = [int(v) for v in input().split()]\na.sort()\n\nflag = True\n\nfor i in range(n-1):\n if a[i]... | ['Wrong Answer', 'Accepted'] | ['s273308457', 's404710781'] | [25172.0, 25168.0] | [194.0, 188.0] | [184, 184] |
p02779 | u811817592 | 2,000 | 1,048,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 -*-\nN = int(input())\nA_list = list(map(int, input().split()))\n\nprint("Yes" if len(A_list) == len(set(A_list)) else "No")', '# -*- coding: utf-8 -*-\nN = int(input())\nA_list = list(map(int, input().split()))\n\nprint("YES" if len(A_list) == len(set(A_list)) else "NO")'] | ['Wrong Answer', 'Accepted'] | ['s769494182', 's170850416'] | [26804.0, 26808.0] | [83.0, 83.0] | [140, 140] |
p02779 | u812576525 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["from collections import Counter\nfrom operator import itemgetter\n\nN = int(input())\nA = Counter(map(int,input().split()))\nA1 = list(A.items())\nA1 = sorted(A1,key=itemgetter(1),reverse = True)\n\nif A1[0][1] == 1:\n print('Yes')\nelse:\n print('No')\n", "from collections import Counter\nfrom operator import ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s004165451', 's967931730', 's023701083'] | [44620.0, 48844.0, 44624.0] | [283.0, 288.0, 195.0] | [248, 257, 259] |
p02779 | u813452457 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\nli = map(int,input().split())\nprint('NO' if len(li)!=len(set(li)) else 'YES')", "input()\nli = map(int,input().split())\n\nprint('NO' if len(li) > len(set(li)) else 'YES')", "input()\nli = list(map(int, input().split()))\nprint('NO' if len(li)>len(set(li)) else 'YES')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s436971349', 's835836520', 's949819372'] | [19160.0, 19924.0, 26800.0] | [37.0, 37.0, 82.0] | [94, 87, 91] |
p02779 | u814271993 | 2,000 | 1,048,576 | 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())\nc=sorted(list(map(int, input().split())))\nans = 0\n\nfor i in range(n-1):\n if c[i] == c[i+1]:\n ans +=1\n\nif ans == 0:\n print('Yes')\nif ans != 0:\n print('No')", "n=int(input())\nc=sorted(list(map(int, input().split())))\nans = 0\n\nfor i in range(n-1):\n if c[i] == c[i+1]:\n ... | ['Wrong Answer', 'Accepted'] | ['s554508568', 's546544362'] | [30876.0, 30804.0] | [143.0, 136.0] | [185, 185] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.