problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s990230877 | Wrong Answer | N,X,T = map(int,input().split())
print(((N//X)+1)*T) |
p02576 | s348808890 | Wrong Answer | n,x,t = map(int,input().split())
if x == 1 | n%x ==0:
print((n//x)*t)
else:
print((n//x)*t) |
p02576 | s996262817 | Wrong Answer | N, X, T = map(int, input().split())
if N <= X:
print(T)
else:
a = N // X
b = a * T
c = b + T
print(c)
|
p02576 | s931822042 | Wrong Answer | N,X,T = map(int,input().split())
if((N - X ) <= X):
print(T + T)
if((N - X) > X):
print(T*T)
if((N == X)):
print(T)
if(N < X):
print(T)
|
p02576 | s595202626 | Wrong Answer | N, X, T = map(int, input().split())
cnt = N // X
if cnt == 0:
print(T)
else:
print(cnt*T) |
p02576 | s342775067 | Wrong Answer | N,X,T=map(int,input().split())
if N//X==0:
t=(N//X)*T
else:
t=((N//X)+1)*T
print(t)
|
p02576 | s362892988 | Wrong Answer | N,X,T= map(int, input().split())
print((int(N / X) + 1) * T) |
p02576 | s539531202 | Wrong Answer | N,X,T=list(map(int,input().split(' ')))
if N%T!=0:
print(T*(N//X+1))
else:
print(T*(N//X))
|
p02576 | s543549676 | Wrong Answer | n,x,t=map(int,input().split())
k=n//x
print((k+1)*t) |
p02576 | s546125279 | Wrong Answer | import math
N,X,T = map(int,input().split())
print(math.floor(N/X)*T) |
p02576 | s375862867 | Wrong Answer | n,x,t=list(map(int,input().split()))
a=1
q=0
while(q==0):
if(a*x>n):
print(a*t)
q=1
else:
a=a+1 |
p02576 | s503128781 | Wrong Answer | print(0) |
p02576 | s653446839 | Wrong Answer | n,x,t = map(int,input().split())
if n%x==0:
print(n/x*t)
else:
print(((n//x)+1)*t) |
p02576 | s990126405 | Wrong Answer | N,X,T = map(int,input().split())
print(T*(N/X+1)) |
p02576 | s687553524 | Wrong Answer | string = input("Enter your input: ")
print(string)
string = string.split()
n = int(string[0])
x = int(string[1])
t = int(string[2])
if(n%x == 0):
res = int(n/x) * t
print(res)
else:
res = (int(n/x) + 1) * t
print(res) |
p02576 | s690400666 | Wrong Answer | import numpy as np
N, X, T = map(int, input().split())
n=1
while T*n < np.ceil(N/X):
n+=1
print(T*n) |
p02576 | s146115880 | Wrong Answer | n,x,t = map(int,input().split())
a = (n//x + 1)*t
print(a) |
p02576 | s429347574 | Wrong Answer | n,x,t=map(int,input().split())
if n%x==0:
print(n/x*t)
else:
print((n/x+1)*t) |
p02576 | s727487844 | Wrong Answer | # Nは総数 Xはワンセットの個数 Tはワンセットにかかる時間
Tako_lists = input().split()
N = int(Tako_lists[0])
X = int(Tako_lists[1])
T = int(Tako_lists[2])
if N // X == N / X:
print(N / X * T)
else:
print((N // X + 1 ) * T)
|
p02576 | s554248519 | Wrong Answer | n = list(map(int, input().split()))
a = n[0] // n[1]
print((a + 1) * n[2]) |
p02576 | s151561429 | Wrong Answer | n, x, t = map(int, input().split())
nt = (n // x) + 1
print(nt * t) |
p02576 | s515990030 | Wrong Answer | N,X,T = map(int,input().split())
if N % (X*T) ==0:
a = (N //X)*T
else :
a = (N //X +1)*T
print(a) |
p02576 | s097404538 | Wrong Answer | N, X, T = map(int, input().split())
if N % T > 0:
ret = (N // X + 1) * T
else:
ret = (N // X) * T
print(ret) |
p02576 | s922450832 | Wrong Answer | n,x,t=map(int,input().split())
m= t//x
print(n*m) |
p02576 | s053624683 | Wrong Answer | n,x,t=map(int,input().split())
if n<=x:
print(t)
else:
while(n>x):
x+=x
t+=t
print(t)
|
p02576 | s663630678 | Wrong Answer | N, X, T = (int(d) for d in input().split())
print((N // X) * T) |
p02576 | s505026723 | Wrong Answer | N, X, T = [int(i) for i in input().split()]
print((N // X) * T) |
p02576 | s649283564 | Wrong Answer | (n, x, t) = map(int, input().split(' '))
r = round(n/x)
print(t*x) |
p02576 | s115475695 | Wrong Answer | n, x, t = map(int, input().split())
print((n + x - 1 // x) * t) |
p02576 | s807913594 | Wrong Answer | a = list(map(int, input().split()))
if a[0]%a[1]==0:
print(a[0]//a[1])
else:
print(a[2]*(a[0]//a[1])+a[2]) |
p02576 | s144304626 | Wrong Answer | n, x, t = map(int,input().split())
if n%x==0:
print((n//x)*t)
else:
n = n//2 +1
print(n*t) |
p02576 | s587545705 | Wrong Answer | n,x,t=map(int,input().split())
p=n//x
print(t*(p+1)) |
p02576 | s270785695 | Wrong Answer | n, x, t = map(int, input().split())
nt = (n + x - 1) / x
print(int(nt * t)) |
p02576 | s782851198 | Wrong Answer | 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)*t)
|
p02576 | s219134226 | Wrong Answer | N, X, T = map(int, input().split())
for i in range(1, 1000):
if N-X*i <= X:
print(T*(i+1))
exit()
|
p02576 | s523287081 | Wrong Answer | n, x, t = map(int, input().split())
print((n//x + 1) * t )
|
p02576 | s450146643 | Wrong Answer | n, x, t = map(int, input().split())
a = n % x
b = n // x
if n % x == 0:
print(n/x*t)
else:
print((b*t)+(t)) |
p02576 | s525202413 | Wrong Answer | N, X, T = map(int, input().split())
print((int(N / X) + 1) * T) |
p02576 | s622977896 | Wrong Answer | N,X,T=map(int,input().split())
a=N//X
c=a*T+T
print(c) |
p02576 | s816241008 | Wrong Answer | N,X,T = map(int,input().split())
print(T*(N//X)) |
p02576 | s913292785 | Wrong Answer | a = input("N X T").split()
n = int(a[0])
x = int(a[1])
t = int(a[2])
ans = (n // x) * t
if n % x > 0:
ans += t
print(ans) |
p02576 | s938574716 | Wrong Answer | # -*- coding: utf-8 -*-
"""
Created on Sat Aug 22 20:59:55 2020
@author: naoki
"""
import sys
N,X,T = map(int,input().split())
for i in range(N):
if N<=X*(i+1):
time = T*(i+1)
print(time)
sys.exit
|
p02576 | s773352650 | Wrong Answer | N, X, T = map(int, input().split())
print(T * ((N // X) + 1)) |
p02576 | s720476821 | Wrong Answer | n, x, t = map(int,input().split())
if n/x == 0:
print((n/x)*t)
else:
print(int(((n/x)+1)*t)) |
p02576 | s688039103 | Wrong Answer | N,X,T = map(int, input().split())
times, mod = divmod(N,X)
if mod == 0:
print(times * T)
else:
print(times * T + 1) |
p02576 | s085364559 | Wrong Answer | def probA():
N, X, T = map(int, input().split())
t = 0
while N > 0:
N //= X
t += T
print(t)
if __name__ == '__main__':
probA()
|
p02576 | s896778299 | Wrong Answer | N,X,T=map(int,input().split())
print(N//X*T) |
p02576 | s879825834 | Wrong Answer | n,x,t=map(int,input().split())
print(t*(n//x+1)) |
p02576 | s175979916 | Wrong Answer | n, x, t = map(int, input().split())
if n%x==0:
print(n*t/x)
else:
print( (int(n/x)+1)*t ) |
p02576 | s587003538 | Wrong Answer | N,X,T= map(int, input().split())
if N%X == 0:
A = N/X*T
if N%X != 0:
A = (N//X+1)*T
print(A) |
p02576 | s452628224 | Wrong Answer | def calculate(N,X,T):
x = N // X
if x ==0:
return T
elif not N % X == 0:
return (x + 1)*T;
else:
return x*T |
p02576 | s426073681 | Wrong Answer | N, X, T = map(int, input().split())
if N % T == 0:
print((N // X) * T)
else:
print(((N // X) + 1) * T) |
p02576 | s507173861 | Wrong Answer | n, x, t = list(map(int, input().split()))
print(t*n//x)
|
p02576 | s886076997 | Wrong Answer | from math import ceil
def resolve():
N, X, T = map(int, input().split(" "))
if N > X:
print(ceil(N/X)*T)
if __name__ == "__main__":
resolve()
|
p02576 | s179311546 | Wrong Answer | N, X, T = map(int,input().split())
n = 0
if N % X == 0:
n = N / X
else:
n = N // X + 1
print(n * T)
|
p02576 | s887315975 | Wrong Answer | n, x, t = map(int, input().split())
print((n / x) * t) |
p02576 | s182179661 | Wrong Answer | a = input().split(" ")
N = int(a[0])
X = int(a[1])
T = int(a[2])
print((N//X +1)*T) |
p02576 | s875099702 | Wrong Answer | n, x, t = map(int, input().split())
if x == 1:
print(t*n)
else:
print(t*((n // x)+1)) |
p02576 | s991860644 | Wrong Answer | N,X,T = map(int,input().split())
print(N//X*T) |
p02576 | s674737140 | Wrong Answer | N,X,T = map(int, (input().split(" ")))
SUM = 0
while N >= 0:
N = N - X
SUM += 1
res = SUM * T
print(res) |
p02576 | s716856714 | Wrong Answer | N,X,T=map(int,input().split())
a=N//T
if N%T==0:
print(a*X)
else:
print(a*X+X) |
p02576 | s403242789 | Wrong Answer | def main():
N, X, T = map(int, input().split())
print(round(N / X) * T)
if __name__ == "__main__":
main() |
p02576 | s144321224 | Wrong Answer | n,x,t = map(int,input().split())
print((n//x+1)*t) |
p02576 | s258417541 | Wrong Answer | N,X,T = map(int,input().split())
import math
print(math.ceil(N / X) * 6) |
p02576 | s633155154 | Wrong Answer | ls = input().split()
N, X, T = int(ls[0]), int(ls[1]), int(ls[2])
keigo = N // X + 1
print(keigo*T) |
p02576 | s647074303 | Wrong Answer | n, x, t = map(int, input().split())
print(((n // x) + 1) * t) |
p02576 | s841801988 | Wrong Answer | n,x,t = map(int,input().split())
tmp = n/x
print(round(tmp)*t) |
p02576 | s382311772 | Wrong Answer | N, X, T = list(map(int, input().split()))
print((N // X + 1) * T) |
p02576 | s913265086 | Wrong Answer | N,X,T = map(int, input().split())
print(int(N*T/X)) |
p02576 | s068243317 | Wrong Answer | N,X,T = map(int,input().split())
if N % (X*T) ==0:
a = (N //X)*T
else :
a = ((N //X) +1)*T
print(a) |
p02576 | s113608618 | Wrong Answer | def main():
n, x, t = map(int, input().split())
times = n//x
amari = n%x
minutes = times * t
if amari ==0:
return print(minutes)
else:
return print(minutes + 1)
main() |
p02576 | s554702632 | Wrong Answer | from math import floor
N, X, T = map(int, input().split())
print(floor(N/X)*T) |
p02576 | s663159754 | Wrong Answer | import numpy as np
N, X, T = map(int, input().split())
for n in range(1,1000):
if n>=N/(T*X):
break
n+=1
print(T*n)
|
p02576 | s309282399 | Wrong Answer | n,x,t = map(int,input().split())
print(((n/x)+1)*t) |
p02576 | s178084837 | Wrong Answer | n,x,t = map(int, input().split())
ans = (n//x + 1) * t
print(ans) |
p02576 | s177792634 | Wrong Answer | import math
n,x,t = map(int,input().split())
if n%x == 0:
c = n/x
else:
b = float(n)/float(x)
c = math.ceil(b)
a = c*t
print(a) |
p02576 | s502810141 | Wrong Answer | a,b,c=map(int,input().split())
d=a//c
print(d*c+c) |
p02576 | s103431243 | Wrong Answer | N,X,T = map(int, input().split())
if(N%X!=0):
A = int(N/X)+1
else:
A = N/X
print(A*T) |
p02576 | s000744904 | Wrong Answer | a,b,c=map(int,input().split())
print((a//b)*c) |
p02576 | s734904444 | Wrong Answer | N, X, T = map(int,input().split())
if N <= X:
print(T)
else:
if N % X == 0:
A = N / X * T
print(A)
else:
B = N // X * T
print(B) |
p02576 | s515864530 | Wrong Answer | N,T,u = map(int,input().split())
print(((N//T)+1)*u) |
p02576 | s332434989 | Wrong Answer | n,x,t=map(int,input().split())
print(n//x+((n%x)!=0)*t) |
p02576 | s651776528 | Wrong Answer | n, x, y = list(map(int, input().split()))
print((n // x + 1) * y) |
p02576 | s137517851 | Wrong Answer | n,x,t = map(int, input().split())
print(t*(n+x-1)/x) |
p02576 | s120829905 | Wrong Answer | n, x, t = map(int,input().split())
count = 1
while x<n:
x = x*t
count+=1
print(count*t) |
p02576 | s047150093 | Wrong Answer | a,b,c=map(int,input().split())
print((1+a//b)*c)
|
p02576 | s167106504 | Wrong Answer | q = input().strip().split()
N, X, T = int(q[0]), int(q[1]), int(q[2])
ans = ((N + X) // X - 1) * T
print(ans) |
p02576 | s953172546 | Wrong Answer | n, x, t = map(int, input().split())
if n % x == 0:
print(n/x*t)
else:
print((int(n/x)+1)*t) |
p02576 | s042153072 | Wrong Answer | n, x, t = map(int, input().split())
print((n//x) * t) if n%x==0 else print((n//x) * t) |
p02576 | s853713034 | Wrong Answer | A,B,C=input().split()
A=int(A)
B=int(B)
C=int(C)
D=A/B
D=int(D)
print((D)*C) |
p02576 | s301749072 | Wrong Answer | n,x,t = map(int,input().split())
if n % x == 0:
c = n / x
else:
b = n / x
c = b // 1
a = c * t
print(a) |
p02576 | s209727496 | Wrong Answer | n, x, t = map(int, input().split())
print(((n // x) + 1) * t) |
p02576 | s628263864 | Wrong Answer | a,b,c=(int(x) for x in input().split())
y=(a//b+1)*c
print(y) |
p02576 | s093601470 | Wrong Answer | import math
N, X, T = map(int, input().split())
print(math.ceil(N / X)) |
p02576 | s038779806 | Wrong Answer | n,x,t= map(int,input().split())
f1=n/x
f2=n//x
if f1==f2:
print(f2)
else:
print(f2+1) |
p02576 | s213304373 | Wrong Answer | N,X,T = map(int,input().split())
ans = (N + X -1) / X * T
print(ans) |
p02576 | s866770778 | Wrong Answer | N, X, T = map(int, input().split())
for i in range(200):
if (i+1) * X >= N:
print((i+1)*T)
break |
p02576 | s333608766 | Wrong Answer | N, X, T = map(int,input().split())
print(( N // X + 1 ) * T ) |
p02576 | s832730039 | Wrong Answer | n, x, t = map(int, input().split())
if n%t == 0:
print(int((n/x)*t))
else:
print(int((n//x + 1)*t))
|
p02576 | s526241022 | Wrong Answer | n, x, t = map(int, input().split())
cnt = n/x
if n%x > 0:
cnt += 1
print(int(cnt*t)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.