problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s827031750 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
print((N//X)*T)
else:
print((N//X+1)*T) |
p02576 | s170377958 | Accepted | n,x,t = map(int,input().split())
if n%x==0:
print((n//x)*t)
else:
print(((n//x)+1)*t) |
p02576 | s995141282 | Accepted | N, X, T = map(int, input().split())
print(T * (N//X if N % X == 0 else N//X+1))
|
p02576 | s250082338 | Accepted | nks=input("").split(" ")
n=int(nks[0])
k=int(nks[1])
s=int(nks[2])
a=(n//k)
if(n%k!=0):
a+=1
print(a*s)
|
p02576 | s964206328 | Accepted | N, X, T = map(int, input().split())
steps = (N + X - 1) // X
print(steps*T)
|
p02576 | s012590596 | Accepted | N,X,T = map(int,input().split())
if N%X == 0 :
W = (N//X)*T
else:
W = ((N//X)+1)*T
print(W)
|
p02576 | s201094972 | Accepted | # [] = list(map(int, input().split()))
[n, x, t] = list(map(int, input().split()))
if n % x == 0:
print(n // x * t)
else:
print((n // x + 1) * t)
|
p02576 | s289624787 | Accepted | l = input()
ls = l.split()
N = int(ls[0])
X = int(ls[1])
T = int(ls[2])
if N % X == 0:
cnt = N // X
else:
cnt = N // X +1
print(T*cnt)
|
p02576 | s813911676 | Accepted | N,X,T = [int(hoge) for hoge in input().split()]
print(T*((N-1)//X+1)) |
p02576 | s713776351 | Accepted | import math
def main():
n,x,t = map(int,input().split())
print(math.ceil(n / x) * t)
if __name__ == '__main__':
main()
|
p02576 | s383086268 | Accepted | n,x,t=map(int,input().split())
a=n%x
b=int(n/x)
if a==0:
c=b
else:
c=b+1
d=c*t
print(d) |
p02576 | s106726306 | Accepted | N,X,T = map(int,input().split())
if N % X == 0:
k = N // X
else:
k = N // X + 1
ans = k * T
print (ans) |
p02576 | s440631234 | Accepted | import math
n,x,t = map(int,input().split())
print(math.ceil(n/x)*t)
|
p02576 | s882775009 | Accepted | import math
N, X, T = map(int, input().split())
if N % X == 0:
print(int(N / X * T))
else:
print((math.floor(N/X) + 1) * T) |
p02576 | s993485468 | Accepted | import sys
readline=sys.stdin.readline
N,X,T=map(int,readline().split())
print(((X + N - 1)// X) * T) |
p02576 | s055605552 | Accepted | n,x,t = map(int, input().split())
ans = 0
tmp = 0
while True:
tmp +=x
ans +=t
if tmp >=n:
break
print(ans) |
p02576 | s505244942 | Accepted | # -*- coding: utf-8 -*-
import math
N,X,T = [int(i) for i in input().split()]
print(T* (math.ceil(N*1.0/X)))
|
p02576 | s523526191 | Accepted | N, X, T = map(int, input().split())
ans = int(N / X) * T
if not N % X == 0:
ans += T
print(ans) |
p02576 | s596254504 | Accepted | import math
N,X,T=map(int,input().split())
if (N/X==0):
print (T)
else:
print (math.ceil(N/X)*T) |
p02576 | s866857659 | Accepted |
N,X,T = map(int, input().split())
ans = int(N / X) * T
ans += T if N % X != 0 else 0
print(ans)
|
p02576 | s066450567 | Accepted | N,X,T = map(int, input().split())
if N%X == 0:
print((N//X) * T)
else:
print((N//X + 1) * T) |
p02576 | s832452415 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N / X) * T)
|
p02576 | s129913475 | Accepted | N, X, T = map(int, input().split())
print(((N-1)//X + 1)*T) |
p02576 | s315583553 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n / x) * t)
|
p02576 | s953511043 | Accepted | import math
N,X,T=map(int,input().split())
print(math.ceil(N/X)*T)
|
p02576 | s810063743 | Accepted | # -*- coding: utf-8 -*-
if __name__ == '__main__':
l = list(map(int, input().split()))
N = int(l[0])
X = int(l[1])
T = int(l[2])
if N%X == 0:
print((N//X) * T)
else:
print((N//X + 1) * T)
|
p02576 | s854398123 | Accepted | param=list(map(int,input().split()))
ama=param[0]%param[1]
war=(param[0]-ama)/param[1]
if ama==0:
tim=war*param[2]
else:
tim=(war+1)*param[2]
print(int(tim)) |
p02576 | s771066430 | Accepted | import math
n,x,t = map(int,input().split())
times = math.ceil(n/x)
print(times*t) |
p02576 | s824217249 | Accepted | n,x,t=map(int,input().split())
c=0
while c<n:
c+=x
print(c//x*t) |
p02576 | s035132473 | Accepted | N, X, T = map(int, input().split())
print(int((N+X-1)/X) * T) |
p02576 | s467748155 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print(n // x * t)
else:
print((n // x + 1) * t)
|
p02576 | s161863165 | Accepted | n,x,k=map(int,input().split())
a=n//x
if(n%x!=0):
a+=1
print(a*k) |
p02576 | s536479742 | Accepted | n,x,t = map(int,input().split())
ans = int(n/x)*t
if(n%x != 0):
ans += t
print(ans) |
p02576 | s734002475 | Accepted | n,x,t=[int(x)for x in input().split()]
print(t*len(range(0,n,x))) |
p02576 | s515131735 | Accepted | n,x,t = map(int,input().split())
if n % x == 0:
print(n//x * t)
else:
print(((n//x)+1)*t) |
p02576 | s475741041 | Accepted | def main():
N, X, T = map(int, input().split())
if N % X == 0:
result = int(N/X)*T
else:
result = int((N/X)+1)*T
print(result)
if __name__ == '__main__':
main()
|
p02576 | s902935226 | Accepted | def resolve():
n, x, t = list(map(int, input().split()))
cnt = int(n / x)
if n % x == 0:
print(cnt * t)
else:
print(cnt * t + t)
resolve() |
p02576 | s718862812 | Accepted | N,X,T = map(int,input().split())
syo = N//X
amari = N%X
if amari != 0:
syo += 1
print(syo*T) |
p02576 | s718743413 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
ans = n//x
else :
ans = n//x + 1
ans *= t
print(ans)
|
p02576 | s991603341 | Accepted | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N, X, T = map(int, input().split())
print((N + X - 1) // X * T) |
p02576 | s055558913 | Accepted | N,X,T = map(int,input().split())
if N%X==0:
print(N//X*T)
else:
print((N//X+1)*T)
|
p02576 | s433777772 | Accepted | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n,x,t = inpl()
print((n+x-1)//x*t)
|
p02576 | s287126268 | Accepted | n,x,t=map(int, input().split())
print(((n-1)//x+1)*t)
|
p02576 | s208342278 | Accepted | n,x,t=map(int,input().split())
u=t
v=x
while(x<n):
x+=v
t+=u
print(t)
|
p02576 | s607712322 | Accepted | x,n,t = map(int,input().split(" "))
cnt =0
while x > 0:
x -= n
cnt += 1
print(cnt * t) |
p02576 | s394247836 | Accepted | def ceildiv(n, x):
ret = n // x
if n % x != 0:
ret += 1
return ret
n, x, t = map(int, input().split())
print (t * ceildiv(n, x)) |
p02576 | s801270306 | Accepted | n,x,t=map(int,input().split())
s=n//x * t
if n%x!=0:
s+=t
print(s) |
p02576 | s436147406 | Accepted | import math
n, x, t = input().split()
answer = math.ceil(int(n) / int(x)) * int(t)
print(answer)
|
p02576 | s935005866 | Accepted | import math
N,X,T = map(int, (input().split(" ")))
t = math.ceil(N/X) * T
print(t)
|
p02576 | s500566544 | 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 | s496687337 | Accepted | N,X,T = map(int,input().split())
print(-(-N//X)*T) |
p02576 | s080807872 | Accepted | import math
meta = [int(s) for s in input().split(' ')]
print(math.ceil(meta[0] / meta[1]) * meta[2])
|
p02576 | s785520649 | Accepted | val = input().split(" ")
n,x,t = [int(i) for i in val]
if n%x ==0:
time = (n//x)*t
elif n%x != 0:
time = (n//x+1)*t
print(time) |
p02576 | s322527482 | Accepted | a, b, c =map(int,input().split())
d = a / b
if a % b == 0:
print(int(d) * c)
else:
print(int(d+1) * c) |
p02576 | s348971056 | Accepted | import math
N,X,T=map(int,input().split())
print(math.ceil(N/X)*T)
|
p02576 | s470752526 | Accepted | import math
n,x,t=map(int,input().split())
print(math.ceil(n/x)*t)
|
p02576 | s617058142 | Accepted | import math
N, X, T = map(int, input().split())
x = math.ceil(N / X)
print(x * T) |
p02576 | s721960266 | Accepted | import math
n, x, t = list(map(int, input().split()))
print (math.ceil(n / x) * t) |
p02576 | s353100707 | Accepted | import math
n, x, t = list(map(int, input().split()))
ans = t * (math.ceil(n/x))
print(ans)
|
p02576 | s247023563 | Accepted | a,b,c=map(int,input().split())
d=a//b
e=a/b
if d==e:
print(d*c)
else:
print((d+1)*c)
|
p02576 | s303619942 | Accepted | n,x,t = map(int,input().split())
a = (n-1)//x + 1
print(a*t) |
p02576 | s603423324 | Accepted | n, x, t = map(int, input().split())
# ↓の式で切り上げられるらしい
print(-(-n // x) * t)
|
p02576 | s896413691 | Accepted | N,X,T = map(int,input().split())
if N%X==0:
print(N//X*T)
else:
print((N//X+1)*T) |
p02576 | s766382865 | Accepted | n,x,t=map(int,input().split())
a=1
if n%x==0:
a=0
print(t*(n//x+a))
|
p02576 | s044809002 | Accepted | import math
n,x,t=map(int,input().split())
print(math.ceil(n/x)*t) |
p02576 | s227690662 | Accepted | n,x,t=map(int, input().split())
print(t*((n-1)//x+1))
|
p02576 | s467685617 | Accepted | n,x,t = input().split(" ")
s = 0
time = 0
while int(n) > s:
s += int(x)
time += int(t)
print(time) |
p02576 | s870774198 | Accepted | N,X,T = list(map(int,input().split()))
print(((N-1)//X+1)*T) |
p02576 | s326212139 | Accepted | N, X, T = map(int, input().split())
print(T*((N+X-1)//X))
|
p02576 | s617255819 | Accepted | n,x,t = map(int,input().split())
print (-(-n//x)*t)
|
p02576 | s917981674 | 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 | s076273800 | Accepted | N,X,T = map(int,input().split())
if N%X == 0:
print(N//X*T)
else:
print((N//X+1)*T) |
p02576 | s860808655 | Accepted | def main():
from math import ceil
n, x, t = map(int, input().split())
ans = t * ceil(n / x)
print(ans)
if __name__ == '__main__':
main()
|
p02576 | s654298824 | Accepted | N, X, T = map(int,input().split())
if N % X == 0 :
a = N / X * T
else:
a = (N // X +1) *T
print (int(a)) |
p02576 | s174634921 | Accepted | N,X,T = map(int, input().split())
print(T*(N//X+(0 if N%X==0 else 1))) |
p02576 | s634646619 | Accepted | N, X, T = map(int, input().split())
cnt = N // X
if N % X != 0:
cnt += 1
print(T*cnt) |
p02576 | s899746489 | Accepted | n,x,t = map(int,input().split())
if n%x == 0:
print(t*(n//x))
else:
print(t*(n//x)+t) |
p02576 | s954898728 | Accepted | n, x, t = map(int, input().split())
ans = t
tako = x
while True:
if tako >= n:
print(ans)
exit()
else:
tako += x
ans += t
|
p02576 | s518438252 | Accepted | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353
N, X, T = map(int, input().split())
print(math.ceil(N/X)*T)
|
p02576 | s785152291 | Accepted | N,X,T =map(int,input().split())
A = -(-N//X)
B = A*T
print(B) |
p02576 | s758690175 | Accepted | # coding:utf-8
n, x, t = map(int, input().split())
count = n // x
if n % x != 0:
count += 1
print(t * count)
|
p02576 | s671686592 | Accepted | n, x, t = map(int, input().split())
print(t * (n // x + 1 * (n % x != 0))) |
p02576 | s285573198 | Accepted | import math
n, x, t = map(int, input().split())
print(int(math.ceil(n / x) * t))
|
p02576 | s381384165 | Accepted | n,x,t=map(int,input().split())
if n%x==0:
print(t*(n//x))
else:
print(t*(n//x+1))
|
p02576 | s667198310 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print(t * (n // x))
else:
print(t * (n // x + 1)) |
p02576 | s132534776 | Accepted | from sys import stdin
from math import ceil
inp = lambda : stdin.readline().strip()
n, x, t = [int(x) for x in inp().split()]
print(ceil(n/x)*t) |
p02576 | s334683665 | Accepted | want, max, time = map(int, input().split())
if want % max == 0:
required = int(want / max)
else:
required = int(want / max + 1)
print(required * time) |
p02576 | s224487247 | Accepted | n,x,t=map(int,input().split())
a=(n+x-1)//x
print(a*t)
|
p02576 | s227706819 | Accepted | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
#read = sys.stdin.buffer.read
def main():
N, X, T = map(int, input().split())
ans = (N//X)*T
if N%X != 0:
ans += T
print(ans)
if __name__ == "__main__":
main()
|
p02576 | s545296108 | Accepted | n, x, t = map(int, input().split())
q, mod = divmod(n, x)
print(q * t if mod == 0 else (q + 1) * t) |
p02576 | s030512529 | Accepted |
import math
n,x,t=list(map(int,input().split()))
k=math.ceil(n/x)
print(k*t)
|
p02576 | s905909745 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N, X, T = mapint()
print(-(-N//X)*T) |
p02576 | s969852837 | Accepted | n,x,t = map(int, input().split())
w = n//x
if (n % x) == 0:
print(w * t)
else:
w += 1
print(w * t) |
p02576 | s134659773 | Accepted | import math
n, x, t = map(int,input().split())
print(math.ceil(n/x)*t) |
p02576 | s563523938 | Accepted | import sys
import math
def gcd(a,b):
if a == 0:
return b
return gcd(b%a,a)
def main():
n,x,t = map(int,input().split())
print((math.ceil(n/x))*t)
if __name__ == "__main__":
main()
|
p02576 | s132924825 | Accepted | n, x, t = map(int, input().split())
print(int((n + x - 1) // x) * t) |
p02576 | s494956237 | Accepted | n, x, t = map(int, input().split())
if n%x:
print((n//x + 1)*t)
else:
print((n//x)*t) |
p02576 | s155657066 | Accepted | input1 = input()
input1 = input1.split()
N, X, T = int(input1[0]), int(input1[1]), int(input1[2])
t = 0
while(N>0):
N = N - X
t += T
print(t)
|
p02576 | s206961322 | Accepted | def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for _ in range(n)]
n,x,t = miinps()
ans = (n + (x - 1)) // x
ans *= t
print(ans) |
p02576 | s178946198 | Accepted | import sys
import math
from collections import defaultdict, deque
from copy import deepcopy
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
def main():
N, X, T = MI()
if N % X == 0:
print((N//X)*T)
else:
print(((N//X)+1)*T)
if __name__ == "__main__":
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.