TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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?

Submission attempts (in order):
import math

N/x=math.ceil(a)
a*T=aa

print(aa)

n,x,t = input().split()

b = -(-int(n)//int(x))
a = b*int(t)

print(a)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T = map(int, raw_input().split())

for i in range(1001):
    if i * X >= N:
        print (i * T)
        break


N, X, T = map(int, input().split())

for i in range(1001):
    if i * X >= N:
        print (i * T)
        break


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
a,b,c=map(int,input().split())
s=k
m=c
while s<a:
  s=s+b
  m=m+c
print(m)

a,b,c=map(int,input().split())
s=b
m=c
while s<a:
  s=s+b
  m=m+c
print(m)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int, input().split())
print((n // x + 1) * T)

import math

n, x, t = map(int, input().split())
print(math.ceil(n / x) * t)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t=map(int, input().split())
a=(n/x)
print(a)
if a==type(int):
    a=str(a)
    b=int(a[:a.index(".")])
    print(b*t)
else:
    a=str(a)
    a2=a[a.index("."):]
    if a2=='.0':
        b=int(a[:a.index(".")])
        print(b*t)
    else:
        b=int(a[:a.index(".")])+1
        print(b*t)

n,x,t=map(int, input().split())
a=(n/x)
print(a)
if a==type(int):
    a=str(a)
    b=int(a[:a.index(".")])
else:
    a=str(a)
    a2=a[a.index("."):]
    print(a2)
    if a2=='.0':
        b=int(a[:a.index(".")])
        print(b*t)
    else:
        b=int(a[:a.index(".")])+1
        print(b*t)

n,x,t=map(int, input().split())
a=(n/x)
if a==type(int):
    a=str(a)
    b=int(a[:a.index(".")])
else:
    a=str(a)
    a2=a[a.index("."):]
    if a2=='.0':
        b=int(a[:a.index(".")])
        print(b*t)
    else:
        b=int(a[:a.index(".")])+1
        print(b*t)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T=input().split()
n=int(N)
x=int(X)
t=int(T)
s=t*(((n-(n%x))/x)+1)
print(s)

N,X,T=input().split()
n=int(N)
x=int(X)
t=int(T)
if n%x==0:
  s=int(t*(n/x))
  print(s)
else:
  s=int(t*(((n-(n%x))/x)+1))
  print(s)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t = map(int, input().split())
print(t * (n // x + 1) if n % x == 0 else t * (n // x))

n,x,t = map(int, input().split())
print(t * (n // x + 1) if n % x != 0 else t * (n // x))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T = map(int, input().split())
print(ceil(N / X) * T)

N = int(input())
X = int(input())
T = int(input())
print(ceil(N / X) * T)


N = int(input())
X = int(input())
T = int(input())
if N % X == 0:
  print(N / X * T)
else:
  print(N / X * T + T)

N = int(input())
X = int(input())
T = int(input())
print(ceil(N / X) * T)

N, X, T = map(int, input().split())
if N % X == 0:
  print(N / X * T)
else:
  print((N / X + 1) * T

N, X, T = map(int, input().split())
if N % X == 0:
  print(N / X * T)
else:
  print((N / X + 1) * T)

N, X, T = map(int, input().split())
if N % X == 0:
  print(int(N / X) * T)
else:
  print(int(N / X + 1) * T)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
h,w,m = map(int, input().split())
mp =  [[0 for i in range(h)] for j in range(w)]
for i in range(m):
  l =list(map(int, input().split()))
  mp[l[1]-1][l[0]-1] = 1
mx = 0
for y in range(w):
  for x in range(h):
    cn = 0
    
    for xx in range(h):
      cn += mp[y][xx]
    
    for yy in range(w):
      if yy != y:
        cn += mp[yy][x]
    if cn > mx:
      mx = cn
print(mx)

n,x,t = map(int, input().split())
q,m = divmod(n,x)
if m > 0:
    q += 1
print(q * t)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T = map(int, input().split())

min_time = (N / X + 1) * T

print(min_time)

N, X, T = map(int, input().split())

a = N / X

import math

min_time = math.ceil(a) * T

print(min_time)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
num = input()
le = len(num)
sum=0
for i in range(le):
  sum += int(num[i])
if sum%==0:
  print("Yes")
else:
  print("No")

num = input()
le = len(num)
sum=0
for i in range(le):
  sum += int(num[i])
if sum%9==0:
  print("Yes")
else:
  print("No")


x = input()
le = len(x)
sum = 0
for i in range(le):
  sum+=int(x[i])
print(sum)


import math
n,x,t = map(int,input().split())
c = t*math.ceil(n/t)
print(c)


n,x,t = map(int,input().split())
print(t*(n//t + 1))

import math
n,x,t = map(int,input().split())
c = t*math.ceil(n/x)
print(c)


Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T=map(int,input().split())
a= N/X
b = int(a)
if a-b > 0:
  a = b+1
res = b*T
print(res)

N,X,T=map(int,input().split())
a= N/X
b = int(a)
if a-b > 0:
  b = b+1
res = b*T
print(res)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
s = input()
ans = 0
for x in s:
  ans += int(x)
if ans%9 == 0:
  print("Yes")
else:
  print("No")

n, x, t = map(int, input().split())
a = n//x
if n%x != 0:
  a += 1
print(t*a)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
oc, cap, time = map(int, input().split())
cnt = 0
while oc>0:
    oc -= cap
    cnt += time

print(time)


oc, cap, time = map(int, input().split())
cnt = 0
while oc>0:
    oc -= cap
    cnt += time

print(cnt)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import math
n,x,t = map(int,input().split())
print(math.ceil(n//x)*t)


import math
n,x,t = map(int,input().split())
print(math.ceil(n/x)*t)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
line = input();
N, X, T = line.split(" ")

return (N + X - 1) // X * T

line = input()
N, X, T = line.split(" ")

print((N + X - 1) // X * T)

line = input()

N, X, T = (int(x) for x in line.split(" "))

print((N + X - 1) // X * T)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
x = int(input())
t = int(input())
 
if(n%x==0):
  count = n // x
else:
  count = n // x + 1
 
print(count*t)

n = int(input())
x = int(input())
t = int(input())
 
if(n%x==0):
  count,mod = divmod(n,x)
else:
  count,mod = divmod(n,x)
  count = count + 1
 
print(count*t)

n = int(input())
x = int(input())
t = int(input())

if(n%x==0):
  count = n/x
else:
  count = n/x + 1

print(count*t)

n = int(input())
x = int(input())
t = int(input())
 
if(n%x==0):
  count = n//x
else:
  count = n//x + 1
 
print(count*t)

n = []
n = input().split()
n_1 = int(n[0])
x = int(n[1])
t = int(n[2])
 
if(n_1%x==0):
  count,mod = divmod(n_1,x)
else:
  count,mod = divmod(n_1,x)
  count = count + 1
 
print(count*t)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
import numpy as np
H,W,M=map(int,input().split())

B=np.zeros((H,W))
for i in range(M):
    inp=list(map(int,input().split()))
    B[inp[0]-1][inp[1]-1]=1
BT=B.T
maxmax=0
for i in range(H):
    for j in range(W):
        sumsum=0
        sumsum=np.sum(B[i])+np.sum(BT[j])-B[i][j]
        #print((np.sum(B[i]),np.sum(BT[j]),B[i][j]))
        if maxmax<sumsum:
            maxmax=sumsum
print(int(maxmax))

N,X,T=map(int,input().split())

if N%X==0:
    print(str(((N//X))*T))
else:
    print(str(((N//X)+1)*T))

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T = map(int, input().split())

cnt = N // X

if cnt == 0:
    print(T)
else:
    print(cnt*T)

N, X, T = map(int, input().split())

cnt = N // X
bl  = N % X
if bl == 0:
    print(cnt*T)
else:
    print((cnt+1)*T)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int, input().split())
a = (n + x - 1) // x * t
print a

n, x, t = map(int, input().split())
a = (n + x - 1) // x * t
print(a)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = map(int, input().split())

answer = 0

if N%X == 0:
    S = N/X
    answer = S*T
else:
    S = N / X
    answer = (S+1) * T

print(int(answer))

N,X,T = map(int, input().split())

answer = 0

if N%X == 0:
    S = int(N/X)
    answer = S*T
else:
    S = int(N / X)
    answer = (S+1) * T

print(int(answer))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int, input().split())
print((n // x + 0 if n % x == 0 else 1) * t)

n, x, t = map(int, input())
print((n // x + 1) * t)

n, x, t = map(int, input().split())
print((n // x + (n % x == 0) ? 0 : 1) * t)

n, x, t = map(int, input().split())
print((n // x + (0 if n % x == 0 else 1)) * t)

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int, input().split())

if n%x > 0:
  print(t * (n//x) + 1)
else:
  print(t * (n//x))

  

n, x, t = map(int, input().split())
 
if n%x > 0:
  print(t * (n//x + 1))
else:
  print(t * (n//x))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = map(int,input().split())
ans = (N + X -1) / X * T
print(ans)

N,X,T = map(int,input().split())
ans = (N + (X -1) / X) * T
print(ans)

n, x, t = map(int,input().split())
k = (n + x -1) // x
ans = k * t
print(ans)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t = [int(x) for x in input().split()]
print((n*t)//x)

from math import ceil
n,x,t = [int(x) for x in input().split()]
print(ceil(n/x)*t)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N=20; X=12; T=6
import math
T_total = ( math.ceil( N / X )*T + T )

print (T_total)

import math
T_total = ( math.ceil( N / X )*T )

print (T_total)

NXT = [int(i) for i in input().split(' ')]
import math
T_total = ( math.ceil( NXT[0]/ NXT[1] )*NXT[2] )

print (T_total)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = map(int,input().split())
print(T*(N/X+1))

import math
N,X,T = map(int,input().split())
print(T*math.ceil(N/X))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import math
n, x, t = [int(x) for x in input().split()]
print(math.ceil(n/x*t))

n, x, t = [int(x) for x in input().split()]
print(ceil(n/x*t))

import math
n, x, t = [int(x) for x in input().split()]
print(math.ceil(n/x)*t)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int,input().split())

if n%x==0:
  print((n//x)*t)
else:
  n = n//2 +1
  print(n*t)

n, x, t = map(int,input().split())

if n%x==0:
  print((n//x)*t)
else:
  n = n//x +1
  print(n*t)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t = map(int,input().split())

if n % x == 0:
  print((n // x) * t + t)
else:
  print((n // x) * t)

n,x,t = map(int,input().split())

if n % x != 0:
  print((n // x + 1) * t)
else:
  print((n // x) * t)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import math
n, x, t = map(int, input().split())

print(t * math(n/x))

import math
n, x, t = map(int, input().split())
 
print(t * math.ceil(n/x))

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = map(int, input().split())
a = N/X
if N%X != 0:
  a += 1
return a * T


N,X,T = map(int, input().split())
a = int(N/X)
if N%X != 0:
  a += 1
print(int(a * T))

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T = map(int,input().split())
print(-(-N // x) * t)

N, X, T = map(int,input().split())
print(-(-N // X) * T)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,K,T = map(int,input().split())

print((N//K)*T)

N,K,T = map(int,input().split())

if N%K == 0:
  print((N//K)*T)
else:
  print(((N//K)+1)*T)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t=map(int,input().split())

if n%x=0:
   a=n//x
if n%x!=0:
   a=n//x+1

b=int(a*t)

print(b)


n,x,t=map(int,input().split())

if n%x=o:
   a=n//x
else:
   a=n//x+1

b=a*t

print(b)


n,x,t=map(int,input().split())

if n%x=0:
   a=int(n//x)
else:
   a=int(n//x+1)

b=int(a*t)

print(b)


n,x,t=map(int,input().split())

if n%x=0:
   a=int(n//x)
if n%x!=0:
   a=int(n//x+1)

b=int(a*t)

print(b)


n,x,t=map(int,input().split())

if n%x=0:
   a=n//x
else:
   a=n//x+1

b=a*t

print(b)


n,x,t=map(int,input().split())

if n%x=0:
   a=n//x
else:
   a=n//x+1

b=int(a*t)

print(b)


n,x,t=map(int,input().split())

if n%x==0:
   a=int(n//x)
else:
   a=int(n//x+1)

b=int(a*t)

print(b)


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
#A - Takoyaki
N,X,T = map(int,input().split())
Time = int(X / N + 1) * T

print(Time)


#A - Takoyaki
N,X,T = map(int,input().split())
Time = (int(N / X ) ) * T
amari = N % X
if amari != 0 :
    Time += T

print(Time)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
#ABC176
#D - Wizard in Maze

h,w=map(int,input().split())
ch,cw=map(int,input().split())
dh,dw=map(int,input().split())
b=[ch-1,cw-1]
a,c,d,f=[],[],[],[]
c.append(b)
d.append(b)
y=0

for i in range(h):
  a.append(list(input()))

warp=0

def def1():
  global c,d
  if 0<=ch1<h and 0<=cw1<w:
    e=[ch1,cw1]
    if a[ch1][cw1]=="." and d not in e:
      c.append(e)
      d.append(e)
def def2():
  global f
  if 0<=ch2<h and 0<=cw2<w:
    e=[ch2,cw2]
    if a[ch2][cw2]=="." and f not in e:
      f.append(e)

while len(c)>0 or len(f)>0 or y==0:
  while len(c)>0 or y==0:
    ch,cw=c[0]
    if ch==dh-1 and cw==dw-1:
        y=1
    if a[ch][cw]==".":
      a[ch][cw]=str(warp)
    c.pop(0)
    ch1,cw1=ch-1,cw
    def1()
    ch1,cw1=ch+1,cw
    def1()
    ch1,cw1=ch,cw-1
    def1()
    ch1,cw1=ch,cw+1
    def1()

    for i in range(5):
      ch2=ch-2+i
      for j in range(5):
        cw2=cw-2+j
        def2()
  for i in f:
    if i not in d:
      c.append(i)
  f=[]
  warp=warp+1
z=a[dh-1][dw-1]
if z==".":
  print(1)
else:
  print(z)

n,x,t=map(int,input().split())
a=n//x

if x*a!=n:
  a=a+1

print(a*t)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):

n, x, t = map(int, input().split())
answer = (n//x)*t
print(answer)


n, x, t = map(int, input().split())
answer = -((-n)//x)*t
print(answer)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import heapq
l=lambda:[int(x) for x in input().split()]
H,W=l()
CH,CW=l()
DH,DW=l()
dh=DH-1
dw=DW-1
S=[[x=='#' for x in list(input())] for _ in range(H)]
q=[(0,0,CH-1,CW-1)]
heapq.heapify(q)
checked=set()
def check(h,w,c):
    if h<0 or h>=H or w<0 or w>=W:
        return
    if S[h][w]:
        return
    p=(abs(dh-h),abs(dw-w))
    heapq.heappush(q,(c,p,h,w))

def main():
    while q:
        c,_,h,w=heapq.heappop(q)
        if h==dh and w==dw:
            return c
        key=(h,w)
        if key in checked:
            continue
        checked.add(key)
        # walk
        check(h-1,w-0,c)
        check(h-0,w-1,c)
        check(h+1,w+0,c)
        check(h+0,w+1,c)
        # warp
        check(h-1,w-1,c+1)
        check(h-1,w+1,c+1)
        check(h+1,w-1,c+1)
        check(h+1,w+1,c+1)
        for i in [-2,+2]:
            for j in range(-2,3):
                check(h+i,w+j,c+1)
                check(h+j,w+i,c+1)
    return -1
print(main())


import math
N,X,T = map(int, input().split())
print(math.ceil(N/X)*T)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = [int(i) for i in input().split()]
print(int(N%X*T))

import math

N,X,T = [int(i) for i in input().split()]
print(math.ceil(N / X) * T)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n=input().split()
a=int(n[0])/int(n[1])
if int(n[0])%int(n[1])!=0:
  a+1
print(a*int(n[2])

import math
n=input().split()
a=int(n[0])/int(n[1])
b=math.floor(a)
print(b)
if int(n[0])%int(n[1])!=0:
  b=b+1
print(b*int(n[2]))  

# coding: utf-8
# Your code here!
import math
n=input().split()
a=int(n[0])/int(n[1])
b=math.floor(a)
if int(n[0])%int(n[1])!=0:
  b=b+1
print(b*int(n[2]))  

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
count = 0
max = A[0]
for i in range (0,N):
    while(max>A[i]):
        count = count + 1
        
       # print(A)
    if(max<=A[i]):
        max = A[i]
      #  print(A)
print(count)

N,X,T = map(int, input().split())

if N%X == 0:
    print(N//X*T)
else:
    print((N//X+1)*T)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = [int(x) for x in input().split()]

c = n / x + 1
print(c * t)

n, x, t = [int(x) for x in input().split()]

a, b = divmod(n, x)

if b:
  print((a+1) * t)
else:
  print(a * t)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = map(int,input().split())
print(-(-N//X*T)

N,X,T = map(int,input().split())
print(N//X*T)

N,X,T = map(int,input().split())
print(-(-N//X)*T)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
h,w,m = map(int,input().split())
hli = [0]*h
wli = [0]*w
li = []
for i in range(m):
    a,b = map(int,input().split())
    li.append([a,b])
    hli[a-1] += 1
    wli[b-1] += 1
a = max(hli)
b = max(wli)
hli2 = []
wli2 = []
for i in range(h):
    if hli[i] == a:
        hli2.append(i+1)
for i in range(w):
    if wli[i] == b:
        wli2.append(i+1)
for i in hli2:
    for j in wli2:
        if [i,j] not in li:
            print(a + b)
            exit()
print(a + b - 1)

n,x,t = map(int,input().split())
if n % x == 0:
    print(n//x*t)
else:
    print((n//x+1)*t)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
X = int(input())
T = int(input())
temp = 0
while (N > 0):
    N = N - X
    temp += 1
print(T*temp)

N, X, T = map(int, input().split())
temp = 0
while (N > 0):
    N = N - X
    temp += 1
print(T*temp)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T  = map(int,input().split())
ans = (N//X + N%X)*T
print(ans)

N, X, T  = map(int,input))
ans = (N//X + N%X)*T
print(ans)

N, X, T  = map(int,input().split())
if N%X == 0:
  print( N//X *T )
else:
  print( ( N//X + 1)*T )

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)

if n % x == 0:
  print((n//x)*t)
else:
  print((n//x)*(t+1))
  


n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)

if n % x == 0:
  print((n//x)*t)
else:
  print((n//x)*t)
  


n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)

print(int(n*t/x))


n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)

print(int(n*t/x))


n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)

if n % x == 0:
  print((n/x)*t)
else:
  print((n//x)*t)
  


n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)

if n % x == 0:
  print((n//x)*t)
else:
  print(int((n//x)*t))
  


n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)

if n % x == 0:
  print((n//x)*t)
else:
  print((n//x)*t+1)
  


n, x, t = input().split()
n = int(n)
x = int(x)
t = int(t)
if n % x == 0:
  print((n//x)*t)
else:
  print((n//x+1)*t)
  


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int, input().split())
print(((n // t) + 1) * x)

n, x, t = map(int, input().split())
if n % x != 0:
	print(((n // x) + 1) * t)
else:
  	print((n // x) * t)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t = input().split()

n = n//x
print(n*t)

n, x, t = list(map(int, input().split()))

n = n//x
print(n*t)

n, x, t = list(map(int, input().split()))

n = math.ceil(n/x)
print(n*t)

import math
n, x, t = list(map(int, input().split()))

n = math.ceil(n/x)
print(n*t)

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = int(input())
print((n//x+1)*t)

n = input()
total = 0
for i in range(len(n)):
  total += int(n[i])
if total % 9 == 0:
  print("Yes")
else:
  print("No")

n, x, t = int(input()).split(" ")
print((n//x+1)*t)

n = int(input())
x = int(input())
t = int(input())
print((n//x+1)*t)

n, x, t = map(int, input())
print((n//x+1)*t)

n, x, t = map(int, input().split())
if n % x == 0:
  print(int(n/x*t))
else:
  print(int((n//x+1)*t))

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
s = int(input().split())
N,X,T =s[0],s[1],s[2]
n = N//X
if N % X != 0:
  n += 1
out = n * T
print(out)


import numpy as np 

s_ = np.array(input().split())
s = [int(i) for i in s_]
N,X,T =s[0],s[1],s[2]
n = N//X
if N % X != 0:
  n += 1
out = n * T
print(out)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = map(int, input().split())
if N % X == 0:
    print((N/X)*T)
else:
    print(((N-N%X)/X+1)*T)

N,X,T = map(int, input().split())
A = int((N/X)*T)
B = int(((N-N%X)/X+1)*T)
if N % X == 0:
    print(A)
else:
    print(B)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import math
n, x, t = (int(i) for i in input().split())
print(math.floor(n/x) * t)

import math
n, x, t = (int(i) for i in input().split())
print(math.ceil(n/x) * t)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int,input().split())
count = 0
while x<n:
  x = x*t
  count+=1
  
print(count*t)

n, x, t = map(int,input().split())
count = 1
if x == n:
    print(t)
    
else:
    temp = x
    ans = t
    while x<n:
        x += temp
        ans+=t
    print(ans)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
a = list(map(int,input().split()))

count = 0
temp = a[0]

for i in range(n):
  if a[i] >= temp:
    temp = a[i]
  else:
    count += temp - a[i]
print(count)

N,T,X = map(int,input().split())
if N % X == 0:
  print(T*N/X)
else:
  print(T*(N//X+1))

N,T,X = map(int,input().split())
if N % X == 0:
  print(T*N//X)
else:
  print(T*(N//X+1))

N,T,X = map(int,input().split())
if N % X == 0:
  print(T*N/X)
else:
  print(T*(N/X+1))


N,T,X = map(int,input().split())
print(T*(N/X + 1))

N,X,T = map(int,input().split())
if N % X == 0:
  print(int(T*N/X))
else:
  print(T*(N//X+1))

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int, input().split())
print(t)

print(int((N+X-1)/X) * T)

N, X, T = map(int, input().split())
print((N / X) * T)

n, x, t = map(int, input().split())
print((n / x) * t)

n, x, t = map(int, input().split())
print(int((n+x-1)/x) * t)

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N =int(input())
N,X,T=map(int,input().split())
if N%T ==0:
    print(NT//X)
else:
    print((N//X+1)*T)

N =int(input())
N,X,T=map(int,input().split())
if N%T ==0:
    print(NT//X)
    else:
        print((N//X+1)*T)

N =int(input())
N,X,T=map(int,input().split())
if N%X ==0:
    print(NT//X)
    else:
        print((N//X+1)*T)

N,X,T=map(int,input().split())
a=(N/x+1)
print(a*T)

N,X,T=map(int,input().split())
if N%X ==0:
  print(NT/x)
else:
  print((N/X+1)*T)

N,X,T=map(int,input().split())
if N%X ==0:
    print(N*T//X)
else:
    print(((N//X)+1)*T)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T = map(int, input().split())

t = N / X
tt = N // X
s = t - X

if s > 0:
  time = T * (tt + 1)
  print(time)

else:
  time = T * t
  print(time)

N, X, T = map(int, input().split())

t = N % X
s = N // X

if t != 0:
  print(T * (s + 1))
  
else:
  print(T * s)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
A,B,C=input().split()
A=int(A)
B=int(B)
C=int(C)
D=A/C
D=int(D)
print((D+1)*B)

A,B,C=input().split()
A=int(A)
B=int(B)
C=int(C)
D=A/B
D=int(D)
if A%B=0:
  print((D)*C)
else:
  print((D+1)*C)

A,B,C=input().split()
A=int(A)
B=int(B)
C=int(C)
D=A/B
D=int(D)
print((D)*C)

A,B,C=input().split()
A=int(A)
B=int(B)
C=int(C)
D=A/B
D=int(D)
if A%B==0:
  print((D)*C)
else:
  print((D+1)*C)

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N, X, T = map(int, input().split())
n=1
while T*n < N//X:
  n+=1

print(T*n)  

N, X, T = map(int, input().split())
n=0
while T*n < N//X:
  n+=1

print(T*n)  

import numpy as np

N, X, T = map(int, input().split())

for n in range(1,1000):
  if T*n >= np.ceil(N/X):
    break
print(T*n)


N, X, T = map(int, input().split())
n=1
while T*n < N/X:
  n+=1

print(T*n)  

import numpy as np

N, X, T = map(int, input().split())

for n in range(1,1000):
    if n>=N/(T*X):
        break
    n+=1

print(T*n)        


import numpy as np

N, X, T = map(int, input().split())

for n in range(1:1000):
  if T*n >= np.ceil(N/X):
    break
print(T*n)  

import numpy as np

N, X, T = map(int, input().split())
n=1
while T*n < np.ceil(N/X):
  n+=1

print(T*n)  

import numpy as np

N, X, T = map(int, input().split())

for n in range(1,1000):
  if T*n >= int(np.ceil(N/X)):
    break
print(T*n)


import numpy as np

N, X, T = map(int, input().split())

for n in range(1,1000):
    if n>=N/X:
        break
    n+=1

print(T*n)


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, x, t = map(int, input().split())

ans = 0

while True:
  if (n - x) <= 0:
    break
  
  if (n - x) > 0:
    ans += t
    n -= x

print(ans)


n, x, t = map(int, input().split())

ans = 0
while True:
  if (n - x) <= 0:
    break
  if (n - x) > 0:
    ans += t
    
print(t)
  

n, x, t = map(int, input().split())

ans = 0

while True:
  if (n - x) <= 0:
    break
  
  if (n - x) > 0:
    ans += t
    n -= x

n, x, t = map(int, input().split())

ans = t

while True:
  if (n - x) <= 0:
    break
  
  if (n - x) > 0:
    ans += t
    n -= x

print(ans)


Verdicts: Wrong Answer

Time Limit Exceeded

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):


import numpy as np

h, w = map(int, input().strip().split())
cx, cy = map(int, input().strip().split())
dx, dy = map(int, input().strip().split())
cx -= 1
cy -= 1
dx -= 1
dy -= 1
qx = [cx]
qy = [cy]

s = [input() for _ in range(h)]
reached = np.zeros((h, w))
for i in range(h):
    for j in range(w):
        if s[i][j] == '.':
            reached[i].append(0)
        if s[i][j] == '#':
            reached[i].append(1)
res = 0

while qx:
    pre_qx = []
    pre_qy = []
    while qx:
        x = qx.pop(0)
        y = qy.pop(0)
        if reached[x][y] == 1:
            continue
        pre_qx.append(x)
        pre_qy.append(y)
        reached[x][y] = 1
        if x > 0 and reached[x-1][y] == 0:
            qx.append(x-1)
            qy.append(y)
        if x < h-1 and reached[x+1][y] == 0:
            qx.append(x+1)
            qy.append(y)
        if y > 0 and reached[x][y-1] == 0:
            qx.append(x)
            qy.append(y-1)
        if y < w-1 and reached[x][y+1] == 0:
            qx.append(x)
            qy.append(y+1)
    if reached[dx][dy] == 1:
        break
    res += 1
    while pre_qx:
        x = pre_qx.pop(0)
        y = pre_qy.pop(0)
        lx = max(x-2, 0)
        rx = min(x+3, h)
        ly = max(y-2, 0)
        ry = min(y+3, w)
        for i in range(lx, rx):
            for j in range(ly, ry):
                if reached[i][j] == 0:
                    qx.append(i)
                    qy.append(j)

if reached[dx][dy] == 0:
    res = -1

print(res)





n, x, t = map(int, input().strip().split())
res = (n-1) // x + 1
res *= t
print(res)




Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
import math

n, x, t = [int(i) for i in input().split(' ')]

ret = math.floor(n/x) * t

print(ret)


import math

n, x, t = [int(i) for i in input().split(' ')]

ret = math.ceil(n/x) * t

print(ret)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t = map(int,input().split())
x = n/x
if x%1 == 0:
    print(int(x)*t)
else:
    print((int(n/x)+1)*t)

n,x,t = map(int,input().split())
x = n/x
if x%1 == 0:
    print(int(x)*t)
else:
    print((int(x)+1)*t)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T = map(int,input().split())
S = X//N
A = X%N
if A == 0:
    print(S*T)
else:
    s = S+1
    print(s*T)

N = int(input())
if N%9 == 0:
    print("yes")
else:
    print("no")

N,X,T = map(int,input().split())
S = N//X
A = N%X
if A == 0:
    print(S*T)
else:
    K = S+1
    print(K*T)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t = map(int,input().split())
print((n*t)//x + 1)


n,x,t = map(int,input().split())
print((n//x)*t if n/x == n//x else (n//x)*t + t)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
total, max, time=map(int, input().split())

print (time*((total/max)+1))


total, max, time=map(int, input().split())

print (time*(total/max)+1)

total, max, time=map(int, input().split())

print (time*int(total/max) if total%max==0 else time*(int(total/max)+1))


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N,X,T=list(map(int,input().split()))

result=N//X*T

if N%X!=0:
    result+=T

print(result)N,X,T=list(map(int,input().split()))

result=N//X*T

if N%X!=0:
    result+=T

print(result)

N,X,T=list(map(int,input().split()))

result=N//X*T

if N%X!=0:
    result+=T

print(result)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n=input()
s=0
for i in n:
  s+=int(i)
print("Yes" if s%9==0 else "No")

MOD = 1000000007
from collections import defaultdict as dd,Counter,deque

def si(): return input()
def ii(): return int(input())
def li(): return list(map(int,input().split()))
def mi(): return map(int,input().split())
def out(v): print(v)
def spout(): print(v,end=" ")
def d2b(n): return bin(n).replace("0b","")
def twod(n,m,num):return [[num for x in range(m)] for y in range(n)]
def vow(): return ['a','e','i','o','u']
def let(): return [chr(i) for i in range(97,123)]
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
def ispow2(x):
    return (x and (not(x & (x - 1))))
def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i: i+=1
        else:
            n //= i
            factors.append(i)
    if n > 1: factors.append(n)
    return (list(factors))
    
    
n,k,t=mi()
if n%k==0: print(t*n)
else: prin(t((n//k)+1)*t)

MOD = 1000000007
from collections import defaultdict as dd,Counter,deque

def si(): return input()
def ii(): return int(input())
def li(): return list(map(int,input().split()))
def mi(): return map(int,input().split())
def out(v): print(v)
def spout(): print(v,end=" ")
def d2b(n): return bin(n).replace("0b","")
def twod(n,m,num):return [[num for x in range(m)] for y in range(n)]
def vow(): return ['a','e','i','o','u']
def let(): return [chr(i) for i in range(97,123)]
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
def ispow2(x):
    return (x and (not(x & (x - 1))))
def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i: i+=1
        else:
            n //= i
            factors.append(i)
    if n > 1: factors.append(n)
    return (list(factors))
    
    
n,k,t=mi()
print(t*(n//k if n%k==0 else n//k+1))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
import math

N, X, T = map(int, input().split())

time = (math.ceil(N // X)) * T

print(time)

import math

N, X, T = map(int, input().split())

time = (math.ceil(N / X)) * T

print(time)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int (input())
X = int (input())
T = int (input())

time = 0

while (N > 0):
    N -= X
    time += T

print(time)


i = list(map(int, input().split()))

time = 0

while (i[0] > 0):
    i[0] -= i[1]
    time += i[2]

print(time)

Verdicts: Runtime Error

Accepted