problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s519702126 | Wrong Answer | n,x,t = map(int, input().split())
if n <= x:
print(x)
elif n % x == 0:
print(n//x*t)
else:
print((n//x+1)*t) |
p02576 | s520375684 | Wrong Answer | n,x,t = map(int,input().split())
if n%x == 0:
print((n/x)*t)
else:
print(((n+x)//x)*t) |
p02576 | s278352171 | Wrong Answer | n,x,t=map(int, input().split())
print(n//x*t+1) |
p02576 | s392055574 | Wrong Answer | N,X,T=map(int,input().split())
a=N//X
b=N%X
c=a*T+T
print(c) |
p02576 | s150745039 | Wrong Answer | N, X, T = map(int, input().split())
print(((N//X)+1)+T) |
p02576 | s429765661 | Wrong Answer | N, X, T = map(int, input().split(' '))
print(int(T*N/X)) |
p02576 | s492333607 | Wrong Answer | N, X, T = map(int, input().split())
if N%T == 0:
print(N//X*T)
else:
print(N//X*T+T) |
p02576 | s244443404 | Wrong Answer | s = input()
max = 0
count = 0
for i in range(3):
if s[i]=="R":
count+=1
else:
if max < count:
max = count
count = 0
if max < count:
max = count
print(max) |
p02576 | s923582518 | Wrong Answer | n,x,t = map(int,input().split())
if n % x == 0:
print((n // x) * t + t)
else:
print((n // x) * t) |
p02576 | s802372832 | Wrong Answer | import sys
input = sys.stdin.readline
def takoyaki(n,x,t):
acc = 0
for i in range(1000):
if i % t == 0:
acc += x
if x >= n:
return i
return 0
if __name__ == "__main__":
n,x,t = map(int,input().split())
print(takoyaki)
|
p02576 | s771222731 | Wrong Answer | N,X,T=map(int, input().split())
a=N//X+1
if N%X==0:
print(a*T-1)
else:
print(a*T) |
p02576 | s784669585 | Wrong Answer | import math
n,x,t = map(int,input().split())
if n%x == 0:
c = n/x
else:
b = n/x
c = math.ceil(b)
a = c*t
print(a) |
p02576 | s344349217 | Wrong Answer | n,x,t=map(int,input().split())
print(-n/x*-t) |
p02576 | s750415833 | Wrong Answer | N, X, T = map(int, input().split())
time = ((N // X) + 1) * T
print(time) |
p02576 | s891182802 | Wrong Answer | n, x, t = map(int,input().split())
res = 0
res = n // x * t
if n % x != 0:
res += t
print(t) |
p02576 | s652740094 | Wrong Answer | n, x, t=map(int,input().split())
print(((n//x)*t)+t)
|
p02576 | s343920919 | Wrong Answer | n,x,t = map(int,input().split())
if n%x ==0:
print(t*n)
else:
print(t*(n//x +1)) |
p02576 | s016184950 | Wrong Answer | n,x,t = map(int,input().split())
if n/x == n//x:
print(n/x*t)
else:
print((n//x+1)*t) |
p02576 | s618965695 | Wrong Answer | import sys
import copy
from collections import deque
import collections
import itertools
stdin = sys.stdin
mod = 10**9+7
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, x, t = na()
if n%x==0:
print(t*(n/x))
else:
print(int(t*(n//x) + t))
|
p02576 | s982131763 | Wrong Answer | N,T,X = map(int,input().split())
print(T*(N/X + 1)) |
p02576 | s624109602 | Wrong Answer | n,x,t=map(int,input().split())
if x>n and n==x:
print(t)
elif x==1:
print(n*t)
else:
print(2*t*(n//x)) |
p02576 | s891046944 | Wrong Answer | NXT= [int(i) for i in input().split(' ')]
T=int(NXT[0]/NXT[1])+1
print(int(T*NXT[2])) |
p02576 | s485601051 | Wrong Answer | x,t,n=list(map(int, input().split()))
for i in range(10000000):
if x*t*i>=n:
print(i*t)
exit()
|
p02576 | s813458285 | Wrong Answer | N, X, T = map(int,input().split())
a = N / X
if a == int(a):
print(int(a * T))
else:
print(int((a + 1) * T)) |
p02576 | s328397260 | Wrong Answer | x,n,t= map(int, input().split())
a=x//n+1
print(str(a*t))
|
p02576 | s362518051 | Wrong Answer | n, x, t = map(int, input().split())
if n % t == 0:
print((n // x) * t)
else:
print(((n // x) + 1) * t) |
p02576 | s381180368 | Wrong Answer | n, x, t = map(int, input().split())
if n<=x:
print(int(t))
else:
print(int((n//x)+1)*t) |
p02576 | s432340319 | Wrong Answer | n,x,t = map(int,input().split())
x = n/x
if x%1 == 0:
print(int(x)*t)
else:
print((int(n/x)+1)*t) |
p02576 | s301738529 | Wrong Answer | N,X,T = 100,20,30
N/X * T |
p02576 | s352229130 | Wrong Answer | N,X,T= map(int,input().split())
print((N//X)*T+T) |
p02576 | s167092618 | Wrong Answer | n,x,t=map(int,input().split())
if n%x==0:
s=n/x
print(s*t)
else:
s=n//x
print((s+1)*t)
|
p02576 | s484727951 | Wrong Answer | n, x, t =map(int,input().split())
if n%x == 0:
print(n/x*t)
else:
print((n//x+1)*t)
|
p02576 | s343092858 | Wrong Answer | N,X,T=map(int,input().split())
a= N/X
b = int(a)
if a-b > 0:
a = b+1
res = b*T
print(res) |
p02576 | s763816858 | Wrong Answer | N,X,T = map(int,input().split())
print((N // X + 1)*T) |
p02576 | s758861610 | Wrong Answer | a,b,c=list(map(int,input().split()))
print(int((a//b)*c)) |
p02576 | s098957295 | Wrong Answer | N, X, T = map(int, input().split())
a = N / X
print(a * T) |
p02576 | s888563260 | Wrong Answer | line = input().split()
n = int(line[0])
x = int(line[1])
t = int(line[2])
print(-(n//x)*t) |
p02576 | s081888216 | Wrong Answer | N ,X, T = map(int,input().split())
a = N // X + 1
total = a *T
print(total) |
p02576 | s394214709 | Wrong Answer | n, x, t = map(int, input().split())
print(t) |
p02576 | s668985099 | Wrong Answer | N, X, T = map(int, input().split())
count = 1
check = X
if X > 1:
while True:
X = N - X
if X > check:
count += 1
continue
else:
count += 1
TotalTime = T * count
break
else:
TotalTime = T * N
print(TotalTime) |
p02576 | s795253947 | Wrong Answer | n, x, t = map(int, input().split())
if n % x == 0:
c = n / x
else:
b = n / x
c = b // 1
a = int(c * t)
print(a)
|
p02576 | s982001421 | Wrong Answer | import sys
input = sys.stdin.readline
def takoyaki(n,x,t):
acc = 0
for i in range(1000):
if i % t == 0:
acc += x
if x >= n:
return i
return 0
if __name__ == "__main__":
n,x,t = input().split()
print(takoyaki)
|
p02576 | s503813485 | Wrong Answer | N, X, T = map(int, input().split())
ans = N//X
if N%T != 0:
ans+=1
print(ans*T)
|
p02576 | s916840941 | Wrong Answer | N,X,T=map(int,input().split())
for i in range(1,N):
if X*i>=N:
print(T*i)
break |
p02576 | s209044194 | Wrong Answer | n, x, t = map(int, input().split())
print((n // x + 1) * t)
|
p02576 | s877561515 | Wrong Answer | # math.ceil(N / X) * T分
import math
N, X, T = [int(i) for i in input().split()]
print(math.ceil(N/X * T)) |
p02576 | s928787627 | Wrong Answer | 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 | s638308471 | Wrong Answer | N, X, T = list(map(int, input().split()))
print((N//X+1)*T) |
p02576 | s493929179 | Wrong Answer | N,K,T = map(int,input().split())
print((N//K)*T) |
p02576 | s777442248 | Wrong Answer |
N,X,T = map(int, input().split())
ans = int(N / X + 1) * T
print(ans) |
p02576 | s166730737 | Wrong Answer | def main():
n, x, t = map(int, input().split())
print(int(n / x + 0.5) * t)
if __name__ == '__main__':
main()
|
p02576 | s770458336 | Wrong Answer | n,x,t = map(int,input().split())
if n//x == 0 :
ans = (n//x) * t
else :
ans = ((n//x)+1) * t
print(ans)
|
p02576 | s648466083 | Wrong Answer | N,X,T = [int(i) for i in input().split()]
print((N+X-1)//T) |
p02576 | s755489534 | Wrong Answer |
N,X,T = map(int, input().split())
ans = N / X * T
print(ans) |
p02576 | s276480485 | Wrong Answer | N,X,T = map(int,input().split())
import math
k = math.floor(N/X)
print(T*(k+1))
|
p02576 | s349975057 | Wrong Answer | N,X,T= map(int, input().split())
if N%X==0:
print((N/X)*T)
else:
print(((N/X)+1)*T) |
p02576 | s880470608 | Wrong Answer | N, X, T = map(int, input().split())
if N // X:
print(N // X * T)
else:
print((N // X + 1) * T)
|
p02576 | s038898880 | Wrong Answer | N,X,T = map(int,input().split())
print((N % X ) * (T + 1)) |
p02576 | s588491025 | Wrong Answer | n, x, t = [int(x) for x in input().split()]
c = n / x + 1
print(c * t) |
p02576 | s262978765 | Wrong Answer | n, x, t = input().split()
N = int(n)
X = int(x)
T = int(t)
Tn = int((N * T) / X)
print(Tn) |
p02576 | s386524670 | Wrong Answer | N, X, T = map(int, input().split())
time = (N+X)//X
print(T * time) |
p02576 | s192390892 | Wrong Answer | n,x,t=map(int,input().split())
l=int(n/x)
if l>n/x:p=l+1
else:p=l
print(p*t) |
p02576 | s375730904 | Wrong Answer | n,x,t = map(int,input().split())
if n==x:
print(0)
else:
tmp = n/x
print(round(tmp)*t) |
p02576 | s068113234 | Wrong Answer | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,x,t = list(map(int, input().split()))
ans = t * (n//x + int(n&x!=0))
print(ans) |
p02576 | s320402107 | Wrong Answer | [n,x,t]=list(map(int,input().split()))
kaisu=n//x+1
if n%x!=0:
kaisu+=1
ans=kaisu*t
print(ans) |
p02576 | s613413169 | Wrong Answer | input1 = input()
input1 = input1.split()
N, X, T = int(input1[0]), int(input1[1]), int(input1[2])
result = int((N*T)/X)
print(result) |
p02576 | s741449044 | Wrong Answer | n,x,t=map(int,input().split())
c=0
while c<n:
c+=t
print(c//t) |
p02576 | s783561270 | Wrong Answer | import math
N,X,T=map(int,input().split(' '))
ans=math.ceil(N/X)
print(ans) |
p02576 | s446369602 | Wrong Answer | n,x,t=map(int,input().split())
if n%x==0:
print(n/x*t)
else:
print((n//x+1)*t) |
p02576 | s547787948 | Wrong Answer | n, x, t = map(int, input().split())
if n % t != 0:
print(((n // x) + 1) * t)
else:
print(int((n / x) * t))
|
p02576 | s166808960 | Wrong Answer | n,x,t=map(int,input().split())
print((n/x+1)*t) |
p02576 | s285118298 | Wrong Answer | oc, cap, time = map(int, input().split())
cnt = 0
while oc>0:
oc -= cap
cnt += time
print(time)
|
p02576 | s716440906 | Wrong Answer | n, x, t = list(map(int, input().split()))
print(((n//x)+1)*t) |
p02576 | s609209423 | Wrong Answer | N, X, T = map(int,input().split())
ans = N//X + 1
ans *= T
print(ans) |
p02576 | s801141322 | Wrong Answer | n,x,t=map(int,input().split())
if n//x==0:
print((n//x)*t)
else:
print((n//x+1)*t) |
p02576 | s033563641 | Wrong Answer | N,X,T=map(int,input().split())
if N%X==0:
print(T*N/X)
else:
print(T*(N//X+1)) |
p02576 | s586753669 | Wrong Answer | n, x, t = [int(i) for i in input().split()]
if n < x:
print(x)
else:
if n % x == 0:
print((n // x) * t)
else:
print(((n // x) + 1) * t)
|
p02576 | s725015899 | Wrong Answer | n,x,t = map(int, input().split())
cnt = (n//x) + 1
time = t * cnt
print(time) |
p02576 | s483160894 | Wrong Answer | N,X,T=map(int,input().split())
if N//X<N/X<N//X+1:
print((N//X+1)*T)
else:
print(N/X*T) |
p02576 | s812312012 | Wrong Answer | N, X, T = map(int,input().split())
n = 0
total = 0
if N % X == 0:
n = N / X
total = n * T
else:
n = N // X + 1
total = n * T
print(total) |
p02576 | s337467277 | Wrong Answer | n,x,t=map(int,input().split())
k=n//x
print((t+1)*k) |
p02576 | s683647570 | Wrong Answer | n, x, t =map(int,input().split())
if n%x == 0:
print(n/x*t)
else:
print((n//x+1)*t)
|
p02576 | s201787733 | Wrong Answer | X,K,D=map(int,input().split())
X=abs(X)
if X>=K*D:
print(X-K*D)
else:
y=X//D
z=K-y
if z%2==0:
print(K-y*D)
else:
print(K-(y+1)*D) |
p02576 | s127038996 | Wrong Answer |
n,x,t=map(int,input().split())
a=n//x
if (n/x)%2!=0:
a+=1
print(a*t)
|
p02576 | s713989457 | Wrong Answer | n,x,t=map(int,input().split())
m=t
a=x
while(x<=n):
x+=a
t+=m
print(t) |
p02576 | s274635621 | Wrong Answer | n,x,t=map(int,input().split())
print(((n//x)+1)*t) |
p02576 | s191837935 | Wrong Answer | n, x, t = map(int, input().split())
print((n // x + 1) * t) |
p02576 | s813559372 | Wrong Answer | N, X, T = map(int,input().split())
print(N/X*T) |
p02576 | s374166891 | Wrong Answer | n,x,t = map(int,input().split())
print((n % x + 1) * t) |
p02576 | s001025870 | Wrong Answer | A,B,C=map(int, input().split())
i,j=divmod(A,B)
if j == 0:
j=0
ttt=(i+j)*C
print(ttt) |
p02576 | s307392323 | Wrong Answer | N, X, T = map(int, input().split())
Y = int(N / X)
ans = Y * T
print(ans)
|
p02576 | s225745456 | Wrong Answer | (n, x, t) = map(int, input().split(' '))
r = round(n/x)
print(t*r) |
p02576 | s784695835 | Wrong Answer | import math
n,x,t=map(int,input().split())
r=math.ceil(n//x)*t
print(r) |
p02576 | s696461522 | Wrong Answer | X,T,N = map(int,input().split())
print(-(-N//X)*T) |
p02576 | s335835556 | Wrong Answer | N,T,X = map(int,input().split())
if N % X == 0:
print(T*N/X)
else:
print(T*(N//X+1)) |
p02576 | s177358928 | Wrong Answer | n, x, t = map(int, input().split())
if n % x >= 0:
print((n//x + 1) * t)
else:
print(n/x * t) |
p02576 | s774871383 | Wrong Answer | N,X,T = map(int, input().split())
if N % X == 0:
print((N/X)*T)
else:
print(((N-N%X)/X+1)*T) |
p02576 | s781155120 | Wrong Answer | import math
n,x,t = map(int,input().split())
print(math.ceil(n//x)*t)
|
p02576 | s389148347 | Wrong Answer | N, X,T= map(int, input().split())
result=(N*T)/X
print(int(result)) |
p02576 | s355444982 | Wrong Answer | n,x,t = map(int,input().split())
if n%x == 0:
print(n/x)
else:
print((n/x) + 1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.