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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03045 | u868628468 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['def find(x):\n if x == par[x]:\n return x\n par[x] = find(par[x])\n return par[x]\n\ndef union(x,y):\n x,y = find(x),find(y)\n if x == y:\n return\n par[y] = x\n\nn,m = map(int,input().split())\npar = {i:i for i in range(1,n+1)}\nfor _ in range(m):\n a,b,c = map(int,input().split())... | ['Runtime Error', 'Accepted'] | ['s624151921', 's721710974'] | [3064.0, 15084.0] | [17.0, 491.0] | [347, 373] |
p03045 | u879870653 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['class UnionFind:\n def __init__(self, num):\n self.rank = [0] * num\n self.par = [i for i in range(num)]\n self.n = num\n \n def find_root(self, node):\n if self.par[node] == node:\n return node\n else:\n self.par[node] = self.find_root(self.par[node])\n ... | ['Wrong Answer', 'Accepted'] | ['s302790249', 's129386721'] | [7856.0, 8624.0] | [566.0, 546.0] | [1002, 963] |
p03045 | u898336293 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['import numpy as np\nimport sys\nfrom collections import deque\n\ninput = sys.stdin.readline\ndef dfs(start, G):\n stack = deque()\n stack.append(start)\n visited = [0]*len(G)\n while stack:\n label = stack.pop()\n visited[label-1]= 1\n for i in G[label-1]:\n if not visited[i-... | ['Wrong Answer', 'Accepted'] | ['s856495574', 's180118748'] | [30904.0, 110204.0] | [385.0, 533.0] | [783, 556] |
p03045 | u903460784 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['class UnionFind:\n def __init__(self,n):\n self.parent=[i for i in range(n)]\n self.rank=[0 for _ in range(n)]\n\n def find(self,x):\n if self.parent[x]==x:\n return x\n else:\n rootx=self.find(self.parent[x])\n self.parent[x]=rootx\n retur... | ['Runtime Error', 'Accepted'] | ['s347820074', 's836697492'] | [32296.0, 38432.0] | [545.0, 603.0] | [849, 849] |
p03045 | u908349502 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ["class UnionFind:\n def __init__(self, n):\n self.par = [i for i in range(n+1)]\n self.rank = [0] * (n+1)\n\n \n def find(self, x):\n if self.par[x] == x:\n return x\n else:\n self.par[x] = self.find(self.par[x])\n return self.par[x]\n\n \n de... | ['Runtime Error', 'Accepted'] | ['s890392434', 's218892513'] | [3064.0, 17964.0] | [17.0, 1892.0] | [915, 495] |
p03045 | u919633157 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['# 2019/10/10\n\nclass unionfind():\n def __init__(self,n):\n self.par=list(range(n+1))\n self.rank=[0]*(n+1)\n \n def find(self,x):\n if self.par[x]==x:\n return x\n else:\n self.par[x]=self.find(self.par[x])\n return self.par[x]\n \n def is_... | ['Runtime Error', 'Accepted'] | ['s019951393', 's253178829'] | [7796.0, 7796.0] | [23.0, 544.0] | [789, 806] |
p03045 | u921773161 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['import sys\nsys.setrecursionlimit(1000000)\nN, M = map(int, input().split())\nX = [0] * M\nY = [0] * M\nZ = [0] * M \nfor i in range(M):\n X[i], Y[i], Z[i] = map(int, input().split())\n\nreach = [[] for _ in range(N)]\n\nfor i in range(M) :\n reach[Y[i]-1].append(X[i])\n reach[X[i]-1].append(Y[i])\n\napproach ... | ['Wrong Answer', 'Accepted'] | ['s668984801', 's998695081'] | [112640.0, 112688.0] | [800.0, 740.0] | [608, 579] |
p03045 | u936985471 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['N,M=map(int,input().split())\n\nparent=[i for i in range(N)]\ndepth=[0 for i in range(N)]\n\ndef root(x):\n if parent[x]==x:\n return x\n else:\n return root(parent[x])\n\ndef same(x,y):\n return root(x)==root(y)\n\ndef unite(x,y):\n rx=root(x)\n ry=root(y)\n if rx==ry:\n return\n if depth[x]<depth[y]... | ['Runtime Error', 'Accepted'] | ['s439943852', 's649721457'] | [7856.0, 16812.0] | [28.0, 402.0] | [549, 1178] |
p03045 | u939790872 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['N, M = map(int,input().split())\npar = [i for i in range(N+1)]\nsize = [1 for _ in range(N+1)]\n\ndef find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\n\ndef unite(x,y):\n x = find(x)\n y = find(y)\n if x == y:\n continue\n par[x] = y\... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s033785139', 's279566072', 's669561791', 's381066573'] | [9092.0, 143328.0, 14420.0, 14480.0] | [26.0, 2377.0, 328.0, 331.0] | [483, 455, 436, 485] |
p03045 | u942033906 | 2,000 | 1,048,576 | There are N cards placed face down in a row. On each card, an integer 1 or 2 is written. Let A_i be the integer written on the i-th card. Your objective is to guess A_1, A_2, ..., A_N correctly. You know the following facts: * For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number. You ar... | ['# coding: utf-8\n# Your code here!\nN,M = map(int,input().split())\nlst = [i for i in range(N)]\n\ndef root(n):\n if n == lst[n]:\n return n\n lst[n] = func(lst[n])\n return lst[n]\n\ndef union(x,y):\n rootX, rootY = root(x), root(y)\n if rootX != rootY:\n lst[max(x,y)] = min(x,y)\n\nfor ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s691738081', 's771509244', 's934283501'] | [7088.0, 2940.0, 11032.0] | [24.0, 17.0, 485.0] | [485, 484, 535] |
p03059 | u001463970 | 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'] | ['s826171175', 's325118960'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 64] |
p03059 | u003501233 | 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())\nint(ans)=(t+0.5)/a*b\nprint(ans)', 'a,b,t=map(int,input().split())\nans=int((t+0.5)/a)\nprint(ans*b)'] | ['Runtime Error', 'Accepted'] | ['s027603299', 's058376389'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 62] |
p03059 | u005270341 | 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())\ninp_ints = list(map(int, input().split()))\n# ints = list(set(inp_ints))\n\nuniq_ints = list(set(inp_ints))\nints = uniq_ints\nfor m in uniq_ints:\n if inp_ints.count(m) >= 2:\n ints.append(m)\n\ngcd = 0\nresult = 1\nfor i in range(len(ints)):\n gcd = 0\n for m in ints... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s253404352', 's669869796', 's763355828', 's320456948'] | [3064.0, 5044.0, 5688.0, 2940.0] | [17.0, 37.0, 152.0, 17.0] | [451, 488, 472, 70] |
p03059 | u005815259 | 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=input().split()\ntime=int(int(c)/int(a))\nprint(int(time*b))', 'a,b,c=input().split()\ntime = (c+0.5)/a\nprint (time*b)', 'a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\ntime=int(c/a)\n\np=time*b\nprint(p)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s186146917', 's426005087', 's827135858'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [64, 53, 81] |
p03059 | u007263493 | 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>\nusing namespace std;\n\nint main(){\n int a, b, t;\n cin >> a >> b >> t;\n cout << (t / a) * b << endl;\n}', 'a, b, t=map(int,input().split())\nprint((t//a)*b)'] | ['Runtime Error', 'Accepted'] | ['s559181502', 's069712721'] | [2940.0, 2940.0] | [17.0, 17.0] | [128, 48] |
p03059 | u007991836 | 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)\n', 'a,b,t = map(int,input().split())\nprint(int((t+0.5)//a*b))\n'] | ['Wrong Answer', 'Accepted'] | ['s014000406', 's344891634'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 58] |
p03059 | u008388455 | 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. | ['print(sum)\n', 'a, b, t = map(int, input().split())\ncnt = 0\nfor i in range(1,100):\n if a*i <= t+0.5:\n cnt = cnt + 1\n else:\n break\nsum = b * cnt\nprint(sum)'] | ['Wrong Answer', 'Accepted'] | ['s324908081', 's358169265'] | [2940.0, 2940.0] | [17.0, 17.0] | [11, 158] |
p03059 | u008582165 | 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'] | ['s576973432', 's739361386'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 57] |
p03059 | u014139588 | 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'] | ['s740768257', 's320847613'] | [9056.0, 9092.0] | [29.0, 29.0] | [52, 57] |
p03059 | u017063101 | 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(float,input().split())\nc=0\nn=2\nwhile True:\n if a<=t+0.5:\n c+=b\n k=a*n\n a=k\n n+=1\n else:\n break\nprint(c)', 'a,b,t=map(float,input().split())\nc=0\nn=2.0\nwhile True:\n if a<=t+0.5:\n c+=b\n k=a*n\n a=k\n n+=1.0\n else:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s445674375', 's710689079', 's915969024'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [154, 158, 170] |
p03059 | u017415492 | 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//a)/b)', 'a,b,c=map(int,input().split())\nprint(int((c//a)/b))', 'a,b,t,=map(int,input().split())\nT=t//a\n\nprint(int(T*b))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s511589044', 's642392112', 's661351041'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [46, 51, 55] |
p03059 | u018597853 | 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()))\nsa = 0\n\nfor i in range(N):\n if v[i] - c[i]>0:\n sa += v[i]-c[i]\n\nprint(sa) \n ', 'A,B,T = map(int,input().split())\nprint(T//A*B)'] | ['Runtime Error', 'Accepted'] | ['s041136932', 's074606033'] | [3060.0, 2940.0] | [17.0, 17.0] | [183, 46] |
p03059 | u023229441 | 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());print(c//a*b)', 'a,b,c=map(int,input().split());print(c//a*b)\n'] | ['Runtime Error', 'Accepted'] | ['s402051094', 's198516382'] | [2940.0, 2940.0] | [17.0, 18.0] | [44, 45] |
p03059 | u023630626 | 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 = a/t*b\n', 'a, b, t = map(int, input().split())\nt=t+0.5\nprint(int(t//a*b))'] | ['Wrong Answer', 'Accepted'] | ['s499354380', 's677614269'] | [2940.0, 2940.0] | [17.0, 18.0] | [46, 62] |
p03059 | u027076164 | 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())\nfor i in range(T/A):\n\ti += B\nprint(i)\n', 'A,B,T = map(int, input().split())\n\nprint(B*(T/A))\n', 'A,B,T = map(int, input().split())\nfor i in range(T/A)\n\ti += B\nprint(i)', 'A,B,T = map(int, input().split())\ni = int(T/A)\nprint(B*i)\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s140383290', 's299238957', 's968078912', 's153981562'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [72, 50, 70, 58] |
p03059 | u027675217 | 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())\nsum = a//t\nprint(b*sum)', 'a,b,t = map(int, input().split())\nsum = a//t\nprint(b*ans)\n', 'a,b,t = map(int, input().split())\nsum = t//a\nprint(b*sum)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s028227801', 's850507068', 's821217499'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [57, 58, 58] |
p03059 | u027929618 | 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)', 'a,b,t=map(int,input().split())\nprint(int(((t+0.5)//a)*b))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s810658200', 's876046614', 's999624583'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [50, 52, 57] |
p03059 | u029234056 | 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()))\nans=0\nc=0\ntmp=10**9\nfor a in A:\n if a<0:\n c+=1\n ans+=abs(a)\n tmp=min(tmp,abs(a))\nif c%2==0:\n print(ans)\nelse:\n print(ans-tmp*2)', 'A,B,T=map(int,input().split())\nprint(int((T+0.5)//A*B))\n'] | ['Runtime Error', 'Accepted'] | ['s007822339', 's166888759'] | [3060.0, 2940.0] | [17.0, 17.0] | [197, 56] |
p03059 | u031146664 | 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())\n\tprint((a+0.5)//c * a)', 'a, b, c = map(int ,input().split())\nprint((a+0.5)//c * 5)', 'a, b, c = map(int ,input().split())\nprint((c+0.5)//a * b)', 'a, b, c = map(int ,input().split())\nprint(int((c+0.5)//a * b))'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s387580189', 's442160598', 's473807080', 's236589842'] | [2940.0, 3316.0, 2940.0, 2940.0] | [17.0, 21.0, 17.0, 17.0] | [58, 57, 57, 62] |
p03059 | u033524082 | 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())\nt=t/a\nprint(b*t)', 'a,b,t=map(int,input().split())\nprint(t/a*b)', 'a,b,t=map(int,input().split())\nprint(b*(t//a))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s491773280', 's508741625', 's444193801'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [47, 43, 46] |
p03059 | u039934639 | 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)\ncount = int((T+0.5)/A)\nans = B*count\nprint(ans)', 'A,B,T = map(int,input().split())\ncount = int((T+0.5)/A)\nans = B*count\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s444623004', 's860757380'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 81] |
p03059 | u040067762 | 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()\nprint(n)', 'a, b, t = input().split() \nprint(t / a * b)', 'a, b, t = input().split() \nprint(int(t) // int(a) * int(b))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s688755541', 's701742713', 's151217913'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [20, 43, 59] |
p03059 | u041382530 | 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(input(),split())\na=int(T/A+0.5)\nprint(a*B)', 'A,B,T=map(int,input().split())\ncount=0\nwhile T>=A:\n\tT=T-A\n\tcount+=1\nprint(count*B)'] | ['Runtime Error', 'Accepted'] | ['s551158772', 's636847123'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 82] |
p03059 | u044442911 | 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. | ['\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n A_reverse = list(reversed(A))\n left = [0]\n right = [0]\n answer = []\n for n in range(N):\n left.append(gcd(left[n], A[n]))\n right.append(gcd(right[n], A_reverse[n]))\n del left[N]\n del right[N]\n ... | ['Runtime Error', 'Accepted'] | ['s749944832', 's411413443'] | [3064.0, 2940.0] | [18.0, 17.0] | [527, 208] |
p03059 | u047023156 | 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()))\nXY = 0\nfor i in range(len(V)):\n if V[i] - C[i] > 0:\n XY += V[i] - C[i]\n\nprint(XY)\n', 'A, B, T = input().split()\nA, B, T = int(A), int(B), int(T)\n\nprint(B * (T // A))\n'] | ['Runtime Error', 'Accepted'] | ['s791606813', 's862923831'] | [2940.0, 2940.0] | [18.0, 17.0] | [176, 80] |
p03059 | u050805798 | 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 = (t/a)*b\nprint(int(n))', 'a,b,t = map(int,input().split())\nn = (t//a)*b\nprint(int(n))'] | ['Wrong Answer', 'Accepted'] | ['s379081903', 's317024265'] | [2940.0, 2940.0] | [17.0, 17.0] | [58, 59] |
p03059 | u052838115 | 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())\na=T+0.5\nb=(a//A)\nprint(b*B)', 'A,B,T=map(int,input().split())\na=T+0.5\nb=(a//A)\nprint(int(b*B))'] | ['Wrong Answer', 'Accepted'] | ['s633682714', 's095003154'] | [9068.0, 9156.0] | [29.0, 30.0] | [58, 63] |
p03059 | u054662964 | 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)\nfor X in range(20):\n if a*X <= T + 0.5:\n b = b + 1\n if a*X >= T + 0.5:\n break\nprint(b)\n \n \n ', 'A,B,T = input().split()\nA = int(A)\nB = int(B)\nT = int(T)\ns = int(s)\nfor X in range(0,20):\n if A*X <= T + 0.5:\n s = B*X\n if A*X >=... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s058058579', 's079886264', 's552184727', 's673673203'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [160, 163, 146, 158] |
p03059 | u054750231 | 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, list(input()))\ntotal = 0\nfor i in range(a, t+1, a):\n total += b\nprint(total)', "a, b, t = list(input(''))\ntotal = 0\nfor i in range(a, t+1, a):\n total += b\nprint(total)", 'a, b, t = map(int, input().split())\ntotal = 0\nfor i in range(a, t+1, a):\n total += b\nprint(total)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s071350200', 's701098438', 's896273202'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [96, 88, 98] |
p03059 | u058592821 | 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().split())\nprint(b * ((t+0.5)//a))', 'a, b, t = (int(i) for i in input().split())\nprint(b * t//a)', 'a, b, t = (int(i) for i in input().split())\nprint(b * (t+0.5)//a)', 'a, b, t = (int(i) for i in input().split())\n\nprint(b * (t//a))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s625934365', 's663263165', 's812023226', 's074229119'] | [2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [67, 59, 65, 62] |
p03059 | u061104093 | 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())\nbis = t // a\nprint(bis * t)', 'a, b, t = map(int, input().split())\nbis = t // a\nprint(bis * b)'] | ['Wrong Answer', 'Accepted'] | ['s188047294', 's249334087'] | [2940.0, 2940.0] | [18.0, 17.0] | [63, 63] |
p03059 | u061912210 | 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()))\nprint(t*(b//a))\n', 'a,b,t=list(map(int,input()))\nprint(t*b//a)', 'a,b,t=list(map(int,input()))\nprint(t(*b//a))\n', 'a,b,t=list(map(int,input().split()))\nprint(t*(b/a))\n', 'a,b,t=list(map(int,input()))\nprint(t*b(//a))\n', 'a,b,t=list(map(int,input().split()))\nprint(t*(b//a))\n', 'a... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s120026371', 's474745779', 's594507107', 's699268044', 's930018653', 's960716186', 's992256838', 's918550509'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [45, 42, 45, 52, 45, 53, 50, 54] |
p03059 | u062306892 | 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()))\n\nk = t / a\nif k >= 0:\n print(k * b)\nelif a>t:\n print(0)\n', 'a, b, t = list(map(int, input().split()))\n\nk = t // a\nif k >= 0:\n print(k * b)\nelif a>t:\n print(0)'] | ['Wrong Answer', 'Accepted'] | ['s169165058', 's071289752'] | [2940.0, 2940.0] | [17.0, 17.0] | [100, 100] |
p03059 | u062604519 | 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(int(b/a*t+0.5))', 'a,b,t = map(int,input().split())\nif (t+0.5)/a < 1:\n print(0)\nelse:\n print(int((t+0.5)/a)*b) '] | ['Wrong Answer', 'Accepted'] | ['s174720128', 's702704630'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 94] |
p03059 | u063703408 | 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'] | ['s159476536', 's955072107'] | [2940.0, 2940.0] | [17.0, 18.0] | [54, 59] |
p03059 | u067983636 | 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())\npritn(B * (T // A))', 'A, B, T = map(int, input().split())\nprint(B * (T // A))'] | ['Runtime Error', 'Accepted'] | ['s319993719', 's121113643'] | [2940.0, 2940.0] | [17.0, 17.0] | [55, 55] |
p03059 | u068142202 | 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(input())\ncount = 0\nfor i in range(t):\n if i % a == 0:\n count +=1\nprint(count * b)', 'a, b, t = int(input())\ncount = 0\nfor i in range(t):\n if i % a == 0:\n count +=1\nprint(count * b)', 'a, b, t = map(int,input().split())\ncount = 0\nfor i in range(1, t+1):\n if i % a == 0:\n count +=... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s287494389', 's825934958', 's810511189'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [99, 99, 117] |
p03059 | u068862866 | 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'] | ['s547108058', 's596327884'] | [9088.0, 9140.0] | [27.0, 27.0] | [55, 59] |
p03059 | u069533671 | 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().split()]\nprint(b * (c // a))', 'a, b, t = [int(i) for i in input().split()]\nprint(b * (t // a))'] | ['Runtime Error', 'Accepted'] | ['s315013313', 's595758203'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 63] |
p03059 | u075155299 | 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\nfor i in range(1,20):\n if i*(i+1)/2 >t+0.5:\n print(b*(i-1))\n break\n\n\n', 'a,b,t = map(int,input().split())\n\nfor i in range(1,90):\n if a*i >=t+0.5:\n if i==1:\n print(0)\n break\n else:\n print(b*(i-1))\n break\n'] | ['Wrong Answer', 'Accepted'] | ['s678018387', 's809299346'] | [2940.0, 3064.0] | [17.0, 17.0] | [110, 157] |
p03059 | u075303794 | 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 = b * t // a\nprint(ans)', 'a,b,t = map(int,input().split())\nans = b * (t // a)\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s111050632', 's542475704'] | [2940.0, 2940.0] | [17.0, 18.0] | [60, 62] |
p03059 | u076564993 | 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. | ['print(B*((T+0.5)//A))', 'print(B*(T//A))\n', 'A, B, T = map(int, input().split())\nprint(B*(T//A))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s154381723', 's897146818', 's818412763'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [21, 16, 52] |
p03059 | u080112718 | 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 = np.array([int(i) for i in input().split()])\n\n# cm = np.prod(A)\n# max_gcd = 0\n\n# Am = A.copy()\n# Am[i] = cm\n# gcd = np.gcd.reduce(Am)\n# if gcd > max_gcd:\n# max_gcd = gcd\nprint(sum(A))', 'import numpy as np\nN = int(input())\nA = np.array([int(... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s511182033', 's847670078', 's223000237'] | [12428.0, 12400.0, 2940.0] | [148.0, 147.0, 17.0] | [271, 268, 80] |
p03059 | u080608919 | 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\nt += 0.5\nprint(t//a*b)', 'import math\na,b,t = map(int,input().split())\n\nt += 0.5\nprint(math.floor(t//a)*b)'] | ['Wrong Answer', 'Accepted'] | ['s921012521', 's741293669'] | [3060.0, 2940.0] | [18.0, 17.0] | [56, 80] |
p03059 | u083960235 | 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())\nt=T+0.5\ncount=0\n\nfor i in range(1,t):\n if A*i<=t:\n count+=B \n \nprint(count)', 'A,B,T=map(int,input().split())\nt=T+0.5\nt=int(t)\na=int(t/A)\nprint(a*B)\n\n'] | ['Runtime Error', 'Accepted'] | ['s628997791', 's588990940'] | [2940.0, 2940.0] | [18.0, 17.0] | [122, 71] |
p03059 | u095089755 | 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()))\nprint(int(T + 0.5) * B // A)\n', 'A, B, T = list(map(int, input().split()))\nnum = int((T + 0.5) // A * B)\nprint(num)\n'] | ['Wrong Answer', 'Accepted'] | ['s547756553', 's892586190'] | [2940.0, 2940.0] | [17.0, 17.0] | [71, 83] |
p03059 | u097317219 | 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())\nC = (T + 0.5) // A\nD = C * B \nprint(str(D))', 'A,B,T = map(int,input().split())\nC = (T + 0.5) // A\nD = C * B \nprint(D)', 'A,B,T = map(int,input().split())\nC = (T + 0.5) // A\nD = C * B \nprint(str(int(D)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s009622209', 's521742971', 's352750285'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [76, 71, 81] |
p03059 | u098552892 | 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())\nt += 0.5\nkey = t//a\nprint(key * b)', 'a, b, t = map(int, input().split())\nt += 0.5\nkey = t//a\nprint(int(key * b))'] | ['Wrong Answer', 'Accepted'] | ['s613460283', 's692706841'] | [2940.0, 2940.0] | [17.0, 18.0] | [70, 75] |
p03059 | u101113363 | 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())\t\n\nS=T+0.5\n\nC=S//A\n\nprint(C*B)', 'A,B,T = map(int,input().split())\t\n\nS=T+0.5\n\nC=S//A\n\nprint(int(C*B))'] | ['Wrong Answer', 'Accepted'] | ['s543244155', 's866261144'] | [2940.0, 2940.0] | [18.0, 17.0] | [62, 67] |
p03059 | u101574948 | 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\nn=int(input())\nlst=list(map(int,input().split()))\nxlst=list(reversed(lst))\n\n\n\n\n\n\n\n\nleft=[lst[0]]\nxright=[lst[n-1]]\nfor i in range(1,len(lst)):\n left.append(math.gcd(left[i-1],lst[i]))\n\nfor i in reversed(range(0,len(lst)-1)):\n\n xright.append(math.gcd(xright[n-i-2],lst[i]))\n\n\n\n\... | ['Runtime Error', 'Accepted'] | ['s875557290', 's206441181'] | [3064.0, 2940.0] | [18.0, 17.0] | [676, 47] |
p03059 | u102275718 | 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 = map(int, input().split())\n*a_abs, = map(abs, a)\nif len([i for i in a if i<0])%2 ==0:\n print(sum(a_abs))\nelse:\n print(sum(a_abs)-2*min(a_abs))', 'a, b, t = map(int, input().split())\ncnt = 0\ntemp = a\nwhile t+0.5 > temp:\n cnt += 1\n temp += a\nprint(b*cnt)'] | ['Runtime Error', 'Accepted'] | ['s251234200', 's635625135'] | [3060.0, 2940.0] | [17.0, 17.0] | [168, 112] |
p03059 | u103146596 | 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\nl = list(map(int, input().split()))\nprint(l[1]*(l[2]-(l[2]%l[0]))/l[0])', 'import math\nl = list(map(int, input().split()))\nprint(int(l[1]*(l[2]-(l[2]%l[0]))/l[0]))'] | ['Wrong Answer', 'Accepted'] | ['s335450149', 's301620725'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 88] |
p03059 | u104740664 | 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. | ['loop, kosu, time = map(int, input().split(" "))\nprint(kosu * (time//loop)', 'loop, kosu, time = map(int, input().split(" "))\nprint(kosu * (time//loop))'] | ['Runtime Error', 'Accepted'] | ['s434912302', 's404933248'] | [2940.0, 2940.0] | [17.0, 17.0] | [73, 74] |
p03059 | u104741254 | 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. | ['inputs = map(int, list(input()))\nA, B, T = inputs\n\nprint(T // A * B)', 'inputs = list(map(int, input().split()))\nA, B, T = inputs\n\nprint(T // A * B)'] | ['Runtime Error', 'Accepted'] | ['s957749601', 's390637503'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 76] |
p03059 | u106311097 | 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 math\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nr = {}\n\nfor j in a:\n for i in range(1, int(j**0.5)+1):\n if j % i == 0:\n if i in r.keys():\n r[i] += 1\n else:\n r[i] = 1\n if i != j // i:\n ... | ['Runtime Error', 'Accepted'] | ['s642731712', 's283210479'] | [3064.0, 3188.0] | [17.0, 22.0] | [516, 123] |
p03059 | u108934099 | 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\ncnt = 0\nwhile time < T + 0.5:\n time += A \n cnt += B \nprint(cnt)', 'A,B,T = map(int,input().split())\ntime = A\ncnt = 0\nwhile time < T + 0.5:\n time += A \n cnt += B \nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s714756758', 's159594171'] | [9080.0, 9032.0] | [31.0, 26.0] | [111, 111] |
p03059 | u111652094 | 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\nA,B,T = map(int,input().split())\n\nC = (T + 1/2)//A\nans = B*C\n\nprint(ans)', '# -*- coding: utf-8 -*-\n\n\nA,B,T = map(int,input().split())\n\nC = int((T + 1/2)//A)\nans = B*C\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s715236269', 's583895046'] | [2940.0, 2940.0] | [17.0, 17.0] | [161, 166] |
p03059 | u114920558 | 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*B*T)', 'A, B, T = map(int, input().split())\nprint(B*(T//A))'] | ['Wrong Answer', 'Accepted'] | ['s455681062', 's680892162'] | [2940.0, 2940.0] | [19.0, 17.0] | [48, 51] |
p03059 | u115110170 | 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 gcd(a, b):\n if a < b:\n a, b = b, a\n if b == 0:\n return a\n c = a % b\n return gcd(b, c)\n \nn = int(input())\narr = list(map(int,input().split(" ")))\nlist.sort(arr)\n\nmemoa = [None for i in range(n)]\nmemoa[0] = arr[0]\nmemob = [None for i in range(n)]\nmemob[0] = arr[-1]\nfor i i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s656733066', 's829063282', 's760790751'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0] | [573, 207, 81] |
p03059 | u115877451 | 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())\nn=len([i for i in range(c) if i%a==0])\nprint(b*n)\n', 'a,b,c=map(int,input().split())\nn=len([i for i in range(1,c+1) if i%a==0])\nprint(b*n)\n'] | ['Wrong Answer', 'Accepted'] | ['s353848091', 's750418508'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 85] |
p03059 | u116233709 | 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=[]\nl.append(0)\nl.append(0)\nr=[]\nr.append(a[n-1])\nr.append(a[n-1])\ng=[]\n\ndef gcd(x,y):\n if x%y==0:\n return y\n else:\n return gcd(y,x%y)\n\n\nfor i in range(1,n):\n l.append(gcd(l[i],a[i-1]))\n r.append(gcd(r[i],a[n-1-i]))\n \nr[0]=l[n]\n\nfor ... | ['Runtime Error', 'Accepted'] | ['s509199145', 's715349706'] | [3064.0, 2940.0] | [17.0, 17.0] | [369, 46] |
p03059 | u118147328 | 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\nN = int(input())\nA = list(map(int, input().split()))\n\nX1 = [0] * (N+2)\nX2 = [0] * (N+2)\n\nfor i in range(N):\n X1[i+1] = math.gcd(X1[i], A[i])\nfor i in range(N,0,-1):\n X2[i] = math.gcd(X2[i+1], A[i-1])\n\nans = 1\nfor i in range(N):\n G = math.gcd(X1[i], X2[i+2])\n if ans < G:\n ... | ['Runtime Error', 'Accepted'] | ['s509208089', 's380120102'] | [3064.0, 2940.0] | [17.0, 17.0] | [321, 53] |
p03059 | u118867138 | 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 = ((T+0.5)//A)*B\nprint(int(Ans)', 'A,B,T = map(int, input().split())\nAns = ((T+0.5)//A)*B\nprint(int(Ans))'] | ['Runtime Error', 'Accepted'] | ['s609403876', 's919387918'] | [2940.0, 2940.0] | [17.0, 17.0] | [69, 70] |
p03059 | u119495375 | 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. | ['li = list(map(int,input().split()))\n\ndef count(s):\n a = int(s[0])\n b = int(s[1])\n t = int(s[2])\n a_now = a\n sum_ = 0\n while a_now< t+0.5:\n sum_ += b\n a_now += a\n \n return t\n\nprint(count(li))', 'li = list(map(int,input().split()))\n\ndef count(s):\n a = int(s[0])\... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s409104439', 's507240691', 's564656810', 's721715933'] | [3060.0, 2940.0, 12492.0, 3060.0] | [17.0, 17.0, 148.0, 17.0] | [228, 231, 866, 232] |
p03059 | u119655368 | 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 copy\nimport fractions\n\nn = int(input())\nl = list(map(int, input().split()))\nsum = 0\nif len(l) == 2:\n print(max(l[0], l[1]))\n exit()\nelse:\n for i in range(n):\n ll = copy.deepcopy(l)\n ll.pop(i)\n ans = ll[0]\n for j in range(1, len(ll)):\n ans = fractio... | ['Runtime Error', 'Accepted'] | ['s966982224', 's133146464'] | [5120.0, 2940.0] | [36.0, 18.0] | [384, 53] |
p03059 | u121192152 | 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\n\nif N == 2:\n print(max(A[0], A[1]))\nelse:\n m = min(A)\n\n ans = -1\n for i in range(m+1, 1, -1):\n count = 0\n for n in range(N):\n if count > 1:\n break\n if A[n] % i != 0:\n cou... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s234913120', 's487594457', 's088988731'] | [3060.0, 3064.0, 2940.0] | [18.0, 17.0, 17.0] | [387, 376, 115] |
p03059 | u122531998 | 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\n\nn_str = input()\nn = int(n_str)\na_str = input().split()\na = []\nfor i in range(n):\n a.append(int(a_str[i]))\ntmp1 = [0] * (n + 1)\ntmp2 = [0] * (n + 1)\ntmp = []\nfor i in range(n + 1):\n for j in range(i):\n if j == 0:\n tmp1[j + 1] = fractions.gcd(0, a[j])\n els... | ['Runtime Error', 'Accepted'] | ['s338594546', 's594517943'] | [5048.0, 3060.0] | [35.0, 17.0] | [742, 219] |
p03059 | u123745130 | 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 // A)*B)', 'A , B, T =map(int,input().split())\nprint((T // A)*B)'] | ['Runtime Error', 'Accepted'] | ['s300974220', 's142745905'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 52] |
p03059 | u124025116 | 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. | ['li = input().split()\nA=int(li[0])\nB=int(li[1])\nT=int(li[2])\ns=T*B//A\nprint(s)', 'a,b,t = map(int,input().split())\ns=(t+0.5)*b/a\nprint(str(s))', 'li = input().split()\nA=int(li[0])\nB=int(li[1])\nT=int(li[2])\ns=T*B/A\nprint(str(s))', 'li = input().split()\ns=(float(li[2])+0.5)*int(li[1])/int(li[0])\nprint(str(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s050919078', 's414799349', 's477587632', 's554263992', 's654564241', 's719186974', 's968522116', 's520906692'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [77, 60, 81, 77, 70, 82, 75, 77] |
p03059 | u125348436 | 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())\ni=1\nwhile i*a<t+0.5:\n i++\nprint{(i-1)*b}\n', 'a,b,t=map(int,input().split())\ni=1\nwhile i*a<t+0.5:\n i++\nprint((i-1)*b)', 'a,b,t=map(int,input().split())\ni=1\nwhile i*a<t+0.5:\n i+=1\nprint((i-1)*b)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s081007062', 's398748336', 's514710209'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [73, 72, 73] |
p03059 | u126232616 | 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(int(t/a * b))', '6', 'a,b,t = map(int, input().split())\nprint(int(t/a) * b)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s264410703', 's735379049', 's199349705'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [53, 1, 53] |
p03059 | u130900604 | 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())\nv=b/a\nans=int((t+0.5)*v)\nprint(ans)', 'a,b,t=map(int,input().split())\nans=((t+0.5)//a*b)\nprint(ans)', 'a,b,t=map(int,input().split())\nans=(t//a)*b\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s426668725', 's812119487', 's927155925'] | [2940.0, 3316.0, 2940.0] | [17.0, 20.0, 17.0] | [66, 60, 54] |
p03059 | u131406572 | 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())\nc=list(map(int,input().split()))\nv=list(map(int,input().split()))\ns=0\nfor i in range(n):\n if c[i]-v[i]>0:\n s=s+c[i]-v[i]\nprint(s)', '#125a\na,b,t=map(int,input().split())\nn=t//a\nprint(b*n)'] | ['Runtime Error', 'Accepted'] | ['s682341061', 's614258606'] | [3060.0, 2940.0] | [18.0, 17.0] | [154, 54] |
p03059 | u131944095 | 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. | ['3 2 9', 'import math\nA, B, T = map(int, input().split())\ntotal = 0\ntime = math.floor(T + 0.5)\ntotal = B * (math.floor(time / A))\nprint(total)'] | ['Runtime Error', 'Accepted'] | ['s676984574', 's505264512'] | [2940.0, 3060.0] | [17.0, 17.0] | [5, 132] |
p03059 | u133805688 | 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. | ['\ndef gcd(a, b) :\n if b == 0 :\n return a\n ret = gcd(b, a % b)\n return ret\n\ndef main( ) :\n\n n = int(input())\n v = [int(i) for i in input().split()]\n\n l = [0 for i in range(n)]\n r = l[:]\n\n for i in range(1, n) :\n l[i] = gcd(l[i-1], v[i-1])\n r[-i-1] = gcd(r[-i], v[-i])\n\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s255755588', 's285162577', 's848775952'] | [3064.0, 3064.0, 2940.0] | [18.0, 18.0, 18.0] | [407, 349, 66] |
p03059 | u135847648 | 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\ncnt = 0\nfor i in range(N):\n if V[i]-C[i] >0:\n cnt += V[i]-C[i]\nprint(cnt) ', 'A,B,T = map(int,input().split())\ncnt = 0\nn = A\nwhile n <= T:\n n += A \n cnt += B\nprint(cnt) '] | ['Runtime Error', 'Accepted'] | ['s767861213', 's637983734'] | [3060.0, 2940.0] | [17.0, 17.0] | [169, 94] |
p03059 | u135945743 | 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 add(A,B,T):\n C=T//A\n return C*B\n \nA=int(input())\nB=int(input())\nT=int(input())\nprint(add(A,B,T))', 'def add(A,B,T):\n C=T//A\n return C*B\n \na=list(map(int,input().split()))\nprint(add(a[0],a[1],a[2]))'] | ['Runtime Error', 'Accepted'] | ['s958532762', 's557883768'] | [2940.0, 2940.0] | [17.0, 17.0] | [103, 100] |
p03059 | u137653400 | 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\nprint(T/A * B)', 'n = input().split()\nA = int(n[0])\nB = int(n[1])\nT = int(n[2])\n\nprint(T//A * B)'] | ['Runtime Error', 'Accepted'] | ['s325668147', 's884756928'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 79] |
p03059 | u138781768 | 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(int, input().split())\nt += 0.5\ncou = t // a\nans = cou * b\nprint(ans)', 'from math import ceil\na, b, t = map(int, input().split())\nt += 0.5\ncou = t // a\nans = cou * b\nprint(ceil(ans))'] | ['Wrong Answer', 'Accepted'] | ['s217538102', 's788412972'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 110] |
p03059 | u140480594 | 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()))\nprint(int((T/A)*B))', 'A, B, T = list(map(int, input().split()))\nprint(int(T/A)*B)'] | ['Wrong Answer', 'Accepted'] | ['s494316785', 's022864219'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 59] |
p03059 | u140697185 | 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\ncount = T // A * B\n\nprint(count)', 'A , B , T = map(int , input().split())\n\nTmax = T + 0.5\n\ncount = B * A // T\n\nprint(count)', 'A , B , T = map(int , input().split())\n \ncount = T // A * B\n \nprint(count)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s207181849', 's294212759', 's437449597'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [72, 88, 75] |
p03059 | u141610915 | 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())\nres = 0\nfor _ in range(B // T):\n res += A\nprint(res)', 'A, B, T = map(int, input().split())\nres = 0\nfor _ in range(A // T):\n res += B\nprint(res)\n', 'A, B, T = map(int, input().split())\nres = 0\nfor _ in range(T // A):\n res += B\nprint(res)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s201630173', 's206981714', 's006692218'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [89, 90, 90] |
p03059 | u150787983 | 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 collections\n\ndef cal_divs(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n return divisors\n \ndef check(num, kouho, N, i):\n for val in kouho.keys():\n if num%va... | ['Runtime Error', 'Accepted'] | ['s723382472', 's746264461'] | [3316.0, 2940.0] | [22.0, 17.0] | [1152, 61] |
p03059 | u151334504 | 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 = ((T+0.5) // a)*b\nprint(int(ans))', '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)', 'a,b,t = map(int, input().split())\nans = ((t+0.5) // a)*b\nprint(int(ans))'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s319188402', 's558189605', 's773163058', 's200200482'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 18.0] | [72, 57, 57, 72] |
p03059 | u151625340 | 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 = (T+0.5)//A\nprint(B*n)\n', 'A,B,T = map(int,input().split())\nn = (T+0.5)//A\nprint(int(B*n))'] | ['Wrong Answer', 'Accepted'] | ['s609599997', 's363883426'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 63] |
p03059 | u153419200 | 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)))\n'] | ['Wrong Answer', 'Accepted'] | ['s451726935', 's533393771'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 58] |
p03059 | u156677492 | 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()))\n\n\nprint((A//T)*B)', 'A,B,T=list(map(int,input().split()))\n\n\nprint((T//A)*B)'] | ['Wrong Answer', 'Accepted'] | ['s792342251', 's283906505'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 54] |
p03059 | u158126367 | 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(input().split())\ns = int(t//a)\nprint(b*s)', 'a,b,t = map(int, input().split())\ns = int(t//a)\nprint(b*s)'] | ['Runtime Error', 'Accepted'] | ['s628448289', 's208942990'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 58] |
p03059 | u161201983 | 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(float, input().split())\n\nfor n in range(20):\n if a < (t + 0.5):\n if (a * n) > (t + 0.5):\n print(b * (n-1))\n break\n if (a * n) < (t + 0.5):\n continue\n', 'a, b, t = map(int, input().split())\n\nif a > t:\n print(0)\nelse:\n n = 1\n while ... | ['Wrong Answer', 'Accepted'] | ['s145408190', 's155654110'] | [2940.0, 2940.0] | [17.0, 17.0] | [213, 135] |
p03059 | u161442663 | 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=(T+0.5)//A\nS=B*time\nprint(S)', 'A,B,T=map(int,input().split())\ntime=(T+0.5)//A\nS=int(B*time)\nprint(S)\n'] | ['Wrong Answer', 'Accepted'] | ['s505649573', 's140434585'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 70] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.