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 | u699944218 | 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()))\ntimes = 1\nsum = 0\nfor i in range(N):\n times *= A[i]\nfor j in range(N):\n sum += A[i]\nprint(times/sum)', 'N = int(input())\nA = list(map(int,input().split()))\nB = [None for _ in range(N)]\nfor i in range(N):\n B[i] = 1/A[i]\nprint(1/sum(B))'] | ['Wrong Answer', 'Accepted'] | ['s716492668', 's768574743'] | [3060.0, 2940.0] | [17.0, 17.0] | [154, 131] |
p02934 | u703130195 | 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()))\nfor i in A:\n sum += 1/i\nprint(1/sum)', 'N = int(input())\nA = list(map(int,input().split()))\nsum = 0\nfor i in A:\n sum += 1/i\nprint(1/sum)'] | ['Runtime Error', 'Accepted'] | ['s008103881', 's533942342'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 99] |
p02934 | u703890795 | 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())\nc = 0.0\nfor i in range(N):\n c += (1 / A[i])\nprint(1/c)\n ', 'N = int(input())\nA = map(int, input().split())\ns = 0\nfor i in range(N):\n s += 1/i\nprint(1/s)', 'N = int(input())\nA = list(map(int, input().split()))\ns = 0\nfor i in range(N):\n s += 1/A[i]\nprin... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s208985256', 's613290333', 's518995969'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [105, 93, 102] |
p02934 | u704284486 | 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(" ")))\nfor i in range(n):\n 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 += 1/a[i]\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s737691781', 's133913026'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 110] |
p02934 | u717671569 | 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 = []\na = list(map(int, input().strip().split()))\n\nprint(a)\n\nall_sum = 0\n\nfor i in range(n):\n all_sum += 1/a[i]\n\nans = 1 / all_sum\n\nprint(ans)', 'n = int(input())\na = list(map(int, input().strip().split()))\n\nall_sum = 0\n\nfor i in range(n):\n all_sum += 1/a[i]\n\nans = 1 / all_sum... | ['Wrong Answer', 'Accepted'] | ['s877508024', 's448180532'] | [2940.0, 2940.0] | [18.0, 17.0] | [161, 145] |
p02934 | u724844363 | 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()))\nk = []\nfor i in range(n):\n k.append(1/a[i])\nprint(k)\nprint(1/sum(k))', 'n = int(input())\na = list(map(int,input().split()))\nk = []\nfor i in range(n):\n k.append(1/a[i])\nprint(k)\nprint(1/sum(k))', 'n = int(input())\na = list(map(int,input().split()))... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s110743034', 's394092474', 's788280622'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [123, 123, 114] |
p02934 | u726807166 | 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 = input().split()\nprint(1/sum(map(lambda x:1/x, a)))', 'n = int(input())\n\na = input().split()\nprint(1/sum(a.map(lambda x:1/x)))', 'n = int(input())\n\na = input().split()\nprint(1/sum(map(lambda x:1/int(x), a)))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s020992240', 's728993101', 's068863011'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [72, 71, 77] |
p02934 | u727801592 | 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())\nsums=0\nfor i in range(n):\n sums+=1/a[i]\nprint(1/sums)', 'n=int(input())\na=list(map(int,input().split()))\nsums=0\nfor i in range(n):\n sums+=1/a[i]\nprint(1/sums)'] | ['Runtime Error', 'Accepted'] | ['s395833979', 's001637521'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 102] |
p02934 | u729119068 | 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\nA=list(map(int,input().split()))\nfor i in range(N):S+=1/i\nprint(1/S)\n', 'N=int(input())\nS=0\nA=list(map(int,input().split()))\nfor i in range(N):\n S += 1/i\nprint(1/S)', 'N=int(input())\nS=0\nA=list(map(int,input().split()))\nfor i in A:S+=1/i\nprint(1/S)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s030237414', 's290691749', 's633844989'] | [9100.0, 9104.0, 9100.0] | [24.0, 27.0, 27.0] | [88, 92, 80] |
p02934 | u729193633 | 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\nsum_a = 0\nfor _ in range(N):\n\ta = int(input())\n sum_a += 1/a\n\nprint(1/sum_a)', 'N = int(input())\nout = 1 / sum([1/int(a) for a in input().split()])\nprint(out)'] | ['Runtime Error', 'Accepted'] | ['s701995603', 's275175265'] | [3068.0, 2940.0] | [17.0, 17.0] | [97, 78] |
p02934 | u731362892 | 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().split()))\ns=list[]\nfor i in range(N):\n s[i]=1/s[i]\n s.attend(s[i])\nQ=sum(s) \nprint(1/Q) ', 'N=int(input())\naa=list(map(int,input().split()))\nfor i in range(N):\n aa[i]=1/aa[i]\nQ=sum(aa)\nprint(1/Q)'] | ['Runtime Error', 'Accepted'] | ['s157988850', 's977510197'] | [2940.0, 2940.0] | [17.0, 17.0] | [131, 104] |
p02934 | u731368968 | 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()))\nprint(1/sum(a))', 'n = int(input())\na = list(map(int, input().split()))\nprint(1/sum([1/x for x in a]))'] | ['Wrong Answer', 'Accepted'] | ['s123546077', 's198900778'] | [2940.0, 2940.0] | [17.0, 19.0] | [68, 83] |
p02934 | u740047492 | 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=list(map(int,input().split()))\nprint(1/sum(1/a for a in range(a_list)))', 'n=int(input())\na=[int(input()) for i in range(n)]\nfor result in range(n):\n 1//(1//(a*n))\n print(result)', 'n=int(input())\na_list=list(map(int,input().split()))\nprint(1/sum(1/a for a in a_list))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s126357551', 's682727751', 's415817726'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [93, 105, 86] |
p02934 | u742036388 | 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())\nfor i in range(n):\n a.append(input())\n\n# 1 / sum_i(1/a_i)\nprint(1 / sum([1/i for i in a]))', 'n = int(input())\na = list(map(int, input().split()))\n\nprint(1 / sum([1/i for i in a]))'] | ['Runtime Error', 'Accepted'] | ['s282169152', 's330457067'] | [3064.0, 2940.0] | [17.0, 18.0] | [110, 86] |
p02934 | u747427153 | 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()]\ns == 0\nfor i in a:\n s += 1/i\nprint(1/s)\n', 'n = int(input())\na = [int(i) for i in input().split()]\ns = 0\nfor j in a:\n s += 1/j\nprint(1/s)\n'] | ['Runtime Error', 'Accepted'] | ['s924718547', 's726818971'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 95] |
p02934 | u752522099 | 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())\nlis = list(map(int,input().split()))\ning_total = 0\n\nfor i in range(n):\n ing_total+= 1 / lis[i]\n\nprint(int(1/ing_total)\n', 'n = int(input())\nlis = list(map(int,input().split()))\ning_total = 0\n\nfor i in range(n):\n ing_total+= 1 / lis[i]\n\nprint(1/ing_total)\n'] | ['Runtime Error', 'Accepted'] | ['s672771519', 's153585778'] | [2940.0, 2940.0] | [17.0, 17.0] | [139, 135] |
p02934 | u754022296 | 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}}. | ['c=0;a=input();for i in input().split():\n c+=1/int(i)\nprint(1/c)', 'import numpy as np\nn = int(input())\na = np.array(list(map(int, input().split())))\nprint(1/((1/a).sum()))'] | ['Runtime Error', 'Accepted'] | ['s019619784', 's514854922'] | [2940.0, 12420.0] | [17.0, 154.0] | [64, 104] |
p02934 | u757030836 | 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 = [float(i) for i in input().split()]\n\nc = 0\n\nfor i in A:\n c += (1/A[i])\n\nprint(float(1/c))\n', 'N = int(input)\nA = [int(i) for i in input().split()]\n\nc = 0\n\nfor i in A:\n c += (1/A[i])\n\nprint(float(1/c))', 'N = int(input())\nA = [int(i) for i in input().split()]\n\nc = 0\n\nfor i in... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s481436915', 's587531354', 's546633389'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [110, 107, 118] |
p02934 | u758831502 | 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())\nsum=0.0\n\nfor i in range(0,N):\n a=int(input())\n sum+=1/a\n\nprint(1/sum)\n', 'N=int(input())\nsum=0.0\n\nA=[i for i in range(N)]\n\nA=list(map(int,input().split()))\n\nfor i in range(0,N):\n sum+=1/A[i]\n\nprint(1/sum)\n'] | ['Runtime Error', 'Accepted'] | ['s922451469', 's245751031'] | [2940.0, 2940.0] | [19.0, 18.0] | [87, 132] |
p02934 | u764569828 | 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())\na = list(map(int,input().split()))\ns = 0\nfor i in range(n):\n s+=1/a[i]\nprint(1/s)', 'n = int(input())\na = list(map(int,input().split()))\ns = 0\nfor i in range(n):\n s+=1/a[i]\nprint(1/s)'] | ['Runtime Error', 'Accepted'] | ['s580157607', 's816092432'] | [2940.0, 2940.0] | [17.0, 17.0] | [101, 101] |
p02934 | u772311880 | 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\n\ncount = int(input())\nnumber_list = map(int, input().split(' '))\n\nsum = 0\nfor number in number_list:\n sum += Fraction(1, number)\n\n up, down = map(int, str(sum).split('/'))\n print(down / up) ", 'if __name__ == "__main__":\n N = int(input())\n s = input().split()\n ... | ['Runtime Error', 'Accepted'] | ['s001585821', 's158087950'] | [5432.0, 2940.0] | [38.0, 17.0] | [227, 158] |
p02934 | u774985302 | 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())]\nB = [map(lambda x : 1/x,A)]\nC = [map(lambda x : 1/x,B)]\nprint(C)\n', 'N = int(input())\nA = [map(int,input().split())]\nB = [lambda x : 1/x for x in A]\nC = [lambda x : 1/x for x in B]\nprint(C)', 'N = int(input())\nA = list(map(int,input().split()))\nB = list(map(l... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s518119936', 's657887470', 's997600598', 's377917833'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 17.0] | [113, 120, 123, 93] |
p02934 | u777394984 | 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())\nasdf = 0\nfor i in range(n):\n asdf += 1/a[i]\nprint(1/asdf)', 'n=int(input())\na=list(map(int,input().split()))\nasdf = 0\nfor i in range(n):\n asdf += 1/a[i]\nprint(1/asdf)\n'] | ['Runtime Error', 'Accepted'] | ['s680975740', 's059995858'] | [2940.0, 2940.0] | [18.0, 17.0] | [101, 108] |
p02934 | u781379878 | 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(input())\nales = list(map(int, input().split()))\ndef gcd(a, b):\n while b != 0:\n a, b = b, a%b\n return a\nk = ales[0]\nfor a in ales[1:]:\n k = gcd(k, a)\nnumerator = int(ales[0]/k)\nfor a in ales[1:]:\n numerator += int(k/a)\nprint(k/numerator)', '_ = int(input())\nales = sorted(list(map(int, input... | ['Wrong Answer', 'Accepted'] | ['s877518945', 's547308444'] | [3064.0, 3064.0] | [18.0, 18.0] | [251, 307] |
p02934 | u783565479 | 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 = [1/f for f in map(float, input().split())]\nprint(A)\nprint(sum(A))\nprint(1/sum(A))', 'N = float(input())\nA = [1/f for f in map(float, input().split())]\nprint(1/sum(A))'] | ['Wrong Answer', 'Accepted'] | ['s565733319', 's200550168'] | [8960.0, 8952.0] | [26.0, 25.0] | [104, 81] |
p02934 | u785795721 | 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 = [1 / a[i] for i int range(n)]\nprint(sum(s))', 'n = int(input())\na = list(map(int, input().split()))\ns = 0.0\nfor i in range(n):\n s += 1 / a[i]\nprint(s)', 'n = int(input())\na = list(map(int, input().split()))\ns = [1 / a[i] for i in range(n)]\nprint(sum... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s392958192', 's543346330', 's829972201', 's080467898'] | [2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [100, 104, 99, 134] |
p02934 | u794921280 | 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()))\nb=0\nfor i in range(n):\n b = b + 1/a[i]\nb=1/b\nprint(b)\n\n', 'n = int(input())\na=[]\nfor i in range(n):\n a.append(int(input()))\nb=0\nfor i in range(n):\n b = b + 1/a[i]\nb=1/b\nprint(b)\n\n', 'n = int(input())\n\na=[int(x) for x in i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s131581994', 's711890983', 's522521579'] | [2940.0, 3068.0, 2940.0] | [17.0, 17.0, 17.0] | [125, 125, 112] |
p02934 | u799710027 | 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 product(a):\n result = 1\n for i in a:\n result = result * i\n return result\ndef foo(a, b):\n result = 0\n for i in a:\n result = result + a/i\n return result\nn = int(input())\na = list(map(int, input().split()))\nnumerator = product(a)\ndenominator = foo(a, numerator)\nprint(numerator/denominator)'... | ['Runtime Error', 'Accepted'] | ['s322288436', 's644110358'] | [3060.0, 2940.0] | [17.0, 17.0] | [303, 107] |
p02934 | u802772880 | 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\nfor i in a:\n r+=1/i\nprint(r)', 'n=int(input())\na=list(map(int,input().split()))\nr=0\nfor i in a:\n r+=1/i\nprint(round(1/r, 7))'] | ['Wrong Answer', 'Accepted'] | ['s052692899', 's388788782'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 93] |
p02934 | u813452457 | 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 = [ 1/int(i) for i in input().split()]\n\nprint(1/sum(s_1))', 'N = int(input())\nA = [ 1/int(i) for i in input().split()]\n\nprint(1/sum(A))'] | ['Runtime Error', 'Accepted'] | ['s992012481', 's123385400'] | [2940.0, 2940.0] | [17.0, 18.0] | [76, 74] |
p02934 | u821432765 | 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([int(i) for i in input().split()])\na = 1/a\nprint(1/(sum(a))', 'import numpy as np\nn=int(input())\na=np.array([int(i) for i in input().split()])\na = 1/a\nprint(1/sum(a))'] | ['Runtime Error', 'Accepted'] | ['s824725649', 's555501532'] | [2940.0, 12424.0] | [17.0, 153.0] | [104, 103] |
p02934 | u821969418 | 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 decimal\nn = float(input())\na = list(map(float, input().split()))\n\ns = 1\nfor i in a:\n s = s * i\n\nx = (n-1)*sum(a))\ns = decimal.Decimal(7)\nx = decimal.Decimal(7)\nprint(float(s)/x)', 'n = int(input())\na = list(map(int, input().split()))\nans = 0\n\nfor i in a:\n ans = ans + 1/i\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s695934349', 's894501396'] | [2940.0, 2940.0] | [17.0, 18.0] | [187, 106] |
p02934 | u832058515 | 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(input())\nresult = 0\nfor num in a:\n result += 1/num\n \nprint(1/result)\n\n', 'n=input()\na=list(input())\nresult = 0\nfor num in a:\n result += 1/int(num)\n \nprint(1/result)\n\n\n', 'n=input()\na=str(input())\nli = list(a.split(" "))\nresult = 0\nfor num in li:\n result += 1/int(n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s425996022', 's462438931', 's682151569'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [93, 99, 122] |
p02934 | u835482198 | 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\n\nn = int(input())\nA = list(map(int, input().split()))\n\nnumerator = reduce(lambda a, b: a * b, A)\ndenominator = 0\nfor i in range(n):\n denominator += reduce(lambda a, b: a * b, A[:i] + A[i+1:])\nprint(1.0)\n', 'from functools import reduce\n\n\nn = int(input())\nA = list(map(in... | ['Runtime Error', 'Accepted'] | ['s954115542', 's588764538'] | [3572.0, 3572.0] | [23.0, 24.0] | [236, 314] |
p02934 | u845847173 | 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(e) for e in range(N)]\nV = 0\nfor i in range(N):\n V += 1/A[i]\nprint(1/V)', 'N = int(input())\nA = map(int, input().split())\n\nsum = 0\nsum += 1/A\nans = 0\nans += 1/sum\nprint(ans)', 'N = int(input())\nA = [int(e) for e in input().split()]\nV = 0\nfor i in range(N):\n V += 1/A[i]\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s583687261', 's942737887', 's613265005'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [99, 98, 106] |
p02934 | u856169020 | 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 += (1/a[i])\nprint(1/ans)', 'n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n ans += (1/a[i])\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s401495729', 's361875157'] | [3064.0, 2940.0] | [17.0, 17.0] | [104, 110] |
p02934 | u857673087 | 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 _ in range(n)]\nrev_a =[]\n\nfor i in a:\n j = 1 / i\n rev_a.append(j)\n \nprint(1/ sum(rev_a))\n', 'n = int(input())\na =[int(input) for _ in range(n)]\nb = 0\nrev_a =[]\n\nfor i in a:\n j = 1 / i\n rev_a.append(j)\n\nfor k in rev_a:\n b += k\n\nprint(1/b)\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s152370055', 's669712852', 's650900655'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [135, 162, 162] |
p02934 | u858670323 | 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().rstrip().split(' ')\nsum = 0\nfor a in A:\n sum += 1/a\nprint(1/sum)", "N = int(input())\nA = list(map(int,input().rstrip().split(' ')))\nsum = 0\nfor a in A:\n sum += 1/a\nprint(1/sum)"] | ['Runtime Error', 'Accepted'] | ['s116272538', 's192667283'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 111] |
p02934 | u860002137 | 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\ntmp = 1\nfor a in A:\n tmp *= a\n\nans = 0\nfor a in A:\n ans += tmp//a\n\nprint(ans)', 'N = int(input())\nA = list(map(int, input().split()))\n\ntmp = 1\nfor a in A:\n tmp *= a\n\nans = 0\nfor a in A:\n ans += tmp//a\n\nprint(tmp/ans)'] | ['Wrong Answer', 'Accepted'] | ['s484106094', 's883909027'] | [3060.0, 3060.0] | [17.0, 18.0] | [137, 141] |
p02934 | u861886710 | 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()))\na = sum(list(map(lambda x : 1 / x, A)))\naa = list(map(lambda x : 1 / x, A))\nprint(aa)\nprint(1/a)', 'N = float(input())\nA = list(map(float, input().split()))\na = sum(list(map(lambda x : 1 / x, A)))\nprint(1/a)'] | ['Wrong Answer', 'Accepted'] | ['s125057271', 's396588894'] | [2940.0, 2940.0] | [17.0, 19.0] | [153, 107] |
p02934 | u862243075 | 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\nsum_a_rev = 0\n\nfor i in range(n):\n val = int(input())\n sum_a_rev = sum_a_rev + 1/val\n\nres = 1/sum_a_rev\n\nprint("{}".format(res))\n\n', 'n = int(input())\n\nsum_a_rev = 0\n\nfor i in range(n):\n val = int(input())\n sum_a_rev = sum_a_rev + 1/val\n\nres = 1/sum_a_rev\n\nprint("{}... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s144816819', 's573496963', 's002082600'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [154, 154, 158] |
p02934 | u864551836 | 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(' ')\n\nans = 0\nfor v in a:\n\tans += 1 / int(v)\nprint(ans)\n", 'n = int(input())\nA = list(map(int, input().split()))\n\nbunbo = 0\nfor value in A:\n bunbo += 1 / value\nprint(1/bunbo)\n'] | ['Wrong Answer', 'Accepted'] | ['s132220710', 's797440490'] | [2940.0, 2940.0] | [17.0, 18.0] | [91, 118] |
p02934 | u867604473 | 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())\nimport numpy as np\nnpa = np.array(a)\nprint(1/(sum(1/a))', 'n = int(input())\na = map(int, input().split())\nimport numpy as np\nnpa = np.array(a)\nprint(1/(sum(1/a)))', 'n = int(input())\na = list(map(int, input().split()))\nimport numpy as np\nnpa = np.array(a)\npri... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s152115976', 's440754704', 's031755024'] | [2940.0, 12468.0, 12512.0] | [17.0, 249.0, 152.0] | [102, 103, 111] |
p02934 | u868628468 | 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())\nfor i in range(N):\n A[i] = 1/A[i]\na = sum(A)\nprint(1/a)', 'N = int(input())\nA = list(map(int, input().split()))\nfor i in range(N):\n A[i] = 1/A[i]\na = sum(A)\nprint(1/a)'] | ['Runtime Error', 'Accepted'] | ['s933017246', 's566044681'] | [2940.0, 2940.0] | [18.0, 18.0] | [105, 111] |
p02934 | u868767877 | 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\nfor i in range(N):\n sum += 1 / A[i]\nprint(1/sum)', 'N = int(input())\nA = list(map(int, input().split(" ")))\nsum = 0\nfor i in range(N):\n sum += 1. / A[i]\nprint(1/sum)'] | ['Runtime Error', 'Accepted'] | ['s501099897', 's222810672'] | [2940.0, 2940.0] | [17.0, 18.0] | [106, 114] |
p02934 | u873736356 | 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(list(int,input().split()))\nans = 0\nfor i in a:\n ans += i\nprint(1 / ans)\n', "a = int(input())\n\ns = input()\n\nif(a >= 3200):\n print(s)\nelse:\n print('red')\n", 'n = int(input())\n\na = map(int,input().split())\nans = 0\nfor i in a:\n ans += 1/i\nprint(1 / ans)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s245393148', 's686768454', 's738790798'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 20.0] | [101, 82, 97] |
p02934 | u873780029 | 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 range(n):\n ans=ans+1/a[i]\nans=1/ans\n print(ans)', 'n=int(input())\na=list(map(int,input().split()))\nans=0.0\nfor i in range(n):\n ans=ans+1.0/a[i]\nans=1.0/ans\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s119566171', 's998939656'] | [8804.0, 9076.0] | [21.0, 27.0] | [111, 116] |
p02934 | u876616721 | 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()))\nsum = 0\nfor i in range(n):\n sum += 1/a[i]\nprint(sum)', 'n = int(input())\na = list(map(int, input().split()))\nsum = 0\nfor i in range(n):\n sum += 1/a[i]\nprint(1/sum)'] | ['Wrong Answer', 'Accepted'] | ['s876260926', 's707281658'] | [2940.0, 2940.0] | [17.0, 18.0] | [106, 108] |
p02934 | u888933875 | 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())\nl= [np.array(input().split() ,dtype=np.int64)]\n\nprint(l)\nl2=[]\nfor i in range(len(l)):\n l2.append(1/(l[i]))\n print(l2)\n sum1=np.sum(l2) \n print(sum1) \n ans=1/(sum1)\nprint(ans)', 'import numpy as np\nn=int(input())\nl= [np.array(input().split() ,dtype=np.int... | ['Wrong Answer', 'Accepted'] | ['s199351758', 's527438152'] | [27180.0, 27192.0] | [117.0, 118.0] | [224, 184] |
p02934 | u891635666 | 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 = 0\nfor _ in range(n):\n num += 1 / int(input())\nprint(1 / num)', "n = int(input())\nnums = list(map(input().split(' '), lambda x: 1 / int(x)))\nprint(1 / sum(nums))", "n = int(input())\nnums = map(lambda x: 1 / int(x), input().split(' '))\nprint(1 / sum(nums))"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s637056044', 's801737916', 's231177371'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [86, 96, 90] |
p02934 | u893063840 | 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\ndiv = 0\nfor i in range(n):\n div += a / a[i]\nprint(1 / div)\n', 'n = int(input())\na = list(map(int, input().split()))\n\ndiv = 0\nfor i in range(n):\n div += 1 / a[i]\nprint(1 / div)\n'] | ['Runtime Error', 'Accepted'] | ['s178492873', 's108469370'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 116] |
p02934 | u895040371 | 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()))\nb = []\nfor i range(n):\n b[i]= 1/a[i]\n B = sum(b)\nprint(1/B)', 'N = int(input())\na = list(map(int,input().split()))\nb=[]\nfor i in range(N+1):\n b.append(1.0/i)\n B = sum(b)\nprint(1/B)', 'n = int(input())\na =list(map(int,input()))\nb = []\nfor i range(n):\n b[i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s367725658', 's544818248', 's695293647', 's729925277', 's799515280', 's854679267', 's712174822'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [104, 119, 109, 124, 122, 115, 122] |
p02934 | u902430070 | 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 = 0\ncount = 0\nwhile count < int(input())+1:\n b = int(input())\n a += 1/b\n count +=1\nc = 1/a\nprint(c)', 'a = 0\nfor i in range(1,int(input())+1):\n a += 1/int(input())\na = 1/a\n ', 'a = 0\nfor i in range(1,int(input())+1):\n b = int(input())\n a += 1/b\na = 1/a', 'a = 0\nb = int(input())\nc = list(map(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s485545240', 's506125192', 's864682916', 's675005536'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0] | [104, 72, 77, 107] |
p02934 | u903179665 | 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 = 1/sum(1/x for x in A)\nprint(ans)', 'N=int(input())\nA=list(map(int,input().split()))\n\nnum=0\nfor i in A:\n num+=1/i\n \nprint(1/num) '] | ['Runtime Error', 'Accepted'] | ['s614156079', 's438421751'] | [2940.0, 3060.0] | [17.0, 20.0] | [84, 100] |
p02934 | u910295650 | 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()))\na=0\nfor i in range(N-1):\n a+=1/A[i]\nprint(1/a)', 'N=int(input())\nA=list(map(int,input().split()))\na=0\nfor i in range(N):\n a+=1/A[i]\nprint(1/a)'] | ['Runtime Error', 'Accepted'] | ['s576004377', 's856909853'] | [2940.0, 2940.0] | [18.0, 17.0] | [97, 95] |
p02934 | u914330401 | 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\nans = 0\nfor i in range(n):\n ans += a[i]\n \nprint(1/ans)', 'n = int(input())\na = list(map(int, input().split()))\n\nans = 0\nfor i in range(n):\n ans += 1/a[i]\n \nprint(1/ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s665359003', 's993470695'] | [2940.0, 2940.0] | [17.0, 17.0] | [110, 113] |
p02934 | u920103253 | 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(x) for x in input().split()]\n\nans=0\nfor i in range(a):\n ans+=1/i\nprint(1/ans)', 'n=int(input())\na=[int(x) for x in input().split()]\n \nans=0\nfor i in a:\n ans+=1/i\nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s447286855', 's849033778'] | [2940.0, 2940.0] | [17.0, 17.0] | [100, 94] |
p02934 | u921027074 | 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()))\na=[1/A for i in A]\nx=sum(a)\nprint(float(1/x))', 'N=int(input())\nA=list(map(int,input().split()))\na=[1/float(num) for num in A]\nx=sum(a)\nprint(1/float(x))\n'] | ['Runtime Error', 'Accepted'] | ['s243348894', 's265306155'] | [2940.0, 2940.0] | [19.0, 17.0] | [93, 105] |
p02934 | u922769680 | 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=list(map(float,input().split()))\nlist_b=[1/i for i in list_a]\n#print(list_b)\nprint(sum(list_b))', 'n=int(input())\nlist_a=list(map(float,input().split()))\nlist_b=[1/i for i in list_a]\n#print(list_b)\nprint(1/sum(list_b))'] | ['Wrong Answer', 'Accepted'] | ['s395370554', 's917069729'] | [2940.0, 2940.0] | [17.0, 17.0] | [117, 119] |
p02934 | u923659712 | 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()\nan = list(map(int, input().split()))\ni=0\nk=0\n \n \n\n \nwhile n>i:\n k+=1/an[i]\n i+=1\n \nprint(1/k)', 'n=int(input())\n\ni=1\nk=0\n\nwhile n>=i:\n f[i]=int(input())\n i+=1\n \nwhile n>=i:\n k+=1/f[i]\n i+1\n \nprint(1/k)', 'n=int(input())\ns=[int(input()) for i in range(n)]\ni=0\nk=0\n \n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s265724265', 's365403541', 's397238036', 's611297229', 's163794963'] | [2940.0, 2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 2104.0, 18.0, 17.0] | [109, 110, 108, 103, 114] |
p02934 | u931297616 | 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())\nnum2=input().split(" ")\nnum3=list(map(int,num2))\nsum=0\nfori in range(N):\n \tsum+=1/num[i]\nprint(sum)', 'N=int(input())\nnum2=input().split(" ")\nnum3=list(map(int,num2))\nsum=0\nfor i in range(N):\n \tsum+=1/num3[i]\nprint(1/sum)'] | ['Runtime Error', 'Accepted'] | ['s435788063', 's373397141'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 119] |
p02934 | u932868243 | 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())\nlista=list(map(int,input().split()))\ncount=0\nfor a in lista:\n count+=1/a\nprint(i/count)', 'n=int(input())\nl=list(map(int,input().split()))\nsum=0\nfor ll in list:\n sum+=1/ll\nprint(1/sum)', 'n=int(input())\nl=list(map(int,input().split()))\nsum=0\nfor ll in l:\n sum+=1/ll\nprint(1/sum)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s036800465', 's452051918', 's430692276'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [103, 94, 91] |
p02934 | u934052933 | 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 math\n\ndef main():\n n = int(input())\n a_l = list(map(int, input().split()))\n print( math.fsum(a_l)/ sum(a_l))\n\nif __name__ == "__main__":\n main()', 'import math\n\ndef main():\n n = int(input())\n a_l = list(map(int, input().split()))\n frac = 0\n for a in a_l:\n frac += (... | ['Wrong Answer', 'Accepted'] | ['s468124850', 's066860705'] | [3060.0, 3060.0] | [17.0, 17.0] | [163, 198] |
p02934 | u934868410 | 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\nans = 0\nfor i in a:\n ans += 1/a\n \nprint(1/ans)', 'n = int(input())\na = list(map(int, input().split()))\n\nans = 0\nfor i in a:\n ans += 1/i\n \nprint(1/ans)'] | ['Runtime Error', 'Accepted'] | ['s351390330', 's086387934'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 102] |
p02934 | u939585142 | 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\n\nN = int(input())\nA = list(map(int,input().split()))\na = []\nb = []\n\nfor i in A:\n a.append(Fraction(1, i))\n\nprint(int(1 / sum(a)))\n', 'from fractions import Fraction\n\nN = int(input())\nA = list(map(int,input().split()))\na = []\nb = []\n\nfor i in A:\n a.append(Fraction(1,... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s077713631', 's294287543', 's536624448'] | [5048.0, 5048.0, 5048.0] | [38.0, 39.0, 38.0] | [162, 157, 178] |
p02934 | u939903905 | 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\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n vector<double> A(N);\n for(int i=0; i<N; i++)\n cin >> A[i];\n\n double sum_recip = 0.0;\n\n for(int i=0; i<N; i++)\n sum_recip += 1 / A[i];\n\n cout << 1 / sum_recip << endl;\n}\n', 'N = int(input())\ninput_str = input()\narray_strs = input_... | ['Runtime Error', 'Accepted'] | ['s841586181', 's840851043'] | [2940.0, 2940.0] | [18.0, 17.0] | [274, 170] |
p02934 | u946424121 | 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 =[]\ninv =[]\ns = 0\nfor i in range(n):\n l.append(int(input()))\n\nfor i in l:\n i_inv = 1/i\n s += i_inv\nprint(1/s)', 'n = int(input())\nl =[]\ninv =[]\ns = 0\nfor i in range(n):\n l.append(int(input()))\n\nfor i in l:\n i_inv = 1/i\n inv.append(i_inv)\n\nfor i in inv:\n s ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s275544829', 's942877988', 's197825769'] | [3060.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [137, 173, 112] |
p02934 | u947263228 | 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())\nstr = input()\nls = [int(u) for u in str.split()]\nnum = 1\ndenom = 0\nprint(ls)\nfor value in ls:\n denom += (1/value)\nprint(1/denom)', 'n = int(input())\nstr = input()\nls = [int(u) for u in str.split()]\nnum = 1\ndenom = 0\n#print(ls)\nfor value in ls:\n denom += (1/value)\nprint(1/denom)'... | ['Wrong Answer', 'Accepted'] | ['s566485026', 's129332192'] | [3060.0, 3060.0] | [17.0, 18.0] | [148, 149] |
p02934 | u954488273 | 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()))\ns=1\n\nfor i in range(n):\n s *= a[i]\n\nb=s/a', 'import numpy as np\n\nn=int(input())\na=list(map(float,input().split()))\ns=1\n\nfor i in range(n):\n s *= a[i]\n\nb=[s/a[j] for j in range(n)]\n\nprint(s/np.sum(b))'] | ['Runtime Error', 'Accepted'] | ['s527618331', 's060780812'] | [2940.0, 21072.0] | [17.0, 299.0] | [92, 155] |
p02934 | u958581328 | 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 \n \ndef main():\n\tn = int(input())\n nums = np.array([int(input()) for i in range(n)])\n n_total = nums.prod()\n n_denominator = sum([n_total/num for num in nums])\n ans = n_total / n_denominator\n print(ans)\n \n \nif __name__ == '__main__':\n main()", "import numpy as np\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s110800616', 's207461842', 's257833076', 's924097334', 's577691567'] | [2940.0, 2940.0, 2940.0, 12920.0, 2940.0] | [17.0, 18.0, 17.0, 158.0, 17.0] | [280, 278, 175, 283, 173] |
p02934 | u968638278 | 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 = 0\nfor i in range(N):\n A = A + 1 / input()\nreturn A\n\nprint(1 / A)\n', 'N = int(input())\nA = list(map(int, input().split()))\nph = []\np = 1\nfor i in range(N):\n p *= A[i]\nfor i in range(N):\n ph.append(p / A[i])\nph_sum = sum(ph)\nprint(p / ph_sum)\n'] | ['Runtime Error', 'Accepted'] | ['s907286265', 's369582281'] | [2940.0, 3060.0] | [17.0, 17.0] | [89, 179] |
p02934 | u969848070 | 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 =[]\nfor i in range(n):\n b.append(1/a[n])\nc = sum(b)\nprint(1/c)', 'n = int(input())\na = list(map(int, input().split()))\nb =[]\nfor i in range(n):\n b.append(1/a[i])\nc = sum(b)\nprint(1/c)'] | ['Runtime Error', 'Accepted'] | ['s233391373', 's649327179'] | [2940.0, 2940.0] | [17.0, 18.0] | [118, 118] |
p02934 | u970738863 | 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\n\nfor i in A:\n a += 1/i\n\nprint(1/a)\n', 'N = int(input())\nA = list(map(int,input().split()))\nans = 0\n\nfor i in A:\n ans += 1/i\n\nprint(1/ans)\n'] | ['Runtime Error', 'Accepted'] | ['s898142184', 's602482962'] | [2940.0, 2940.0] | [17.0, 18.0] | [98, 102] |
p02934 | u971161994 | 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\nnum = [int(input()) for i in range(N)]\n\nfor i in num:\n\n sum = 1/i\n\nanswer = 1 / sum\n\nprint(int(answer))\n', 'N = int(input())\n\nnum = [int(i) for i in input().split()]\nsum = 0\nfor i in num:\n\n sum += 1/i\n\nanswer = 1 / sum\n\nprint(int(answer))\n', 'N = int(input())\n\nnum = map... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s452121690', 's460978867', 's898006886'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [125, 134, 120] |
p02934 | u974665134 | 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())\nprint('{:.16g}'.format(1/ sum(x for x in A)))", "N = int(input())\nA = map(int, input().split())\nprint('{0:.16g}'.format(1/ sum(x for x in A)))", "N = int(input())\nA = map(int, input().split())\nprint('{:.16g}'.format(1 / sum(1 / x for x in A)))"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s240467586', 's410491451', 's130219201'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [92, 93, 97] |
p02934 | u979038517 | 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\nd = []\nfor _ in range(N):\n d.append(int(input()))\n\nsm = 0\nfor i in range(N):\n sm += 1/d\n\nprint(1/sm)', '_ = int(input())\nprint(1/sum([1/int(x) for x in input().split()]))'] | ['Runtime Error', 'Accepted'] | ['s926568092', 's353553917'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 66] |
p02934 | u987164499 | 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 sys import stdin\nn = int(stdin.readline().rsprit())\nli = list(map(int,stdin.readline().rstrip().split()))\ns = 0\nfor i in range(n):\n s += 1/li[i]\nprint(1/s)', 'from sys import stdin\nn = int(stdin.readline().rstrip())\nli = list(map(int,stdin.readline().rstrip().split()))\ns = 0\nfor i in range(n):\n ... | ['Runtime Error', 'Accepted'] | ['s364658138', 's670590756'] | [2940.0, 2940.0] | [17.0, 17.0] | [163, 163] |
p02934 | u987637902 | 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()))\nA\nx = 0\nfor i in A:\n x += 1 / i\nprint(x)\ny = 1/x\nprint(y)\n', '# ABC138\n# B Resistors in Parallel\nimport math\nn = int(input())\nA = list(map(int, input().split()))\ny = 0\nfor i in A:\n y += 1000/i\nx = 1/y*1000\nprint(x)\n'] | ['Wrong Answer', 'Accepted'] | ['s875819733', 's468617357'] | [8988.0, 9112.0] | [23.0, 26.0] | [114, 156] |
p02934 | u991269553 | 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 = 1\nsum = sum(a)\nfor i in range(n):\n b *= a[i]', 'n = int(input())\na = list(map(int,input().split()))\nb = 0\nfor i in range(n):\n b += 1/a[i]\nprint(float(1/b))\n'] | ['Wrong Answer', 'Accepted'] | ['s008524713', 's734620465'] | [2940.0, 3064.0] | [17.0, 17.0] | [103, 111] |
p02934 | u992648619 | 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\nsum = 0.0\nfor x in n:\n sum = sum + 1/x\n\nprint(1/sum)', 'n = int(input())\na = map(int, input().split())\n\nsum = 0.0\nfor x in a:\n sum = sum + 1 / x\n\nprint(1/sum)'] | ['Runtime Error', 'Accepted'] | ['s067678701', 's406082504'] | [2940.0, 2940.0] | [18.0, 17.0] | [99, 103] |
p02934 | u995760761 | 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\ndef main():\n inputs = [input() for _ in range(2)]\n numbers = np.array([float(i) for i in inputs[1].split('\\s')])\n numbers = np.reciprocal(numbers)\n answer = 1 / sum(numbers)\n print(answer)\n\nif __name__ == '__main__':\n main()", "import numpy as np\n\ndef main():\n in... | ['Runtime Error', 'Accepted'] | ['s970689878', 's673778537'] | [12528.0, 12504.0] | [153.0, 154.0] | [262, 261] |
p02935 | u001609307 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['# coding: utf-8\n# Your code here!\n# ABC138C\n \nn = int(input())\nv = list(map(int, input().split()))\nprint(v)\nwhile len(v) > 1:\n a = min(v)\n v.remove(a)\n print(a,v)\n b = min(v)\n v.remove(b)\n print(b,v)\n c = (a + b) / 2\n v.append(c)\n \nprint(v.pop())', '# coding: utf-8\n# Your ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s440790239', 's451525884', 's941723331', 's985072403', 's116533519'] | [3064.0, 3064.0, 3064.0, 3064.0, 3060.0] | [18.0, 18.0, 18.0, 18.0, 18.0] | [273, 272, 254, 313, 247] |
p02935 | u003501233 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n=int(input())\nv=list(map(int,input().split()))\nsv=sorted(v)\n\nx = (sv[0]+sv[1])/2\ny = (x + sv[n-1])/2\n\nprint(y)', 'n=int(input())\nv=sorted(list(map(int,input().split())))\n\nans=v[0]\n\nfor i in range(n-1):\n ans = (ans + v[i]) / 2\nprint(ans) ', 'n=int(input())\nv=sorted(list(map(int,input().split())))\n\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s171107842', 's453740628', 's651218480'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [111, 125, 125] |
p02935 | u007991836 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['N = int(input())\nv = list(map(int,input().split()))\n\nv.sorted(reverse=True)\nx = 1\nanswer = 0\nfor i in range(N-1):\n x *= 2\n answer += (v[i]/x)\n\nanswer += v[N-1]/x\nprint(answer)\n', 'N = int(input())\nv = list(map(int,input().split()))\n\nv.sorted(reverse=True)\nx = 1\nanswer = 0\nfor i in range(n-1):\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s696170207', 's900337276', 's905945738', 's858008051'] | [3060.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [182, 182, 182, 180] |
p02935 | u021217230 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n=int(input())\nl=map(int,input().split())\nsort(l)\ns=l[0]\nfor i in range(1,n):\n s+=l[i]\n s/=2\nprint(s)', 'n=int(input())\nl=[int(i) for i in input().split()]\ns=0\nfor i in range(n-1):\n\tf=l[i]\n for j in range(n):\n if i!=j:\n f+=l[j]\n f=f/2\n if s<f:\n s=f\n \n \n\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s063216077', 's297472745', 's673032899', 's728539239', 's757683605', 's743350242'] | [2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [103, 197, 105, 115, 104, 107] |
p02935 | u023141436 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['from collections import deque\nn = int(input())\nv = [int(i) for i in input().split()]\nv.sort()\nvi = deque(v)\nwhile len(vi) != 1:\n\tv0 = vi.popleft()\n\tv1 = vi.popleft()\n\tvadd = (v0+v1)/2\n\tvi.appendleft(vadd)\nprint(int(vi[0]))\n', 'from collections import deque\nn = int(input())\nv = [int(i) for i in input(... | ['Wrong Answer', 'Accepted'] | ['s075433372', 's989558179'] | [3444.0, 3316.0] | [21.0, 21.0] | [223, 217] |
p02935 | u023229441 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n=int(input())\nA=sorted(map(int,input().split()))\nans=0\nfor i in range(n-1):\n ans=(ans+A[i])/2\nprint(ans)', '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)\n'] | ['Wrong Answer', 'Accepted'] | ['s307613795', 's031088632'] | [2940.0, 2940.0] | [17.0, 17.0] | [106, 110] |
p02935 | u024245528 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['N = int(input())\nv = list(map(int,input().split()))\n\nfor i in range(N):\n if len(v) == 1:\n pass\n else:\n if min(v) in v:\n aaa =min(v)\n v.remove(min(v))\n if min(v) in v:\n bbb =min(v)\n v.remove(min(v))\n ccc =(aaa + bbb)/2\n ... | ['Wrong Answer', 'Accepted'] | ['s068783952', 's044027851'] | [3060.0, 3060.0] | [18.0, 18.0] | [336, 337] |
p02935 | u030314915 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['import heapq\nn = int(input())\nv = list(map(int,input().split()))\nheapq.heapify(v)\nprint(v)\nfor _ in range(n-1):\n x = heapq.heappop(v)\n y = heapq.heappop(v)\n heapq.heappush(v,(x+y)/2)\nprint(v[0])', 'import heapq\nn = int(input())\nv = list(map(int,input().split()))\nheapq.heapify(v)\nfor _ in range(n... | ['Wrong Answer', 'Accepted'] | ['s278268688', 's277974612'] | [3064.0, 3060.0] | [18.0, 18.0] | [203, 194] |
p02935 | u033094865 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n=int(input())\nd=map(int,input().split())\nv=list(d)\n\nv.sort()\n\ns=v[0]\nfor i in range(1,n):\n s=(s+v[i])//2\n\nprint(s)', 'n=int(input())\nd=map(int,input().split())\nv=list(d)\n\nv.sort()\n\ns=v[0]\nfor i in range(1,n):\n s=(s+v[i])//2\n\nprint(s)', 'n=int(input())\nd=map(int,input().split())\nv=list(d)\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s180352346', 's603901179', 's606956961'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [118, 118, 117] |
p02935 | u036412778 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['A=sorted(list(map(int,input().split())))\n\nr = (A[0]+A[1])/2\nfor i in range(2,len(A)):\n r=(r+A[i])/2\n \nprint(r)', 'N=int(input()) #not needed for Python, but needed for competition\nA=sorted(list(map(int,input().split())))\n\nr = (A[0]+A[1])/2\nfor i in range(2,len(A)):\n r=(r+A[i])/2\n \nprint(r)\n'... | ['Runtime Error', 'Accepted'] | ['s052740878', 's175348199'] | [3064.0, 2940.0] | [17.0, 18.0] | [116, 183] |
p02935 | u038408819 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n = int(input())\nv = list(map(int, input().split())\n \n\n\nwhile len(v) > 1:\n v =\u3000sorted(v)\n v1 = v.pop(0)\n v2 = v.pop(0)\n v.append((v1+v2)/2)\nprint(v[0])\n', 'n = int(input())\nv = list(map(int, input().split())\n \n\n\nwhile len(v_sort) > 1:\n v_sort =\u3000sorted(v)\n v1 = v... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s187148609', 's493022186', 's581623747'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [170, 199, 154] |
p02935 | u042385277 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['N = int(input())\nv = list(map(int, input().split()))\nv.sort()\nnew = v[0]\nfor i in range(1,N-1):\n new = (new + v[i])/2\nprint(new)', 'N = int(input())\nv = list(map(int, input().split()))\nv_sort = sorted(v)\nmeal = v_sort[0] + v_sort[1]\nfor i in range(2, N):\n meal = (meal + v_sort[i])/2\nprint(meal)', 'N... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s054941666', 's859592464', 's928758328', 's049135872'] | [3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0, 17.0] | [131, 166, 133, 170] |
p02935 | u045408189 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['N = int(input())\nv = sorted(list(map(int,input().split())))\nc = v[0]\nfor i in range(1,len(v)+1):\n c = (v[i]+c)/2\nprint(int(c))', 'N = int(input())\nv = sorted(list(map(int,input().split())))\nc = v[0]\nfor i in range(1,len(v)):\n c = (v[i]+c)/2\nprint(int(c))\n', 'N = int(input())\nv = sorted(list(map(int,inpu... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s466008251', 's657902690', 's394417143'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [127, 126, 121] |
p02935 | u045953894 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n = int(input())\nv = sorted(list(map(int,input().split())))\ns = [0]*n\ns[0] = v[0]\n\nfor i in range(n-1):\n s[i+1] = (v[i+1]+s[i])/2\nprint(s)\n', 'def cumsum(n,A):\n s = [0]*(n+1)\n s[0] = A[0]\n for i in range(len(A)):\n s[i+1] = (s[i] + A[i])/2\n return s\n\nn = int(input())\nv = sorted(li... | ['Wrong Answer', 'Accepted'] | ['s755732033', 's174376742'] | [9172.0, 9084.0] | [29.0, 30.0] | [142, 240] |
p02935 | u046187684 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['N = int(input())\nV = [float(v) for v in input().split()]\nV.sort(revese=True)\nfor i in range(N):\n if len(V) == 1:\n print(V[0])\n exit()\n v1 = V.pop()\n v2 = V.pop()\n V.append((v1 + v2) / 2)\n', "def solve(string):\n n, *v = map(int, string.split())\n v = sorted(v, reverse=True)\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s155796698', 's824355619', 's728704636'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [213, 235, 215] |
p02935 | u046592970 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['ans = (ans + v[i])/2', 'n = int(input())\nv = sorted(list(map(int,input().split())))\nans = (v[0] + v[1])/2\n\nfor i in range(2,n):\n ans = (ans + v[i])/2\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s946095929', 's324253447'] | [2940.0, 3316.0] | [17.0, 20.0] | [20, 139] |
p02935 | u054471580 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['import numpy as np\n\ndef set_list(es):\n return len(list(set(es))) == 1\n\nn = int(input())\na = [int(i) for i in input().split()]\n\nif(len(a)==2):\n print((a[0]+a[1])/2) \nelif(len(a)!=2 and set_list(a)):\n print(a[0])\nelse:\n for i in range(1,n):\n idx = np.argmin(a)\n num1 = a.pop(idx)\n idx... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s463842906', 's985025494', 's715690024'] | [3064.0, 18892.0, 12504.0] | [17.0, 284.0, 158.0] | [380, 373, 407] |
p02935 | u057415180 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n = int(input())\nv = list(map(int, input().split()))\n\nvs = sorted(v)\nans = vs[0]\nfor i in range(1,n):\n ans = (ans + vs[i]) // 2\n\nprint(ans)', 'n = int(input())\nv = list(map(int, input().split()))\n\nvs = sorted(v)\nans = vs[0]\nfor i in range(1,n):\n ans = (ans + vs[i]) / 2\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s690848021', 's226985191'] | [2940.0, 2940.0] | [18.0, 17.0] | [142, 142] |
p02935 | u060569392 | 2,000 | 1,048,576 | You have a pot and N ingredients. Each ingredient has a real number parameter called _value_ , and the value of the i-th ingredient (1 \leq i \leq N) is v_i. When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 wh... | ['n=int(input())\nv=list(map(int,input().split()))\nlist.sort(v)\n\nresult=0\nfor i in range(1,n):\n if i==1:\n result+=(v[i-1]+v[i]/2)\n else:\n result=(result+v[i])/2\nprint(result)', 'n=int(input())\nv=list(map(int,input().split()))\nlist.sort(v)\n\nresult=0\nfor i in range(1,n):\n if i==1:\n ... | ['Wrong Answer', 'Accepted'] | ['s412346001', 's488119647'] | [3060.0, 3060.0] | [17.0, 17.0] | [191, 191] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.