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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02934 | u023229441 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\nans=0\nA=list(map(int,input().split()))\nfor i in range(n):\n ans+=A[i]^(-1)\nprint(ans^(-1))', 'n=int(input())\nA=sorted(map(int,input().split()))\nans=A[0]\nfor i in range(1,n):\n ans=(ans+A[i])/2\nprint(ans^(-1))\n', 'n=int(input())\nans=0\nA=list(map(int,input().split()))\nfor i in range(n):\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s175097750', 's550748123', 's781314366'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [105, 115, 111] |
p02934 | u024804656 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = input()\na = list(map(int, input().split()))\ns = 0\nfor i in range(n):\n s += 1/a[i]\n\nprint(1/s)', 'n = int(input())\na = list(map(int, input().split()))\ns = 0\nfor i in range(n):\n s += 1/a[i]\n\nprint(1/s)'] | ['Runtime Error', 'Accepted'] | ['s707187144', 's691751675'] | [3316.0, 2940.0] | [21.0, 17.0] | [98, 103] |
p02934 | u025287757 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(int, input().split()))\nimport numpy as np\nA = np.array(A)\n1_A = 1/A\nprint(1/np.sum(1_A))', 'N = int(input())\nA = list(map(int, input().split()))\nimport numpy as np\nA = np.array(A)\nA_inv = 1/A\nprint(1/np.sum(A_inv))'] | ['Runtime Error', 'Accepted'] | ['s415596536', 's297857126'] | [2940.0, 12484.0] | [17.0, 150.0] | [118, 122] |
p02934 | u027076164 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = []\nfor i in range(N):\n A.append(int(input()))\n\nM = 0\nfor l in range(N):\n M += 1/A[l]\nprint(1/M)', 'N = int(input())\nA = list(map(int,input().split()))\n\nM = 0\nfor l in range(N):\n M += 1/A[l]\nprint(1/M)\n'] | ['Runtime Error', 'Accepted'] | ['s773674292', 's793179799'] | [2940.0, 2940.0] | [17.0, 18.0] | [118, 103] |
p02934 | u027675217 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(float ,input().split()))\nsum=float(0)\nfor i in range(N)\n\tsum+=A[i]/(A[i]**2)\nsum=sum**sum\nprint(sum)', 'N = int(input())\nA = list(map(int ,input().split()))\nsum=0\nfor i in range(N):\n\tsum+=A[i]/(A[i]**2)\nsum=1/sum\nprint(sum)\n'] | ['Runtime Error', 'Accepted'] | ['s351474031', 's621821920'] | [2940.0, 2940.0] | [17.0, 17.0] | [130, 120] |
p02934 | u028014940 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import numpy as np\nn=int(input())\na=np.array(list(map(float,input().split())))\nprint(float(1/sum(1/a_array)))', 'import numpy as np\nn=int(input())\na=np.array(list(map(float,input().split())))\nprint(float(1/sum(1/a)))'] | ['Runtime Error', 'Accepted'] | ['s900732158', 's644721823'] | [12500.0, 12384.0] | [148.0, 146.0] | [109, 103] |
p02934 | u028413707 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\naa = list(map(int, input().strip().sprit()))\n\ng = 0\n\n\nfor a in aa:\n g += 1 / a\n\nprint(1 / g)', 'n = int(input())\na = list(map(int, input().sprit()))\n\ng = 0\n\n\nfor x in a:\n g += 1 / x\n\nprint(1 / g)', 'n = int(input())\naa = list(map(int, input().strip().split()))\n\ng = 0\n\n\nf... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s564014231', 's690028530', 's377742304'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [139, 129, 139] |
p02934 | u036104576 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(int, input().split()))\nans = 0\nfor a in A:\n ans += 1 / a\nprint(1 / ans', 'N = int(input())\nA = list(map(int, input().split()))\nans = 0\nfor a in A:\n if a == 0:\n continue\n ans += 1 / a\nif ans == 0:\n print(0)\nelse:\n print(1 / ans)\n'] | ['Runtime Error', 'Accepted'] | ['s602675576', 's008898974'] | [8920.0, 9100.0] | [23.0, 30.0] | [103, 173] |
p02934 | u036531287 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['a = int(input())\nList=[int(i) for i in input().split()]\nList.sort()\nprint(List)\nnum = 0\nans = []\nwhile num < a:\n res = (List[num] + List[num+1])/2\n ans.append(res)\n resa = (ans[num] + List[num+2])/2\n num = num + 1\n if num == a:\n print(resa)\n break\n', 'a = int(input())\nList=[int(i) for i in input... | ['Runtime Error', 'Accepted'] | ['s710167073', 's247166563'] | [3064.0, 2940.0] | [17.0, 20.0] | [255, 101] |
p02934 | u038819082 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\nA=int(input()).split()\nc=0\nfor i in N:\n c+=A[i]**-1\nprint(c**-1)', 'N=int(input())\nA=int(input()).split()\nc=0\nfor i in A:\n c+=reciprocal(A[i])\nprint(rexiprocal(c)\n', 'N=int(input())\nA=list(map(int,input().split()))\nc=0\nfor i in N:\n c+=1/A[N]\nc=1/c\nprint(c)\n', 'N=int(input())\nA=int... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s035333206', 's472101464', 's575224929', 's981872683', 's930522671'] | [2940.0, 2940.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [80, 96, 91, 97, 82] |
p02934 | u045003093 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input().rstrip())\nA = input().rstrip().split(" ")\na = 1\nb = 0\nfor i in range(N):\n a *= int(A[i])\n b += int(A[i])\nc = a / b\nprint(\'{:.6f}\'.format(c))', 'N = int(input().rstrip())\nA = input().rstrip().split(" ")\na = 1\nb = 0\nfor i in range(N):\n a *= int(A[i])\n b += int(A[i])\nc = b / a\nprint... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s535767937', 's707195183', 's870803137'] | [3060.0, 3060.0, 2940.0] | [18.0, 17.0, 19.0] | [158, 158, 122] |
p02934 | u046167857 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\n\nlst = []\n\nfor i in range(n):\n lst.append(int(input()))\n\nsum = 0\nfor el in lst:\n sum += 1/el\n\nprint(1/sum)', '\nn = int(input())\n\nlst = list(map(int, input().split()))\n\nsum = 0\nfor el in lst:\n sum += 1/el\n\nprint(1/sum)'] | ['Runtime Error', 'Accepted'] | ['s755682901', 's260458429'] | [2940.0, 2940.0] | [17.0, 17.0] | [129, 110] |
p02934 | u046187684 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nprint(sum([1/float(a) for a in input().split()]))\n', 'N = int(input())\nprint(1 / sum([1 / float(a) for a in input().split()]))'] | ['Wrong Answer', 'Accepted'] | ['s336019418', 's935720830'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 72] |
p02934 | u057415180 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = [int(input()) for i in range(n)]\ncnt = 0\nfor k in range(n):\n cnt += 1/a[k]\nprint(1/cnt)', 'n = int(input())\na = map(int, input().split())\nprint(1/sum(1/i for i in a))'] | ['Runtime Error', 'Accepted'] | ['s711855210', 's542095621'] | [2940.0, 2940.0] | [18.0, 17.0] | [111, 75] |
p02934 | u059436995 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = list(map(int,input()))\nans = 0\nfor _a in a:\n ans +=1/_a\nprint(1/ans)', 'n = int(input())\na = list(map(int,input().split()))\nans = 0\nfor _a in a:\n ans +=1/_a\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s017672682', 's308089157'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 100] |
p02934 | u060770263 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['from functools import reduce\nimport operator\n\nn =int(input())\na = [int(x) for x in input().split()]\nsum([1/x for x in a])', 'from functools import reduce\nimport operator\n \nn =int(input())\na = [int(x) for x in input().split()]\nprint(1/sum([1/x for x in a]))'] | ['Wrong Answer', 'Accepted'] | ['s179565878', 's609537316'] | [3572.0, 3700.0] | [22.0, 29.0] | [121, 131] |
p02934 | u061984624 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ["a = int(input())\ns = input()\nif a >= 3200:\n print(s)\nelse:\n print('red')\n\n", 'n = int(input())\na = list(map(int, input().split()))\nbo = sum(map(lambda x: 1/x, a))\nprint(1/bo)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s980331802', 's261434237'] | [2940.0, 2940.0] | [18.0, 18.0] | [80, 98] |
p02934 | u062604519 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = map(int,input().split())\nA = sum(a)\nprint(A/A**2/(A/A**2)**2)', 'n = int(input())\na = list(map(int,input().split()))\nb=[]\nfor i in range(n):\n b.append(a[i]/a[i]**2)\nA = sum(b)\nprint(A/A**2)'] | ['Wrong Answer', 'Accepted'] | ['s844822706', 's877665871'] | [2940.0, 2940.0] | [17.0, 18.0] | [82, 125] |
p02934 | u069129582 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\na = list(map(int, input().split()))\nnew_a=[i**(-1) for i in a]\nprint(new_a)\naa=sum(new_a)\nprint(aa**(-1))', 'n=int(input())\na = list(map(int, input().split()))\nnew_a=[i**(-1) for i in a]\naa=sum(new_a)\nprint(aa**(-1))'] | ['Wrong Answer', 'Accepted'] | ['s507796141', 's054188964'] | [2940.0, 2940.0] | [18.0, 17.0] | [120, 107] |
p02934 | u072080927 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\na=[]\nfor i in range(n):\n p=float(input())\n p=1/p\n a=a+[p]\n \nx=sum(a)\nprint(1/x)', 'n=int(input())\na=[]\np=[int(e) for e in input().split()]\ni=0\nwhile i<n:\n a=a+[1/p[i]]\n i+=1\nx=sum(a)\nprint(1/x)'] | ['Runtime Error', 'Accepted'] | ['s528046856', 's723460791'] | [2940.0, 3060.0] | [17.0, 17.0] | [97, 112] |
p02934 | u077898957 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\nA=np.array(list(map(int,input().split())))\nprint(1/sum(1/A))\n', 'import numpy as np\nimport sys\nimport math\n\nn=int(input())\nA=np.array(list(map(int,input().split())))\nprint(1/sum(1/A))'] | ['Runtime Error', 'Accepted'] | ['s238348036', 's877824513'] | [2940.0, 12504.0] | [17.0, 150.0] | [76, 118] |
p02934 | u082446606 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import numpy as np\n\nN = int(input())\nA = [float(input()) for _ in range(N)]\n\nnA = np.array(A)\nprint(np.reciprocal(np.sum(np.reciprocal(nA))))\n', 'import numpy as np\n\nN = int(input())\nA = [float(x) for x in input().split()]\n\nnA = np.array(A)\nprint(np.reciprocal(np.sum(np.reciprocal(nA))))'] | ['Runtime Error', 'Accepted'] | ['s218745866', 's713852034'] | [21476.0, 21528.0] | [318.0, 319.0] | [142, 142] |
p02934 | u090361088 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ["n = int(input())\na = sorted(list(map(float, input().split())),reverse=True)\nb = [1]\nfor i in range(1, n):\n c = float(a[0]) // a[i]\n b.append(c)\nprint('{:.5f}'.format(float(a[0]) / sum(b)))", 'from fractions import Fraction\nn = int(input())\na = sorted(list(map(int, input().split())),reverse=True)\nb = [1... | ['Wrong Answer', 'Accepted'] | ['s750889460', 's807944168'] | [3060.0, 5048.0] | [17.0, 38.0] | [194, 206] |
p02934 | u094948308 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = input()\n\ntry:\n n = int(n)\n \n sum = 0\n for i in range(n):\n na = input()\n na = int(na)\n \n sum += 1/na\n \n sum = 1 / sum\n print(sum)\n \nexcept ValueError:\n print("数値を入力してください")', 'n = input()\ntry:\n n = int(n)\n \n v = [int(x) for x i... | ['Wrong Answer', 'Accepted'] | ['s264453807', 's793223308'] | [2940.0, 3060.0] | [17.0, 17.0] | [256, 270] |
p02934 | u095844416 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import numpy as np\nn=int(input())\na=np.array(list(map(int,input().split())))\nprint(a)\n\nanswer=np.sum(1/a)\nprint(1/answer)', 'import numpy as np\nn=int(input())\na=np.array(list(map(int,input().split())))\n\n\nanswer=np.sum(1/a)\nprint(1/answer)'] | ['Wrong Answer', 'Accepted'] | ['s610565050', 's193672003'] | [12396.0, 12416.0] | [152.0, 153.0] | [121, 113] |
p02934 | u097026338 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\n \nA = map(int,input().split())\n\ndef inverse(A):\n A = sum(A)\n def inverse(A):\n print(sum(A))\n ', 'N = int(input())\n\nA = int(input().split())\n\nb = sum(reverse(a)) for a in A\n\nprint(sum(severse(b)))', 'N = int(input())\n \nA = map(int,input().split())\n\nA = [1/a for a in A]\n\npri... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s891099334', 's960214280', 's571897374'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [118, 98, 86] |
p02934 | u098588273 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\nA=list(map(int,input().split()))\nre=0\nfor i in A:\n re+=1/A[i]\nprint(1/re)', 'N=int(input())\nA=list(map(int,input().split()))\nre=0\nfor i in range(N):\n re+=1/A[i]\nprint(1/re)'] | ['Runtime Error', 'Accepted'] | ['s483577072', 's510802765'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 96] |
p02934 | u103520789 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\nnum_list = map(int, input().split())\ndef ave(nums):\n rev_sum = 0\n for i in nums:\n rev_sum += 1/i\n ans = 1/rev_sum\n return ans\n\nave(num_list)', 'n = int(input())\nnum_list = list(map(int, input().split()))\ndef ave(nums):\n rev_sum = 0\n for i in nums:\n rev_su... | ['Wrong Answer', 'Accepted'] | ['s568920172', 's488466944'] | [2940.0, 2940.0] | [17.0, 17.0] | [176, 189] |
p02934 | u104282757 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['def main():\n a, b = map(int, input().split())\n # 1 + R * (A - 1) >= B\n print((b - 1 + a - 2) // (a - 1))\n\n\nif __name__ == "__main__":\n main()\n', 'N = int(input())\nA_list = list(map(int, input().split()))\n\nprint(1 / sum([1 / a for a in A_list]))\n'] | ['Runtime Error', 'Accepted'] | ['s936318213', 's707246034'] | [3060.0, 2940.0] | [18.0, 17.0] | [154, 99] |
p02934 | u105302073 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = [int(i) for i in input().split()]\nmax_a = max(A)\nnumerator = 0\nfor a in A:\n numerator += max_a // a\nprint("{:.7e}".format(max_a / numerator))\n\n', 'N = 1\nA = [1000]\nmax_a = max(A)\nnumerator = 0\nfor a in A:\n numerator += max_a // a\nprint(max_a / numerator)\n', 'N = int(input())\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s462944944', 's909880736', 's968450724'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [167, 111, 136] |
p02934 | u105791541 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['v', 'N = int(input())\nans = 0\nfor A in map(int, input().split()):\n\tans += 1 / A\n\nans = 1 / ans\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s290295269', 's655021047'] | [2940.0, 2940.0] | [17.0, 17.0] | [1, 101] |
p02934 | u106778233 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import numpy as np\nN=int(input())\nA=list(map(int,input().split())\nB=np.array(A)\nC=B**-1\nprint((C.sum())**-1)', 'import numpy as np\nN=int(input())\nA=np.array(list(map(int,input().split())))\n\nC=A**-1\nprint((C.sum())**-1)', 'import numpy as np\nN=int(input())\nA=np.array(list(map(float,input().split())))\n\nC=... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s512681615', 's729239180', 's098308281'] | [2940.0, 17680.0, 18604.0] | [17.0, 270.0, 292.0] | [108, 106, 118] |
p02934 | u107269063 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nl = map(int, raw_input().split())\nl = [int(s) for s in l]\n\ntotal = 0\nfor i in l:\n total += 1/i\n\nprint(1/total)', 'N = int(input())\nl = list(map(int,input().split()))\n \ntotal = 0\nfor i in l:\n total += 1/i\n\nprint(1/total)'] | ['Runtime Error', 'Accepted'] | ['s929112893', 's871659155'] | [2940.0, 2940.0] | [17.0, 17.0] | [128, 106] |
p02934 | u111365362 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = input()\na = list(map(int,input().split()))\ninv = 0\nfor i in range(n):\n inv += 1 / a[i]\nprint( 1 / inv )', 'n = int(input())\na = list(map(int,input().split()))\ninv = 0\nfor i in range(n):\n inv += 1 / a[i]\nprint( 1 / inv )'] | ['Runtime Error', 'Accepted'] | ['s212669744', 's106697399'] | [2940.0, 2940.0] | [17.0, 18.0] | [108, 113] |
p02934 | u112247039 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['input()\nl = list(map(int,input().split()))\ns = 0\ns += 1/i for i in l\nprint(round(1/s,3))', 'input()\nl = list(map(int,input().split()))\ns = sum(1/i for i in l)\nprint(1/s)'] | ['Runtime Error', 'Accepted'] | ['s411058330', 's928262649'] | [8952.0, 9156.0] | [23.0, 26.0] | [88, 77] |
p02934 | u113971909 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(int,input().split()))\nR = 0.0\nfor i in range(N):\n R += i**(-1)\nprint(1/R)', '_=input()\nprint(1/sum[1/r for r in list(map(int,input().split()))])', '_=input()\nprint(1/sum([1/r for r in list(map(int,input().split()))]))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s224089766', 's891362073', 's022516060'] | [3316.0, 9020.0, 9144.0] | [21.0, 22.0, 22.0] | [104, 67, 69] |
p02934 | u114648678 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['from fractions import Fraction\nn=int(input())\na=list(map(int,input().split()))\nb=0\nfor i in range(n):\n b+=Fraction(1,a[i])\nans=Fraction(1,b)\n\nprint(ans)', 'from fractions import Fraction\nn=int(input())\na=list(map(int,input().split()))\nb=0\nfor i in range(n):\n b+=1/a[i]\nans=1/b\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s423471831', 's508794093'] | [5344.0, 5304.0] | [38.0, 39.0] | [153, 133] |
p02934 | u115877451 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['a=int(input())\nb=list(map(int,input().split()))\nprint(b/a)', 'a=int(input())\nb=list(map(int,input().split()))\nprint(sum(b)/a)', 'import math\nfrom functools import reduce\ndef lcm_base(x, y):\n return (x * y) // math.gcd(x, y)\ndef lcm_list(numbers):\n return reduce(lcm_base, numbers, 1)\na=int(input())\nb=... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s248477868', 's417330971', 's683722366'] | [2940.0, 2940.0, 9584.0] | [18.0, 17.0, 31.0] | [58, 63, 261] |
p02934 | u117054186 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['def main():\n \n n = int(input())\n a = []\n for i in range(n): \n a.append( 1/int(input()))\n\n print(sum(a))\n \n\nif __name__ == "__main__":\n main()', 'n = int(input())\na = [int(1/e) for e in input().split()]\n\nprint(1/sum(a))\n', 'def main():\n \n n = int(input())\n a = []\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s093161264', 's189766521', 's195500863', 's851006322', 's806650820'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [169, 74, 171, 91, 74] |
p02934 | u117193815 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['from fractions import Fraction\nN=int(input())\nl=[]\nfor i in range(N):\n k=int(input())\n x=Fraction(1, k)\n l.append(x)\n\np=sum(l)\ny=float(1/p)\nprint(y)', 'from fractions import Fraction\nnum = int(input())\nl=[]\nfor i in range(num):\n k=int(input())\n x=Fraction(1, k)\n l.append(x)\np=sum(l)... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s171929244', 's730245070', 's864569835', 's919626402', 's591548681'] | [5692.0, 5308.0, 5052.0, 5436.0, 2940.0] | [49.0, 41.0, 35.0, 39.0, 18.0] | [157, 162, 162, 160, 110] |
p02934 | u123745130 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\nl=list(map(int,input().split())\nsum_m=0\nfor i in l:\n\tsum_m+=1/i\nprint(1/sum_m)\n', 'n=int(input())\nl=list(input().split())\nsum_m=0\nfor i in l:\n\tsum_m+=1/i\nprint(1/sum_m)', 'n=int(input())\nl=list(map(int,input().split()))\nsum_m=0\nfor i in l:\n\tsum_m+=1/i\nprint(1/sum_m)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s363808754', 's413243489', 's751069254'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [94, 85, 94] |
p02934 | u125805286 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\ni=1 \na=[0]\nA=[0]\n\nwhile i<=n:\n a.append(int(input()))\n A.append(1/a[i])\n A[0]+=A[i]\n i+=1\n\nprint(1/A[0])', 'n=int(input())\ni=1\na=list(map(int,input().split()))\nA=[0]\n\nwhile i<=n:\n A.append(1/a[i-1])\n A[0]+=A[i]\n i+=1\n\nprint(1/A[0])\n\n'] | ['Runtime Error', 'Accepted'] | ['s947527695', 's394704407'] | [3060.0, 2940.0] | [18.0, 18.0] | [131, 134] |
p02934 | u126972044 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import numpy as np\na = int(input())\nsum = 0\nfor i in range(a):\n bb = int(input())\n sum += b\nnp.reciprocal(sum)\nnp.reciprocal(sum)\nprint(sum)', 'a = int(input())\nsum = 0\nfor i in range(a):\n b = int(input())\n sum += pow(b, -1)\nprint(pow(sum, -1)', 'N = int(input())\nA = [int(x) for x in input().split()... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s153455311', 's163519613', 's201922813', 's384419088', 's476472814', 's554345113', 's566360843', 's590126774', 's594920037', 's605648239', 's675196004', 's923495921', 's936216975', 's399462965'] | [20736.0, 2940.0, 2940.0, 12504.0, 12392.0, 2940.0, 2940.0, 2940.0, 2940.0, 12500.0, 2940.0, 2940.0, 12500.0, 2940.0] | [327.0, 17.0, 17.0, 152.0, 150.0, 17.0, 17.0, 17.0, 17.0, 147.0, 22.0, 17.0, 150.0, 17.0] | [142, 101, 106, 139, 154, 105, 112, 97, 107, 141, 114, 98, 146, 112] |
p02934 | u127499732 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\nb=0\nfor _ in range(n):\n b+=1/int(input())\nprint(1/b)', 'n=int(input())\nl = list(map(int,input().split()))\nb = sum([1/x for x in l])\nprint(1/b)'] | ['Runtime Error', 'Accepted'] | ['s699356574', 's015337817'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 86] |
p02934 | u135116520 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\nA=map(int,input().split())\ns=sum(1/i) for i in A\nt=1/s\nprint(t)', 'N=int(input())\nA=map(int,input().split())\ns=sum(1/i for i in A)\nt=1/s\nprint(t)'] | ['Runtime Error', 'Accepted'] | ['s016454618', 's404141265'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 78] |
p02934 | u143100985 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['int N\nfloat sum = 0\nN = input() \nfor i in N\n\ts = input()\n\tsum = (float)1/s\nprint(sum)', 'int N\nfloat sum = 0\nN = input() \nfor i in range(N)\n\ts = input()\n\tsum = (float)1/s\nprint(sum)', 'sum = 0\nN = input() \nfor i in range(int(N)):\n\ts = float(input())\n\tsum = sum+(1/s)\nprint(sum)', 'sum = 0\nN = i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s328998801', 's598301347', 's843876147', 's976165059', 's493803757'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [85, 92, 92, 75, 137] |
p02934 | u144969476 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\nA=list(map(int, input(). strip(). split()))\nfor i in range(n):\n A[i]=1/A[i]\nprint(round(sum(A),5))', 'n=int(input())\nA=list(map(int, input(). strip(). split()))\nfor i in range(n):\n A[i]=1/A[i]\nprint(round(1/sum(A),5))'] | ['Wrong Answer', 'Accepted'] | ['s385289790', 's219014459'] | [2940.0, 2940.0] | [17.0, 18.0] | [116, 118] |
p02934 | u155667931 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['#from functools import reduce\n\nN = int(input())\nAs = map(int,input().split())\n\nP = reduce(lambda a,b:a*b,As)\n\nprint(P/sum([P/a for a in As]))', 'from functools import reduce\n\nN = int(input())\nAs = map(int,input().split())\n\nP = reduce(lambda a,b:a*b,As)\n\nprint(P/sum([P/a for a in As]))', 'from functools ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s773838346', 's843457990', 's636604798'] | [2940.0, 3700.0, 3828.0] | [17.0, 31.0, 28.0] | [141, 140, 146] |
p02934 | u155687575 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\nalist = list(map(int, input().split()))\nalist = np.array(alist)\ngyakulist = 1 / alist\nprint(1/sum(gyakulist))', 'import numpy as np\nn = int(input())\nalist = list(map(int, input().split()))\nalist = np.array(alist)\ngyakulist = 1 / alist\nprint(1/sum(gyakulist))'] | ['Runtime Error', 'Accepted'] | ['s211819925', 's443559567'] | [2940.0, 12496.0] | [18.0, 149.0] | [126, 145] |
p02934 | u159653753 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\ndata = [input() for i in range(n)]\nsum=0\nfor i in range(n):\n sum = sum + 1/data[i]\nprint(1/sum)', 'n=int(input())\na=list(map(int,input().split()))\nsum=0\nfor i in range(n):\n sum = sum + 1/data[i]\nprint(1/sum)', 'n=int(input())\na=list(map(int,input().split()))\nsum=0\nfor i in a:\n sum = su... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s048363853', 's116162114', 's464435361'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [111, 109, 96] |
p02934 | u165516759 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\na = list(map(int,input().split()))\n\nb = 0\n for i in range(0,N):\n b = b + 1/a[i]\nprint(1/b)', 'N = int(input())\na = list(map(int,input().split()))\n \nb = 0\nfor i in range(0,N):\n b = b + 1/a[i]\nprint(1/b)'] | ['Runtime Error', 'Accepted'] | ['s593027857', 's768910954'] | [2940.0, 2940.0] | [17.0, 17.0] | [110, 110] |
p02934 | u166849422 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\nList = list(map(int,input().split()))\ns = sum(List)\nprint(1 / s)', 'n = int(input())\ndef f(x):\n return 1 / x\nList = list(map(int, input().split()))\nList2 = [x for x in map(f, List)]\ns = sum(List2)\nprint(1 / s)\n'] | ['Wrong Answer', 'Accepted'] | ['s551131222', 's781649920'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 145] |
p02934 | u169138653 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n=int(input())\na=list(map(int,input().split()))\ns=0\nfor i in range(a):\n s+=1/i\nprint(1/s)', 'n=int(input())\na=list(map(int,input().split()))\ns=0\nfor i in a:\n s+=1/i\nprint(1/s)\n'] | ['Runtime Error', 'Accepted'] | ['s600684921', 's067039976'] | [2940.0, 2940.0] | [18.0, 17.0] | [90, 84] |
p02934 | u169696482 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = input()\na = list(map(int, input()))\nfor i in a:\n i = 1/i\nprint(sum(i) for i in a)', 'n = input()\na = list(map(int, input().split()))\na = [1/i for i in a]\nb = sum(t for t in a )\nprint(1/b)'] | ['Runtime Error', 'Accepted'] | ['s130028587', 's460699448'] | [2940.0, 2940.0] | [18.0, 18.0] | [88, 102] |
p02934 | u175590965 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = list(map(int,input().split()))\n\nb = 0\nfor i in range(a):\n b += float(1/a[i])\nprint(float(1/b))', 'n = int(input())\na = list(map(int,input().split()))\nb = 0\nfor i in range(n):\n b += float(1/a[i])\nprint(float(1/b))'] | ['Runtime Error', 'Accepted'] | ['s882802584', 's889874046'] | [2940.0, 2940.0] | [17.0, 17.0] | [118, 117] |
p02934 | u175677815 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\nS = list(map(float,input().split()))\nans_t = 0\n\nfor i in S:\n\tans = 1/i\n\tprint(ans)\n\tans_t = ans + ans_t\n\nans_t=1/ans_t\nprint(ans_t)', 'n = int(input())\nS = list(map(float,input().split()))\nans_t = 0\n\nfor i in S:\n\tans = 1/i\n\t#print(ans)\n\tans_t = ans + ans_t\n\nans_t=1/ans_t\npri... | ['Wrong Answer', 'Accepted'] | ['s395772918', 's411163543'] | [3060.0, 2940.0] | [18.0, 17.0] | [148, 149] |
p02934 | u176674210 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['# -*- coding:utf8 -*-\n\nn = int(input())\nl = list(map(float, 1 / input().split()))\nprint(a/sum(l))\n', '# -*- coding:utf8 -*-\n\nn = int(input())\nl = list(map(int, input().split()))\nf = [1/i for i in l]\nprint(1/sum(f))\n'] | ['Runtime Error', 'Accepted'] | ['s826613184', 's300501953'] | [2940.0, 3060.0] | [17.0, 17.0] | [98, 113] |
p02934 | u194297606 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ["n = input()\na = input().split(' ')\na_int = [int(i) for i in asp]\n\narev_sum = 0\nfor i in a_int:\n arev_sum += 1/i\n \nans = 1/arev_sum\nprint(ans)", 'n = input()\na = input().split()\na_int = [int(i) for i in asp]\narev_sum = 0\nfor i in a_int:\n arev_sum += 1/i\nans = 1/arev_sum\nprint(ans)', "n = input... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s158454754', 's203078355', 's659388428', 's825719633', 's008442362'] | [3060.0, 3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [147, 138, 165, 167, 145] |
p02934 | u198905553 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nlist_a = [[i for i in input()] for _ in range(N)]\n\ngyaku_su_list = [1/a for a in list_a]\nprint(1 / sum(gyaku_su_list))', 'N = int(input())\nlist_a = [i for i in input()]\n \ngyaku_su_list = [1/a for a in list_a]\nprint(1 / sum(gyaku_su_list))', 'N = int(input())\nlist_a = list(map(int, input().sp... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s286417621', 's667064338', 's862136125'] | [2940.0, 3056.0, 2940.0] | [18.0, 19.0, 17.0] | [135, 116, 128] |
p02934 | u200527996 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = float(input())\nA = list(map(float, input().split()))\nj = float(0)\nans = float(0)\nfor i in A:\n J += 1/i\nans = 1/j\nprint(ans)', 'N = float(input())\nA = list(map(float, input().split()))\nj = float(0)\nans = float(0)\nfor i in A:\n j += 1/i\nans = 1/j\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s654904400', 's979974839'] | [3060.0, 3060.0] | [20.0, 17.0] | [130, 130] |
p02934 | u201387466 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import sys\ninput=sys.stdin.readline\nsys.setrecursionlimit(10 ** 6)\n#from collections import defaultdict\n\n#import fractions\n#import math\n#import collections\n#from collections import deque\n\n#from bisect import insort_left\n#N = int(input())\n#A = list(map(int,input().split()))\n#S = list(input())\n#S.remove("... | ['Runtime Error', 'Accepted'] | ['s390657489', 's560919181'] | [3060.0, 3060.0] | [17.0, 17.0] | [725, 725] |
p02934 | u204616996 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = map(int,input())\nx =0\nfor a in A:\n x+=1/A\nprint("{:,5f}".format(1/x))', 'N=int(input())\nA=list(map(int, input().split()))\nans = 0.0\n\nfor a in A:\n ans += 1/a\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s942674309', 's512402634'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 99] |
p02934 | u205087376 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = list(map(int,input().split()))\nb = list(i/i for i in a)\nprint(1/(sum(b)))', 'n = int(input())\na = list(map(int,input().split()))\nb = list(1/i for i in a)\nprint(1/(sum(b)))'] | ['Wrong Answer', 'Accepted'] | ['s866063229', 's052203350'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 94] |
p02934 | u214304095 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in n:\n ans += 1 / i\nprint(1 / ans)\n', 'n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += 1 / i\nprint(1 / ans)\n'] | ['Runtime Error', 'Accepted'] | ['s273231160', 's269398398'] | [2940.0, 2940.0] | [17.0, 17.0] | [105, 105] |
p02934 | u220064149 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\nA=list(map(int,input().split()))\nb=0\nfor i in range(N):\n b=b+1/A[i]\nprint 1/b\n', 'N=int(input())\nA=input()\nb=0\nfor i in range(N):\n b=b+1/A[i]\nprint 1/b\n', 'N=int(input())\nA=map(int,input().split())\nb=0\nfor i in range(N):\n b=b+1/A[i]\nprint 1/b', 'N=int(input())\nA=list(map(int,input(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s278468098', 's473915791', 's975991752', 's398662305'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 18.0] | [94, 71, 87, 95] |
p02934 | u222668979 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\na=list(map(1/int(),input().split()))\n\nprint(1/sum(a))', 'N=int(input())\na=list(map(1/int,input().split()))\nprint(1/sum(a))', 'N=int(input())\na=list(map(int,input().split()))\nfor i in range(0,N):\n\ta[i]=1/a[i]\nprint(1/sum(a))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s476275584', 's532708715', 's000008853'] | [2940.0, 2940.0, 3064.0] | [18.0, 17.0, 18.0] | [68, 65, 97] |
p02934 | u223555291 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['a=int(input())\nimport numpy\nb=list(map(int,input().split()))\nc=0\nfor i in range(a):\n c+=numpy.reciprocal(b[i])\nprint(numpy.reciprocal(c))', 'a=int(input())\nimport numpy\nb=list(map(int,input().split()))\nc=0\nfor i in range(a):\n c+=1/b[i]\n\nprint(1/c)\n'] | ['Wrong Answer', 'Accepted'] | ['s262051693', 's424018917'] | [21156.0, 12496.0] | [293.0, 150.0] | [138, 108] |
p02934 | u226912938 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(int, input()))\n\ntop = 1\nfor a in A:\n top = top * a\n\nbottom = 0\nfor i in range(N):\n bottom += top / A[i]\n\nans = top / bottom\nprint(ans)', 'N = int(input())\nA = list(map(int, input()))\n\ntop = 1\nfor a in A:\n top = top * a\n\nbottom = 0\nfor i in range(N):\n bott... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s091424444', 's455463745', 's461601133', 's004921747'] | [3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [170, 180, 172, 188] |
p02934 | u227082700 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['L=lambda:list(map(int,input().split()))\nn=int(input())\na=L()\nb=0\nfor i in a:b+=1/a\nprint(1/b)', 'n=int(input())\na=list(map(int,input().split()))\nans=0\nfor i in a:ans+=1/i\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s607130334', 's679075978'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 86] |
p02934 | u228636605 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\ns = input().split()\nsum = 0\n\nfor i in range(N):\n sum = sum + 1/(int(s[i]))\nprint(sum)\n', 'N = int(input())\ns = input().split()\nsum = 0\n\nfor i in range(N):\n sum = sum + 1/(int(s[i]))\nprint(1/sum)\n'] | ['Wrong Answer', 'Accepted'] | ['s695390255', 's816792793'] | [2940.0, 2940.0] | [17.0, 17.0] | [106, 108] |
p02934 | u234856548 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nv = list(map(int,input().split()))\n\nsum = 0\n\nfor i in range(v)\n\tsum = 1/v[i] + sum\n\nans = 1/(sum/N)\n\nprint(ans)', 'N = int(input())\nv = list(map(int,input().split()))\n \nsum = 0\n \nfor i in range(len(v)):\n\tsum = 1/v[i] + sum\n \nans = 1/(sum/N)\n \nprint(ans)', 'N = int(input())\nA = ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s176033382', 's828612347', 's905542266', 's820578649'] | [2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0, 18.0] | [128, 138, 133, 133] |
p02934 | u248221744 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['X = int(input())\na = X//500\nb = (X - (500*a))//5\n\nprint((1000*a) + (5*b))', 'N = int(input())\nA = list(map(int, input().split()))\na = 0\nfor i in range(N):\n a = a + (1/A[i])\n \nprint(1/a)'] | ['Wrong Answer', 'Accepted'] | ['s005771923', 's605634522'] | [2940.0, 2940.0] | [17.0, 18.0] | [73, 110] |
p02934 | u250061066 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\ns=0\nfor i in range(N):\n a=int(input())\n s+=1/a\nprint(1/s)', 'N = int(input())\nA = list(map(int, input().split()))\nB = [1/i for i in A]\nprint(1/sum(B))'] | ['Runtime Error', 'Accepted'] | ['s406962485', 's769577634'] | [2940.0, 2940.0] | [18.0, 17.0] | [74, 89] |
p02934 | u251075661 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['denominator = 0\nfor a in range(map(int, input().split())):\n denominator += 1 / a\n\nprint(1 / denominator)', 'n = int(input())\n\ndenominator = 0\nfor a in map(int, input().split()):\n denominator += 1 / a\n\nprint(1 / denominator)'] | ['Runtime Error', 'Accepted'] | ['s895236805', 's332606214'] | [2940.0, 2940.0] | [17.0, 17.0] | [105, 116] |
p02934 | u252964975 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\nA=map(int, input().split())\nans = 0\nfor i in range(N):\n ans = ans + 1/A[i]\nprint(1/ans)', 'N=int(input())\nA=list(map(int, input().split()))\nans = 0\nfor i in range(N):\n ans = ans + 1/A[i]\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s723117900', 's091897661'] | [3056.0, 2940.0] | [18.0, 17.0] | [103, 109] |
p02934 | u257632310 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\nres = list(map(int, input().split()))\nans = 0 \nfor x in res:\n ans += 1/res\nprint(1/ans)', 'n = int(input())\nres = list(map(int, input().split()))\nans = 0 \nfor x in res:\n ans += 1/x\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s575727527', 's205724964'] | [9128.0, 9124.0] | [24.0, 28.0] | [105, 103] |
p02934 | u258325541 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = input()\na = input()\nl = a.split()\nprint(l)\ntemp = 0\nfor num in l:\n temp = temp + 1/int(num)\n\nprint(1/temp)', 'N = input()\na = input()\nl = a.split()\nprint(l)\ntemp = 0\nfor num in l:\n temp = temp + int(num)\n\nprint(1/temp)', 'N = input()\na = input()\nl = a.split()\ntemp = 0\nfor num in l:\n temp =... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067265332', 's621142278', 's033279049'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [111, 109, 102] |
p02934 | u258808501 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\nA=map(int(),input().split()) \nans=0\nfor a in A:\n ans+=a\nprint(ans)', 'N=int(input())\nA=map(int,input().split()) \nans=0\nfor a in A:\n ans += 1/a\nprint(ans)', 'N=int(input())\nA=map(int,input().split()) \nans=0\nfor a in A:\n ans += 1/a\nprint(1/ans)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s233364875', 's355169946', 's497913392'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [82, 84, 86] |
p02934 | u258862116 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nlist = [int(i) for i in input().split()]\ngyaku = 0\n\nfor j in list:\n gyaku += round(1/j,5)\n\nprint(round(1/gyaku, 5))', 'N = int(input())\nlist = [int(i) for i in input().split()]\ngyaku = 0\n\nfor j in list:\n #gyaku += round(1/j,5)\n gyaku += float(1/j)\n\n#print(round(1/gyaku, 5))\nprint(1... | ['Wrong Answer', 'Accepted'] | ['s000885346', 's773464112'] | [2940.0, 2940.0] | [17.0, 17.0] | [133, 172] |
p02934 | u261260430 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = map(int, input().split())\n\nd=1\nm=0\nfor i in range(n):\n d *= i\n m += i\n\nans = d/m\nprint(ans)', 'n = int(input())\n*a, = map(int, input().split())\n\nd=1\nm=0\nfor i in a:\n d *= i\nfor i in a:\n m += d/i\n\nans = d/m\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s494430609', 's639780155'] | [3060.0, 3060.0] | [17.0, 17.0] | [114, 124] |
p02934 | u264989012 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(int,input().split()))\ni = 0\nfor i <= N-1:\n B[i] = 1/A[i]\nS = sum(B)\nanswer = 1 / S\nprint(answer)', 'N = int(input())\nA = list(map(int,input().split()))\ni = 0\nB = 0\nwhile i <= N-1:\n B += 1/A[i]\n i = i + 1\nanswer = 1 / B\nprint(answer)'] | ['Runtime Error', 'Accepted'] | ['s955477369', 's923056985'] | [2940.0, 3060.0] | [17.0, 17.0] | [127, 134] |
p02934 | u265118937 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import numpy as np\nn = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n ans += np.reciprocal(a[i])\nprint(np.reciprocal(ans))', 'n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n ans += pow(a[i], -1)\nprint(pow(ans, -1))'] | ['Wrong Answer', 'Accepted'] | ['s157669362', 's018649470'] | [27296.0, 9132.0] | [121.0, 26.0] | [155, 124] |
p02934 | u269778596 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['size = int(input())\nli = list(map(int,input().split()))\ns = 0\nfor i in li:\n s += 1/i\nprint(1/s \n', 'size = int(input())\nli = list(map(int,input().split()))\ns = 0\nfor i in li:\n s += (1/i)\nprint(1/s)'] | ['Runtime Error', 'Accepted'] | ['s436626670', 's519076114'] | [2940.0, 2940.0] | [17.0, 17.0] | [98, 100] |
p02934 | u280673588 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ["n = int(input())\na = input().split(' ')\nfor i in range(n):\n a[i] = int(a[i])\nprint(a)\n\ndef gcd(a,b):\n while b!=0:\n a,b=b,a%b\n return a\n\nbunshi = 1\nbunbo = a[0]\nfor i in range(1, n):\n bunshi = bunbo + a[i]\n bunbo = bunbo * a[i]\n gcd = gcd(bunbo, bunshi)\n bunbo = bunbo / gcd\n bunshi = bunsh... | ['Runtime Error', 'Accepted'] | ['s439074701', 's253301187'] | [3064.0, 3060.0] | [17.0, 18.0] | [329, 143] |
p02934 | u284744415 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['# -*- coding: utf-8 -*-\n\ndef main():\n n = int(input())\n num = makeNumList(input())\n ans = 0.0\n \n for i in range(n):\n ans += invNum(num[i])\n \n print(invNum(ans))\n\ndef invNum(n):\n return 1 / n\n\ndef makeNumList(raw):\n num = []\n raw = raw.split(" ")\n for i in rang... | ['Runtime Error', 'Accepted'] | ['s072334933', 's113163881'] | [3056.0, 3064.0] | [17.0, 18.0] | [362, 367] |
p02934 | u284999381 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['a = int(input())\nn = list(map(int, input().split()))\nb = []\nfor i in range(len(n)):\n b.append(1/n[i])\nans = sum(b)\nprint(ans)', 'a = int(input())\nn = list(map(int, input().split()))\nb = []\nfor i in range(len(n)):\n b.append(1/n[i])\nans = sum(b)\nprint(round(ans,5))', 'a = int(input())\nn = list(map(in... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s334870861', 's642897692', 's951870918'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [128, 137, 130] |
p02934 | u287920108 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['#Resistors in Parallel\nN = int(input())\nlst_A = [1/int(input()) for i in range(N)]\n\nprint(1/sum(lst_A))', "N = int(input())\nlst_A = [1/int(input()) for i in range(N)]\n#print('lst_A:', lst_A)\nprint(1/sum(lst_A))", 'N = input()\nlst_A = [1/int(input()) for i in range(N)]\n\nprint(1/sum(lst_A))', 'n = input()\nls... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s082231651', 's147273474', 's772648966', 's238778243'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 18.0] | [103, 103, 75, 102] |
p02934 | u288430479 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['a,b = map(int,input().split())\ni = 0\nwhile 2*a+(a-1)*(i-2) <b:\n i += 1\nprint(i+1)', 'n = int(input())\nl = list(map(int,input().split()))\na = 0\nfor i in range(n):\n a += 1/l[i]\nprint(1/a)'] | ['Runtime Error', 'Accepted'] | ['s637571966', 's813425450'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 101] |
p02934 | u288888252 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['a = int(input())\ns = list(map(int,input().split()))\n\nans = 0\n\nfor i in s:\n print (ans)\n print (1/i)\n ans += (1/i)\n \n\nprint (1/ans)', 'a = int(input())\ns = list(map(int,input().split()))\n\nans = 0\n\nfor i in s:\n ans += (1/i)\n \nprint (1/ans)'] | ['Wrong Answer', 'Accepted'] | ['s527350314', 's732721617'] | [3060.0, 2940.0] | [17.0, 17.0] | [142, 109] |
p02934 | u289499565 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = 0\nnumbers = array()\n\nN = int(input())\nnumbers = input().split()\nnumbers = [1/int(i) for i in numbers]\n\nprint(1/sum(numbers))\n', 'N = 0\nnumbers = array()\n\nN = int(input())\nnumbers = [1/int(i) for i in input().split()]\n\nprint(sum(numbers))', 'N = 0\nnumbers = array()\n\nN = int(input())\nnumbers = [1/... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s436109541', 's647546202', 's946368263', 's370605324'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [129, 108, 110, 106] |
p02934 | u294385082 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\na = list(map(int,input().split()))\nl = []\n\nfor i in a:\n l.append(1/i)\n \nprint(sum(l))', 'n = int(input())\nm = list(map(int,input().split()))\no = []\nfor i in m:\n o.append(1/a[i])\np = sum(o) \nprint(1/p)', 'n = int(input())\na = list(map(int,input().split()))\nl = []\n \nfor i in a:\n l... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s592232139', 's938202724', 's762043636'] | [2940.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0] | [104, 112, 107] |
p02934 | u298554556 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\narr = input()\n\nmother = 0\nfor i in arr:\n if i != " ":\n \tmother = mother + 1 / int(i) \n\nprint(1/mother)', 'N = int(input())\narr = input()\n\nhoge = arr.split(" ")\n\nmother = 0\nfor i in hoge:\n mother = mother + 1 / int(i) \n\nprint(1/mother)'] | ['Runtime Error', 'Accepted'] | ['s177760595', 's738221254'] | [2940.0, 2940.0] | [17.0, 18.0] | [121, 129] |
p02934 | u303059352 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['n = int(input())\nans = 0\nfor i in range(n):\n a = int(input())\n ans += 1 / a;\nprint(1 / ans)', 'n = int(input())\nans = 0\nlis = list(map(int, input().split()))\nfor i in lis:\n ans += 1 / i;\nprint(1 / ans)\n'] | ['Runtime Error', 'Accepted'] | ['s618474696', 's642170647'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 108] |
p02934 | u306070611 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nli = list(map(int,input().split()))\nli2 = []\nfor i in li:\n li2.append(1/i)\nprint(sum(li2))', 'N = int(input)\nli = list(map(int,input().split()))\nli2 = []\nfor i in li:\n li2.append(1/i)\nprint(sum(li2))', 'N = int(input())\nli = list(map(int,input().split()))\nli2 = []\nfor i in li:\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s211576685', 's969382080', 's725856884'] | [2940.0, 3064.0, 2940.0] | [18.0, 17.0, 19.0] | [110, 108, 112] |
p02934 | u309455049 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(int, input().split()))\n\nx = []\nfor i in range(A):\n x.append(1/A[i])\n bunbo = sum(x)\nprint(1 / bunbo)\n ', 'N = int(input())\nA = map(int, input().split())\n\nx = []\nfor i in range(A):\n x.append(1/A[i])\n bunbo = sum(x)\nprint(1 / bunbo)', 'N = int(input())\nA = li... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s130362274', 's275408940', 's671209676'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [141, 130, 141] |
p02934 | u310549140 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(float, input().split()))\ndeno = 1\nfor i in range(N):\n deno += 1/A[i]\nprint(1/deno)\n', 'N = input()\nA = list(map(float, input().split()))\ndeno = 1\nfor i in range(N):\n deno += 1/A[i]\nprint(1/deno)\n', 'N = int(input())\nA = list(map(float, input().split()))\ndeno = 0\nfor ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s923660785', 's931194233', 's478452792'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [116, 111, 115] |
p02934 | u321065001 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N=int(input())\nA= list(map(int,input().split()))\ns=0\n\nfor i in A:\n S+=1/i\n\nprint(1/S)\n', 'N=int(input())\nA= list(map(int,input().split()))\n\nfor i in range(N):\n S+=1/A[i]\n\nprint(1/S)\n', 'N=int(input())\nA= list(map(int,input().split()))\n\nfor i in A:\n S+=1/A\n\nprint(1/S)\n', 'N=int(input())\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s113206079', 's305041869', 's350069531', 's647736748', 's416845219'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 16.0, 17.0, 17.0, 17.0] | [89, 95, 85, 87, 99] |
p02934 | u328755070 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = list(map(int, input().split()))\n\nbun = 0\nfor i in range(N):\n bun += 1/A[i]\n \nans = 1/ans\nprint(ans)', 'N = int(input())\nA = list(map(int, input().split()))\n\nbun = 0\nfor i in range(N):\n bun += 1/A[i]\n \nans = 1/bun\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s485314307', 's236994763'] | [2940.0, 2940.0] | [17.0, 17.0] | [122, 122] |
p02934 | u329565519 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['N = int(input())\nA = map(int, input().split())\n\n# r = 0\n# for a in A:\n# r += 1 / a\n# print(1 / r)\n\nprint(sum(1 / a for a in A))', 'N = int(input())\nA = map(int, input().split())\n\nprint(1 / sum(1 / a for a in A))\n'] | ['Wrong Answer', 'Accepted'] | ['s987839040', 's490669525'] | [2940.0, 2940.0] | [17.0, 18.0] | [131, 81] |
p02934 | u331997680 | 2,000 | 1,048,576 | Given is a sequence of N integers A_1, \ldots, A_N. Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}}. | ['import numpy as np\nN = int(input())\nA = np.array(list(map(int, input().solit())))\nprint(1/sum(1/A))', 'import numpy as np\nN = int(input())\nA = np.array(list(map(int, input().split())))\nprint(1/sum(1/A))'] | ['Runtime Error', 'Accepted'] | ['s909617319', 's494865718'] | [21296.0, 12632.0] | [317.0, 152.0] | [99, 99] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.