problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s644632399 | Accepted | N, X, T = map(int,input().split())
print(-(-N // X) * T)
|
p02576 | s474149555 | Accepted | from math import ceil
n, x, t = map(int, input().split())
print(t*ceil(n/x)) |
p02576 | s991473987 | Accepted | def main():
n, x, t = list(map(int, input().split()))
k = n // x
if n % x != 0:
k += 1
print(k*t)
if __name__ == "__main__":
main()
|
p02576 | s184935852 | Accepted | # import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")
N, X, T = map(int, input().split())
val = (N + X - 1) // X
print(val * T)
|
p02576 | s922924113 | Accepted | import math
N,X,T = map(int,input().split())
l = math.ceil(N/X)
print(l*T) |
p02576 | s529269280 | Accepted | L=list(map(int,input().split()))
N,X,T=L[0],L[1],L[2]
if N%X==0:
Y=(N//X)*T
else:
Y = (1+ N // X) * T
print(Y) |
p02576 | s362793148 | Accepted | N, X, T = list(map(int, input().split()))
times=(N+X-1)//X
ans=times*T
print(ans) |
p02576 | s374125955 | Accepted | N, X, T = map(int, input().split())
print((N // X + bool(N%X)) * T) |
p02576 | s656232421 | Accepted | from math import ceil
n, x, t = map(int, input().split())
print(ceil(n/x)*t)
|
p02576 | s069526979 | Accepted | import math
N, X, T = map(int, input().split())
print((math.ceil(N/X)) * T) |
p02576 | s281104116 | Accepted | n,x,t=map(int,input().split())
y=n//x
if(n%x!=0):
ans=(y+1)*t
else:
ans=y*t
print(ans) |
p02576 | s810737422 | Accepted | N, X, T = map(int, input().split())
result = N//X
if N%X == 0:
pass
else:
result += 1
print(result*T) |
p02576 | s892445263 | Accepted | n,x,t = map(int,input().split())
a = n//x
mod = n%x
if mod==0:
ans = a*t
else:
ans = (a+1)*t
print(ans) |
p02576 | s107398643 | Accepted | import math
N,X,T = map(int,input().split())
NX = math.ceil(N/X)
print(NX*T) |
p02576 | s356542331 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N / X) * T) |
p02576 | s361160923 | Accepted | import math
n, x, t = map(int, input().split())
ans = math.ceil(n / x) * t
print(ans) |
p02576 | s399827412 | Accepted | n,x,t=map(int,open(0).read().split())
print(-(-n//x)*t) |
p02576 | s148091206 | Accepted | n,x,t=map(int,input().split())
p=n//x
if n/x>n//x:
p+=1
print(p*t) |
p02576 | s376223118 | Accepted | import math
n,x,t = map(int,input().split())
point = math.ceil(n/x)
print(point*t) |
p02576 | s137869308 | Accepted | N,X,T = map(int,input().split())
k = N/X
t = N//X
if k > t:
print((t+1)*T)
else:
print(t*T) |
p02576 | s714441890 | Accepted | N, X, T = map(int, input().split())
print((N + X - 1) // X * T) |
p02576 | s330980970 | Accepted | N, X, T = map(int, input().split())
print(-(-N//X)*T) |
p02576 | s868964269 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
print(N // X * T)
else:
print((N // X + 1) * T) |
p02576 | s498623602 | Accepted | n, x, t = map(int, input().split())
times = (n + x - 1) // x
ans = times * t
print(ans) |
p02576 | s706837397 | Accepted | n, x, t = map(int, input().split())
answer = 0
while n > 0:
n -= x
answer += t
print(answer)
|
p02576 | s210260480 | Accepted | n,x,t = map(int,input().split())
c=1
while True:
if x*c >= n:
break
else:
c = c+1
print(c*t) |
p02576 | s597986419 | Accepted | N, X, T = map(int, input().split())
print(T * ((N + X - 1) // X))
|
p02576 | s193026082 | Accepted | n,x,t = map(int, input().split())
if n <= x:
print(t)
elif n % x == 0:
print(n//x*t)
else:
print((n//x+1)*t) |
p02576 | s590221097 | Accepted | n ,x,t = map(int,input().split())
time =0
while n>0:
n-=x
time+=t
print(time)
|
p02576 | s060643196 | Accepted | 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) |
p02576 | s045295001 | Accepted | N, X, T = map(int, input().split())
print( -(-N//X) * T ) |
p02576 | s340549076 | Accepted |
import math
N,X,T = map(int,input().split())
print(math.ceil(N/X)*T) |
p02576 | s048413480 | Accepted | N, X, T = (int(x) for x in input().split())
if(N % X == 0):
print((N // X) * T)
else:
print(((N // X) + 1) * T) |
p02576 | s393948235 | Accepted | #####
# B #
#####
N,X,T = map(int,input().split())
if N % X == 0:
print(N // X * T)
else:
print((N // X + 1) * T )
|
p02576 | s263115149 | Accepted | n, x, t = map(int, input().split())
print(((n - 1) // x + 1) * t)
|
p02576 | s847332603 | Accepted | n, x, t = map(int, input().split())
total_num = 0
total_time = 0
while(True):
total_num += x
total_time += t
if n <= total_num:
break
print(total_time)
|
p02576 | s077676721 | Accepted | N, X, T = map(int, input().split())
ANS = -(-N // X) * T
print(ANS) |
p02576 | s195087904 | Accepted | n, x, t = map(int, input().split())
ans = t * ((n+x-1) // x)
print(ans) |
p02576 | s716789486 | Accepted | n, x, t = map(int, input().split())
print(t * ((n+x-1)//x))
|
p02576 | s317516727 | Accepted | n, x, t = map(int, input().split())
if n%x == 0:
ans = n//x
print(t*ans)
else:
ans = n//x
print(t*(ans+1)) |
p02576 | s230793494 | Accepted | N, X,T = map(int, input().split())
if (N/X)-int(N/X)==0:
a=N/X
print(int(a*T))
else:
a=int(N/X)+1
print(int(a*T)) |
p02576 | s440977575 | Accepted | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N, X, T = MI()
a = math.ceil(N / X)
print(a * T) |
p02576 | s602386236 | Accepted | import math
N,X,T = map(int, input().split())
ans = 0
while N>0:
N-=X
ans += T
print(ans) |
p02576 | s255362436 | Accepted | n, x, t = map(int, input().split())
num = 0
for i in range(n):
if n > x:
n -= x
num += 1
num += 1
print(t * num) |
p02576 | s654316844 | Accepted | n,x,t=map(int,input().split())
import math
print(t*(math.ceil(n/x))) |
p02576 | s412783944 | Accepted | import math
n,x,t=list(map(int,input().split()))
print(math.ceil(n/x)*t) |
p02576 | s805427700 | Accepted | n,x,t=map(int,input().split());print((-(-n//x))*t) |
p02576 | s597172438 | Accepted | # -*- coding: utf-8 -*-
# スペース区切りの整数の入力
n, x, t = map(int, input().split())
# print(n, x, t)
count = n // x
if n % x != 0 :
count += 1
print(count*t)
|
p02576 | s093054891 | Accepted | N,X,T = map(int, input().split())
ans = 0
while(N>0):
N-=X
ans +=T
print(ans) |
p02576 | s649207616 | Accepted | n,x,t = list(map(int,input().split()))
print(t*((n-1)//x + 1)) |
p02576 | s127083979 | Accepted | from math import ceil
a,b,c= map(int,input().split())
ans= int(ceil(a/b)*c)
print(ans) |
p02576 | s143890059 | Accepted | n,x,t = map(int, input().split())
if n%x == 0:
print((n//x)*t)
else:
print(((n//x)+1)*t) |
p02576 | s104422889 | Accepted | import math
n,x,t = map(int,input().split())
print(math.ceil(n/x)*t) |
p02576 | s868952049 | Accepted | import math
n,x,t=map(int,input().split())
print(t*math.ceil(n/x)) |
p02576 | s517092314 | Accepted | input_str = input().split()
amount_to_make = int(input_str[0])
lot_size = int(input_str[1])
time_to_make_one_lot = int(input_str[2])
proceeded_time = 0
made_amount = 0
while made_amount < amount_to_make:
made_amount += lot_size
proceeded_time += time_to_make_one_lot
print(proceeded_time)
|
p02576 | s413361439 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
times = N // X
elif N % X != 0:
times = N // X + 1
else:
pass
ans = T * times
print("{0}".format(ans)) |
p02576 | s352529773 | Accepted | #!/usr/bin/env python3
import sys
import pprint
from math import ceil
sys.setrecursionlimit(10 ** 6)
class Logger:
def __init__(self, debug):
self.debug = debug
def print(self, *args):
if self.debug:
pprint.pprint(args)
def main():
log = Logger(1)
n, x, t = map(int, sys.stdin.readline().split())
print(t * ceil(n / x))
main() |
p02576 | s535092285 | Accepted | from math import ceil
N,X,T = map(int, open(0).read().split())
print(ceil(N/X)*T) |
p02576 | s845434643 | Accepted | n,x,t=map(int,input().split())
ans=n//x+1
if n%x==0:
ans-=1
print(ans*t) |
p02576 | s857434081 | Accepted | n,x,t = map(int,input().split())
print(-(-n//x)*t) |
p02576 | s397999539 | Accepted | import math
def takoyaki(n, x, t)-> int :
itr = math.ceil(n / x)
return itr * t
if __name__ == "__main__":
input = list(map(int, input().split()))
print(takoyaki(input[0], input[1], input[2]))
|
p02576 | s523987547 | Accepted | n,x,t=map(int,input().split())
b=int(n/x)
if n%x >0:
b+=1
print(b*t) |
p02576 | s169290139 | Accepted | N,X,T = map(int,input().split())
if N%X == 0:
print((N//X)*T)
else:
print(((N//X)+1)*T)
|
p02576 | s921949623 | Accepted | X,Y,T = list(map(int,input().split()))
A = 1
if X % Y == 0:
A = 0
print(((X//Y)+A)*T) |
p02576 | s225751576 | Accepted | import math
a,b,c=[int(i) for i in input().split()]
d=math.ceil(a/b)
print(c*d) |
p02576 | s758702607 | Accepted | import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
def main():
n,x,t = map(int, input().split())
if n%x == 0:
print((n//x)*t)
else:
print(((n//x)+1)*t)
if __name__ == '__main__':
main()
|
p02576 | s312905043 | Accepted | from math import ceil
N, X , T = map(int, input().split())
time=ceil(N/X)
print(T*time) |
p02576 | s881312634 | Accepted |
N,X,T = list(map(int, input().split()))
n = 0
cnt = 0
while n < N:
cnt += T
n += X
print(cnt) |
p02576 | s511268271 | Accepted | import math
N,X,T = map(int, input().split())
A = math.ceil(N/X)
print(A*T) |
p02576 | s308600384 | Accepted | n, x, t = map(int, input().split())
print((n + x - 1) // x * t) |
p02576 | s450254390 | Accepted | n, x, t = map(int,input().split())
print((n+x-1)//x*t) |
p02576 | s547178427 | Accepted | n, x, t = map(int, input().split())
print(abs(-n // x) * t) |
p02576 | s577294940 | Accepted | N,X,T = map(int,input().split())
if N%X==0:
print(N//X*T)
if N%X!=0:
print((N//X+1)*T) |
p02576 | s810832021 | Accepted | import math
a = list(map(int,input().split()))
print((math.ceil(a[0]/a[1]))*a[2]) |
p02576 | s111980687 | Accepted | n, x, t = map(int, input().split())
i = 0
while True:
i += 1
if i*x >= n :
break
print(i*t) |
p02576 | s575315942 | 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 | s355988053 | Accepted | from math import ceil
n, x, t = map(int, input().split())
print(ceil(n/x)*t)
|
p02576 | s676303469 | Accepted | # cook your dish here
n,x,t=map(int,input().split())
if n/x==n//x:
print(n*t//x)
else:
print(((n//x)+1)*t) |
p02576 | s294050636 | Accepted | N,X,T = map(int, input().split())
nf = float(N/X)
ni = int(N/X)
d = nf - ni
if d == 0:
ans = ni * T
else:
ans = (ni + 1) * T
print(ans) |
p02576 | s848135124 | Accepted | import math
N, X, T = map(int, input().split())
ans = math.ceil(N / X) * T
print(ans) |
p02576 | s405631522 | Accepted | n, x, t = map(int, input().split())
if n%x == 0:
a = n//x
else:
a = n//x + 1
print(a*t) |
p02576 | s049245495 | Accepted | N, X, T = map(int, input().split())
A = N // X
B = N % X
if B == 0:
print(A * T)
else:
print((A+1)*T) |
p02576 | s285686189 | Accepted | import math
N,X,T=map(int,input().split())
k=N/X
print((math.ceil(k))*T) |
p02576 | s504014423 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print((n // x) * t)
else:
print((n // x + 1) * t) |
p02576 | s926816948 | Accepted | from math import ceil
n,x,t = [int(x) for x in input().split()]
print(ceil(n/x)*t) |
p02576 | s193103520 | Accepted | N, X, T = map(int, input().split())
if N <= X:
print(T)
else:
if (N % X) == 0:
print((N // X) * T)
else:
print((N // X + 1) * T) |
p02576 | s042536435 | Accepted | n,x,t=map(int,input().split())
import math
print((math.ceil(n/x))*t)
|
p02576 | s387636399 | Accepted | N, X, T = map(int,input().split())
i = 0
while X * i < N: i += 1
print(T * i) |
p02576 | s154087146 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n / x) * t)
|
p02576 | s269468031 | Accepted | import math
import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
from numba import jit
import collections
import bisect
from collections import deque
from copy import copy, deepcopy
import time
def main():
N,X,T = map(int,input().split())
print(math.ceil(N/X) * T)
if __name__ == '__main__':
main() |
p02576 | s871555341 | Accepted | import math
n,x,t=map(int,input().split())
y=math.ceil(n/x)
print(y*t) |
p02576 | s808202775 | Accepted | n,x,t = map(int,input().split())
if n%x==0:
print(int(n*t/x))
else:
print((int(n/x)+1)*t) |
p02576 | s365016491 | Accepted | N,X,T = map(int,input().split())
print(-(-N//X)*T)
|
p02576 | s511779112 | Accepted | N, X, T = (list(map(int, input('').split(' '))))
print(-(-N//X)*T) |
p02576 | s160365798 | Accepted | import math
n,x,t=map(int,input().split())
temp=int(math.ceil(n/x))
print(temp*t) |
p02576 | s817700554 | Accepted | N, X, T = map(int,input().split())
A = N % X
if ( A ) == 0:
print(( N // X ) * T )
elif ( N % X ) != 0:
print(( N // X + 1 ) * T ) |
p02576 | s547614747 | Accepted | n,x,t = map(int, input().split())
ans = 0
if n % x == 0:
ans = (n//x)*t
else:
ans = (n//x)*t + t
print(ans) |
p02576 | s014139296 | Accepted | n,x,t=map(int,input().split())
if n%x!=0:
num=n//x+1
print(num*t)
else:
print(n//x*t) |
p02576 | s076473654 | Accepted | n,x,t = map(int, input().split())
y = n//x
z = n%x
if z != 0:
print((y+1)*t)
else:
print(y*t) |
p02576 | s011306360 | Accepted | import math
i = list(map(int, input().split()))
N = i[0]
X = i[1]
T = i[2]
A = N / X
A = math.ceil(A)
A = A*T
print(A) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.