problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s146126088 | Accepted | import math
n, x, t = map(int, input().split())
count = math.ceil(n / x)
time = t * count
print(time) |
p02576 | s421396766 | Accepted | n, x, t = map(int, input().split())
ans = ( (n-1)//x + 1)* t
print(ans) |
p02576 | s623609592 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
print(int(N / X) * T)
else:
print(((N // X) + 1) * T)
|
p02576 | s891985294 | Accepted | n,x,t=map(int,input().split(' '))
if n%x==0:
print((n//x)*t)
else:
print(((n//x)+1)*t)
|
p02576 | s325303535 | Accepted | N, X, T = map(int, input().split())
res = 0
count = 0
while count < N:
res += T
count += X
print(res) |
p02576 | s047179709 | Accepted |
import math
to_make, at_most, batch_time = map(int, input().split())
batches = math.ceil(to_make / at_most)
print(batch_time * batches)
|
p02576 | s331957225 | Accepted | N, X, T = map(int, input().split())
ans = (N + X - 1)//X*T
print(ans) |
p02576 | s255603214 | Accepted | a,b,c=map(int, input().split())
print(((a+b-1)//b)*c) |
p02576 | s518850933 | Accepted | i = input("").split(" ")
ii = [int(a) for a in i]
if ii[0]%ii[1] == 0:
n = (ii[0]//ii[1])
else:
n = (ii[0]//ii[1])+1
print(str(n*ii[2])) |
p02576 | s787723488 | Accepted | import math
n,x,t = map(int,input().split())
num=0
while(num*x<n):
num+=1
print(num*t)
|
p02576 | s972654954 | Accepted | V = input()
N,X,T = V.split()
N = int(N)
X = int(X)
T = int(T)
if(N%X==0):
c = N/X
else:
c = N//X + 1
A = int(c*T)
print(A) |
p02576 | s027989688 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n / x) * t) |
p02576 | s885481445 | Accepted | N,X,T = map(int,input().split())
if N%X == 0:
print(N//X*T)
else:
print((N//X+1)*T) |
p02576 | s327938297 | Accepted | N,X,T = map(int, input().split())
t = 0
while(N>0):
t += 1
N -= X
print(T*t) |
p02576 | s268599258 | Accepted | n, x, t = map(int, input().split())
if n % x > 0:
print(int((n//x + 1) * t))
else:
print(int(n/x * t))
|
p02576 | s403788543 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N/X)*T) |
p02576 | s950279949 | Accepted | N,X,T=(int(x) for x in input().split())
counter=0
while(N>X):
counter+=1
N=N-X
counter+=1
print(counter*T)
|
p02576 | s536177901 | Accepted | N, X, T = map(int, input().split())
print(-(-N//X)*T)
|
p02576 | s288155168 | Accepted | import sys
input =sys.stdin.readline
N,X,T=(int(x) for x in input().rstrip('\n').split())
if N%X==0:
print(T*(N//X))
else:
print(T*(N//X)+T) |
p02576 | s726734161 | Accepted | import math
N, X, T = input().strip().split(' ')
count = math.ceil(int(N)/int(X))
time = int(T) * count
print(time) |
p02576 | s842220554 | Accepted | n, x, t = map(int, input().split())
print((n + x - 1) // x * t) |
p02576 | s381449231 | Accepted | N,X,T = map(int,input().split())
ans = ( (N-1) // X + 1 ) * T
print(ans) |
p02576 | s791995113 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N / X)*T) |
p02576 | s432930895 | Accepted | n,x,t = map(int,input().split())
if n%x == 0:
print(n//x*t)
else:
print((n//x+1)*t) |
p02576 | s150957613 | Accepted | n, x, t = map(int, input().split())
import math
print(t*math.ceil(n/x)) |
p02576 | s332720302 | Accepted | import math
N,X,T = list(map(int,input().split(" ")))
k = math.ceil(N/X)
print(k*T) |
p02576 | s010566019 | Accepted | #!/usr/bin python3
# -*- coding: utf-8 -*-
n, x, t = map(int, input().split())
ret = (n + (x-1))//x
print(ret*t)
|
p02576 | s036164136 | Accepted | import math
N, X, T = map(int, input().split())
ans = int(math.ceil(N / X)) * T
print(ans) |
p02576 | s317787991 | Accepted | input_list = input().rstrip().split(' ')
n = int(input_list[0])
x = int(input_list[1])
t = int(input_list[2])
times = int(n / x)
if n % x != 0:
times += 1
print(times * t)
|
p02576 | s977900281 | Accepted | N,X,T=map(int,input().split())
if N%X==0:
ans=N//X*T
else:
ans=(N//X+1)*T
print(ans) |
p02576 | s395182378 | Accepted | import math
n, x, t = map(int,input().split())
print(math.ceil(n/x)*t) |
p02576 | s125203102 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
times = N / X
else:
times = N // X
times += 1
ans = int(times * T)
print(str(ans))
|
p02576 | s868643297 | Accepted | import math
n, x, t = list(map(int, input().split()))
print(math.ceil(n/x) * t) |
p02576 | s600868963 | Accepted | n, x, t = input().split()
N = int(n)
X = int(x)
T = int(t)
if N % X == 0:
c = N / X
else:
c = int(N / X) + 1
C = int(c)
print(C*T)
|
p02576 | s946510386 | Accepted | n,x,t= map(int,input().split()) #標準入力
if(n%x==0):
num=n//x
else:
num=n//x+1
print(num*t) #焼くセット数*時間を計算して出力(()) |
p02576 | s081981359 | Accepted | N,X,T = map(int,input().split())
if N % X ==0:
a = int(N/X)
print(a*T)
else:
a = int(N/X)+1
print(a*T) |
p02576 | s370986884 | Accepted | n, x, t = map(int,input().split())
if (n%x == 0):
y = n//x*t
print(y)
else:
y = n//x + 1
y = y*t
print(y) |
p02576 | s395978669 | Accepted | n,x,t=map(int,input().split())
count=0
a=0
a=x
if(n<=x):
print(t,end='\n')
elif(x==1):
print((n)*t)
else:
while(x<n):
count=count+1
x=x+a
print((count+1)*t) |
p02576 | s398194567 | Accepted | n,x,t = map(int, input().split())
if n % x ==0:
print((n // x) * t)
else:
print((n // x + 1) * t)
|
p02576 | s830675957 | Accepted | N, X, T = list(map(int, input().split()))
if N%X == 0:
print((N//X)*T)
else:
print((N//X)*T+T) |
p02576 | s726742682 | Accepted | # -*- coding: utf-8 -*-
N, X, T = map(int, input().split())
print((N // X) * T + (T if N % X != 0 else 0)) |
p02576 | s601209536 | Accepted | N, X, T = map(int, input().split())
import math
print(math.ceil(N / X) * T) |
p02576 | s495298648 | Accepted | def read_ints():
return map(int, input().split(' '))
n, x, t = read_ints()
print(((n - 1) // x + 1) * t)
|
p02576 | s833998576 | Accepted | import math
[N, X, T] = input().split()
A = math.ceil(int(N)/int(X))
ans = A*int(T)
print(ans) |
p02576 | s563496651 | Accepted | N, X, T = map(int,input().split())
counter = 0
rem = N
while rem > 0:
rem -= X
counter += 1
print(counter*T)
|
p02576 | s909729543 | Accepted | ## coding: UTF-8
import math
N, X, T = map(int,input().split())
ans = math.ceil(N/X) * T
print(ans)
|
p02576 | s855397668 | Accepted | import math
n,x,t = list(map(int, input().split()))
print(math.ceil(n/x)*t) |
p02576 | s908113734 | Accepted | def cooking_takoyaki(target_num, cook_per, need_time):
div, mod =divmod(target_num, cook_per)
if mod == 0:
return div * need_time
return div * need_time + need_time
if __name__=='__main__':
a, b, c = map(int, input().split())
print(cooking_takoyaki(a, b, c)) |
p02576 | s374925134 | Accepted | # 2020/08/22
# AtCoder Beginner Contest 176 - A
import math
# Input
n, x, t = map(int,input().split())
# Calc
ans = math.ceil((n / x)) * t
# Output
print(ans)
|
p02576 | s148093291 | Accepted | n,x,t = map(int, input().split())
print(t * (n // x + 1) if n % x != 0 else t * (n // x)) |
p02576 | s534597595 | Accepted | import math
n,x,t = map(int,input().split())
ans = t*math.ceil(n/x)
print(ans) |
p02576 | s803404490 | Accepted | # A - Takoyaki
N,X,T = map(int,input().split())
ans = T*((N-1)//X+1)
print(ans) |
p02576 | s904591709 | Accepted | N, X, T = map(int, input().split())
print((N + X - 1) // X * T)
|
p02576 | s396032630 | Accepted | N,X,T=map(int,input().split())
if N//X!=N/X:
print((N//X+1)*T)
else:
print((N//X)*T)
|
p02576 | s158295948 | Accepted | import math
n, x, t = map(int, input().split())
for _ in range(1<<30):
continue
print(math.ceil(n / x) * t) |
p02576 | s393965264 | Accepted | N, X, T = map(int, input().split())
ans = - (- N // X) * T
print(ans) |
p02576 | s794169947 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print(int(n / x * t))
else:
print(int((n // x + 1) * t)) |
p02576 | s937750511 | Accepted | import math
N, X, T = map(int, input().split())
ans = math.ceil(N/X)*T
print(ans) |
p02576 | s630233596 | Accepted | n,x,t = map(int,input().split())
for i in range(1,10**9):
if n <= x*i:
print(i*t)
quit() |
p02576 | s676176658 | Accepted | import math
n,x,t = map(int,input().split())
c = math.ceil(n/x)
print(t*c) |
p02576 | s093140672 | Accepted | import math
n,x,t=map(int, input().split(" "))
print(math.ceil(n / x) * t) |
p02576 | s221351936 | Accepted | import math
N, X, T = [int(i) for i in input().split()]
print(math.ceil(N / X) * T) |
p02576 | s937618272 | Accepted | N,X,T = map(int,input().split())
if N%X == 0:
print((N//X)*T)
else:
print((N//X+1)*T)
|
p02576 | s884096558 | Accepted | import math
a, b, c = map(int,input().split())
d = math.ceil(a / b)
print(d * c) |
p02576 | s777413974 | Accepted |
import math
n, x, t = map(int, input().split())
res = math.ceil(1. * n / x) * t
print(res)
|
p02576 | s849922084 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
total = n // x * t
else:
total = (n// x + 1) * t
print(total) |
p02576 | s409667006 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print((n//x)*t)
else:
print((n//x+1)*t) |
p02576 | s677652958 | Accepted | import sys
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().rstrip()
def main():
N, X, T = map(int, input().split())
c = 0
t = 0
while c < N:
c += X
t += T
print(t)
if __name__ == '__main__':
main() |
p02576 | s043972411 | Accepted | import sys
sys.setrecursionlimit(10**9)
def main():
n, x, t = map(int, input().split())
if n % x == 0:
print((n//x)*t)
else:
print((n//x+1)*t)
return
if __name__ == "__main__":
main() |
p02576 | s358760912 | Accepted | n,x,t=[int(i) for i in input().split()]
k=n//x
if n%x:
print((k+1)*t)
else:
print(k*t) |
p02576 | s295434036 | Accepted | def ceil(a, b):
return -(-a//b)
n,x,t = map(int,input().split())
print(ceil(n, x)*t) |
p02576 | s291692451 | Accepted | n, x, t = map(int, input().split())
m = n//x
if n%x==0:
print(m*t)
else:
print(m*t+t) |
p02576 | s128552245 | Accepted | n, x, y = list(map(int, input().split()))
if n % x == 0:
print((n // x) * y)
else:
print((n // x + 1) * y) |
p02576 | s889299367 | Accepted | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
SI = lambda : sys.stdin.readline().rstrip()
N,X,T = LI()
ans = math.ceil(N/X)*T
print(ans)
if __name__ == '__main__':
main() |
p02576 | s937187009 | Accepted | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N, X, T = MAP()
print(0--N//X*T)
|
p02576 | s395497008 | Accepted | n,x,t=map(int, input().split())
a=(n+x-1)//x
ans=a*t
print(ans) |
p02576 | s725511859 | Accepted | from math import ceil
N, X, T = map(int, input().split())
a = ceil(N / X)
print(a * T)
|
p02576 | s063736187 | Accepted | N, X, T = map(int, input().split())
n = N // X
r = N % X
if r == 0:
print(T * n)
else:
print(T * (n + 1)) |
p02576 | s915938719 | Accepted | import math
n, x, t = map(int, input().split(" "))
out = int(math.ceil(n/x)) * t if x != 0 else 0
print(out) |
p02576 | s706087614 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N/X) * T)
|
p02576 | s774190032 | Accepted | import math
n, x, t = map(int, input().split())
print(t * math.ceil(n / x)) |
p02576 | s144523972 | Accepted | N, X, T = list(map(int, input().split()))
ans = N // X
if N % X != 0:
ans += 1
ans = ans * T
print(ans) |
p02576 | s658908826 | Accepted | n,x,t = map(int, input().split())
if n%x==0:
print((n//x)*t)
else:
print((n//x + 1)*t) |
p02576 | s227113852 | Accepted | N,X,T=map(int,input().split())
s1=int(N/X)
s2=N%X
if s2>0:
print((s1+1)*T)
else:
print(s1*T) |
p02576 | s779770199 | Accepted | a,b,c=map(int,input().split())
d=0
if a%b!=0:
d=1
print((d+a//b)*c)
|
p02576 | s305400861 | Accepted | n,x,t=map(int,input().split())
if n%x==0:
print(t*(n//x))
else:
print(t*(n//x+1)) |
p02576 | s361913894 | Accepted | N, X, T = map(int,input().split())
if N % X == 0:
print((N//X)*T)
else:
print((N//X+1)*T) |
p02576 | s860371153 | Accepted | n, x, t = [int(x) for x in input().split()]
print( (n // x) * t + (n % x > 0) * t )
|
p02576 | s901336199 | Accepted | import collections as cc
import sys
import bisect as bi
I=lambda:list(map(int,input().split()))
n,x,t=I()
print((n+x-1)//x*t) |
p02576 | s036537239 | Accepted | n, x, t = map(int, input().split())
total = int(n / x) * t
total += t if (n % x) > 0 else 0
print(total)
|
p02576 | s361928633 | Accepted | a = list(map(int,input().split()))
b = a[0] // a[1]
c = a[0] % a[1]
if c != 0:
c = 1
ans = (b + c) * a[2]
print(str(ans)) |
p02576 | s248609756 | Accepted | import math
N, X, T = map(int, input().split())
t = int(math.ceil(N/X))
print('{}'.format(t*T))
|
p02576 | s463219999 | Accepted | n, x, t = map(int,input().split())
cnt=0
while True:
n=n-x
cnt+=t
if n<=0:
break
print(cnt) |
p02576 | s169767628 | Accepted | n, x, t = map(int, input().split())
print((n + x - 1) // x * t) |
p02576 | s516096918 | Accepted | n,x,t = map(int, input().split())
times = 0
times = t
while n - x > 0:
n -= x
times += t
print(times) |
p02576 | s573133791 | Accepted | N, X, T = map(int, input().split())
count = 1
check = X
if X > 1:
while True:
value = int(N / X)
re = N % X
if re == 0:
count = value
TotalTime = T * count
break
else:
count += value
TotalTime = T * count
break
else:
TotalTime = T * N
print(TotalTime)
|
p02576 | s914587849 | Accepted | n, x, t = map(int, input().split())
if n % x != 0:
print((n // x + 1) * t)
else:
print(n // x * t)
|
p02576 | s973074265 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n / x) * t) |
p02576 | s643493017 | Accepted | import math
n, x, t = [int(x) for x in input().split()]
ans = math.ceil(n / x) * t
print(ans)
|
p02576 | s631960541 | Accepted | N, X, T = map(int, input().split())
if N%X ==0:
ans = (N // X ) *T
else:
ans = (N // X +1) *T
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.