problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s041548406 | Accepted | from math import ceil
N,X,T=map(int,input().split())
print(T*ceil(N/X))
|
p02576 | s824134367 | Accepted | N,X,T = map(int,input().split())
if N%X != 0:
print(((N//X)+1)*T)
else:
print(((N//X))*T) |
p02576 | s279958149 | Accepted | N, X, T = map(int, input().split())
ans = (N // X) * T
if N % X == 0:
print(ans)
exit()
else:
ans += T
print(ans)
|
p02576 | s025129268 | Accepted | import math
n, x, t = map(int, input().split())
print(t * math.ceil(n/x)) |
p02576 | s466680285 | Accepted | import math
n,x,t = map(int,input().split())
zz = math.ceil(n/x)
print(zz*t) |
p02576 | s812937023 | Accepted | N,X,T = list(map(int, input().split()))
a = N//X
b = N%X
if b > 0:
a+=1
print(a*T) |
p02576 | s575710589 | Accepted | # -*- coding: utf-8 -*-
"""
X : 一度に焼ける最大個数
T : 焼く時間
N : 必要個数
N個のたこ焼きを作るのに何分必要か？
"""
N, X, T = [int(i) for i in input().split()]
#print(N,X,T)
print(-(-N // X) * T) |
p02576 | s757978955 | Accepted | N, X, T = map(int, input().split())
a = int(N / X)
if N % X == 0:
a = a
else:
a = a + 1
print(a * T) |
p02576 | s947628966 | Accepted | N, X, T = map(int, input().split())
if(N % X == 0):
ans = T * int(N/X)
else:
ans = T * (int(N/X) + 1)
print(ans) |
p02576 | s244735113 | Accepted | N, X, T = map(int, input().split())
ans = 0
while N > 0:
ans += T
N -= X
print(ans) |
p02576 | s417945968 | Accepted | import math
N,X,T = map(int, input().split())
print(math.ceil(N/X) * T) |
p02576 | s818478198 | Accepted | n,x,t = map(int,input().split())
if n % x == 0:
print(n // x * t)
else:
print(n // x * t + t) |
p02576 | s187612533 | Accepted | n, x, t = map(int,input().split())
act = n // x
if n % x != 0:
act += 1
print(int(act * t))
|
p02576 | s458992888 | Accepted | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
def solve():
n, x, t = inl()
return t * ((n + x - 1) // x)
print(solve())
|
p02576 | s006917835 | Accepted | import sys
from math import sqrt, gcd, ceil, log, floor
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda: list(map(int, input().strip().split()))
MOD = 10**9 + 7
def main():
# ans_ = []
# ans_.append(ans)
# print(("\n").join(map(str, ans_)))
n, x, t = read()
print(ceil(n/x)*t)
if __name__ == "__main__":
main() |
p02576 | s914788416 | Accepted | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
n,x,t=map(int,input().split())
print(t*(-(-n//x))) |
p02576 | s672070262 | 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 | s812186897 | Accepted | n,x,t = map(int,input().split())
a = n / x +0.99999999999
print(int(a)*t) |
p02576 | s623743571 | Accepted | from math import ceil
n,x,t=map(int, input().split())
val=ceil(n/x)
#print(val)
print(t*val) |
p02576 | s347791052 | Accepted | 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) |
p02576 | s169598716 | Accepted | import math
n,x,t=map(int,input().split())
ans=math.ceil(n/x)
print(ans*t) |
p02576 | s059977880 | Accepted | N, X, T = map(int, input().split())
if N%X ==0:
print((N//X)*T)
else:
print((N//X + 1)*T) |
p02576 | s160368051 | Accepted | N, X, T = map(int, input().split())
print((N // X + 1) * T if N % X else (N // X) * T)
|
p02576 | s454173715 | Accepted | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(input())
def FI(): return int(input())
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 TI(): return tuple(map(int,input().split()))
# rstrip().decode()
def main():
n,x,t=MI()
y=(n-1)//x+1
print(y*t)
if __name__ == "__main__":
main()
|
p02576 | s014124608 | 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 | s962735843 | Accepted | N,X,T = map(int,input().split())
tmp = N//X
tmp2 = N%X
if tmp2 == 0:
ans = tmp * T
else:
ans = (tmp+1)*T
print(ans)
|
p02576 | s168267475 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print((n//x) * t)
else:
print((n//x+1)*t) |
p02576 | s784941833 | Accepted | x, n, t = list(map(int, input().split()))
result = (-(-x // n)) * t
print(result) |
p02576 | s075416514 | Accepted | n, x, t = map(int, input().split())
a = n // x
if n % x == 0:
print(a * t)
else:
print((a + 1) * t) |
p02576 | s834707477 | Accepted | i = list(map(int, input().split()))
ws = i[0]
cs1 = i[1]
cs2 = i[1]
t = i[2]
n = 1
while ws > cs1:
n += 1
cs1 += cs2
tt = n * t
print(tt)
|
p02576 | s659756976 | Accepted | n, x, t = map(int, input().split())
r = n % x
res = (n // x + 1) * t if n % x != 0 else n // x * t
print(res) |
p02576 | s238995783 | Accepted | n,x,t=map(int, input().split())
tako = n//x
amari = n%x
ans = tako*t
if amari != 0:
ans += t
print(ans) |
p02576 | s253244117 | Accepted | import sys
sys.setrecursionlimit(10**7)
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 LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,X,T = MI()
print(T*((N+X-1)//X))
|
p02576 | s067392310 | Accepted | n, x, t = map(int, input().split())
if n%x == 0:
print(n//x*t)
else:
print((n//x+1)*t) |
p02576 | s508709812 | Accepted | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,X,T=MI()
cnt=(N+X-1)//X
ans=cnt*T
print(ans)
main()
|
p02576 | s606465446 | Accepted | n, x, t = map(int, input().split())
print(((n - 1) // x + 1) * t)
|
p02576 | s543459292 | Accepted | import math
N,X,T=map(int,input().split())
print(math.ceil(N/X)*T) |
p02576 | s710446703 | Accepted | import math
n, x, t = map(int,input().split())
print(math.ceil(n/x)*t) |
p02576 | s767990057 | Accepted | n, x, t =map(int, input().split())
k = (n + x - 1) // x
ans = k * t
print(ans) |
p02576 | s227428439 | Accepted | n, x, t = list(map(int, input().rstrip().split(" ")))
print(((n-1)//x + 1)*t) |
p02576 | s473268165 | Accepted | N, X, T = map(int, input().split())
print((N + (X-1)) // X * T)
|
p02576 | s640644938 | Accepted | # -*- coding: utf-8 -*-
# A
import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
n, x, t = map(int, input().split())
print(math.ceil(n / x)*t)
|
p02576 | s190386417 | Accepted | n, x, t = map(int, input().split())
a = n // x
if n % x != 0:
a += 1
print(a * t)
|
p02576 | s696281189 | Accepted | #176-A Takoyaki
takoyaki = input().split()
totalTime = -(-int(takoyaki[0]) // int(takoyaki[1])) * int(takoyaki[2])
print(totalTime) |
p02576 | s242873447 | Accepted | N,X,T = map(int,input().split())
print((N+X-1)//X*T) |
p02576 | s184934606 | Accepted | N,X,T = map(int,input().split())
count = 1
while N > X:
N = N - X
count += 1
print(T*count) |
p02576 | s934799924 | Accepted | #A - Takoyaki
N,X,T = map(int,input().split())
Time = (int(N / X ) ) * T
amari = N % X
if amari != 0 :
Time += T
# 出力
print(Time)
|
p02576 | s969854531 | Accepted | n, x, t = map(int, input().split())
print((n + x - 1) // x * t)
|
p02576 | s518602621 | Accepted | n, x, t = map(int, input().split())
temp = int(n / x)
if n % x != 0:
temp += 1
print(t * temp) |
p02576 | s769382910 | Accepted | 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)
|
p02576 | s257909108 | 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 | s018814811 | Accepted | import math
n,x,t = map(int, input().split())
ans = math.ceil(n/x) * t
print(ans) |
p02576 | s090039239 | Accepted | import math;
n,x,t=list(map(int,input().split()))
print(math.ceil(n/x)*t) |
p02576 | s569641037 | Accepted | def resolve():
N, X, T = map(int,input().split())
turn = N//X
if N%X == 0:
print(turn*T)
else:
print((turn+1)*T)
resolve() |
p02576 | s871303125 | Accepted | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n,x,t=mp()
print(((n-1)//x+1)*t) |
p02576 | s485414694 | Accepted | import math
N, X, T = map(int, input().split())
print(math.ceil(N/X)*T) |
p02576 | s954919334 | Accepted | n, x, t = map(int, input().split())
num = n // x
if n % x != 0:
num += 1
print(t * num) |
p02576 | s098798881 | Accepted | N,X,T =map(int,input().split())
ans =T*(N//X)
if N%X!=0:
ans += T
print(ans) |
p02576 | s288995851 | Accepted | n,x,t = map(int,input().split())
if n%x == 0:
print(int(t*n/x))
else:
print(int(t*(n//x + 1))) |
p02576 | s212654165 | Accepted | n,x,t = map(int,input().split())
ans = -(-n//x)*t
print(ans) |
p02576 | s740718035 | Accepted | n,x,t=map(int,input().split())
tt=((n-1)//x+1)*t
print(tt)
|
p02576 | s926634933 | Accepted | import math
n,x,t=map(int,input().split())
print(math.ceil(n/x)*t) |
p02576 | s896635200 | Accepted | from math import ceil
def mlt(): return map(int, input().split())
x, y, z = mlt()
print(ceil(x/y)*z)
|
p02576 | s556144463 | Accepted | import math
n,x,t = map(int, input().split())
print(math.ceil(n/x)*t) |
p02576 | s366966119 | Accepted | def main():
N, X, T = (int(i) for i in input().split())
print((0--N//X)*T)
if __name__ == '__main__':
main()
|
p02576 | s753792796 | Accepted | n,x,t = map(int,input().split())
x = n/x
if x%1 == 0:
print(int(x)*t)
else:
print((int(x)+1)*t) |
p02576 | s992716364 | Accepted | from math import ceil
# print('input >>')
N, X, T = map(int,(input().split()))
# print('-----output-----')
print(ceil(N / X) * T) |
p02576 | s192055364 | Accepted | N,X,T = map(int, input().split())
if N%X == 0:
print(N//X*T)
else:
print((N//X+1)*T) |
p02576 | s840309116 | Accepted | n,x,t = map(int,input().split())
cnt = -((-n)//x)
print(t*cnt) |
p02576 | s382940311 | Accepted | kk = list(map(int, input().split()))
a = kk[0] - (kk[0] % kk[1])
b = a / kk[1]
if (kk[0] % kk[1]) == 0:
answer = b * kk[2]
else:
answer = (b + 1) * kk[2]
print(int(answer)) |
p02576 | s527902647 | Accepted | n,x,t = map(int,input().split())
if(n%x==0):
print((n//x)*t)
else:
print((n//x)*t+t) |
p02576 | s653459020 | Accepted | N,X,T = map(int,input().split())
if N%X == 0:
a = N//X
else:
a = N//X + 1
print(a*T) |
p02576 | s155465358 | Accepted | #A
N, X, T=map(int, input().split())
print((N//X)*T if N%X ==0 else (N//X+1)*T) |
p02576 | s521562498 | Accepted | N, X, T = map(int, input().split())
result = N // X * T
if N % X > 0:
result += T
print(result) |
p02576 | s081975523 | Accepted | N, X, T = map(int, input().split())
if N % X == 0:
print((N//X)*T)
else:
print((N//X + 1)*T)
|
p02576 | s155526148 | Accepted | def main():
N, X, T = map(int, input().split())
if N % X == 0: return N // X * T
else: return (N//X + 1) * T
if __name__ == '__main__':
print(main())
|
p02576 | s574242446 | 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 | s939465901 | Accepted | x,n,t = map(int,input().split(" "))
cnt =0
while x > 0:
x -= n
cnt += 1
print(cnt * t) |
p02576 | s001740538 | Accepted | n, x, t = input().split()
z = ((int(n)+int(x))-1)//int(x)
ans = z * int(t)
print(ans)
|
p02576 | s900270697 | Accepted | N, X, T = map(int, input().split())
x = int(N / X)
x = x + 1 if N % X != 0 else x
ans = T * x
print(ans) |
p02576 | s523348346 | Accepted | n, x, t = map(int, input().split())
print(t * ((n + x - 1) // x))
|
p02576 | s527504841 | Accepted | N, X, T = map(int,input().split())
ans = -(-N // X) * T
print(ans) |
p02576 | s930342094 | Accepted | n, x, t = map(int, input().split())
print(((n - 1) // x + 1) * t)
|
p02576 | s742927351 | Accepted | def inputlist(): return [int(j) for j in input().split()]
N,X,T =inputlist()
a = (N//X) + int(N % X != 0)
print(a*T) |
p02576 | s934722563 | Accepted | N, X, T = map(int,input().split())
if N % X == 0:
print((N//X)*T)
else:
print((N//X+1)*T) |
p02576 | s682048724 | Accepted | n,x,t=map(int,input().split())
if n%x==0:
print((n//x)*t)
else:
print((1+n//x)*t) |
p02576 | s819203488 | Accepted | import math
N,X,T = map(int,input().split())
print(math.ceil(N/X)*T) |
p02576 | s924301376 | Accepted | import math
n,x,t=map(int,input().split())
y = t * int(math.ceil(n/x))
print(y)
|
p02576 | s249208603 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n/x)*t) |
p02576 | s700804497 | Accepted | x, y, z = map(int, input().split())
print(int((x + y - 1) / y) * z)
|
p02576 | s547219652 | Accepted | tako = list(map(int, input().split()))
if tako[0] % tako[1] != 0:
print(tako[0]//tako[1]*tako[2]+tako[2])
else:
print(tako[0]//tako[1]*tako[2]) |
p02576 | s195355259 | Accepted | N,X,T=map(int,input().split())
if N%X==0:
print(str(((N//X))*T))
else:
print(str(((N//X)+1)*T)) |
p02576 | s932277606 | Accepted | int_n, int_x, int_t = map(int, input().split())
#print(int_n, int_x, int_t)
if int_n % int_x == 0:
print(int_n // int_x *int_t)
else:
print(((int_n // int_x) + 1)*int_t) |
p02576 | s015646379 | Accepted | n, x, t = map(int, input().split())
cnt = 0
time = 0
while True :
if cnt >= n:
break
else:
cnt += x
time += t
print(time) |
p02576 | s945264148 | Accepted | n, x, t = map(int, input().split())
ans = t * (n//x)
print(ans+t if n%x else ans) |
p02576 | s522697592 | Accepted | def resolve():
import math
N, X, T = map(int, input().split())
print(math.ceil(N/X)*T)
resolve() |
p02576 | s108891223 | Accepted | N, X, T = map(int, input().split())
import math
ans = math.ceil(N/X)*T
print(ans) |
p02576 | s636873663 | Accepted | n, x, t = map(int, input().split())
m = (n+x-1)//x
print(t*m)
|
p02576 | s360547112 | Accepted | N, X, T = [int(x) for x in input().split()]
result = -(-N // X) * T
print(result)
|
p02576 | s845184726 | Accepted | n, x, t = map(int, input().split())
y = int(n / x)
if n % x == 0:
time = y * t
else:
time = (y + 1) * t
print(time) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.