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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02576 | u881675205 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n, x, t = map(int, input().split())\n\nprint(((n-1)+1)//x*t)\n', 'n, x, t = map(int, input().split())\n\nprint(((n-1)//x+1)*t)\n'] | ['Wrong Answer', 'Accepted'] | ['s594465503', 's306461416'] | [9140.0, 9136.0] | [33.0, 31.0] | [59, 59] |
p02576 | u882869256 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ["a=input().split('')\nn=int(a[0])\nx=int(a[1])\nt=int(a[2])\nf=x\nm=t\nwhile x<n:\n x=x+f\n t=t+m\nprint(t)\n", "a=input().split(' ')\nn=int(a[0])\nx=int(a[1])\nt=int(a[2])\nf=x\nm=t\nwhile x<n:\n x=x+f\n t=t+m\nprint(t)\n"] | ['Runtime Error', 'Accepted'] | ['s550536255', 's880743297'] | [9096.0, 9160.0] | [26.0, 34.0] | [100, 101] |
p02576 | u882950355 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['a = list(map(int,input().split()))\nn = a[0]\nx = a[1]\nt = a[2]\nprint(n,x,t)\n\nif n%x == 0:\n print((int)(n/x)*t)\nelse:\n print((int)(n//x+1)*t)', 'a = list(map(int,input().split()))\nn = a[0]\nx = a[1]\nt = a[2]\n\nif n%x == 0:\n print((int)(n/x)*t)\nelse:\n print((int)(n//x+1)*t)'] | ['Wrong Answer', 'Accepted'] | ['s772231615', 's814938486'] | [9176.0, 9168.0] | [32.0, 33.0] | [141, 128] |
p02576 | u885068064 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ["import math\n\nN, X, T = list(map(int, input().rstrip().split(' ')))\n\nans = math.floor(N / X) * T\n\nprint(ans)", "import math\n\nN, X, T = list(map(int, input().rstrip().split(' ')))\n\nans = math.ceil(N / X) * T\n\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s186017969', 's644860186'] | [9164.0, 9052.0] | [27.0, 33.0] | [107, 106] |
p02576 | u886545507 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ["#abc176b\nN=input()\ns=0\nfor i in range(len(N)):\n s+=int(N[i])\nif s%9==0:\n print('Yes')\nelse:\n print('No')\n", '#abc176a\nimport math\nn,x,t=map(int,input().split())\nprint(math.ceil(float(n)/x)*t)\n'] | ['Runtime Error', 'Accepted'] | ['s502139264', 's786339747'] | [9088.0, 9088.0] | [23.0, 26.0] | [105, 83] |
p02576 | u886610768 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n=input()\nn = int(n)\nx=input()\nx = int(x)\nt=input()\nt=int(t)\nif x == 1:\n count = n\nelse:\n count = n//x \n if n%x == 0:\n pass\n else:\n \u3000\u3000count = count + 1\n\nprint(t*count)', 'n=input()\nn = int(n)\nx=input()\nx = int(x)\nt=input()\nt=int(t)\nif x == 1:\n count = n\nelse:\n count = n//x \n if n%x == 0:\n pass\n else:\n count = count + 1\n\nprint(t*count)', 'n = input()\nn = int(n)\nx = input()\nx = int(x)\nt = input()\nt = int(t)\n\nif x == 1:\n count = n\nelse:\n count = n//x\n if n%x == 0:\n pass\n else:\n count = count + 1\n\nprint(t*count)', 'n=input()\nn = int(n)\nx=input()\nx = int(x)\nt=input()\nt=int(t)\nif x == 1:\n count = n\nelse:\n count = n//x \n if n%x == 0:\n pass\n else:\n count = count + 1\n\nprint(t*count)', 'n=input()\nn = int(n)\nx=input()\nx = int(x)\nt=input()\nt=int(t)\nif x == 1:\n count = n\nelse:\n count = n//x \n if n%x == 0:\n pass\n else:\n count = count + 1\n\nprint(t*count)', 'n=input()\nn = int(n)\nx=input()\nx = int(x)\nt=input()\nt=int(t)\nif x == 1:\n count = n\nelse:\n count = n//x \n if n%x == 0:\n pass\n else:\n count = count + 1\n\nprint(t*count)', 'n,x,t=map(int,input().split())\ncount = n // x\nif n % x == 0:\n pass\nelse:\n count += 1\nprint(count * t)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s020742784', 's070368075', 's293773566', 's420295697', 's433269843', 's990698050', 's058033815'] | [9024.0, 9096.0, 9052.0, 8992.0, 9116.0, 9144.0, 9108.0] | [28.0, 27.0, 26.0, 27.0, 24.0, 25.0, 25.0] | [193, 191, 199, 191, 191, 188, 107] |
p02576 | u886907961 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['import math\nn,x,t = map(int,input().split())\nprint(math.ceil(n//x)*t)', 'import math\nn,x,t = map(int,input().split())\nprint((math.ceil(n/x))*t)'] | ['Wrong Answer', 'Accepted'] | ['s408106576', 's303933230'] | [9104.0, 9080.0] | [30.0, 33.0] | [69, 70] |
p02576 | u891847179 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['print("No"if int(input())%9else"Yes")\n', 'import math\ndef MAP(): return map(int, input().split())\nN, X, T = MAP()\n\nprint(math.ceil(N / X) * T)\n'] | ['Runtime Error', 'Accepted'] | ['s900866972', 's684795170'] | [9060.0, 8988.0] | [24.0, 26.0] | [38, 101] |
p02576 | u892305365 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X, T = list(map(int(input().split())))\n\nprint((N // X + 1) * T)', 'import math\n\nN, X, T = list(map(int, input().split()))\n\nprint(math.ceil(N / X) * T)'] | ['Runtime Error', 'Accepted'] | ['s177236610', 's301613410'] | [8904.0, 9148.0] | [29.0, 33.0] | [66, 83] |
p02576 | u898058223 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n,x,t=map(int,input().split())\nprint(t*(n+(x-1)//t))', 'n,x,t=map(int,input().split())\nprint(t*((n+x-1)//x))'] | ['Wrong Answer', 'Accepted'] | ['s649497703', 's098624170'] | [9156.0, 9144.0] | [27.0, 33.0] | [52, 52] |
p02576 | u898967808 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n,x,t = map(int,input().split())\nprint((n//x)*t)', 'from math import ceil\nn,x,t = map(int,input().split())\nprint(ceil(n/x)*t)'] | ['Wrong Answer', 'Accepted'] | ['s632368896', 's151128386'] | [9100.0, 9032.0] | [29.0, 28.0] | [48, 73] |
p02576 | u901598613 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['a,b,c=map(int,inout().split())\nans=0\nwhile 1:\n if b>0:\n a-=b\n ans+=1\n else:\n break\nprint(ans*c)', 'a,b,c=map(int,input().split())\nans=a/b\nif a%b!=0:\n ans+=1\nprint(ans*c)', 'a,b,c=map(int,input().split())\nans=0\nwhile 1:\n if b>0:\n a-=b\n ans+=1\n else:\n break\nprint(ans*c)', 'n,x,t=map(int,input().split())\nif n%x==0:\n print(int(n/x*t))\nelse:\n print(int(n//x+1)*t)'] | ['Runtime Error', 'Wrong Answer', 'Time Limit Exceeded', 'Accepted'] | ['s172277553', 's457020103', 's965614804', 's257909108'] | [9088.0, 9156.0, 8988.0, 9096.0] | [19.0, 28.0, 2206.0, 32.0] | [122, 73, 122, 94] |
p02576 | u905029819 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N,X,T = input().split()\n\n\nA = ((N // X) + 1 ) * T\nprint(int(A))', 'N,X,T = input(int()).split()\n\nA = ((N // X) + 1 ) * T\nprint(int(A))', 'N,X,T = input(int()).split()\n\nA = ((N // X) + 1 ) * T\nprint(A)', 'N,X,T = input(int()).split()\n\n\nif N % X != 0:\n A = ((N // X) + 1 ) * T\nelse:\n A = (N/X) * T\nprint(int(A))', 'N,X,T = input().split()\n\nN = int(N)\nX = int(X)\nT = int(T)\n\nif N % X != 0:\n A = ((N // X) + 1 ) * T\nelse:\n A = (N/X) * T\nprint(int(A))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s347246116', 's625682973', 's834322364', 's987396377', 's746949340'] | [9004.0, 8980.0, 8996.0, 9064.0, 9068.0] | [26.0, 27.0, 23.0, 20.0, 30.0] | [63, 67, 62, 107, 135] |
p02576 | u905551271 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N = int(input())\nX = int(input())\nT = int(input())\n\na = N // X\nmin_T = T*a\n\nprint(min_T)', 'N, X, T = map(int, input().split())\n\na = N // X\nif N%X == 0\n\tmin_T=T*a\nelse\n\tmin_T = T*(a+1)\n\nprint(min_T)', 'N, X, T = map(int, input().split())\n\na = N // X\nmin_T = T*a\n\nprint(min_T)', 'N = input()\nX = input()\nT = input()\n\na = N//X\nmin_T = T*a\n\nprint(min_T)', 'N, X, T = map(int, input().split())\n\na = N // X\nif N%X == 0:\n\tmin_T=T*a\nelse:\n\tmin_T = T*(a+1)\n\nprint(min_T)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s334304034', 's659465144', 's773410465', 's925506607', 's777977203'] | [9036.0, 8812.0, 9152.0, 9000.0, 9048.0] | [30.0, 27.0, 27.0, 23.0, 29.0] | [88, 106, 73, 71, 108] |
p02576 | u910358825 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n,x,t=map(int, input().split())\nprint(n//x*t+1)', 'import math\nn,x,t=map(int, input().split())\nprint(math.ceil(n/x)*t)'] | ['Wrong Answer', 'Accepted'] | ['s278352171', 's404643617'] | [8940.0, 8916.0] | [26.0, 29.0] | [47, 67] |
p02576 | u913565745 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['import sys\nimport math\n\n\ntest = sys.stdin\n\nresult = math.ceil( test[0] / test[1] ) * test[2]\n\nprint(result)', 'import sys\nimport math\n\n\ntest = int(stdin.readline().rstrip())\n\nresult = math.ceil( test[0] / test[1] ) * test[2]\n\nprint(result)', '\nfrom sys import stdin\nfrom math import ceil\n\nN,X,T = [int(x) for x in stdin.readline().rstrip().split()]\n\nresult = ceil( N / X ) * T\n\nprint(result)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s448675378', 's602287051', 's948000221'] | [9080.0, 9072.0, 9064.0] | [22.0, 23.0, 27.0] | [107, 128, 148] |
p02576 | u914802579 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['I = lambda : list(map(int,input().split()))\nh,w,m=I()\nx={};y={}\nl=[];dic={}\nfor i in range(m):\n a,b=I()\n l.append([a,b])\n dic[(a,b)]=1\n x[a]=x.get(a,0)+1\n y[b]=y.get(b,0)+1\np,q=max(x.values()),max(y.values())\na,b=[i for i in x if x[i]==p],[i for i in y if y[i]==q]\nan=p+q;fl=0\nfor i in a:\n for j in b:\n if dic.get((i,j),-1)==-1:\n fl=1;break\n if fl:\n break\nan-=(fl==0)\nprint(an)', 'n,x,t = map(int,input().split())\nprint((n+x-1)//x*t)'] | ['Runtime Error', 'Accepted'] | ['s987686419', 's244334134'] | [9088.0, 9080.0] | [26.0, 34.0] | [395, 52] |
p02576 | u914883924 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N,M,T=map(int,input().split())\nprint((N//X)*T+1)', 'N,X,T=map(int,input().split())\nprint((N//X)*T+1)', 'N,X,T=map(int,input().split())\nif N%X==0:\n print((N//X)*T)\nelse:\n print(((N//X)*T)+T)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s498594252', 's957820812', 's319765264'] | [9148.0, 9104.0, 9040.0] | [29.0, 36.0, 29.0] | [48, 48, 87] |
p02576 | u916242112 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N ,X, T = map(int,input().split())\n\nif N %X ==0:\n\ta = N // X + 1\nelse:\n\ta = N//X\ntotal = a *T\nprint(total)\n', 'N ,X, T = map(int,input().split())\n\nif N %X ==0:\n\ta = N // X \nelse:\n\ta = N//X+1\ntotal = a *T\nprint(total)\n'] | ['Wrong Answer', 'Accepted'] | ['s688587761', 's933980221'] | [9088.0, 9020.0] | [30.0, 27.0] | [107, 106] |
p02576 | u917558625 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N,X,T=map(int,input().split())\nprint(N//X*T)', 'N,X,T=map(int,input().split())\nif N%X!=0:\n print((N//X+1)*T)\nelse:\n print(N//X*T)'] | ['Wrong Answer', 'Accepted'] | ['s896778299', 's069418568'] | [9052.0, 9060.0] | [28.0, 28.0] | [44, 83] |
p02576 | u918712681 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['A,B,C=map(int, input().split())\ni,j=divmod(A,B)\nif j == 0:\n j=0\nttt=(i+j)*C\nprint(ttt)', 'A,B,C=map(int, input().split())\ni,j=divmod(A,B)\nif j == 0:\n j=0\nelse:\n j=1\nttt=(i+j)*C\nprint(ttt)\n'] | ['Wrong Answer', 'Accepted'] | ['s001025870', 's230507228'] | [9156.0, 9108.0] | [27.0, 29.0] | [87, 100] |
p02576 | u918770092 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n, x, t = map(int, input().split())\nnt = (n + x - 1) / x \nprint(int(nt * t))', 'n, x, t = map(int, input().split())\nnt = (n + x - 1) / x \nans = int(nt) * t\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s270785695', 's072537475'] | [9060.0, 9144.0] | [29.0, 26.0] | [76, 86] |
p02576 | u919519672 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ["probA():\n N, X, T = map(int, input().split())\n\n t = 0\n while N > 0:\n N //= X\n t += T\n print(t)\n\n\ndef main():\n probA()\n\n\nif __name__ == '__main__':\n main()\n", "def probA():\n N, X, T = map(int, input().split())\n\n t = 0\n while N > 0:\n N -= X\n t += T\n print(t)\n\n\ndef main():\n probA()\n\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Accepted'] | ['s364267791', 's510929165'] | [8996.0, 9152.0] | [26.0, 25.0] | [187, 190] |
p02576 | u920391637 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['def main():\n N = int(input())\n A = list(map(int, input().split()))\n \n m = A[0]\n S = 0\n \n for a in A:\n if m - a > 0:\n S += m - a\n if m < a:\n m = a\n \n print(S)\n \n \nif __name__ == "__main__":\n main()', 'import math\n\nline = input()\n\nstrL = line.split()\n\nN = int(strL[0])\nX = int(strL[1])\nT = int(strL[2])\n\nans = math.ceil(N/X) * T\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s222465440', 's541438963'] | [9120.0, 9168.0] | [26.0, 25.0] | [259, 138] |
p02576 | u921033149 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['string = input("Enter your input: ")\nstring = string.split()\nn = int(string[0])\nx = int(string[1])\nt = int(string[2])\n\nif(n%x == 0):\n res = int(n/x) * t\n print(res)\nelse:\n res = (int(n/x) + 1) * t\n print(res)', 'string = input("Enter your input: ")\n\nprint(string)\n\nstring = string.split()\n\n\nn = int(string[0])\nx = int(string[1])\nt = int(string[2])\n\nif(n%x == 0):\n res = int(n/x) * t\n print(res)\nelse:\n res = (int(n/x) + 1) * t\n print(res)', 'string = input()\nstring = string.split()\nn = int(string[0])\nx = int(string[1])\nt = int(string[2])\n\nif(n%x == 0):\n res = int(n/x) * t\n print(res)\nelse:\n res = (int(n/x) + 1) * t\n print(res)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s366850125', 's687553524', 's100547744'] | [9116.0, 9204.0, 8992.0] | [29.0, 32.0, 24.0] | [220, 238, 200] |
p02576 | u922050654 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N,X,T=[int(i) fir i in input().split()]\na=divmod(N,X)\nx=a[0]\nif a[1]<X and a[1] != 0:\n x += 1\nprint(x*T)\n\n ', 'N,X,T=[int(i) for i in input().split()]\na=divmod(N,X)\nx=a[0]\nif a[1]<X and a[1] != 0:\n x += 1\nprint(x*T)\n\n \n'] | ['Runtime Error', 'Accepted'] | ['s467576827', 's322491455'] | [8968.0, 9148.0] | [25.0, 30.0] | [110, 111] |
p02576 | u922769680 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n=int(input())\na_list=list(map(int,input().split()))\nans=0\ntmp=a_list[0]\nfor i in range(n-1):\n if tmp>a_list[i+1]:\n #print(tmp,ans)\n ans+=tmp-a_list[i+1]\n else:\n ans+=tmp-a_list[i]\n tmp=a_list[i+1]\nprint(ans)', 'N,X,T=map(int,input().split())\na=N//T\nif N%T==0:\n print(a*X)\nelse:\n print(a*X+X)', 'N,X,T=map(int,input().split())\na=N//X\nif N%X==0:\n print(a*T)\nelse:\n print(a*T+T)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s651946777', 's716856714', 's440569984'] | [9064.0, 9156.0, 9076.0] | [26.0, 31.0, 33.0] | [242, 82, 86] |
p02576 | u925353288 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X, T = map(int,input().split())\n\nif X != 1:\n print(( N // X ) * T )\nelse:\n print(( N // X + 1 ) * T )', 'N, X, T = map(int,input().split())\n\nif N % x == 0:\n print(( N // X ) * T )\nelse:\n print(( N // X + 1 ) * T )', 'N, X, T = map(int,input().split())\n\nif N % x == 0\n print(( N // X ) * T )\nelse:\n print(( N // X + 1 ) * T )', 'N, X, T = map(int,input().split())\n\nif ( N % x ) == 0:\n print(( N // X ) * T )\nelse:\n print(( N // X + 1 ) * T )', 'print(( N // X + 1 ) * T )', 'N, X, T = map(int,input().split())\n\nif ( N % x )== 0:\n print(( N // X ) * T )\nelse:\n print(( N // X + 1 ) * T )', 'N, X, T = map(int,input().split())\n\nif ( N % x ) == 0:\n print(( N // X ) * T )\nelif ( N % x ) != 0:\n print(( N // X + 1 ) * T )', 'print(( N // X + 1 ) * T )\n', 'N, X, T = map(int,input().split())\n\nA = N % X\n\nif ( A ) == 0:\n print(( N // X ) * T )\nelif ( N % X ) != 0:\n print(( N // X + 1 ) * T )'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s046044894', 's141520971', 's188158701', 's237728648', 's529871262', 's660137976', 's715073603', 's781145172', 's817700554'] | [9164.0, 9164.0, 8944.0, 9092.0, 9080.0, 9104.0, 9104.0, 9004.0, 9168.0] | [27.0, 25.0, 21.0, 23.0, 21.0, 28.0, 23.0, 28.0, 27.0] | [106, 114, 113, 118, 26, 117, 133, 27, 140] |
p02576 | u928347588 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n, x, t = map(int, input().split())\nprint(n*t/x)', 'import math\nn, x, t = map(int, input().split())\nt *= math.ceil(n/x)\nprint(t)\n'] | ['Wrong Answer', 'Accepted'] | ['s215703371', 's530688743'] | [9068.0, 9052.0] | [33.0, 31.0] | [48, 77] |
p02576 | u929793345 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n, x, t = map(int, input().split())\nprint(n//x*t)', 'map(int, input().split())\nprint((n//x+1)*t)', 'n, x, t = map(int, input().split())\nprint((n//x)*t if n%x == 0 else (n//x+1)*t)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s234749243', 's548569953', 's987408863'] | [9148.0, 9080.0, 9032.0] | [31.0, 28.0, 29.0] | [49, 43, 79] |
p02576 | u931769295 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | [', X, T = map(int,input().split())\nn = 0\ntotal = 0\n\nif N % X == 0:\n n = N / X\n total = n * T\nelse:\n n = N // X + 1\n total = n * T\n\nprint(int(total))', 'N, X, T = map(int,input().split())\nn = 0\n\nif N % X == 0:\n n = N / X\nelse:\n n = N // X + 1\n\nprint(int(n * T))'] | ['Runtime Error', 'Accepted'] | ['s667405619', 's168094805'] | [8984.0, 9116.0] | [22.0, 31.0] | [159, 114] |
p02576 | u933650305 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['print(0)', 'n,x,t=map(int,input().split())\nif n%x==0:\n print(n*t//x)\nelse:\n print(((n//x)+1)*t)'] | ['Wrong Answer', 'Accepted'] | ['s503128781', 's609071577'] | [8876.0, 9152.0] | [28.0, 29.0] | [8, 85] |
p02576 | u939947474 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X, T=input().split()\nprint((int(N)/int(X) + int(N)%int(X))*int(T))', 'N,X,T = input().split()\nM = 1 if int(N)%int(X) else 0\nH = int(N)/int(X)\nprint((int(H) + M)*int(T))'] | ['Wrong Answer', 'Accepted'] | ['s341778700', 's890962310'] | [9028.0, 9100.0] | [28.0, 24.0] | [69, 98] |
p02576 | u942356554 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['import collections\nh, w, m = map(int, input().split())\nL_g = []\nL_r = []\nL = []\nfor i in range(m):\n a, b = map(int, input().split())\n L_g.append(a)\n L_r.append(b)\n L.append((a, b))\nc1 = collections.Counter(L_g)\nc2 = collections.Counter(L_r)\n\nL1 = c1.most_common()\nL2 = c2.most_common()\n\ns = L1[0][1]\nbL1 = []\nd = 0\nfor i in range(len(L1)):\n if L1[i][1] == s:\n bL1.append(L1[i])\n d += 1\n if d == 3:\n break\n else:\n break\ns = L2[0][1]\nbL2 = []\nd = 0\nfor i in range(len(L2)):\n if L2[i][1] == s:\n bL2.append(L2[i])\n d += 1\n if d == 3:\n break\n else:\n break\nbL = []\nfor i in range(len(bL1)):\n for j in range(len(bL2)):\n bL.append((bL1[i][0], bL2[j][0]))\nflag = 0\nfor e in bL:\n if e not in L:\n bom = e\n flag = 1\n break\nif flag == 0:\n bom = bL[0]\n\nt = L1[0][1]+L2[0][1]\n\nif flag == 0:\n t -= 1\nprint(t)', 'n,x,t = map(int, input().split())\nif n%x == 0:\n print((n//x)*t)\nelse:\n print((n//x + 1)*t)'] | ['Runtime Error', 'Accepted'] | ['s270612055', 's093448976'] | [9380.0, 9156.0] | [35.0, 27.0] | [934, 92] |
p02576 | u942388574 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['# -*- coding: utf-8 -*-\n"""\nCreated on Sat Aug 22 20:59:55 2020\n\n@author: naoki\n"""\n\nN,X,T = map(int,input().split())\ni=0\ntime = 0\nwhile N >= X*i:\n time = T*i\n i+=1\n \nprint(time)\n ', '# -*- coding: utf-8 -*-\n"""\nCreated on Sat Aug 22 20:59:55 2020\n\n@author: naoki\n"""\nimport sys \n\nN,X,T = map(int,input().split())\n\nfor i in range(N):\n if N<=X*(i+1):\n time = T*(i+1)\n print(time)\n sys.exit\n ', '# -*- coding: utf-8 -*-\n"""\nCreated on Sat Aug 22 20:59:55 2020\n\n@author: naoki\n"""\nimport sys \n\nN,X,T = map(int,input().split())\n\nfor i in range(N):\n if X*i<N and N<=X*(i+1):\n time = T*(i+1)\n print(time)\n sys.exit\n '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s353452515', 's938574716', 's525157895'] | [9052.0, 9176.0, 9052.0] | [32.0, 36.0, 28.0] | [192, 233, 243] |
p02576 | u945342410 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['s = input().split()\nN = int(s[0])\nX = int(s[1])\nT = int(s[2])\nif N%X == 0:\n print((N//X)*T)\nelse:\n print((N/X+1)*T)\n', 's = input().split()\n\nN = int(s[0])\nX = int(s[1])\nT = int(s[2])\n\nprint(((N/X)+1)*T)', 's = input().split()\nN = int(s[0])\nX = int(s[1])\nT = int(s[2])\nif N%X == 0:\n print((N//X)*T)\nelse:\n print((N//X+1)*T)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s242869421', 's638174846', 's035510277'] | [9160.0, 9156.0, 9112.0] | [26.0, 30.0, 31.0] | [118, 82, 119] |
p02576 | u949141002 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['a = input("N X T").split()\nn = int(a[0])\nx = int(a[1])\nt = int(a[2])\nans = (n // x) * t\nif n % x > 0:\n ans += t\nprint(ans)', 'a = input("").split()\nn = int(a[0])\nx = int(a[1])\nt = int(a[2])\nans = (n // x) * t\nif n % x > 0:\n ans += t\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s913292785', 's432388840'] | [9132.0, 9096.0] | [27.0, 29.0] | [125, 120] |
p02576 | u949327459 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['import math\n\nN, X, T = map(int,input().split())\n\ncount = math.ceil(N/X);\n\nans = count*T', 'import math\n\nN, X, T = map(int,input().split())\n\ncount = math.ceil(N/X);\n\nans = count*T\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s158277798', 's521922908'] | [9132.0, 9148.0] | [28.0, 29.0] | [87, 100] |
p02576 | u951502681 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ["a,b,c=map(int, input('N,X,T=').split())\n\nif a%b==0:\n Q=a//b\n \nelse:\n Q=a//b+1\n \nprint(Q*c)\n\n", "a,b,c=map(int, input('N,X,T=').split())\n\nif a%b==0:\n Q=a//b\n \nelse:\n Q=a//b+1\n \nprint(Q*c)\n\n", 'a,b,c=map(int, input().split())\n\nif a%b==0:\n Q=a//b\n \nelse:\n Q=a//b+1\n \nprint(Q*c)\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s736291632', 's861132998', 's259608669'] | [9108.0, 9100.0, 8992.0] | [28.0, 25.0, 24.0] | [198, 198, 190] |
p02576 | u953655640 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['H, W, M = map(int, input().split())\nB = []\nc={}\nd={}\n\nfor i in range(M):\n b = list(map(int, input().split()))\n if b[0] not in c.keys():\n c[b[0]] =1\n else:\n c[b[0]] +=1\n \n if b[1] not in d.keys():\n d[b[1]] =1\n else:\n d[b[1]] +=1\n B.append(b)\n\n\nc_max =max(c.values())\ncc = [kv[0] for kv in c.items() if kv[1] == c_max]\nd_max= max(d.values())\ndd = [kv[0] for kv in d.items() if kv[1] == d_max]\n#print(c_max,d_max)\n#print(cc,c_max,dd,d_max)\nif c_max == H and d_max== W:\n print((c_max+d_max)-1)\nelse: \n for i in range (len(cc)):\n for n in range(len(dd)):\n #print(i, n, cc[i], dd[n])\n if [cc[i], dd[n]] not in B:\n print(c_max+d_max)\n break\n \n if i == len(cc)-1 and n == len(dd)-1:\n print((c_max+d_max)-1)', 'n, x, t = map(int, input().split())\n\nif n % x !=0:\n a = ((n // x)+1) * t \nelse:\n a=(n//x)*t\nprint(a)'] | ['Runtime Error', 'Accepted'] | ['s582792916', 's490760902'] | [9160.0, 9084.0] | [28.0, 32.0] | [874, 106] |
p02576 | u954488273 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['a,b,c=list(map(int,input().split()))\nd=a//b\nprint(int(d*c))', 'a,b,c=list(map(int,input().split()))\n\nprint(int((a//b)*c))', 'a,b,c=list(map(int,input().split()))\n\nif a%b== 0:\n d=a//b\nelse:\n d=a//b+1\n\nprint(int(d*c))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s273172689', 's758861610', 's945742185'] | [9156.0, 9148.0, 9096.0] | [36.0, 30.0, 25.0] | [59, 58, 92] |
p02576 | u955653863 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['A, B, C = map(int, input().split())\n\nZ = N/X-N%X\ntime = Z*T\n\nprint(time)', 'var N = 20;\nvar X = 12;\nvar T = 6;\nvar Z = N/X-N%T;\nvar time = Z*T;\nprint(time);', 'A, B, C = map(int, input().split())\n\nZ = A/B-A%B\ntime = Z*C\n\nprint(time)', 'A, B, C = map(int, input().split())\n\nZ = A//B\ntime = Z*C\n\nprint(time)', 'var Takoyaki = [N,X,T]\nN = 20 \nX = 12\nT = 6\nN / X -- N % X = Z\nZ*T = time\nprint(time)', 'A, B, C = map(int, input().split())\n\nif A%B == 0:\n\tZ = A//B\nelse :\n Z = A//B + 1\ntime = Z*C\n\nprint(time)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s069716797', 's532008394', 's552735106', 's614725812', 's815826134', 's242664765'] | [9092.0, 8968.0, 9084.0, 9048.0, 8904.0, 9092.0] | [21.0, 29.0, 27.0, 33.0, 29.0, 32.0] | [72, 80, 72, 69, 85, 107] |
p02576 | u955699148 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N,X,T=map(float,input().split())\nimport math \nA=N/X \nA= math.ceil(A)\nprint(A*T)', 'N,X,T=map(float,input().split())\nimport math \nA=N/X \nA= math.ceil(A)\nB=A*T\nprint(int(B))'] | ['Wrong Answer', 'Accepted'] | ['s193640836', 's603912266'] | [9088.0, 9024.0] | [27.0, 30.0] | [79, 88] |
p02576 | u956318161 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X, T = map(int,inout().split())\ntakoyakitime=math.ceil(N/T/X)\nprint(takoyakitime)', 'N, X, T = map(int,input().split())\ntakoyakitime=math.ceil(N/T/X)\nprint(takoyakitime)', 'import math\nn,x,t = map(int,input().split())\npoint = math.ceil(n/x)\nprint(point*t)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s006253046', 's970931713', 's376223118'] | [8936.0, 9088.0, 9180.0] | [21.0, 20.0, 26.0] | [84, 84, 82] |
p02576 | u961523950 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ["import math\n\nN, X, T = input().split(' ')\nprint(math.ceil(N/X) * T)", "import math\n\nN, X, T = input().split(' ')\nprint(math.ceil(int(N)/int(X)) * int(T))"] | ['Runtime Error', 'Accepted'] | ['s070454298', 's309588876'] | [9016.0, 9164.0] | [25.0, 30.0] | [67, 82] |
p02576 | u962164623 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['import numpy\n\nn = input()\nx = input()\nt = input()\n\nprint((n//x+1)*t)', 'import math\n\nN, x, T = map(int, input().split)\n\nprint(math.ceil(N / x) * T)', 'import math\n\nN,x,t = map(int,input().split)\n\nprint(math.ceil(N / x)*T)', 'import math\n\nN = int(input())\nx = int(input())\nT = int(input())\n\nprint(str(T * math.ceil(N / x)))', 'N = int(intput())\nx = int(input())\nT = int(input())\n\nprint(str(T*floor(N/x)))', '\n\nn = input()\nx = input()\nt = input()\n\nprint((n//x+1)*t)', 'import math\n\nN, x, T = map(int, input().split())\n\nprint(math.ceil(N / x) * T)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s200656834', 's393686142', 's403668490', 's548770666', 's819580446', 's909851280', 's848196712'] | [27020.0, 9036.0, 9032.0, 9164.0, 8972.0, 8996.0, 9096.0] | [119.0, 26.0, 31.0, 26.0, 24.0, 24.0, 28.0] | [68, 75, 70, 97, 77, 56, 77] |
p02576 | u962765087 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N = int(input())\nL = list(map(int, input().split()))\nif N == 1:\n print(0)\nelse:\n x = 0\n for i in range(0,len(L)-1):\n if L[i] > L[i + 1]:\n x = x + (L[i] - L[i + 1])\n L[i + 1] = L[i + 1] + (L[i] - L[i + 1])\n print(x)\n \n\n', 'import sys\ninput = sys.stdin.readline\nN = int(input())\nL = list(map(int, input().split()))\nif N == 1:\n print(0)\nelse:\n x = 0\n for i in range(0,len(L)-1):\n if L[i] > L[i + 1]:\n x = x + (L[i] - L[i + 1])\n L[i + 1] = L[i + 1] + (L[i] - L[i + 1])\n print(x)\n \n\n', 'N, X, T = map(int, input().split())\nif N % X > 0:\n a = (N // X + 1) * T\nelse:\n a = (N // X) * T\n\nprint(a)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s457982333', 's975928068', 's279035783'] | [9168.0, 9032.0, 9148.0] | [29.0, 33.0, 32.0] | [238, 276, 107] |
p02576 | u965397031 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X, T = map(int, input().split())\nimport math\nnumber_of_times = math.ceil(N/X)\ntotal_time = T * number_of_times\nprint(number_of_times)\n', 'N, X, T = map(int, input())\nimport math\nnumber_of_times = math.ceil(N/X)\ntotal_time = T * number_of_times\nprint(number_of_times)\n', 'N, X, T = map(int, input().split())\nimport math\nnumber_of_times = math.ceil(N/X)\ntotal_time = T * number_of_times\nprint(total_time)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s021540644', 's665452292', 's117265596'] | [9068.0, 9076.0, 9088.0] | [29.0, 21.0, 23.0] | [137, 129, 132] |
p02576 | u969993073 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N,X,T=map(int, raw_input().split())\nmod=int((N/X))*T\nif N%X!=0:\n print(mod)\nelse:\n print(mod+T)', 'n,x,t= map(int, input().split())\nif n%x==0:\n print( int((n/x))*t )\nelse:\n print(int((n/x + 1))*(t))'] | ['Runtime Error', 'Accepted'] | ['s507104858', 's373822367'] | [9120.0, 9160.0] | [21.0, 31.0] | [97, 101] |
p02576 | u974190618 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N,X,T = map(int, input().split())\nprint(int(N*T/X))', 'N,X,T = map(int, input().split())\nans = 0\nwhile(N>0):\n N-=X\n ans +=T \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s913265086', 's093054891'] | [9068.0, 9168.0] | [27.0, 27.0] | [51, 82] |
p02576 | u974436134 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X, T = map(int,input().split())\nC=1\n if N%X!=0:\n C=N//X+1\n else:\n C=N//X\n\nprint(C*T)\n \n ', 'N, X, T = map(int,input().split())\n\nprint(N/X*T)', 'N, X, T = map(int,input().split())\nC=1\nif N%X!=0:\n C=N//X+1\nelse:\n C=N//X\n \nprint(C*T)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s281420717', 's813559372', 's748460952'] | [8920.0, 9048.0, 9096.0] | [25.0, 29.0, 28.0] | [105, 48, 93] |
p02576 | u977739722 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X,T= map(int, input().split())\nresult=(N*T)/X\nprint(int(result))', 'N, X,T= map(int, input().split())\nsum=0\nwhile(N>0):\n N-=X\n sum+=1\nprint(T*sum)'] | ['Wrong Answer', 'Accepted'] | ['s389148347', 's005259485'] | [9152.0, 9060.0] | [26.0, 34.0] | [67, 84] |
p02576 | u977982384 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['N, X, T = int( input().split() )\nif int(N) % int(X) != 0 :\n\tprint( ( int(N) // int(X) + 1) * int(T) )\nif int(N) % int(X) == 0 :\n\tprint( (int(N) // int(X) ) * int(T) )\n', "n = input( )\nresult = sum(list(map(int, str(n))))\n\nif result % 9 == 0 :\n print('Yes')\nelse :\n print('No')\n", 'N, X, T = map(int, input().split())\nif int(N) % int(X) != 0 :\n\tprint( ( int(N) // int(X) + 1) * int(T) )\nif int(N) % int(X) == 0 :\n\tprint( (int(N) / int(X) * int(T) )\n', 'N, X, T = map(int, input().split())\nif int(N) % int(X) != 0 :\n\tprint( ( int(N) // int(X) + 1) * int(T) )\nif int(N) % int(X) == 0 :\n\tprint( (int(N) // int(X) ) * int(T) )\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s216256907', 's297192540', 's680665908', 's048152982'] | [9048.0, 9064.0, 9016.0, 9044.0] | [27.0, 25.0, 27.0, 31.0] | [167, 112, 167, 170] |
p02576 | u990679153 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n,x,t=map(int,input().split())\nprint((n+x-1)//(x*t))', 'N, X, T = map(int, input().split())\n\nprint((N + X - 1) // X * T)'] | ['Wrong Answer', 'Accepted'] | ['s163037994', 's993340787'] | [9160.0, 9080.0] | [28.0, 24.0] | [52, 64] |
p02576 | u991641236 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n,x,t=map(int,input().split())\ny=ceil(n/x)\nprint(y*t)\n', 'from math import ceil\nn,x,t=map(int,input().split())\ny=ceil(n/x)\nprint(y*t)'] | ['Runtime Error', 'Accepted'] | ['s917541707', 's142570451'] | [9148.0, 9112.0] | [30.0, 25.0] | [54, 75] |
p02576 | u995163736 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['n, x, t = map(int, input())\nans = n//x \nif n%x != 0:\n ans += 1\nprint(int(ans)*t)', 'n, x, t = map(int, input().split())\nans = n//x \nif n%x != 0:\n ans += 1\nprint(int(ans)*t)\n'] | ['Runtime Error', 'Accepted'] | ['s105371818', 's564617532'] | [9156.0, 9144.0] | [29.0, 35.0] | [81, 90] |
p02576 | u997648604 | 2,000 | 1,048,576 | Takahashi loves takoyaki - a ball-shaped snack. With a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make. How long does it take to make N takoyaki? | ['#! /usr/bin/env python3\n# -*- coding: utf-8 -*-\nimport sys\nimport os\nf = open(\'/Users/yuigawada/Desktop/競プロ/Atcoder/input.txt\', \'r\')\nsys.stdin = f\n\n\nimport itertools\nimport numpy as np\nimport fractions\nfrom itertools import combinations\nfrom functools import reduce\nfrom functools import lru_cache\nimport math\nfrom collections import deque\nimport decimal\nimport bisect\nimport heapq\n# ---*- start -*--- #\nimport math\nimport sys\nsys.setrecursionlimit(10**9)\n\n\n\ndef mi(): return map(int,input().split())\ndef ii(): return int(input())\ndef isp(): return input().split()\ndef deb(text): print("-------\\n{}\\n-------".format(text))\n\nINF=10**20\ndef solve(N,X,T):\n print(T*math.ceil(N/X))\n return\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) # type: int\n X = int(next(tokens)) # type: int\n T = int(next(tokens)) # type: int\n solve(N, X, T)\n\n\n\nif __name__ == "__main__":\n main()\n', '#! /usr/bin/env python3\n# -*- coding: utf-8 -*-\nimport itertools\nimport numpy as np\nimport fractions\nfrom itertools import combinations\nfrom functools import reduce\nfrom functools import lru_cache\nimport math\nfrom collections import deque\nimport decimal\nimport bisect\nimport heapq\n# ---*- start -*--- #\nimport math\nimport sys\nsys.setrecursionlimit(10**9)\n\n\n\ndef mi(): return map(int,input().split())\ndef ii(): return int(input())\ndef isp(): return input().split()\ndef deb(text): print("-------\\n{}\\n-------".format(text))\n\nINF=10**20\ndef solve(N,X,T):\n print(T*math.ceil(N/X))\n return\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) # type: int\n X = int(next(tokens)) # type: int\n T = int(next(tokens)) # type: int\n solve(N, X, T)\n\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s645339035', 's848571376'] | [8908.0, 27268.0] | [24.0, 114.0] | [1043, 933] |
p02577 | u000037600 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['a=list(input())\ncnt=0\nfor i in a:\n b=int(i)\n cnt=(cnt+b)//9\nif cnt==0:\n print("Yes")\nelse:\n print("No")', 'a=list(input())\ncnt=0\nfor i in a:\n b=int(i)\n cnt=(cnt+b)%9\nif cnt==0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s746873880', 's347094175'] | [10612.0, 10540.0] | [79.0, 83.0] | [107, 106] |
p02577 | u004823354 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['n = int(input())\ns = 0\nfor i in n:\n s += n[i]\nif s % 9 == 0:\n print("Yes")\nelse:\n print("No")\n ', 'n = int(input())\ns == 0\nfor i in n:\n s += n[i]\nif s % 9 == 0:\n print("Yes")\nelse:\n print("No")\n ', 'n = int(input())\ns == 0\nfor i in n:\n s += i\nif s % 9 == 0:\n print("Yes")\nelse:\n print("No")\n ', 's = input()\nsum = 0\nfor i in s:\n sum+=int(i)\nif sum%9==0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s359016519', 's469891149', 's963571019', 's023690382'] | [9156.0, 9240.0, 9320.0, 9152.0] | [203.0, 202.0, 201.0, 65.0] | [99, 100, 97, 93] |
p02577 | u007637377 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['n=input()\nk=0\nfor m in n:\n k += int(m) % 9\nprint("Yes" if k == 0 else "No")', 'n=input()\nk=0\nfor m in n:\n k += int(m) % 9\nprint("Yes" if k % 9 == 0 else "No")\n'] | ['Wrong Answer', 'Accepted'] | ['s172754309', 's854647117'] | [9120.0, 9176.0] | [68.0, 72.0] | [76, 81] |
p02577 | u013513417 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['import sys\nimport copy\ninput = sys.stdin.readline\n\nS=input()\nL=len(S)\n\ngoukei=0\nfor i in range(L):\n goukei+=int(S[i])\n\nif goukei%9==0:\n print("Yes")\nelse:\n print("No")', 'S=input()\nL=len(S)\n\ngoukei=0\nfor i in range(L):\n goukei+=int(S[i])\n\nif goukei%9==0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s621941773', 's439887464'] | [9508.0, 9268.0] | [80.0, 75.0] | [176, 125] |
p02577 | u014386369 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['N=int(input())\n\nresult=sum(list(map(int, str(N))))\nif result==9:\n print("Yes")\nelse:\n print("No")\n ', 'N=int(input())\n\nresult=sum(list(map(int, str(N))))\nif result%9==0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s145927527', 's671012609'] | [11096.0, 11016.0] | [747.0, 750.0] | [108, 105] |
p02577 | u018679195 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['x = input()\nalist = list(map(int,x))\nresult = sum(alist)\nif result%9 == 0 :\n print("yes")\nelse:\n print("no")', 'x = input()\nfor i in range(5):\n\n alist = list(map(int,x))\n result = sum(alist)\n x = str(result)\n\nif result % 9 == 0 :\n print("yes")\nelse:\n print("no")', 'big = str(input())\nnum = 0\nfor x in range(len(big)):\n num += int(big[x])\nif num % 9 == 0:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s295747081', 's544608172', 's955244333'] | [10568.0, 10640.0, 9196.0] | [48.0, 50.0, 76.0] | [114, 165, 132] |
p02577 | u020445457 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['N = input()\nif N % 9 == 0:\n print("Yes")\nelse :\n print("No")', 'N = int(input())\nif N % 9 == 0:\n print("Yes")\nelse :\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s392787295', 's153352670'] | [9308.0, 9148.0] | [26.0, 206.0] | [66, 71] |
p02577 | u037972512 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['inputs = int(input())\n\nif (inputs // 9) == 0:\n print("Yes")\nelse:\n print("No")', 'inputs = int(input())\n\nif (inputs % 9) == 0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s959918660', 's286824331'] | [9308.0, 9184.0] | [219.0, 215.0] | [84, 83] |
p02577 | u039304781 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['N =int(input())\nlst = []\n\nN = str(N)\n\nlist_num = list(N)\n\nN = [int(s) for s in list_num]\nans = sum(N)\n\nif ans % 9 == 0:\n print("yes")\nelse:\n print("No")\n', 'N =int(input())\nlst = []\nwhile N > 0:\n lst.append(N%10)\n N //= 10 \nlst.reverse()\n\nans = sum(lst)\n\nif ans % 9 == 0:\n print("yes")\nelse:\n print("No")', 'N =int(input())\nlst = []\n\nN = str(N)\n\nlist_num = list(N)\n\nN = [int(s) for s in list_num]\nans = sum(N)\n\nif ans % 9 == 0:\n print("yes")\nelse:\n print("No")', 'N =int(input())\nlst = []\n\nN = str(N)\n\nlist_num = list(N)\n\nN = [int(s) for s in list_num]\nans = sum(N)\n\nif ans % 9 == 0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s060879938', 's164175342', 's483350685', 's242627471'] | [12616.0, 9248.0, 12640.0, 12516.0] | [759.0, 2205.0, 763.0, 714.0] | [161, 161, 154, 154] |
p02577 | u047679381 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['import sys\nli = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\nrw = lambda : sys.stdin.readline().strip().split()\nni = lambda : int(sys.stdin.readline().strip())\nnsi = lambda : sys.stdin.readline().strip()\n\nfrom collections import defaultdict as df\nimport math\ns=input()\nsum=0\nfor i in s:\n sum+=int(i)\n\nif(sum%9==0):\n print("YES")\nelse:\n print("NO")\n', 'import sys\nli = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\nrw = lambda : sys.stdin.readline().strip().split()\nni = lambda : int(sys.stdin.readline().strip())\nnsi = lambda : sys.stdin.readline().strip()\n\nfrom collections import defaultdict as df\nimport math\nn=ni()\nif(n==0):\n sum=0\nelif(n%9==0):\n sum=9\nelse:\n sum=n%9\n\nif(sum%9==0):\n print("YES")\nelse:\n print("NO")\n', 'import sys\nli = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\nrw = lambda : sys.stdin.readline().strip().split()\nni = lambda : int(sys.stdin.readline().strip())\nnsi = lambda : sys.stdin.readline().strip()\n\nfrom collections import defaultdict as df\nimport math\ns=input()\nsum=0\nfor i in s:\n sum+=int(i)\n\nif(sum%9==0):\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s339970193', 's982863792', 's737067721'] | [9644.0, 9636.0, 9588.0] | [72.0, 211.0, 74.0] | [387, 412, 387] |
p02577 | u053856575 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['def inp():\n return input()\ndef iinp():\n return int(input())\ndef inps():\n return input().split()\ndef miinps():\n return map(int,input().split())\ndef linps():\n return list(input().split())\ndef lmiinps():\n return list(map(int,input().split()))\ndef lmiinpsf(n):\n return [list(map(int,input().split()))for _ in range(n)]\n\nn = inp()\nm = int(n)\n\nfor i in range(len(n)):\n ans += (m % 10)\n m //= 10\n\nans %= 9\n\nif ans == 0:\n print("Yes")\nelse:\n print("No")', 'def inp():\n return input()\ndef iinp():\n return int(input())\ndef inps():\n return input().split()\ndef miinps():\n return map(int,input().split())\ndef linps():\n return list(input().split())\ndef lmiinps():\n return list(map(int,input().split()))\ndef lmiinpsf(n):\n return [list(map(int,input().split()))for _ in range(n)]\n\nn = inp()\nm = int(n)\n\nans = 0\n\nfor i in range(len(n)):\n ans += int(n[i])\n\nans %= 9\n\nif ans == 0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s856797586', 's940034126'] | [9176.0, 9284.0] | [201.0, 246.0] | [478, 475] |
p02577 | u054825571 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['print("Yes" if int(input())%9==o else "No")', 'n=sum([int(c) for c in input()])\nprint("Yes" if n%9==0 else "No")'] | ['Runtime Error', 'Accepted'] | ['s001707820', 's803900798'] | [9260.0, 10832.0] | [201.0, 56.0] | [43, 65] |
p02577 | u054966391 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['n=int(input()) \nl=0\nfor i in range(len(str(n))): \n l=l+int(n[i])\nif((l%9)==0): \n print("Yes") \nelse: \n print("No") \n \n', 'n=int(input()) \nl=[] \nfor i in range(len(str(n))): \n l.append(int(n[i])) \nif((sum(l)%9)==0): \n print("Yes") \nelse: \n print("No") \n ', 'n=input() \nl=[] \nfor i in range(len(str(n))): \n l.append(int(n[i])) \nif((sum(l)%9)==0): \n print("Yes") \nelse: \n print("No") \n \n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s459460856', 's902661539', 's600857240'] | [9320.0, 9180.0, 10876.0] | [724.0, 684.0, 78.0] | [123, 136, 131] |
p02577 | u058007948 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['def fun(x):\n sum=0\n while(x):\n sum=sum+ x%10\n x=x/10\n return sum\nn=int(input())\nx=n;\nwhile(x>=10):\n x=fun(x)\n \nif x%9==0:\n print("Yes")\nelse:\n print("No")\n \n', 'x=int(input())\n \nif x%9==0:\n print("Yes")\nelse:\n print("No")\n \n'] | ['Runtime Error', 'Accepted'] | ['s388536381', 's690193513'] | [9344.0, 9076.0] | [205.0, 206.0] | [171, 67] |
p02577 | u058268297 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['n=int(input())\nif(n%9==0):\n print("Yes")\nelse:\n print("No)', 'n=int(input())\nif(n%9==0):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s205167165', 's647932484'] | [9016.0, 9304.0] | [28.0, 209.0] | [60, 62] |
p02577 | u061835391 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["n=int(input())\ns=0\nc=0\nwhile n>0:\n r=n%10\n s=s+r\n n=n//10\n if s%9==0:\n continue\n else:\n c=1\n print('No')\n break\nif not c:\n print('Yes')\n", "n=input()\nu=sum(map(int, str(n)))\nif u%9==0:\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s607234677', 's491046181'] | [9264.0, 9120.0] | [2206.0, 50.0] | [154, 80] |
p02577 | u067273593 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['#N = int(input()).split()\nn = 12141.split()\nprint(n[0])', 'N = int(input())\nn = str(N)\na = list(n)\n\ncount = 0\n\nfor i in range(len(a)):\n count = count + int(a[i])\n\nif count % 9 == 0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s045393811', 's283330841'] | [8840.0, 10772.0] | [26.0, 733.0] | [55, 158] |
p02577 | u075085722 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['N = input()\ndigits = list(N)\n\nsum = 0\nfor i in range(len(digits)):\n sum += int(digits[i])\n\nif(sum%9 == 0):\n print("YES")\nelse:\n print("NO")', 'N = input()\ndigits = list(N)\n\nsum = 0\nfor i in range(len(digits)):\n sum += int(digits[i])\n\nif(sum !=0 and sum%9 == 0):\n print("YES")\nelse:\n print("NO")', 'N = input()\ndigits = list(N)\n\nsum = 0\nfor i in range(len(digits)):\n sum += int(digits[i])\n\nif(sum%9 == 0):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s561106744', 's685867712', 's504204034'] | [10556.0, 10672.0, 10616.0] | [85.0, 82.0, 77.0] | [148, 160, 148] |
p02577 | u075303794 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["N=int(input())\n\nif N%9==0:\n print('YES')\nelse:\n print('NO')", "N=int(input())\n\nif N%9==0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s273289662', 's729403208'] | [9240.0, 9208.0] | [221.0, 205.0] | [61, 61] |
p02577 | u076880196 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,=I()\nif sum(n)%9==0:\n print("Yes")\nelse:\n print("No")\n', 'import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn=I()\nif sum(n)%9==0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s782462838', 's361034394'] | [9324.0, 9404.0] | [213.0, 207.0] | [141, 139] |
p02577 | u082861480 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['a = float(input())\nprint("Yes" if (a / 9).is_integer() else "No")\nprint(a/9)', 'a = int(input())\nprint("Yes" if a % 9 == 0 else "No")'] | ['Wrong Answer', 'Accepted'] | ['s459227026', 's625759515'] | [9152.0, 9304.0] | [29.0, 204.0] | [76, 53] |
p02577 | u084014570 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['s=input();\nint sum=0;\nfor i in range(len(s)):\n sum=sum+int(s[i])\nif(sum%9==0):\n print("Yes")\nelse:\n print("No")', 's=input();\nsum=0;\nfor i in range(len(s)):\n sum=sum+int(s[i])\nif(sum%9==0):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s663325762', 's719838185'] | [8720.0, 9224.0] | [25.0, 78.0] | [114, 110] |
p02577 | u084365375 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['N= int(input())\nif N%9 =0:\n print("Yes")\nelse:\n print("No")', 'N= int(input())\nif N%9 ==0\n print("Yes")\nelse:\n print("No")', 'N= int(input())\nif N%9 ==0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s679287913', 's946456797', 's961660740'] | [8960.0, 9004.0, 9224.0] | [28.0, 30.0, 216.0] | [65, 65, 66] |
p02577 | u084573018 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['n = int(input())\nif(n%9==0):\n print("YES")\nelse:\n print("NO")', 'n = float(input())\nif(n%9==0):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\nif(n%9==0):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s083738621', 's168544939', 's873255013'] | [9244.0, 9216.0, 9196.0] | [217.0, 29.0, 216.0] | [67, 69, 67] |
p02577 | u089230684 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['user_input=input("N: ")\ni=len(user_input)-1\nj=int(user_input)\nif j>=10**(200000):\n print("its out of the limit")\nelse:\n number=0\n while i>=0:\n number+=int(user_input[i])\n i=i-1\nif number%9==0:\n print("Yes")\nelse :\n print("no")\n', 'def solve(s):\n suma = 0\n for x in s:\n suma += int(x)\n if suma % 9 == 0:\n return True\n return False\n\ns = input()\nx = solve(s)\nif x == True: print("YES")\nelse: print("NO")', 'user_input=input("N: ")\ni=len(user_input)-1\nj=int(user_input)\nif j>=10**(200000):\n print("its out of the limit")\nelse:\n number=0\n while i>=0:\n number+=int(user_input[i])\n i=i-1\nif number%9==0:\n print("Yes")\nelse :\n print("No")\n', 'x= input()\nreslut = sum(list(map(int,x)))\nif reslut%9 == 0 :\n print("Yes")\nelse:\n print(\'No\')'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s004323957', 's016613607', 's908356045', 's979570492'] | [9560.0, 9148.0, 9628.0, 10592.0] | [265.0, 56.0, 267.0, 50.0] | [256, 179, 256, 99] |
p02577 | u094191970 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["n=input()\nprint('Yes' if n%9==0 else 'No')", "n=int(input())\nprint('Yes' if n%9==0 else 'No')"] | ['Runtime Error', 'Accepted'] | ['s215074055', 's542591090'] | [9196.0, 9240.0] | [27.0, 217.0] | [42, 47] |
p02577 | u097852911 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['x = inoput()\nle = len(x)\nsum = 0\nfor i in range(le):\n sum+=int(x[i])\nprint(sum)', 'num = input()\nle = len(num)\nsum=0\nfor i in range(le):\n sum += int(num[i])\nif sum%9==0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s088197018', 's532752016'] | [8984.0, 8952.0] | [26.0, 73.0] | [80, 122] |
p02577 | u100792685 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['N=int(input())\nif N%9 == 0:\n print(Yes)\nelse:\n print(No)', 'int(input())\nN = input()\nif(N%9=0)\nprint(Yes)\nif(N%9=!0)\nprint(No)', 'N=int(input())\nif N%9 == 0:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s561645089', 's632498923', 's517463771'] | [9196.0, 8844.0, 9156.0] | [213.0, 27.0, 206.0] | [58, 66, 63] |
p02577 | u106413450 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['number = list(map(int,list(input())))\nif sum(number)%9==0:\n print("YES")\nelse:\n print("NO")', 'number = list(map(int,list(input())))\nif sum(number)%9==0:\n print("YES")\nelse:\n print("NO")', 'number = list(map(int,list(input())))\nif sum(number)%9==0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s087926197', 's663630834', 's241909943'] | [12136.0, 11984.0, 12124.0] | [50.0, 58.0, 55.0] | [97, 97, 97] |
p02577 | u110996038 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['n = input()\nif(n % 9 == 0): print("Yes")\nelse : print("No")\n', 'n = int(input())\nif n % 9 == 0:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s045624846', 's271629881'] | [9136.0, 9204.0] | [25.0, 205.0] | [60, 71] |
p02577 | u111559399 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["N=int(input())\nn=str(N)\nlistst=list(n)\nlists=[int(str) for str in listst]\nprint(lists)\nA=sum(lists)\nif A%9==0:\n print('Yes')\nelse:\n print('No')", "N=int(input())\nn=str(N)\nlistst=list(n)\nlists=[int(str) for str in listst]\n#print(lists)\nA=sum(lists)\nif A%9==0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s698555570', 's084461772'] | [13892.0, 12504.0] | [729.0, 714.0] | [149, 150] |
p02577 | u116763463 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['s = input()\nans = 0\nfor x in s:\n ans += int(x)\nif x%9 == 0:\n print("Yes")\nelse:\n print("No")', 's = input()\nans = 0\nfor x in s:\n\tans += int(x)\n\nif ans%9 == 0:\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Runtime Error', 'Accepted'] | ['s164857677', 's969479298'] | [9240.0, 9204.0] | [66.0, 72.0] | [95, 95] |
p02577 | u119015607 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["N=int(input())\n\n\nresult = sum(list(map(int, str(N))))\nif result %9 ==0:\n print('Yes')\nelse:\n print('No'", "N=int(input())\n\n\nresult = sum(list(map(int, str(N))))\nif result %9 ==0:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s755997218', 's672804954'] | [8968.0, 11036.0] | [28.0, 748.0] | [110, 111] |
p02577 | u126127392 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['def digit_sum(n):\n n_lst = list( str(n) )\n n_sum = 0\n for i in range( len(n_lst) ):\n n_sum += int( n_lst[i] )\n return n_sum\n \nn1 = input()\nif digit_sum(n1)%9==0 : print("Yes")\nelse: print("No"', 'def digit_sum(n):\n n_lst = list( str(n) )\n n_sum = 0\n for i in range( len(n_lst) ):\n n_sum += int( n_lst[i] )\n return n_sum\n \nn1 = input()\nif digit_sum(n1)%9==0 : print("Yes")\nelse: print("No")'] | ['Runtime Error', 'Accepted'] | ['s948557625', 's335102320'] | [8980.0, 10392.0] | [28.0, 63.0] | [211, 212] |
p02577 | u130074358 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["N = input()\narray = list(map(int, N))\nS = sum(array)\n\nif S%9 == 0:\n print('YES')\nelse:\n print('NO')", "N = input()\narray = list(map(int, N))\nS = sum(array)\n\nif S%9 == 0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s247085195', 's521911499'] | [10720.0, 10580.0] | [56.0, 54.0] | [101, 101] |
p02577 | u132147074 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['line = input()\n\nlength = len(line)\nsum = 0\nfor i in range(length):\n sum += int(line[i])\n\nif sum % 9 == 0:\n print("yes")\nelse:\n print("no")', 'line = input()\n \nlength = len(line)\nsum = 0\nfor i in range(length):\n sum += int(line[i])\n \nif sum % 9 == 0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s323058624', 's371441489'] | [9188.0, 9144.0] | [75.0, 75.0] | [147, 149] |
p02577 | u140937388 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['# Python profram to check if n is a multiple of 3 \n \n# Function to check if n is a multiple of 3 \ndef isMultipleOf3(n): \n \n odd_count = 0\n even_count = 0\n \n # Make no positive if + n is multiple of 3 \n # then is -n. We are doing this to avoid \n # stack overflow in recursion \n if(n < 0): \n n = -n \n if(n == 0): \n return 1\n if(n == 1): \n return 0\n \n while(n): \n \n # If odd bit is set then \n \n if(n & 1): \n odd_count += 1\n \n # If even bit is set then \n \n if(n & 2): \n even_count += 1\n n = n >> 2\n \n return isMultipleOf3(abs(odd_count - even_count))\nnum=int(input())\nif (isMultipleOf3(num)): \n print("YES") \nelse: \n print("NO") ', 'n=int(input())\nif(n%9==0):\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s586443210', 's833058412'] | [9344.0, 9200.0] | [2206.0, 206.0] | [823, 59] |
p02577 | u144242534 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['target = input()\nsum = 0\nfor each in all:\n sum += int(each)\nif sum % 9 == 0:\n print("Yes")\nelse:\n print("No")', 'if int(input()) % 9 == 0:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s024523408', 's382246834'] | [9252.0, 9300.0] | [25.0, 208.0] | [112, 60] |
p02577 | u153427406 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['\'\'\'\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press "Run" button to execute it.\n\n\'\'\'\n\nip=list(input())\nsum=0\nfor i in ip:\n sum+=int(i)\nif sum%9==0:\n print(\'YES\')\nelse:\n print(\'NO\')', '\'\'\'\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press "Run" button to execute it.\n\n\'\'\'\n\nip=list(input())\nsum=0\nfor i in ip:\n sum+=int(i)\nif sum%9==0:\n print(\'Yes\')\nelse:\n print(\'No\')'] | ['Wrong Answer', 'Accepted'] | ['s730765869', 's431258431'] | [10484.0, 10588.0] | [70.0, 72.0] | [303, 303] |
p02577 | u158415841 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['N = int(input())\nN_letter = str(N)\n\nSUM_N = sum(N_letter)\nif (SUM_N/9) == int(SUM_N/9):\n\tprint("Yes")\nelse:\n\tprint("No")', 'N = int(input())\nN_letter = str(N)\n\nSUM_N = sum(N_letter)\nif int(SUM_N/9) = isinstance(i, int):\n\tprint("Yes")\nelseif:\n\tprint("No")', 'N = int(input())\n\nN_letter = str(N)\nM = (len(N_letter))\nS = 0\nfor i in range(M):\n\tS = S + int(N_letter[i])\n\nif (S/9) == int(S/9):\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s352825424', 's353243641', 's534336789'] | [9220.0, 8880.0, 9264.0] | [685.0, 21.0, 728.0] | [121, 131, 163] |
p02577 | u163320134 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["#!/usr/bin/env python3\n\nimport sys\ninput=sys.stdin.readline\n\ns=input()\nans=0\nfor c in s:\n ans+=int(c)\n ans%=9\nif ans==0:\n print('Yes')\nelse:\n print('No')", "s=input()\nans=0\nfor c in s:\n ans+=int(c)\n ans%=9\nif ans==0:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s674212744', 's968289797'] | [9208.0, 9104.0] | [79.0, 77.0] | [165, 104] |
p02577 | u163874353 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ['n = int(input())\nsum = 0\nfor i in range(len(str(n))):\n sum += (n % 10)\n n //= 10\n \nprint(sum)', 'n = int(input())\nif n % 9 == 0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s997894275', 's512203196'] | [9176.0, 9132.0] | [2206.0, 205.0] | [102, 70] |
p02577 | u166057331 | 2,000 | 1,048,576 | An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9. Determine whether N is a multiple of 9. | ["N = int(input())\n\nif N//9 == 0:\n ans = 'Yes'\nelse:\n ans = 'No'\n\nprint(ans)", "N = int(input())\n\nif N%9 == 0:\n ans = 'Yes'\nelse:\n ans = 'No'\n\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s149048648', 's382740929'] | [9312.0, 9304.0] | [206.0, 215.0] | [76, 75] |
Subsets and Splits