problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s421164247 | Accepted | import fractions
n, x, t = map(int, input().split())
kaiten = int(n / x)
if int(n / x) != n / x:
kaiten += 1
print(kaiten * t)
|
p02576 | s664995431 | Accepted | N, X, T = map(int, input().split())
w = N // X
if N % X == 0:
print(w * T)
else:
print((w + 1) * T)
|
p02576 | s889180434 | Accepted | import math
N,X,T=map(int,input().split())
a = math.ceil(N/X)
print(a*T) |
p02576 | s086423387 | Accepted | a,b,c = map(int,input().split())
print((((a-1)//b)+1)*c) |
p02576 | s960463873 | Accepted | import sys
def I(): return int(sys.stdin.readline().rstrip())
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 = LI()
a = N // X
b = N % X
if b == 0:
print(a*T)
else:
print((a+1)*T) |
p02576 | s816581953 | Accepted | N,X,T = map(int,input().split())
print(-(-N//X)*T) |
p02576 | s382166721 | Accepted | N, X, T = map(int, input().split())
time = (N+X-1)//X
print(T * time) |
p02576 | s381737129 | Accepted | n, x, t = map(int, input().split())
print((n + x - 1) // x * t) |
p02576 | s913762878 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
ans = N / X * T
else:
ans = (N // X + 1) * T
print(int(ans)) |
p02576 | s107721340 | Accepted | N,X,T = map(int,input().split())
if N % X == 0:
print(int(T*N/X))
else:
print(T*(N//X+1)) |
p02576 | s934406675 | Accepted | n,x,t=list(map(int, input().split()))
sore=9
if n%x==0:
sore=t*int(n/x)
else:
sore=t*int(n/x)+t
print(sore) |
p02576 | s222649350 | Accepted | n, x, t = map(int, input().split())
print(-(-n // x) * t) |
p02576 | s519196663 | Accepted | import sys
if sys.subversion[0] == "PyPy":
import io, atexit
sys.stdout = io.BytesIO()
atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
sys.stdin = io.BytesIO(sys.stdin.read())
input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())
def solve():
print((n // x + int((n % x)!=0)) * t)
return
n, x, t = RA()
solve()
|
p02576 | s865129786 | Accepted | n,x,t = map(int,input().split())
iter=n//x
if n%x!=0:
print((iter+1)*t)
elif n%x==0:
print(iter*t)
|
p02576 | s888922132 | Accepted | n,x,t=map(int,input().split())
if n%x == 0:
print((n//x)*t)
else:
print((n//x)*t+t) |
p02576 | s362534711 | 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 | s717856850 | Accepted | import math
N, X, T = map(int, input().split())
kaisuu = math.ceil(N/X)
print(T*kaisuu) |
p02576 | s425016257 | Accepted | n, x, t = map(int, input().split())
ans = t*(n//x)
if n % x != 0:
ans += t
print(ans) |
p02576 | s351017962 | Accepted | N,X,T=map(int,input().split())
print(-(-N//X)*T) |
p02576 | s759688243 | Accepted | # -*- coding: utf-8 -*-
#
import math
import sys
import itertools
import numpy as np
n,x,t = map(int, input().split())
if n%x>0:
print((n//x+1)*t)
else:
print(n//x*t)
|
p02576 | s660284997 | Accepted | n, m, t = input().split()
z = ((int(n)+int(m))-1)//int(m)
ans = z * int(t)
print(ans)
|
p02576 | s110675876 | Accepted | n,x,t=map(int,input().split())
ans=int(n/x+0.99)
print(ans*t) |
p02576 | s178966745 | Accepted | def main():
n, x, t = map(int, input().split())
print(-(-n // x) * t)
if __name__ == '__main__':
main()
|
p02576 | s792113851 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n / x) * t) |
p02576 | s306443767 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, X, T = map(int, readline().split())
ans = (N + X - 1) // X * T
print(ans)
return
if __name__ == '__main__':
main()
|
p02576 | s272294036 | Accepted | N, X, T=map(int,input().split())
if N%X!=0:
print((N//X+1)*T)
else:
print(N//X*T) |
p02576 | s918317667 | Accepted | N, X, T = (int(x) for x in input().split() )
a = int(N/X)
if N % X != 0:
t = (a + 1)* T
else:
t = a * T
print(t) |
p02576 | s612603823 | Accepted | import math
N, X, T = map(int, input().split())
t = math.ceil(N / X)
print(t * T) |
p02576 | s702526726 | Accepted | # coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math
import itertools
def I(): return int(sys.stdin.readline().rstrip())
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())
def main():
N, X, T = LI()
time = math.ceil(N/X)
ans = T*time
print(ans)
if __name__ == '__main__':
main()
|
p02576 | s430858204 | Accepted | n,x,t=map(int,input().split())
time = n//x
if n%x != 0: time += 1
print(time*t) |
p02576 | s204065581 | Accepted | #!/usr/bin/python3
cmdvar_numlist=input()
cmdvar_numlist_splited=cmdvar_numlist.split()
N,X,T=list(map(int,cmdvar_numlist_splited))
i=0
while N >0:
N = N - X
i+=1
ans=T * i
print(ans) |
p02576 | s088641282 | Accepted | import math
N,T,u = map(int,input().split())
print((math.ceil(N/T))*u) |
p02576 | s340010251 | Accepted | n, c, t = map(int, input().split())
print(t * (n // c + bool(n % c)))
|
p02576 | s826037315 | Accepted | n, x, t = map(int, input().split(' '))
ans = 0
if n % x == 0:
ans = n/x * t
else:
ans = ((n//x)+1)*t
print(int(ans)) |
p02576 | s142927779 | Accepted | N, X, T = map(int, input().split())
count = 0
result = 0
if N < X:
print(T)
else:
if N % X == 0:
count = N / X
result = count * T
print(int(result))
else:
count = (N // X) + 1
result = count * T
print(int(result)) |
p02576 | s176556167 | Accepted | N,X,T = map(int,input().split())
res = N*T//X
div = res//T
mod = res%T
if mod == 0:
print (res)
else :
print ((div+1)*T)
|
p02576 | s572241716 | Accepted | n, x, t = map(int ,input().split())
print(int(((n + x -1) / x )) * t) |
p02576 | s901076012 | Accepted | n,x,t=map(int,input().split())
ans=0;
while(n>0):
ans+=t;
n-=x;
print(ans)
|
p02576 | s076161092 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print((n // x) * t)
else:
print((n // x) * t + t)
|
p02576 | s755606724 | Accepted | n,x,t = map(int,input().split())
add = n % x != 0
ans = n // x * t
if(add):
ans += t
print(ans)
|
p02576 | s084786147 | Accepted | N, X, T = list(map(int, input().split()))
if N % X == 0:
print(N // X * T)
else:
print((N // X + 1) * T)
|
p02576 | s648285883 | Accepted | import math
n, x, t = map(int, input().split())
N = math.ceil(n/x)
print(t*N) |
p02576 | s852509285 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
print(N // X * T)
else:
print((N // X + 1) * T) |
p02576 | s082144381 | Accepted | import math
n,x,t = map(int, input().split())
print(math.ceil(n/x)*t) |
p02576 | s287358497 | Accepted | a,b,c=map(int,input().split())
x = 0
y = 0
for i in range(a):
x = x + c
y = y + b
if a <= y:
print(x)
break |
p02576 | s358798934 | Accepted | n,x,t=map(int,input().split())
a=n//x
if x*a!=n:
a=a+1
print(a*t) |
p02576 | s686719191 | Accepted | import math
n,x,t = map(int,input().split(' '))
nn = math.ceil(n/x)
print(nn * t) |
p02576 | s170385279 | Accepted | import math
n,m,t = map(int,input().split())
if n%m == 0:
print(int(n/m)*t)
else:
print(math.ceil(n/m)*t) |
p02576 | s567082579 | Accepted | N, X, T = map(int,input().split())
if N % X != 0:
print((N // X + 1)*T)
else:
print((N // X)*T)
|
p02576 | s190152839 | Accepted | N, X, T = map(int, input().split())
ans = 0
while N > 0:
ans += T
N -= X
print(ans) |
p02576 | s310126852 | Accepted | #! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=tf-8
#
"""
"""
from collections import defaultdict
import bisect
import sys
input = sys.stdin.readline
def solve(n,x,t):
print (((n-1)//x+1) * t)
def main():
n,x,t = map(int,input().split())
solve(n,x,t)
if __name__ == "__main__":
main() |
p02576 | s462926269 | Accepted | n,x,t = map(int,input().split())
if n%x == 0:
s=n//x
else:
s=n//x+1
l=s*t
print(l) |
p02576 | s429532999 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N / X) * T) |
p02576 | s669460567 | Accepted | import sys
import math
input = sys.stdin.readline
n,x,t=map(int,input().split())
val = math.ceil(n/x)
ans = val*t
print(ans)
|
p02576 | s892474632 | Accepted | from math import ceil
n, x, t = map(int, input().split())
res = ceil(n/x) * t
print(res) |
p02576 | s392294328 | Accepted | (n, x, t) = tuple([int(x) for x in input().split(" ")])
summ = 0
time = 0
while summ < n:
summ += x
time += t
print(time) |
p02576 | s535871185 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
print(T*(N//X))
else:
print(T*(N//X+1))
|
p02576 | s776984555 | Accepted | import math
N,X,T = [int(x) for x in input().split()]
print(math.ceil(N/X)*T)
|
p02576 | s811464072 | Accepted | n,x,t=map(int,input().split())
print((n+x-1)//x*t) |
p02576 | s443611932 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n/x)*t) |
p02576 | s060149368 | Accepted | import math
n, x, t = map(int, input().split())
#t分でx個のたこ焼き
print(math.ceil(n / x) * t) |
p02576 | s327707402 | Accepted | from math import ceil
N, X, T = map(int, input().split())
print(ceil(N/X)*T) |
p02576 | s190358129 | Accepted | N,X,T=map(int,input().split())
if N%X==0:
print((N//X)*T)
else:
print((N//X+1)*T) |
p02576 | s419979695 | Accepted | n,x,t=map(int,input().split())
kaisuu=n//x
if n%x!=0:
kaisuu+=1
ans=kaisuu*t
print(ans) |
p02576 | s327197359 | Accepted | N, X, T = map(int, input().split())
n_count = ((N - 1)// X) + 1
print(n_count * T) |
p02576 | s650320190 | Accepted | N, X, T = map(int, input().split())
count = N // X
if N % X != 0:
count += 1
print(count * T)
|
p02576 | s903515773 | Accepted | N, X, T = map(int, input().split())
print((N + X - 1) // X * T)
|
p02576 | s558483261 | Accepted | def solve():
N, X, T = map(int, input().split())
ans = (0--N//X)*T
return ans
print(solve()) |
p02576 | s276090160 | Accepted | import math
n,x,t = (int(x) for x in input().split())
print(math.ceil(n/x)*t)
|
p02576 | s635525802 | Accepted | from math import ceil
n, x, t = map(int, input().split())
k = ceil(n / x)
print(k * t) |
p02576 | s868474693 | Accepted | import math
n,x,t = map(int,input().split())
print(math.ceil(n/x)*t)
|
p02576 | s221763390 | Accepted | N, X, T = map(int,input().split())
add = 0
if N % X > 0:
add = 1
ans = int(N//X + add)*T
print(ans) |
p02576 | s601786878 | Accepted | n, x, t = map(int, input().split())
print(-(-n//x)*t)
|
p02576 | s434448751 | Accepted | from math import ceil
N,X,T = map(int,input().split())
print(ceil(N/X)*T) |
p02576 | s646045776 | Accepted | n, x, t = map(int, input().split())
if n % x != 0:
print(n // x * t + t)
else:
print(n // x * t)
|
p02576 | s490760902 | Accepted | n, x, t = map(int, input().split())
if n % x !=0:
a = ((n // x)+1) * t
else:
a=(n//x)*t
print(a) |
p02576 | s779308955 | Accepted | n, x, t = map(int, input().split())
cnt = n // x
if n % x > 0:
cnt += 1
print(int(cnt*t)) |
p02576 | s361001309 | Accepted | from sys import stdin,stdout
# n=int(stdin.readline())
n,x,t=list(map(int,stdin.readline().split()))
q=n//x+int((n%x)!=0)
print(t*q) |
p02576 | s488017484 | Accepted | N, X, T = map(int, input().split())
times = (N + X - 1) // X
print(times * T) |
p02576 | s220927158 | Accepted |
n,x,t = list(map(int,input().split()))
for i in range(2000):
if i * x >= n:
ans = i
break
print(ans*t) |
p02576 | s812225411 | Accepted | n,x,t=map(int,input().split())
if n%x==0:
print(n//x*t)
else:
print((n//x+1)*t)
|
p02576 | s468786555 | Accepted | import math
from sys import stdin
n, x, t = map(int, stdin.readline().rstrip().split())
print(int(math.ceil(n/x)*t)) |
p02576 | s406250672 | Accepted | from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations
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 | s900510401 | Accepted | n = input().split()
n = [int(i) for i in n]
time = 0
while n[0] > 0:
n[0] = n[0] - n[1]
time += n[2]
print(time) |
p02576 | s607786803 | Accepted | import math
n, x, t = map(int, input().split())
print(t * math.ceil(n/x)) |
p02576 | s061733731 | Accepted | n, x, t = map(int, input().split())
res = ((n+x-1) // x) * t
print(res)
|
p02576 | s843219902 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N/X)*T) |
p02576 | s152068490 | Accepted | n,x,t=map(int,input().split())
print((n+x-1)//x*t) |
p02576 | s737630681 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n/x)*t) |
p02576 | s186229495 | Accepted | k,x,t=map(int,input().split())
if x>=k:
print(t)
else:
if k%x==0:
print((k//x)*t)
else:
print(((k//x)+1)*t) |
p02576 | s974705396 | Accepted | n,x,t = map(int,input().split())
if n>x:
print(-(-n//x)*t)
else:
print(t) |
p02576 | s294790194 | Accepted | n, x, t = map(int, input().split())
print((n//x)*t if n%x==0 else (n//x)*t+t) |
p02576 | s402357781 | Accepted | N,X,T=map(int,input().split())
if N%X==0:
print(N//X*T)
else:
print((N//X+1)*T) |
p02576 | s324202379 | Accepted | n,x,t = list(map(int,input().split()))
ans = (n // x) * t
if n % x != 0:
ans += t
print(ans) |
p02576 | s381540362 | Accepted | n,x,t = map(int,input().split())
nn = n//x
amari = n%x
if amari == 0:
print(nn * t)
else:
print(nn * t + t) |
p02576 | s976803992 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print((n//x)*t)
else:
print((n//x+1)*t) |
p02576 | s404643617 | Accepted | import math
n,x,t=map(int, input().split())
print(math.ceil(n/x)*t) |
p02576 | s074058682 | Accepted | import math
import re
#import sympy
n,x,t=map(int,input().split())
if n%x==0:
print((int(n/x))*t)
exit()
print((int(n/x)+1)*t) |
p02576 | s893189984 | Accepted | n,x,t = map(int,input().split())
cnt = 0
while n > 0:
n = n - x
cnt += 1
print(cnt*t)
|
p02576 | s033733283 | Accepted | n,x,t=map(int, raw_input().split())
if n%x==0:
print (n/x)*t
else:
print (n/x)*t+t |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.