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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03059 | u857148155 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t=[int(s)for s in input().split()]\nprint(b*t//a)', 'a,b,t=[int(s)for s in input().split()]\nprint(b*(t//a))'] | ['Wrong Answer', 'Accepted'] | ['s759324361', 's067021316'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 54] |
p03059 | u857673087 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A,B,T = map(int(input().split()))\n\nprint((T//A)*B)', 'A,B,T = map(int,input().split())\n\nprint((T//A)*B)\n'] | ['Runtime Error', 'Accepted'] | ['s213111576', 's593877307'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 50] |
p03059 | u858670323 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\nans = 0\nT = A\nwhile(T<=t):\n ans += B\n T += A\nprint(ans)', 'a,b,t = map(int,input().split())\nans = 0\nT = a\nwhile(T<=t):\n ans += b\n T += a\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s209326456', 's463982489'] | [9104.0, 9052.0] | [24.0, 27.0] | [90, 91] |
p03059 | u861466636 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A, B, T = map(int, input().split())\nprint(B * ((T + 0.5)//A))', 'A, B, T = map(int, input().split())\nprint(int(B * ((T + 0.5)//A)))'] | ['Wrong Answer', 'Accepted'] | ['s114945008', 's079153000'] | [2940.0, 2940.0] | [18.0, 23.0] | [61, 66] |
p03059 | u861566690 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A,B,T=map(int,input().split())\n\nnumber = ((T+0.5)//A)*B\n\nprint(number)', 'A,B,T=map(int,input().split())\n\nnumber = round(((T+0.5)//A)*B)\n\nprint(number)'] | ['Wrong Answer', 'Accepted'] | ['s314193606', 's035654818'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 77] |
p03059 | u864069774 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import fractions\nfrom functools import reduce\n\ndef gcd_list(numbers):\n return reduce(fractions.gcd, numbers)\n\nn = int(input())\na_list = list(map(int,input().split()))\n\n\nans = 0\nfor i in range(n):\n init = a_list[:]\n init.pop(i)\n gcd = gcd_list(init)\n if ans < gcd:\n ans = gcd\n\npr... | ['Runtime Error', 'Accepted'] | ['s533583227', 's459579182'] | [5048.0, 2940.0] | [36.0, 17.0] | [308, 107] |
p03059 | u867320886 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['n=int(input())\nv=list(map(int,input().split()))\nc=list(map(int,input().split()))\ns = 0\nfor i in range(n):\n s += max(0,v[i]-c[i])\nprint(s)', 'a,b,t=map(int,input().split())\nprint((t//a)*b)'] | ['Runtime Error', 'Accepted'] | ['s323576674', 's219364333'] | [2940.0, 2940.0] | [17.0, 17.0] | [140, 46] |
p03059 | u867826040 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\nprint(((t+0.5)//a)*b)', 'a,b,t = map(int,input().split())\nprint(int(((t+0.5)//a)*b))'] | ['Wrong Answer', 'Accepted'] | ['s203939486', 's426449865'] | [2940.0, 2940.0] | [17.0, 18.0] | [54, 59] |
p03059 | u870062840 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import math\n\nA,B,T=map(int,input().split())\n\nif isinstance(A,int) and isinstance(B,int) and isinstance(T,int) :\n num_biscuit=0\n\n if 1<=A<=20 and 1<=B<=20 and A<=T<=20:\n \n for i in range(math.floor(T/A)):\n num_biscuit=num_biscuit+B\n print(num_biscuit)\n else :\n ... | ['Wrong Answer', 'Accepted'] | ['s219262450', 's464600617'] | [3060.0, 3060.0] | [17.0, 17.0] | [442, 501] |
p03059 | u870178975 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['n=input()\nv=list(map(int, input().split()))\nc=list(map(int, input().split()))\nfor i in range(n)\nt[i]=v[i]-c[i]\na=0\nfor i in range(n)\nif t[i]>0 :\na+=t[i]\nprint(a)', 'n=input()\nv=list(map(int, input().split()))\nc=list(map(int, input().split()))\nt=[i-j,if i-j>0 else 0 for i,j in zip(v,c)]\nprint(sum(t))\n', ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s297160235', 's599957537', 's902134889', 's243057840'] | [2940.0, 2940.0, 2940.0, 3316.0] | [17.0, 17.0, 17.0, 21.0] | [161, 136, 161, 49] |
p03059 | u870793476 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['n,m=[int(i) for i in input().split()]\nid=[[int(i) for i in input().split()]+[j] for j in range(m)]\n\nprint(id)\n\npre_num=[0]*(n+1)\nans=[""]*m\n\nid.sort(key=lambda x:x[1])\n\nfor p,y,i in id:\n pre_num[p]+=1\n ans[i]=str(p).zfill(6)+str(pre_num[p]).zfill(6)\n \nprint("\\n".join(ans))\n', 'a, b, t = map(i... | ['Runtime Error', 'Accepted'] | ['s237522838', 's207319021'] | [3064.0, 3064.0] | [17.0, 17.0] | [283, 52] |
p03059 | u871596687 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\n\nprint((t+0.5)//a*b)', 'a,b,t = map(int,input().split())\n\nprint(int((t+0.5))//a*b)'] | ['Wrong Answer', 'Accepted'] | ['s545425569', 's759518215'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 58] |
p03059 | u871602253 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = map(int, input().split())\nx = 0\n\nwhile a <= t + 0.5:\n\tx = x + b\n\ta = a + a', 'A, B, T = list(map(int, input().split()))\n\nans = T//A * B\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s839124475', 's407453824'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 68] |
p03059 | u872887731 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['N = int(input())\nV = list(map(int,input().split()))\nC = list(map(int,input().split()))\n\ncount = 0\nfor i in range(N):\n if V[i] > C[i]:\n count += V[i] - C[i]\n\nprint (count)', 'A,B,T = list(map(int,input().split()))\n\nN = T // A\nprint(N*B)'] | ['Runtime Error', 'Accepted'] | ['s482177087', 's259285831'] | [3060.0, 2940.0] | [18.0, 18.0] | [180, 61] |
p03059 | u882359130 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A, B, T = input().split()\nA = int(A)\nB = int(B)\nT = int(T)\nn = (T+0.5) // A\nN = n * B\nN //= 1\nprint(N)', 'A, B, T = input().split()\nA = int(A)\nB = int(B)\nT = int(T)\nn = (T+0.5) // A\nN = n * B\nprint(N)', 'A, B, T = input().split()\nA = int(A)\nB = int(B)\nT = int(T)\nn = T // A\nN = n * B\nprint(N)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s676968831', 's972032455', 's930150018'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [102, 94, 88] |
p03059 | u882370611 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = map(int, input().split())\ntime = 0\n\nwhile time + a < t + 1/2:\n time += a\n\ntime += a\nprint(b*time)', 'a, b, t = map(int, input().split())\ntime = 0\n\nwhile time + a < t + 1/2:\n time += a\n\nprint(b*time)\n', 'a, b, t = map(int, input().split())\n\nprint((t // a) * b)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s001864861', 's630128644', 's518077546'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [108, 99, 57] |
p03059 | u885523920 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t=map(int,input().split())\nprint(((0.5+t)//a)*b)', 'a,b,t=map(int,input().split())\nprint((0.5+t)//a*b)', 'a,b,t=map(int,input().split())\nprint((t//a)*b)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s037806053', 's568575008', 's557206796'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [52, 50, 46] |
p03059 | u887207211 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['#include "bits/stdc++.h"\n\nusing namespace std;\n\nint main(){\n int A, B, T;\n cin >> A >> B >> T;\n\n cout << T/A*B << endl;\n}', 'A, B, T = map(int,input().split())\nT += 0.5\nprint(int(T//A*B))'] | ['Runtime Error', 'Accepted'] | ['s685365135', 's730319825'] | [2940.0, 2940.0] | [17.0, 17.0] | [124, 62] |
p03059 | u889344512 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\nprint((t+0.5)//a*b)', 'a,b,t = map(int,input().split())\nprint(int((t+0.5)//a*b))'] | ['Wrong Answer', 'Accepted'] | ['s892058450', 's666800096'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 57] |
p03059 | u892687772 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import math\na,b,t=map(float,input().split())\nc = math.floor(t/a)\nprint(c*b)', 'import math\na,b,t=map(float,input().split())\nc = round(math.floor(t/a))\nprint(c*round(b))'] | ['Wrong Answer', 'Accepted'] | ['s313731284', 's601463608'] | [2940.0, 2940.0] | [18.0, 17.0] | [75, 89] |
p03059 | u892796322 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a = list(map(int, input().split())\nprint(a[1]//a[0]*(a[2]+0.5))', 'a = list(map(int, input().split()))\nprint(a[2]//a[0] * a[1])'] | ['Runtime Error', 'Accepted'] | ['s445981786', 's734973266'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 60] |
p03059 | u895333128 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['n = input().split(" ")\n \na = int(n[0])\nb = int(n[1])\nt = int(n[2])\n \nw = (t / a)\nprint(w * b)', 'n = input().split(" ")\n\na = int(n[0])\nb = int(n[1])\nt = int(n[2])\n\nw = (t / a)\npritn(w * b)', 'n = input().split(" ")\n \na = int(n[0])\nb = int(n[1])\nt = int(n[2])\n \nw = int(t / a)\nprint(w * b)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s272856306', 's724297548', 's605584595'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [93, 91, 96] |
p03059 | u902577051 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['# -*- coding: utf-8 -*-\nimport fractions\n\nN = int(input().rstrip())\nAs = list(map(int, input().rstrip().split()))\n\n\ndef gcd_list(numbers):\n res = math.gcd(numbers[0], numbers[1])\n if len(numbers) > 2:\n for idx in range(2, len(numbers)):\n res = fractions.gcd(res, numbers[idx])\n r... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s217959355', 's548286140', 's323581858'] | [5048.0, 5048.0, 21268.0] | [36.0, 35.0, 294.0] | [510, 515, 127] |
p03059 | u903179665 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['n=int(input())\nV=list(map(int, input().split()))\nC=list(map(int, input().split()))\n\nsum=0\nfor i in range(n):\n if V[i]>C[i]:\n sum+=V[i]-C[i]\nprint(sum) ', 'a,b,t=list(map(int, input().split()))\nprint((t//a)*b)'] | ['Runtime Error', 'Accepted'] | ['s076012861', 's569066990'] | [3060.0, 2940.0] | [17.0, 17.0] | [160, 53] |
p03059 | u905715926 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,c = map(int,input().split())\nprint(c//b*a)', 'a,b,c = map(int,input().split())\nprint(c//a*b)'] | ['Wrong Answer', 'Accepted'] | ['s836387675', 's912658098'] | [2940.0, 2940.0] | [17.0, 17.0] | [46, 46] |
p03059 | u906195369 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = map(int, input().split())\nprint((t+0.5)//a * b)', 'a, b, t = map(int, input().split())\nprint(((t+0.5)//a) * b)\n', 'a, b, t = map(int, input().split())\nprint(t//a * b)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s569815104', 's898966498', 's070866370'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [57, 60, 52] |
p03059 | u910469029 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['def biscuit_generator():\n number = [int(x) for x in input().split()]\n A = number[0]\n B = number[1]\n T = number[2]\n return int(((T + 0.5) // A) * B)\n\nbiscuit_generator()', 'def biscuit_generator():\n number = [int(x) for x in input().split()]\n A = number[0]\n B = number[1]\n T = numb... | ['Wrong Answer', 'Accepted'] | ['s995882840', 's528620607'] | [2940.0, 2940.0] | [17.0, 17.0] | [183, 183] |
p03059 | u914620181 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['N=int(input())\nA=list(map(int,input().split()))\n\nimport fraction\nfrom functools import reduce\nfrom copy import copy\n\ndef gcd(*numbers):\n return reduce(fraction.gcd, numbers)\n\ngcds=[]\nfor i in range(N):\n A_=copy(A)\n A_=pop(i)\n gcds.append(gcd(*A_))\n\nprint(max(gcds))\n', 'N=int(input())\nA=l... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s068437738', 's332063765', 's362791680', 's985672794', 's502811320'] | [3060.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [278, 280, 58, 57, 45] |
p03059 | u914671452 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['x,y,z= input().split()\n\nA =( z + 0.5) / x\n\nprint( A * y)', '#coding:utf-8\na,b,t = input().split()\nx = t // a\nprint(b*x)\n', 'X = list(int,input().split())\n\nY =( X[3] + 0.5) / X[1]\n\nprint( Y * X[2])', '#coding:utf-8\na,b,t =map(int,input().split())\nx = t // a\nprint(b*x)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s512292483', 's533975600', 's785389851', 's707549812'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [56, 60, 72, 67] |
p03059 | u915355756 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['\n\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\n\n\nint main(){\n //input \n int A,B,T;\n cin >> A >> B >> T;\n int ans;\n ans = (T / A)*B;\n cout << ans << endl;\n \n\n return 0;\n}', '#[A,B,T] = [20,20,19]\n[A,B,T] = list(map(int,input().split()))\np... | ['Runtime Error', 'Accepted'] | ['s232311860', 's389984831'] | [2940.0, 2940.0] | [17.0, 17.0] | [265, 81] |
p03059 | u916806287 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['from fractions import gcd\n\nn = int(input())\na = list(map(int, input().split()))\n\nrs, ls = [0], [0]\nfor i in range(n-1):\n rs.append(gcd(rs[i], a[i]))\n ls.append(gcd(ls[i], a[-i-1]))\n\nprint(max(gcd(r, l) for r, l in zip(rs, ls[::-1])))', 'a, b, t = map(int, input().split())\nprint(int(((t + 0.5) // a) * b))... | ['Runtime Error', 'Accepted'] | ['s440458449', 's357604082'] | [5048.0, 2940.0] | [35.0, 18.0] | [235, 68] |
p03059 | u917558625 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['s = list(map(int, input().split()))\nif(0<=s[0]=<20 and 0<=s[1]=<20 and 0<=s[2]=<20)\n\tz=round((s[2]+0.5)/s[0])\n\tw=s[1]*z\n\tprint(w)\n \nelse:\n print("error")', 's = list(map(int, input().split()))\nz=(s[2]+0.5)//s[0]\nw=s[1]*z\nprint(z)', 's = list(map(int, input().split()))\nz=s[2]+0.5\nq=z//s[0]\nw=s[1]*q... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s436516035', 's509342349', 's536992939', 's742941734', 's759797791', 's878032626', 's883313579', 's084584855'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [157, 72, 74, 73, 73, 69, 77, 85] |
p03059 | u918845030 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['def solve(a, b, t):\n result = int(t/a) * b\n return result\n\ndef input_from_console():\n a, b, t = map(int, input().split())\n\n return a, b, t\n\n\ndef main():\n a, b, t = input_from_console()\n print(solve(a, b, t))\n', 'def solve(a, b, t):\n result = int(t / a) * b\n return result\n\ndef ... | ['Wrong Answer', 'Accepted'] | ['s477431023', 's832520473'] | [2940.0, 3060.0] | [18.0, 18.0] | [226, 265] |
p03059 | u918935103 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['s = input()\nd = s.split("/")\nm = int(d[1])\nif m > 4:\n print("TBD")\nelse:\n print("Heisei")', 'a,b,t =(int(x) for x in input().split())\nc = t//a\nprint(c*b)'] | ['Runtime Error', 'Accepted'] | ['s484357349', 's280193145'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 60] |
p03059 | u921199520 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['n = int(input())\na = input().split()\nmi = abs(int(a[0]))\nans = 0 \ncount = 0\nfor i in range(n):\n ans = ans + abs(int(a[i]))\n if mi > abs(int(a[i])):\n mi = abs(int(a[i]))\n if int(a[i])<0:\n count = count + 1\nif count%2 ==0:\n print(ans)\nelse:\n print(ans-2*mi)\n', 'n = int(input... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s216103058', 's467915483', 's786909295', 's160791893'] | [3064.0, 3060.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0, 17.0] | [286, 188, 189, 188] |
p03059 | u923504061 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['def solve():\n A,B,T = int(input().split())\n num = B*int(T/A)\n print(num)\n\n\nsolve()', 'def solve():\n A,B,T = map(int,input().split())\n num = B*int(T/A)\n print(num)\n\n\nsolve()'] | ['Runtime Error', 'Accepted'] | ['s915738347', 's999447275'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 95] |
p03059 | u924467864 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['abt = list(map(int,input().split()))\n\na = abt[0]\nb = abt[1]\nt = abt[2]\n\nt05 = t + 0.5\ntimes = t05 // a\n\ntotal = b * times\n', 'abt = list(map(int,input().split()))\n\na = abt[0]\nb = abt[1]\nt = abt[2]\n\nt05 = t + 0.5\ntimes = t05 // a\n\ntotal = b * times\n\nprint(str(total))\n', 'abt = list(map(int,input(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s577418054', 's755589822', 's929902504'] | [2940.0, 2940.0, 3188.0] | [17.0, 17.0, 17.0] | [122, 141, 145] |
p03059 | u924594299 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = (int(i) for i in input())\n\ntimes = int(t / a)\n\nnum = times * b\n\nprint(num)\n', 'a, b, t = (int(i) for i in input().split())\n \ntimes = int(t / a)\n \nnum = times * b\n \nprint(num)'] | ['Runtime Error', 'Accepted'] | ['s003873800', 's024806930'] | [2940.0, 2940.0] | [17.0, 18.0] | [85, 95] |
p03059 | u925336653 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['N = int(input())\nV = list(map(int,input().split()))\nC = list(map(int,input().split()))\n\nfor i in range(N):\n if V[i] <= C[i]:\n continue\n Max = Max + V[i] - C[i]\nprint(Max)', 'A,B,T = map(int,input().split())\nprint(T//A*B)'] | ['Runtime Error', 'Accepted'] | ['s773438035', 's619642848'] | [3060.0, 2940.0] | [17.0, 17.0] | [183, 46] |
p03059 | u937119374 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['N = int(input())\nV = [int(n) for n in input().split(" ")]\nC = [int(n) for n in input().split(" ")]\nret = 0\nfor i in range(N):\n if V[i] - C[i] > 0:\n ret += V[i] - C[i]\n\nprint(ret)\n\n', 'input = input()\nsp_input = input.split(" ")\nA = int(sp_input[0])\nB = int(sp_input[1])\nT = int(sp_input[2]) + 0... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s361585415', 's981930499', 's169698435'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [190, 175, 180] |
p03059 | u939236255 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ["def calc_max_total_jewels_value():\n jewels = int(input())\n jewel_value = [int(x) for x in input().split()]\n jewel_cost = [int(x) for x in input().split()]\n \n max_total_jewels_value = 0\n for jewel_no in range(jewels):\n max_total_jewels_value += max([0, jewel_value[jewel_no] - jewel_cost[jewel_no]])\n ... | ['Runtime Error', 'Accepted'] | ['s137749048', 's729028144'] | [3060.0, 2940.0] | [18.0, 18.0] | [411, 391] |
p03059 | u940040979 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ["first = input().split(' ')\nper_time = int(first[0])\nper_make = int(first[1])\ntime = int(first[2]) + 0.5\n\nmade = int(per_make / per_time * time)\n\nprint(made)", "first = input().split(' ')\nper_time = int(first[0])\nper_make = int(first[1])\ntime = int(first[2]) + 0.5\n\nmade = per_make * int(time / per_time)\n\... | ['Wrong Answer', 'Accepted'] | ['s360679749', 's839063400'] | [2940.0, 2940.0] | [17.0, 17.0] | [156, 156] |
p03059 | u940102677 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\nprint(a//t*b)', 'a,b,t = map(int,input().split())\nprint(t//a*b)'] | ['Wrong Answer', 'Accepted'] | ['s808531764', 's737770765'] | [3444.0, 2940.0] | [21.0, 17.0] | [46, 46] |
p03059 | u941458732 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t=list(map(int, list(input().split())))\nreturn int(t/a)*b', 'a,b,t=list(map(int, list(input().split())))\nprint(int(t/a)*b)'] | ['Runtime Error', 'Accepted'] | ['s957229917', 's173465319'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 61] |
p03059 | u948911484 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\nnow = 0\nans = 0\nwhile now < t:\n ans += b\n now += a\nprint(ans)', 'a,b,t = map(int,input().split())\nn = 0\nans = 0\nwhile n+a <= t:\n ans += b\n n += a\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s291751912', 's278799037'] | [2940.0, 2940.0] | [18.0, 17.0] | [96, 93] |
p03059 | u951492009 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A,B,T=map(int,input().split())\nn=int(T/B)\nprint(B*n)\n', 'A,B,T=map(int,input().split())\nn=int(T/A)\nprint(B*n)\n'] | ['Wrong Answer', 'Accepted'] | ['s973064493', 's379270421'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 53] |
p03059 | u951582245 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a = int(input())\nb = int(input())\nt = int(input())\n\nx = (t+0.5)%a\nreturn b*x', 'a, b, t = map(int, input().split())\n\nx =(t+0.5)//a\n\nprint(b*x)', 'a, b, t = map(int, input().split())\n\nx =int((t+0.5)//a)*b\n\nprint(b)\n\n', 'a, b, t = map(int, input().split())\n\nx =int((t+0.5)//a)*b\n\nprint(x)'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s319787673', 's370634857', 's881167852', 's445095810'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [76, 62, 69, 67] |
p03059 | u953379577 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\n\nprint(b*(a//t))', 'a,b,t = map(int,input().split)\n\nprint(b*(a//t))', 'a,b,t = map(int,input().split())\n\nprint(b*(t//a))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s385467952', 's770675271', 's938823639'] | [8960.0, 9088.0, 8964.0] | [26.0, 23.0, 24.0] | [49, 47, 49] |
p03059 | u955125992 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['N = int(input())\nA = list(map(int, input().split()))\n \nL = [0]*(N+2)\nR = [0]*(N+2)\n \nimport fractions\n \nfor i in range(1,N+1):\n L[i] = fractions.gcd(L[i-1],A[i-1])\nfor i in range(0,N)[::-1]:\n R[i] = fractions.gcd(R[i+1],A[i])\n \nM = [fractions.gcd(L[i-1],R[i]) for i in range(1,N+1)]\nprint(max(M))',... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s002137948', 's378246812', 's590027949'] | [3064.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0] | [302, 218, 62] |
p03059 | u958402756 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A,B,T = list(map(int,input().split()))\ncount = int((T+0.5)/A)\nprint(count*A)', 'A,B,T = list(map(int,input().split()))\ncount = int((T+0.5)/A)\nprint(count*B)'] | ['Wrong Answer', 'Accepted'] | ['s309334514', 's056952107'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 76] |
p03059 | u958506960 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = map(int, input().split())\nprint((t+0.5)//a * b)', 'a, b, t = map(int, input().split())\nprint(int((t+0.5)//a * b))'] | ['Wrong Answer', 'Accepted'] | ['s758962778', 's040855186'] | [9160.0, 9184.0] | [28.0, 26.0] | [57, 62] |
p03059 | u959651981 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['n = int(input())\na = list(map(int,input().split()))\nb = list(map(abs,a))\nc = [a for a in A if a < 0]\n\nif len(c) % 2 == 0:\n print(sum(b))\nelse:\n print(sum(b)-min(b)*2)\n', 'a,b,t = map(int,input().split())\nprint(t//a*b)'] | ['Runtime Error', 'Accepted'] | ['s387232993', 's566952534'] | [2940.0, 2940.0] | [18.0, 17.0] | [173, 46] |
p03059 | u960171798 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import functools\nimport fractions\nN = int(input())\nA_list = list(map(int, input().split()))\nans = 0\n\nfor i in range(1,N+1):\n x = A_list[-i]\n del A_list[-i]\n gcd = functools.reduce(fractions.gcd, A_list)\n ans = max(gcd,ans)\n A_list.append(x)\nprint(ans)\n\n', 'A,B,T = map(int, input().split()... | ['Runtime Error', 'Accepted'] | ['s842451591', 's455082745'] | [5116.0, 2940.0] | [36.0, 17.0] | [268, 62] |
p03059 | u960513073 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,c = list(map(int, input().split()))\nprint(a//c * b)', 'a,b,c = list(map(int, input().split()))\nprint(c//a * b)'] | ['Wrong Answer', 'Accepted'] | ['s630334250', 's330796833'] | [2940.0, 2940.0] | [17.0, 17.0] | [55, 55] |
p03059 | u962609087 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['def main():\n a,b,t = map(int,input().split())\n ans = 0\n for i in range(t + 1):\n if i % a == 0:\n ans += b\n print(ans)\nmain()', 'def main():\n a,b,t = map(int,input().split())\n ans = 0\n for i in range(t + 1, 1):\n if i % a == 0:\n ans += b\n print(ans... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s099498219', 's407748590', 's483569117', 's821338913', 's054346127'] | [9160.0, 9112.0, 9056.0, 8900.0, 9024.0] | [26.0, 29.0, 27.0, 23.0, 28.0] | [153, 156, 148, 159, 158] |
p03059 | u962829271 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import math\n\nn = int(input())\na = []\ntmp = input().split()\nfor i in range(n):\n a.append(int(tmp[i]))\n\nif n == 2:\n if a[0] > a[1]:\n print(a[0])\n else:\n print(a[1])\n exit()\n\nrev = []\nrev.append(a[n-1])\nprev_gcd = a[n-1]\nfor i in range(n-2, 0, -1):\n prev_gcd = math.gcd(pre... | ['Runtime Error', 'Accepted'] | ['s526816310', 's310194810'] | [3064.0, 2940.0] | [18.0, 17.0] | [617, 112] |
p03059 | u962942039 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = map(int, input().split())\nprint(((t+0.5)//a)*b)', 'a, b, t = map(int, input().split())\nprint(int(((t+0.5)//a)*b))'] | ['Wrong Answer', 'Accepted'] | ['s039727032', 's839281827'] | [3188.0, 2940.0] | [18.0, 17.0] | [57, 62] |
p03059 | u963915126 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ["S = input().split(' ')\nA = int(S[0])\nB = int(S[1])\nT = int(S[2])\n\ncnt=0\nbcnt=0\n\nfor i in range(1,30):\n cnt+=i\n\n if cnt > T:\n break\n else:\n bcnt+=B\n\nprint(bcnt)\n\n\n\n", "S = input().split(' ')\nA = int(S[0])\nB = int(S[1])\nT = int(S[2])\n\ncnt=0\nbcnt=0\n\nfor i in range(1,30)... | ['Wrong Answer', 'Accepted'] | ['s798940981', 's206593082'] | [2940.0, 3060.0] | [17.0, 24.0] | [186, 186] |
p03059 | u966378542 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['def make_divisors(n):\n\tdivisors = []\n\tfor i in range(1, int(n**0.5)+1):\n\t\tif n % i == 0:\n\t\t\tdivisors.append(i)\n\t\t\tif i != n // i:\n\t\t\t\tdivisors.append(n//i)\n\tdivisors.sort(reverse=True)\n\treturn divisors\n\nn = int(input())\na = list(map(int,input().split()))\na.append(0)\na.append(0)\na.sort(re... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s342460616', 's608137270', 's277683125'] | [3188.0, 3064.0, 2940.0] | [18.0, 17.0, 20.0] | [1010, 1011, 71] |
p03059 | u967965346 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import math\n\nN = int(input())\nA = list(map(int, input().split()))\n\ngcd_l = [0]\ngcd_r = [0]\n\nfor i in range(N):\n gcd_l.append(math.gcd(gcd_l[i], A[i]))\n gcd_r.append(math.gcd(gcd_r[i], A[-(i+1)]))\ngcd_r = gcd_r[::-1]\n\nans = []\nfor i in range(N):\n ans.append(math.gcd(gcd_l[i], gcd_r[i+1]))\nprin... | ['Runtime Error', 'Accepted'] | ['s902929884', 's544138705'] | [3064.0, 2940.0] | [17.0, 17.0] | [308, 102] |
p03059 | u969091951 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import numpy as np\n\ndef gcd_(a, b):\n a_ = max(a, b)\n b_ = min(a, b)\n\n while True:\n if a_ % b_ == 0:\n return b_\n a_, b_ = b_, a_ % b_\n\n_ = input()\na = np.array([int(x) for x in input().split(" ")])\n\nif len(a) == 2:\n print(gcd_(*a))\n exit()\n\nlist = [gcd_(a[2], a... | ['Runtime Error', 'Accepted'] | ['s511831161', 's729723237'] | [12436.0, 2940.0] | [150.0, 17.0] | [676, 69] |
p03059 | u970197315 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t=map(int,input().split())\nprint((t+0.5)//a＊b)', 'a,b,t=map(int,input().split())\nprint(int(((t+0.5)//a)＊b))', 'a,b,t=map(int,input().split())\nt//=a\nprint(a*t)', 'a,b,t=map(int,input().split())\nprint((t+0.5)＊b/a)', 'a,b,t=map(int,input().split())\nt//=a\nprint(b*t)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s010979153', 's151922904', 's216083496', 's602320540', 's792771674'] | [2940.0, 3192.0, 2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0, 17.0, 17.0] | [52, 59, 47, 51, 47] |
p03059 | u970899068 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a = int(input())\nb= int(input())\nc = int(input())\nx= int(input())\nans=0\nfor i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if i*500+j*100+k*50==x:\n ans+=1\nprint(ans)', 'A,B,T=map(int, input().split())\nprint(T//A*B)'] | ['Runtime Error', 'Accepted'] | ['s656962370', 's843360932'] | [3060.0, 2940.0] | [17.0, 17.0] | [196, 45] |
p03059 | u973108807 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int, input().split())\nprint(b*((t+0.5)//a)', 'a,b,t = map(int, input().split())\nprint(b*((t+0.5)//a))', 'a,b,t = map(int, input().split())\nprint(b* int((t+0.5)//a) )'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s467348827', 's720167395', 's996945559'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0] | [54, 55, 60] |
p03059 | u978494963 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t = map(int,input().split())\nprint(b * ((t+0.5)//a))', 'a,b,t = map(int,input().split())\nprint(int(b * ((t+0.5)//a)))'] | ['Wrong Answer', 'Accepted'] | ['s599666381', 's900711305'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 61] |
p03059 | u979362546 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A,B,T = map(int, input().split())\nX = (T+0.5)//A\nprint(B*X)', 'A,B,T = map(int, input().split())\nX = (T+0.5)//A\nprint(B*X)', 'A,B,T = map(int, input()split())\nX = (T+0.5)/A\nprint(B*X)', 'A,B,T = map(int, input().split())\nX = T//A\nprint(B*X)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s410996182', 's494427145', 's703705397', 's938628686'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [59, 59, 57, 53] |
p03059 | u981332890 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ["def main():\n A, B, T = map(int, input().split())\n print(((T+0.5)//A) * B)\n\n return 0\n\n\nif __name__ == '__main__':\n main()", "def main():\n A, B, T = map(int, input().split())\n print(int(((T+0.5)//A) * B))\n\n return 0\n\n\nif __name__ == '__main__':\n main()"] | ['Wrong Answer', 'Accepted'] | ['s049189206', 's360472805'] | [2940.0, 2940.0] | [17.0, 17.0] | [133, 138] |
p03059 | u982533817 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = input().split()\na = int(a)\nb = int(b)\nt = int(t)\nn = (t+0.5) // a\nans = n * b\nprint(ans)\n', 's = input()\na, b, t = s.split()\na = int(a)\nb = int(b)\nt = int(t)\nn = int((t + 0.5) / a)\nans = n * b\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s085533621', 's745141548'] | [2940.0, 3060.0] | [18.0, 17.0] | [99, 110] |
p03059 | u982594421 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ["from fractions import gcd\n \ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n left = [0]\n right = [0]\n for l in a[:-1]:\n g = gcd(left[-1], l)\n left.append(g)\n for r in a[n:0:-1]:\n g = gcd(right[-1], r)\n right.append(g)\n right.reverse()\n ... | ['Runtime Error', 'Accepted'] | ['s323411501', 's380773019'] | [5048.0, 2940.0] | [36.0, 17.0] | [434, 137] |
p03059 | u985408358 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a,b,t=(int(x) for x in input().split())\nn=(t+0.5)//a\nprint(b*n)', 'a,b,t = (int(x) for x in input().split())\nt = t + 0.5\nc = a\nn = 0\nwhile t >= a :\n a = a + c\n n += 1\nprint((n)*b)'] | ['Wrong Answer', 'Accepted'] | ['s019256310', 's151162953'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 118] |
p03059 | u985648232 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['# coding:UTF-8\n\n\n\ninput_list = input().split()\n\n\nprint((input_list[2] + 0.5) // input_list[0] * input_list[1])', '# coding:UTF-8\n\n\n\ninput_list = input().split()\n\nnum_A = int(input_list[0])\nnum_B = int(input_list[1])\nnum_T = int(input_list[2])\n\n\nprint((num_T + 0.5) // num_A * num_B)', '# coding:UTF-8... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s221053694', 's989028605', 's077941827'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [220, 278, 251] |
p03059 | u985797832 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['import numpy as np \nN = int(input())\nA =list(map(int, input().strip().split()))\nAp = np.abs(A)\ni = 0\nm = 0\ns = 1\nwhile i <= N - 1:\n if A[i] < 0:\n m += 1\n i += 1\nif m % 2 == 0:\n M = np.sum(Ap)\nif m % 2 == 1:\n M = np.sum(Ap) - 2 * Ap[0]\n while s <= N - 1:\n M1 = np.sum(Ap) - ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s091048155', 's238262041', 's453093144'] | [12484.0, 12492.0, 2940.0] | [148.0, 150.0, 17.0] | [373, 349, 122] |
p03059 | u989157442 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = map(int, input().split())\nans = 0\nfor i in range(100000000):\n if i * a >= t:\n ans += b\n else:\n exit(print(ans))\n', 'a, b, t = map(int, input().split())\nans = 0\nfor i in range(100000000):\n if i * a <= t:\n ans += b\n else:\n exit(print(ans))\n', 'a, b, t = ma... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s225386603', 's940859198', 's787299971'] | [3188.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0] | [142, 142, 56] |
p03059 | u989326345 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A,B,T=map(int,input(),split())\nnum=(T+0.5)//A\nprint(num*B)', 'A,B,T=map(int,input().split())\nnum=(T+0.5)//A\nprint(int(num*B))\n'] | ['Runtime Error', 'Accepted'] | ['s870775097', 's267494709'] | [2940.0, 2940.0] | [17.0, 18.0] | [58, 64] |
p03059 | u993461026 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['A, B, T = map(int, input().split())\nprint(B*T//A)', 'A, B, T = map(int, input().split())\nprint(T//A * B)'] | ['Wrong Answer', 'Accepted'] | ['s824338154', 's785754776'] | [2940.0, 2940.0] | [17.0, 38.0] | [49, 51] |
p03059 | u996665352 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ['a, b, t = map(int, input().split())\nnum = t / a\nprint(num * b)', 'a, b, t = map(int, input().split())\nnum = t / a\nprint(int(num) * b)'] | ['Wrong Answer', 'Accepted'] | ['s214313650', 's021870258'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 67] |
p03059 | u998733244 | 2,000 | 1,048,576 | A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation. Find the total number of biscuits produced within T + 0.5 seconds after activation. | ["# -*- coding: utf-8 -*-\n\ndef gcd(a,b):\n if b==0:return a\n return gcd(b,a%b)\n\n\nn = int(input())\n\na = (list(map(int, input().split())))\n\nif n==2:\n print(max(a))\n exit()\n'''\nL = [gcd(a[0], a[1])]\nR = [gcd(a[n-2], a[n-1])]\n'''\n\n\nL = [0]\nR = [0]\nfor i in range(1,n+1):\n L.append(gcd(L[... | ['Runtime Error', 'Accepted'] | ['s516280301', 's970448604'] | [3064.0, 2940.0] | [17.0, 18.0] | [525, 93] |
p03060 | u003501233 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['N=int(input())\nV=list(map(int,input().split()))\nC=list(map(int,input().split()))\n\nans=0\n\nfor i in range(N):\n ans += max(0,V[i] - C[i]):\nprint(ans)', 'N=int(input())\nV=[int(input().split()) for i in range(N)]\nC=[int(input().split()) for i in range(N)]\n\nfor i in range(N):\n if V[i] > C[i]:\n ans += V[i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s275788262', 's999053632', 's561597527'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [147, 177, 146] |
p03060 | u005570675 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=[]\nans=0\nfor i in range(n):\n c.append(a[i]-b[i])\n\nprint(c)\nfor i in c:\n if i>=0:\n ans+=i\nprint(ans)', 'n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=[]\nans=0\nfor i in r... | ['Wrong Answer', 'Accepted'] | ['s370492033', 's607224995'] | [3064.0, 3060.0] | [17.0, 17.0] | [195, 186] |
p03060 | u007299532 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['N = int(input())\nV = list(map(int,input().split()))\nC = list(map(int,input().split()))\ncnt=0\nfor i in range(N):\n\tif V[i]-C[i] > 0:\n\t\tcnt = cnt + 1\nprint(cnt)', 'N = int(input())\nV = list(map(int,input().split()))\nC = list(map(int,input().split()))\nX=0\nfor i in range(N):\n\tif V[i]-C[i] > 0:\n\t\tX = X +... | ['Wrong Answer', 'Accepted'] | ['s209556040', 's411446654'] | [3060.0, 2940.0] | [17.0, 17.0] | [157, 157] |
p03060 | u012694084 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['N = int(input())\nV = list(map(int, input()))\nC = list(map(int, input()))\n\nans = 0\nfor v, c in zip(V, C):\n vr = v - c\n if vr >= 0:\n ans += vr\n\nprint(ans)\n', 'input()\nV = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nans = 0\nfor v, c in zip(V, C):\n vr = v - c\n if vr >... | ['Runtime Error', 'Accepted'] | ['s003367057', 's176734248'] | [2940.0, 2940.0] | [17.0, 17.0] | [158, 173] |
p03060 | u025463382 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['num = int(input())\nvalue = map (int,input().split())\nprice = map (int,input().split())\nans = 0\nfor i in range(num):\n if value[i] > price[i] :\n income = value[i] - price[i]\n ans += income\nprint(ans)', 'num = int(input())\nvalue = tuple( map (int,input().split()))\nprice = tuple(map (int,input().spli... | ['Runtime Error', 'Accepted'] | ['s340857092', 's913607640'] | [3060.0, 3060.0] | [17.0, 17.0] | [208, 223] |
p03060 | u027076164 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['N = int(input())\nV = list(map(int, input().split())\nC = list(map(int, input().split())\n\ns = 0\nfor i in range(N):\n\tif V[i] >= C[i]:\n\t\ts += V[i]-C[i]\n\telse:\n\t\ts += 0\nprint(s)\n', 'N = int(input())\nV = list(map(int, input().split())\nC = list(map(int, input().split())\n\ns = A\nfor i in range(N):\n\tif ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s042337162', 's462396090', 's468460519', 's666827577', 's790464466'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0] | [173, 173, 177, 171, 175] |
p03060 | u027675217 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n=int(input())\nv=[int(i) for i in range(n)]\nc=[int(i) for i in range(n)]\nans=[]\nfor i in range(2**n):\n\tfor j in range(n):\n\t\tif (i>>j)&1:\n\t\t\tsum_v+=v[j]\n\t\t\tsum_c+=c[j]\n\t\t\tans.append(sum_c-sum_v)\nprint(max(ans))', 'n=int(input())\nv=list(map(int,input().split()))\nc=list(map(int,input().split()))\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s110822625', 's614859628', 's809568248'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [209, 235, 248] |
p03060 | u030726788 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nv = list(map(int,input().split()))\nc = list(map(int,input().split()))\n\ns = 0\nfor i in range(n):\n s += max(0,v-c)\nprint(s)', 'n = int(input())\nv = list(map(int,input().split()))\nc = list(map(int,input().split()))\n\ns = 0\nfor i in range(n):\n s += max(0,v[i]-c[i])\nprint(s)\n'] | ['Runtime Error', 'Accepted'] | ['s834813738', 's388051116'] | [2940.0, 2940.0] | [18.0, 17.0] | [141, 148] |
p03060 | u033524082 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n=int(input())\nv=list(map(int,input().split()))\nc=list(map(int,input().split()))\nans=0\nfor i in range(n):\n if v[i]-c[i]>0:\n ans+=v[i]+c[i]\nprint(ans)', 'n=int(input())\nv=list(map(int,input().split()))\nc=list(map(int,input().split()))\nans=0\nfor i in range(n):\n if v[i]-c[i]>0:\n ans+=v[i... | ['Wrong Answer', 'Accepted'] | ['s190334472', 's860598641'] | [3060.0, 3060.0] | [17.0, 17.0] | [159, 159] |
p03060 | u043146101 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nvalues = [ int(x) for x in range(n) ]\ncost = [ int(x) for x in range(n) ]\nprofit_list = [ value[i] - cost[i] for i in range(n) if value[i] > cost[i] ]\nprint(sum(profit_list))\n', 'n = int(input())\nvalues = [ int(x) for x in input().split() ]\ncost = [ int(x) for x in input().split() ]\nprofit_li... | ['Runtime Error', 'Accepted'] | ['s117005863', 's876235025'] | [2940.0, 2940.0] | [17.0, 17.0] | [192, 208] |
p03060 | u054412614 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n=int(input())\nv=map(int,input().split())\nc=map(int,input().split())\nans=0\nfor i in range(n):\n if c[i]-v[i]>0:\n ans+=c[i]-v[i]\nprint(ans)', 'n=int(input())\nv=list(map(int,input().split()))\nc=list(map(int,input().split()))\nans=0\nfor i in range(n):\n if v[i]-c[i]>0:\n ans+=v[i]-c[i]\nprin... | ['Runtime Error', 'Accepted'] | ['s330450015', 's335379568'] | [3060.0, 2940.0] | [17.0, 17.0] | [147, 161] |
p03060 | u054750231 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nif n == 1:\n\tprint(0)\nelse:\n\tvals = list(map(int, input().split()))\n costs = list(map(int, input().split()))\n \n\ttotal = 0\n\tfor v, c in zip(vals, costs):\n \tresale = v - c\n if resale > 0:\n \ttotal += resale\n print(total)', 'n = int(input())\nif n == 1:\n\tprint(0)... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s096963264', 's503030838', 's208138230'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [256, 239, 266] |
p03060 | u058295774 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['# coding: utf-8\nimport numpy as np\nN = int(input())\n\nv = list(map(int,input().split()))\nc = list(map(int,input().split()))\n\nv2=np.array(v)\nc2=np.array(c)\n\nv2[np.argsort(v2)]\nc2[np.argsort(c2)]\n\nx = v2[-1] + v2[-2]\ny = c2[-1] + c2[-2]\nprint(x-y)\n', '# coding: utf-8\n# Your code here!\nV=[]\nC=[]\n\nans... | ['Runtime Error', 'Accepted'] | ['s907232072', 's273878433'] | [12496.0, 3064.0] | [150.0, 17.0] | [245, 322] |
p03060 | u059436995 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\nans = 0\nfor a, b in zip(v,c):\n ans +=max(a-b,0)\nans', 'n = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\nans = 0\nfor a, b in zip(v,c):\n ans +=max(a-b,0)\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s739318257', 's219971212'] | [2940.0, 2940.0] | [17.0, 17.0] | [143, 151] |
p03060 | u061104093 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n if v[i] > c[i]:\n count += 1\nprint(count)', 'n = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n if v[i] > c[i]:\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s307241645', 's917160325', 's437918276'] | [3060.0, 3060.0, 3060.0] | [19.0, 17.0, 17.0] | [163, 174, 176] |
p03060 | u068750695 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n=int(input())\nv=list(map(int,input().split()))\nc=list(map(int,input().split()))\na=["0"]\nfor i in range(n):\n for j in range(n-1):\n if (v[i]+v[j+1])-(c[i]+c[j+1])>0 and v[i]!=v[j+1] and c[i]!=c[j+1]:\n a+=str((v[i]+v[j+1])-(c[i]+c[j+1]))\n elif (v[i]+v[j+1])-(c[i]+c[j+1])<=0:\n ... | ['Wrong Answer', 'Accepted'] | ['s488168835', 's221910116'] | [3316.0, 2940.0] | [19.0, 17.0] | [359, 136] |
p03060 | u073711480 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['# -*-coding:utf-8 -*-\n\nn = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nprofits = []\nz = 0\n\nfor i in range(n):\n profits.append(v[i] - c[i])\nprofits.sort()\n\nprint(profits)\n\nfor i in profits:\n p = profits.pop()\n if p < 0:\n print(z)\n exit... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s176450839', 's906755392', 's482926853'] | [3064.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [335, 336, 351] |
p03060 | u075303794 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nv = map(int, input().split())\nc = map(int, input().split())\nans = 0\n\nfor i in range(n):\n if v[i] - c[i] > 0:\n ans += v[i] - c[i]\nprint(ans)', 'n = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\nans = 0\n\nfor i in range(n):\n if v[i] - c[i] > 0:\n... | ['Runtime Error', 'Accepted'] | ['s046652522', 's692766065'] | [3064.0, 3060.0] | [17.0, 17.0] | [160, 172] |
p03060 | u075628913 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nv = map(int, input().split())\nc = map(int, input().split())\nmax_val = 0\nfor _v, _c in zip(v, c):\n if _v - _c > 0:\n max_val += _v - _c\nprint(max_val', 'n = int(input())\nv = map(int, input().split())\nc = map(int, input().split())\nmax_val = 0\nfor _v, _c in zip(v, c):\n if _v - _c > 0:\n ... | ['Runtime Error', 'Accepted'] | ['s563183309', 's491889607'] | [2940.0, 2940.0] | [17.0, 17.0] | [168, 169] |
p03060 | u076996519 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nv = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\nd = 0\nfor i in range(n):\n if v[i] < c[i]:\n d = d + v[i] - c[i]\nprint(d)', 'n = int(input())\nv = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\nd = 0\nfor i in range(n):\n if v[i... | ['Wrong Answer', 'Accepted'] | ['s704646558', 's411344913'] | [2940.0, 2940.0] | [18.0, 18.0] | [174, 174] |
p03060 | u077075933 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['N = int(input())\ncost = [int(c)-int(v) for c,v in zip(input(), input())]\nprint(sum([c if c>0 else 0 for c in cost]))', 'N = int(input())\ncost = [int(c)-int(v) for c,v in zip(input().split(), input().split())]\nprint(sum([c if c>0 else 0 for c in cost]))'] | ['Runtime Error', 'Accepted'] | ['s052615654', 's284416287'] | [3056.0, 2940.0] | [17.0, 17.0] | [116, 132] |
p03060 | u097804107 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['# coding: utf-8\nimport itertools\nn = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\nd = 0\nmaxd = 0\nfor m in range(1, n + 1):\n a0 = [list(i) for i in list(itertools.combinations(list(range(n)), m))]\n print(a0)\n for a1 in a0:\n x = sum([v[j] for j in a1])\... | ['Wrong Answer', 'Accepted'] | ['s371706372', 's090796572'] | [115580.0, 3060.0] | [2109.0, 17.0] | [415, 191] |
p03060 | u102960641 | 2,000 | 1,048,576 | There are N gems. The value of the i-th gem is V_i. You will choose some of these gems, possibly all or none, and get them. However, you need to pay a cost of C_i to get the i-th gem. Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid. Find the maximum possible value of X-Y. | ['n = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\nans = 0\nfor i,j in zip(v,c):\n cospa = i - j\n if cospa > ans:\n ans = cospa\nprint(ans)\n ', 'n = int(input())\nv = list(map(int, input().split()))\nc = list(map(int, input().split()))\nans = 0\nfor i,j in zip(v,c):\... | ['Wrong Answer', 'Accepted'] | ['s663285109', 's354217959'] | [2940.0, 3060.0] | [18.0, 18.0] | [183, 182] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.