problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02576 | s510687813 | Wrong Answer | N, X, T = map(int, input().split())
t = N // X
s = t % X
if s > 0:
time = T * (t + 1)
print(time)
else:
time = T * t
print(time) |
p02576 | s297301248 | Wrong Answer | n,x,k=map(int,input().split(' '))
print(((n/x)+1)*k)
|
p02576 | s299478162 | Wrong Answer | n, x, t = (int(i) for i in input().split())
print(round(n/x) * t) |
p02576 | s337983805 | Wrong Answer | 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
else:
count = (N // X) + 1
result = count * T
print(int(result)) |
p02576 | s368414984 | Wrong Answer | N,X,T = map(int, input().split())
print((N//X+1)*T)
|
p02576 | s950826816 | Wrong Answer | n,x,t=input().split()
n=int(n)
x=int(x)
t=int(t)
syou,amari=divmod(n,x)
if amari==0:
print(syou*t)
else:
print(syou*(t+1))
|
p02576 | s795748059 | Wrong Answer | N,X,T=input().strip().split()
N,X,T=[int(N),int(X),int(T)]
A=N/X
B=A*T
print(B)
|
p02576 | s821812892 | Wrong Answer | N,X,T=map(int, input().split())
if N%X==0:
print(N//X)
else:
print((N//X)+1) |
p02576 | s967680875 | Wrong Answer | N, X, T = map(int, input().split())
if N <= X:
print(T)
else:
print(int(N/X)*T) |
p02576 | s498345655 | Wrong Answer | A = list(map(int, input().split()))
c=2
while True:
b=A[0]-(A[1]*c)
if b<=0:
break
c+=1
print(c*A[2]) |
p02576 | s689887838 | Wrong Answer | if __name__=="__main__":
ans=0
x,y,z=map(int,input().split())
while(x>=0):
x=x-y
ans+=z
print(ans)
|
p02576 | s743045809 | Wrong Answer | n,x,t = map(int,input().split())
print(t*(n//t + 1)) |
p02576 | s446948033 | Wrong Answer | N, X, T = [int(i) for i in input().split()]
print(T * N // X) |
p02576 | s084129350 | Wrong Answer | n, x, t = map(int, input().split())
if n % x == 0:
print(n/x*t)
else:
print((n//x+1)*t) |
p02576 | s458735561 | Wrong Answer | List=list(map(int,input().split()))
if List[0]<=List[1]:
print(List[2])
else:
if List[1]!=1:
print(((List[0]//List[1])+1)*List[2])
else :
print(((List[0]//List[1]))*List[2])
|
p02576 | s513098866 | Wrong Answer | import math
n,x,t = map(float,input().split())
if n%x == 0:
c = n/x
else:
b = n/x
c = math.ceil(b)
a = c*t
print(a) |
p02576 | s479749444 | Wrong Answer | N, X, T = list(map(int, input().split()))
shou = N // X
amari = N - shou
if amari == 0:
print(T * shou)
else:
print(T * (shou + 1))
|
p02576 | s170769716 | Wrong Answer | N, X, T = map(int, input().split())
if N <= X:
print(T)
elif N%T == 0:
print(int(N/X)*T)
else:
print((int(N/X)*T)+T) |
p02576 | s994531560 | Wrong Answer | a = input().split()
b = int(a[0])
c = 0
while b >= 0:
b -= int(a[1])
c += int(a[2])
print(c)
|
p02576 | s445630373 | Wrong Answer | N, X, T = map(int, input().split())
print((N + X - 1) / X * T)
|
p02576 | s690503499 | Wrong Answer | total, max, time=map(int, input().split())
print (time*(total/max)+1) |
p02576 | s279612521 | Wrong Answer | N,S,T=map(int,input().split())
a=N%S
if a==0:
print((N/S)*T)
else:
print(((N//S)+1)*T) |
p02576 | s887066011 | Wrong Answer | n, x, t = map(int, input().split())
times = n // x
times +=1
print(times*t) |
p02576 | s880972081 | 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 | s401040625 | Wrong Answer | a = input().split(" ")
N = int(a[0])
X = int(a[1])
T = int(a[2])
b = N//X
if N%T != 0:
b += 1
print(b*T) |
p02576 | s513606097 | Wrong Answer | n,k,t = map(int,input().split())
count = 0
while n<0:
n-=k
count+=1
print(count*t) |
p02576 | s105509910 | Wrong Answer | n,x,t= map(int, input().split())
a=x//n
print(str(a*t)) |
p02576 | s046483084 | Wrong Answer | N, X, T = map(int, input().split())
n=1
while T*n < N//X:
n+=1
print(T*n) |
p02576 | s441234910 | Wrong Answer | N,X,T = [int(i) for i in input().split()]
print(int(N%X*T)) |
p02576 | s664678207 | Wrong Answer | n,x,t=map(int,input().split())
print(t * (n//x + 1)) |
p02576 | s548566189 | Wrong Answer | import sys
data = sys.stdin.read().split()
N = data[0]
X = data[1]
T = data[2]
def takoyaki(N, X, T):
if N % X==0:
return T * N / X
else:
return T * (N / X + 1) |
p02576 | s047358915 | Wrong Answer | n,x,t = map(int,input().split())
if x == 1:
print((n//x)*t)
else:
print((n//x+1)*t) |
p02576 | s436340666 | Wrong Answer | n, x, t = input().split()
N = int(n)
X = int(x)
T = int(t)
if N % X == 0:
c = N / X
else:
c = int(N / X) + 1
print(c*T)
|
p02576 | s627577457 | Wrong Answer | N, X, T = map(int, input().split())
QuireTime = (N//X)*T + T
print(QuireTime) |
p02576 | s556946943 | Wrong Answer | n, x, t = map(int, input().split())
num = n // x + 1
time = t * num
print(time) |
p02576 | s253581324 | Wrong Answer | #A
N, X, T=map(int, input().split())
print((N/X)*T if N%X ==0 else (N//X+1)*T) |
p02576 | s593408836 | Wrong Answer | 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
else:
count = (N // X) + 1
result = count * T
print(result) |
p02576 | s134866649 | 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 | s793584547 | Wrong Answer | n,x,t = map(int,input().split())
ans = n//x + 1
print(ans*t) |
p02576 | s367961684 | Wrong Answer | n,x,t=map(int,input().split())
count=2
item=0
time=0
while True:
if n > item:
item=x*count
time=t*count
if n <= item:
break
count+=1
print(time) |
p02576 | s136391586 | Wrong Answer | n,x,t=map(int,input().split())
c=0
while c<n:
c+=t
print(c//t*x) |
p02576 | s712656881 | Wrong Answer | import sys
def input():
return sys.stdin.readline()[:-1]
def main():
n,x,t = map(int,input().split())
print((n//x + 1) * t)
if __name__ == "__main__":
main() |
p02576 | s046124730 | 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 | s453536281 | Wrong Answer | n, x, t = map(int,input().split())
count = 0
while x<n:
x = x*t
count+=1
print(count*t) |
p02576 | s220243715 | 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 | s606092871 | Wrong Answer | n, x, t = map(int, input().split())
if n % x == 0:
print(n/x*t)
else:
a = n // x
print((a+1)*t) |
p02576 | s331052489 | Wrong Answer | total, max, time=map(int, input().split())
print (time*((total/max)+1))
|
p02576 | s298138315 | Wrong Answer | n,x,t = [int(i) for i in input().split()]
if n%x==0:
print(n/x*t)
else:
print((int(n/x)+1)*t) |
p02576 | s074597639 | Wrong Answer | N, K, T = map(int, input().split())
ans = (N // K + 1) * T
print(ans) |
p02576 | s242240993 | Wrong Answer | N, X, T = map(int, input().split())
count = 0
time = 0
while N >= count:
count += X
time += T
print(time)
|
p02576 | s948604058 | Wrong Answer | N, X, T = map(int, input().split())
if N % X == 0:
print(N / X * T)
else:
print((N / X + 1) * T) |
p02576 | s648216465 | Wrong Answer | N,X,T= map(int,input().split())
if N%T != 0:
print((N//X)*T+T)
else:
print((N//X)*T) |
p02576 | s066154554 | Wrong Answer | s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
print((N//X+1)*T)
|
p02576 | s069268076 | Wrong Answer | N, X, T = map(int, input().split())
t = N / X if N % X == 0 else (N // X + 1)
print(f'{t * T}') |
p02576 | s304475122 | 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 | s729179429 | Wrong Answer | N, X, T= map(int, input().split())
c=int(N/X)
print(c*T+T)
|
p02576 | s210973673 | Wrong Answer | N,X,T = map(int, input().split())
print((N // X) * T + (N % X) * T) |
p02576 | s951837238 | Wrong Answer | s = list(map(int, input().split()))
print(int((s[0]+(s[1]-1))/s[1]*s[2])) |
p02576 | s063238948 | Wrong Answer | N, X, T = map(int, input().split())
print('N',N)
print('X',X)
print('T',T)
print(N//X+1) |
p02576 | s133970940 | Wrong Answer | N,X,T=map(int,input().split())
print(((N//X)+1)*T) |
p02576 | s717681802 | Wrong Answer | N, X, T = list(map(int, input().strip().split()))
ans = (int(N/X)+1)*T
print(ans) |
p02576 | s140412969 | 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+1))
|
p02576 | s849855368 | Wrong Answer | N,X,T = map(int,input().split())
ans = (N + (X -1) / X) * T
print(ans) |
p02576 | s457020103 | Wrong Answer | a,b,c=map(int,input().split())
ans=a/b
if a%b!=0:
ans+=1
print(ans*c) |
p02576 | s744777342 | Wrong Answer | def calculate(N,X,T):
print(round(N/X * T)) |
p02576 | s815613025 | Wrong Answer | n,x,t=map(int,input().split())
count=2
item=0
time=0
while True:
if n <= item:
break
if n > item:
item=x*count
time=t*count
count=count+1
print(time) |
p02576 | s978893288 | Wrong Answer | n, x, t = map(int, input().split())
if n % x > 0:
print((n//x + 1) * t)
else:
print(n/x * t) |
p02576 | s030349317 | Wrong Answer | List=list(map(int,input().split()))
if List[0]<=List[1]:
print(List[2])
else:
print(((List[0]//List[1]))*List[2]) |
p02576 | s332310016 | 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 | s693038425 | 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 | s478277114 | Wrong Answer | N, X, T = map(int, input().split())
print(((N//X)+1)*T) |
p02576 | s514931649 | Wrong Answer | N, X, T = map(int, input().split())
cnt = N // X
if N % X == 0:
cnt += 1
print(T*cnt) |
p02576 | s386933179 | Wrong Answer | n, x, t = map(int, input().split())
print(((n // t) + 1) * x) |
p02576 | s171366419 | Wrong Answer | N,X,T=map(int,input().split())
a=N//X
if N%T==0:
print(a*T)
else:
print(a*T+T) |
p02576 | s665086907 | Wrong Answer | N,S,T=map(int,input().split())
if S<N:
a=N%S
if a==0:
print((N/S)*T)
else:
print(((N//S)+1)*T)
else:
print(T) |
p02576 | s986498402 | Wrong Answer | N, X, T = map(int, input().split())
a = N / X
min_time = (int(a) + 1) * T
print(min_time)
|
p02576 | s051240074 | Wrong Answer | def resolve():
N, X, T = map(int, input().split())
print((N+N%X)//X*T)
resolve() |
p02576 | s984847284 | Wrong Answer | N, X, T = map(int,input().split())
ans = (N // X + 1)*T
print(ans) |
p02576 | s028370131 | Wrong Answer | n, x, t = map(int, input().split())
print((n//x+1)*t) |
p02576 | s221924478 | Wrong Answer | N, X, T = map(int, input().split())
print(-(-N/X)*T) |
p02576 | s756354618 | Wrong Answer | N, X, T = map(int, input().split())
print((int(N/X)+1)*T)
|
p02576 | s778242541 | Wrong Answer | n,x,t = map(int,input().split())
print((int(n/x)+1)*t) |
p02576 | s805864728 | Wrong Answer | N, X, T = map(int, input().split())
if N % T == 0:
print((N // X) * T)
else:
print(((N // X) + 1) * T) |
p02576 | s380066799 | Wrong Answer | a = input().split()
a = list(map(int, a))
print((int(a[0]/a[1])+1)*a[2]) |
p02576 | s281613427 | Wrong Answer | [N, X, T] = map(int, input().split())
if N%T > 0:
print((N//X+1)*T)
else:
print(N//X*T)
|
p02576 | s790123463 | Wrong Answer | N, X, T = map(int, input().split())
if N%X != 0:
time = (N//X + 1) * T
elif N%X == 0:
time = N/X*T
print(time) |
p02576 | s048740919 | Wrong Answer | s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
print(((N//X)+1)*T)
|
p02576 | s607804925 | Wrong Answer | n, x, t = map(int, input().split())
v = n//x
print(v*x) |
p02576 | s323698119 | Wrong Answer | N, X, T = map(int, input().split())
n = (N//X) * T + T
print(n) |
p02576 | s295340830 | Wrong Answer | N,X,T=list(map(int, input().split()))
a=0
t=0
while a<=N:
a+=X
t+=T
print(t) |
p02576 | s234749243 | Wrong Answer | n, x, t = map(int, input().split())
print(n//x*t) |
p02576 | s100650805 | Wrong Answer | import math
N,X,T = map(int,input().split())
print(T*(math.floor(N/X)+1)) |
p02576 | s996685000 | Wrong Answer | n,x,t=map(int,input().split())
if n%x==0:
print(n//x*t)
else:
print(n//x*t+1) |
p02576 | s837902308 | Wrong Answer | def main():
inp = [int(i) for i in input().split()]
for i in inp:
if i not in range(1,1001):
raise ValueError
if inp[0] % inp[1] == 0:
print((inp[0]*inp[2])/inp[1])
else:
print((int((inp[0]/inp[1]))+1)*inp[2])
if __name__ == '__main__':
main()
|
p02576 | s046044894 | Wrong Answer | N, X, T = map(int,input().split())
if X != 1:
print(( N // X ) * T )
else:
print(( N // X + 1 ) * T ) |
p02576 | s366850125 | Wrong Answer | string = input("Enter your input: ")
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 | s488739368 | Wrong Answer | N,X,T = map(int, input().split())
ans = 0
while True:
N -= X
ans += T
if N < 0: break
print(ans) |
p02576 | s797398454 | Wrong Answer | import sys
input = sys.stdin.readline
def takoyaki(n,x,t):
acc = 0
ans = 0
for i in range(1000):
if i % t == 0:
acc += x
if acc >= n:
ans = i
break
return ans
if __name__ == "__main__":
n,x,t = map(int,input().split())
print(takoyaki(n,x,t))
|
p02576 | s267896962 | Wrong Answer | n,x,t = map(int,input().split())
y = int(n/x)
print(t*y) |
p02576 | s094854460 | Wrong Answer | N,X,T=map(int,input().split())
ans=(N//X)*T+T
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.