problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02754 | n, a, b = map(int, input().split())
ans = a * (n // (a+b)) + min(n % (a+b),b)
print(ans)
| n, a, b = map(int, input().split())
ans = a * (n // (a+b)) + min(n % (a+b),a)
print(ans)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 535,387 | 535,388 | u222668979 | python |
p02754 | n, a, b = map(int, input().split())
ans = a * (n // (a+b)) + n % (a+b)
print(ans)
| n, a, b = map(int, input().split())
ans = a * (n // (a+b)) + min(n % (a+b),a)
print(ans)
| [
"call.add",
"call.arguments.add"
] | 535,389 | 535,388 | u222668979 | python |
p02754 | import math
N, A, B = list(map(int, input().split(' ')))
S = A + B
count = N // S if S != 0 else 0
mod = N % S if S != 0 else 0
print(A*count + mod)
| import math
N, A, B = list(map(int, input().split(' ')))
S = A + B
count = N // S if S != 0 else 0
mod = min(N % S, A) if S != 0 else 0
print(A*count + mod)
| [
"call.add",
"call.arguments.add"
] | 535,392 | 535,393 | u253799217 | python |
p02754 | n, a, b = map(int,input().split())
print((n // (a + b)) * a + n % (a + b)) | n, a, b = map(int,input().split())
print((n // (a + b)) * a + min(a,n % (a + b))) | [
"call.add",
"call.arguments.change"
] | 535,414 | 535,415 | u131946248 | python |
p02754 | N,A,B = [int(x) for x in input().split(" ")]
if (A == 0):
print(0)
else:
total_sec = A+B
print(int(N/total_sec*A) + min(N%total_sec, A))
| N,A,B = [int(x) for x in input().split(" ")]
if (A == 0):
print(0)
else:
total_sec = A+B
print(int(N/total_sec)*A + min(N%total_sec, A))
| [
"call.arguments.change"
] | 535,422 | 535,423 | u628151901 | python |
p02754 | N,A,B = [int(x) for x in input().split(" ")]
if (A == 0):
print(0)
total_sec = A+B
print(int(N/total_sec*A) + min(N%total_sec, A))
| N,A,B = [int(x) for x in input().split(" ")]
if (A == 0):
print(0)
else:
total_sec = A+B
print(int(N/total_sec)*A + min(N%total_sec, A))
| [
"call.arguments.change"
] | 535,424 | 535,423 | u628151901 | python |
p02754 | n, a, b = map(int, input().split())
fulls = n // (a+b)
lefts = n % (a+b)
print(fulls*a + min(left, a)) | n, a, b = map(int, input().split())
fulls = n // (a+b)
lefts = n % (a+b)
print(fulls*a + min(lefts, a)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,425 | 535,426 | u206133536 | python |
p02754 | import math
n, a, b = map(int,input().split())
try:
ans = math.ceil(n / (a + b)) * a + (n % (a + b))
except Exception as e:
ans = 0
print(ans) | import math
n, a, b = map(int,input().split())
try:
ans = int(n / (a + b)) * a + min(n % (a + b),a)
except Exception as e:
ans = 0
print(ans) | [
"assignment.value.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 535,429 | 535,430 | u907549201 | python |
p02754 | N, A, B = list(map(int, input().split()))
C = A + B
result = 0
if A < N:
q, mod = divmod(N, C)
result = q * A + mod
else:
result = N
print(result) | N, A, B = list(map(int, input().split()))
C = A + B
result = 0
if A < N:
q, mod = divmod(N, C)
result = q * A + min(mod, A)
else:
result = N
print(result) | [
"call.add",
"call.arguments.add"
] | 535,438 | 535,439 | u760256928 | python |
p02754 | def main():
N, A, B = map(int, input().split(" "))
if (A + B) == 0:
print(0)
return
amari = N % (A+B)
kaisuu = N // (A+B)
print(kaisuu*A+amari)
main() | def main():
N, A, B = map(int, input().split(" "))
if (A + B) == 0:
print(0)
return
amari = N % (A+B)
kaisuu = N // (A+B)
print(kaisuu*A+min(amari, A))
main()
| [
"call.add",
"call.arguments.add"
] | 535,457 | 535,458 | u485716382 | python |
p02754 | n,a,b = map(int,input().split())
ans = (n//(a+b))*a
ans += min((n-n%(a+b)),a)
print(ans) | n,a,b = map(int,input().split())
ans = (n//(a+b))*a
ans += min(n%(a+b),a)
print(ans) | [
"call.arguments.change"
] | 535,469 | 535,471 | u677121387 | python |
p02754 | total,blue,red=map(int,input().split())
num = -(-total)//(blue+red)
if blue == 0:
print(0)
else:
if (total%(red+blue)) >= blue:
print(num*blue+(total%(red+blue)))
else:
print(num*blue+blue) | total,blue,red=map(int,input().split())
num = -(-total)//(blue+red)
if blue == 0:
print(0)
else:
if (total%(red+blue)) <= blue:
print(num*blue+(total%(red+blue)))
else:
print(num*blue+blue) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 535,479 | 535,480 | u549383771 | python |
p02754 | N, A, B = map(int, input().split())
kaisu = N//(A+B)
print(kaisu)
n = N-((A+B)*kaisu)
if n >= A:
print(A*(kaisu+1))
else:
print(A*kaisu+n) | N, A, B = map(int, input().split())
kaisu = N//(A+B)
n = N-((A+B)*kaisu)
if n >= A:
print(A*(kaisu+1))
else:
print(A*kaisu+n) | [
"call.remove"
] | 535,500 | 535,501 | u677842374 | python |
p02754 | n, a, b = list(map(int, input().split()))
result = 0
if a + b != 0:
roop = n // (a +b)
extra = n - roop*(a+b)
print(extra)
result = a*roop
if extra >= a:
result += a
else:
result += extra
print(result) | n, a, b = list(map(int, input().split()))
result = 0
if a + b != 0:
roop = n // (a +b)
extra = n - roop*(a+b)
result = a*roop
if extra >= a:
result += a
else:
result += extra
print(result) | [
"call.remove"
] | 535,527 | 535,528 | u730270108 | python |
p02754 | Me, a, b = map(int, input().split())
period = a+b
times = Me//period
k = Me%period
n = a if k >a else k
print(times*a + Me) | n, a, b = map(int, input().split())
period = a+b
times = n//period
k = n%period
n = a if k >a else k
print(times*a + n) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 535,547 | 535,548 | u194637581 | python |
p02754 | N,A,B = map(int,input().split())
if A == 0:
print(0)
else:
if N > A+B:
a = N / (A+B)
b = N % (A+B)
if b > A:
b = A
print(a*A + b)
else:
if A > N:
print(N)
else:
print(A) | N,A,B = map(int,input().split())
if A == 0:
print(0)
else:
if N > A+B:
a = N // (A+B)
b = N % (A+B)
if b > A:
b = A
print(a*A + b)
else:
if A > N:
print(N)
else:
print(A)
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 535,578 | 535,579 | u715355213 | python |
p02754 | n, a, b = map(int, input().split())
if a == 0:
print(0)
exit()
g = a + b
ans1 = (n % g) * a
rem = n - ((n % g) * g)
ans2 = min(rem, a)
print(ans1 + ans2)
| n, a, b = map(int, input().split())
if a == 0:
print(0)
exit()
g = a + b
ans1 = int((n / g)) * a
rem = n - (int(n / g) * g)
ans2 = min(rem, a)
print(ans1 + ans2)
| [
"call.add",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"type_conversion.to_integer.change",
"type_conversion.to_number.change"
] | 535,605 | 535,606 | u764050215 | python |
p02754 | N,A,B = map(int,input().split())
b = 0
r = 0
if A > N:
print(A)
else:
C = A * (N // (A+B) )
D = N % (A+B)
if D <= A:
print(C+D)
else:
print(C+A) | N,A,B = map(int,input().split())
b = 0
r = 0
if A >= N:
print(N)
else:
C = A * (N // (A+B) )
D = N % (A+B)
if D <= A:
print(C+D)
else:
print(C+A)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 535,621 | 535,622 | u877428733 | python |
p02754 | import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)
def main():
n, a, b = na()
if (a == 0 and b == 0) or a == 0:
print(0)
return
if n <= a:
print(n)... | import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)
def main():
n, a, b = na()
if (a == 0 and b == 0) or a == 0:
print(0)
return
if n <= a:
print(n)... | [
"call.add",
"call.arguments.add"
] | 535,652 | 535,653 | u887207211 | python |
p02754 | n,m,l = map(int,input().split())
x, y = divmod(n, (m + l))
if y <= m:
print(x*m+y)
else:
print(x*m+y) | n,m,l = map(int,input().split())
x, y = divmod(n, (m + l))
if y <= m:
print(x*m+y)
else:
print(x*m+m) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,660 | 535,661 | u981449436 | python |
p02754 | n, b, r = map(int, input().split())
am = n % (b + r)
s = n // (b + r)
if am <= b:
print((s * b) + am)
else:
print(s * (b+1)) | n, b, r = map(int, input().split())
am = n % (b + r)
s = n // (b + r)
# print(b)
# print(r)
# print(am)
# print(s)
if am <= b:
print((s * b) + am)
else:
print((s+1) * b)
| [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,677 | 535,678 | u723345499 | python |
p02754 | N,A,B = map(int,input().split())
S = A+B
count = N//S
pre_cnt = A*count
S_amari = N-S
if S_amari >= A:
cnt = pre_cnt + A
else:
cnt = pre_cnt + S_amari
print(cnt) | N,A,B = map(int,input().split())
S = A+B
count = N//S
pre_cnt = A*count
S_amari = N-S*count
if S_amari >= A:
cnt = pre_cnt + A
else:
cnt = pre_cnt + S_amari
print(cnt) | [
"assignment.change"
] | 535,683 | 535,684 | u869917163 | python |
p02754 | n, a, b = (int(i) for i in input().split())
q, mod = divmod(ｎ, a+b)
print(b * q + min(mod, a)) | n, a, b = (int(i) for i in input().split())
q, mod = divmod(ｎ, a+b)
print(a * q + min(mod, a)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,695 | 535,696 | u500942659 | python |
p02754 | n, a, b = (int(i) for i in input().split())
q, mod = divmod(ｎ, a+b)
print(b * q + max(mod - a, 0)) | n, a, b = (int(i) for i in input().split())
q, mod = divmod(ｎ, a+b)
print(a * q + min(mod, a)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"misc.opposites",
"call.function.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove"
] | 535,697 | 535,696 | u500942659 | python |
p02754 | N,A,B = map(int,input().split())
if A == 0:
print(A)
exit()
n = N // (A + B)
nn = N % (A + B)
if n != 0 and nn <= A:
print(int(A*n + nn))
elif n != 0 and nn > A:
print(int(A*(n+1)))
elif n == 0 and N > A:
print(A)
elif n == 0 and N < A:
print(A - N) | N,A,B = map(int,input().split())
if A == 0:
print(A)
exit()
n = N // (A + B)
nn = N % (A + B)
if n != 0 and nn <= A:
print(int(A*n + nn))
elif n != 0 and nn > A:
print(int(A*(n+1)))
elif n == 0 and N >= A:
print(A)
elif n == 0 and N < A:
print(N) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 535,706 | 535,707 | u488272873 | python |
p02754 | N, A, B = map(int, input().split())
if(A==0 & B==0):
print("0")
else:
r=N//(A+B)
s=N-A*r
if(A<s):
s=A
if(A!=0):
t=(A*r)+s
else:
t=0
print(t) | N, A, B = map(int, input().split())
if(A==0 & B==0):
print("0")
else:
r=N//(A+B)
s=N%(A+B)
if(A<s):
s=A
if(A!=0):
t=(A*r)+s
else:
t=0
print(t) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 535,742 | 535,743 | u031115006 | python |
p02754 | n,a,b=map(int, input().split())
c=n%(a+b)
if n-c*(a+b)>=a:
ans=a*(c+1)
else:
ans=c*a+n-c*(a+b)
print(ans) | n,a,b=map(int, input().split())
c=int(n/(a+b))
if n-c*(a+b)>=a:
ans=a*(c+1)
else:
ans=c*a+n-c*(a+b)
print(ans) | [
"call.add",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 535,744 | 535,745 | u737491054 | python |
p02754 | N, A, B = map(int, input().split())
q, mod = divmod(N, A+B)
# print(q,mod)
if A == 0:
print(0)
else:
if mod > A:
print(q * A + mod - B)
else:
print(q * A + mod) | N, A, B = map(int, input().split())
q, mod = divmod(N, A+B)
# print(q,mod)
if A == 0:
print(0)
else:
if mod > A:
print(q * A + A)
else:
print(q * A + mod) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 535,746 | 535,747 | u293523199 | python |
p02754 | import sys
read = sys.stdin.readline
T = read()
a, b, c = map(int, T.split())
temp = a // (b+c)
answer = temp * b
temp2 = a % (b+c)
if temp2 >= b:
answer += b
else:
answer += temp2
print(temp2)
| import sys
read = sys.stdin.readline
T = read()
a, b, c = map(int, T.split())
temp = a // (b+c)
answer = temp * b
temp2 = a % (b+c)
if temp2 >= b:
answer += b
else:
answer += temp2
print(answer)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 535,752 | 535,753 | u789836448 | python |
p02754 | # -*- coding: utf-8 -*-
i_str = input()
N,A,B = map(int,i_str.split())
import sys
AB = A+B
maxnum = pow(10,100)
if A == 0:
print(0)
sys.exit()
if N <= A:
print(N)
sys.exit()
waru,amari = divmod(B,AB)
#waru = (N // AB)
#amari = N % AB
if amari > A:
amari = A
answer = waru * A + amari
print(answer) | # -*- coding: utf-8 -*-
i_str = input()
N,A,B = map(int,i_str.split())
import sys
AB = A+B
maxnum = pow(10,100)
if A == 0:
print(0)
sys.exit()
if N <= A:
print(N)
sys.exit()
waru,amari = divmod(N,AB)
#waru = (N // AB)
#amari = N % AB
if amari > A:
amari = A
answer = waru * A + amari
print(answer) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 535,760 | 535,761 | u827021590 | python |
p02754 | def input_int_list():
return [int(thing) for thing in input().split(" ")]
N,A,B=input_int_list()
r=N//(A+B)
if A==0:
print(0)
exit()
if N-r*(A+B)<=A:
ans=N-B*r
else:
ans=A*r
print(ans) | def input_int_list():
return [int(thing) for thing in input().split(" ")]
N,A,B=input_int_list()
r=N//(A+B)
if A==0:
print(0)
exit()
if N-r*(A+B)<=A:
ans=N-B*r
else:
ans=A*(r+1)
print(ans) | [] | 535,762 | 535,763 | u334928930 | python |
p02754 | N,A,B = (int(x) for x in input().split())
S = N % (A+B) - A
Acount = N % (A+B)
Ansn = int(N / (A + B) * A)
if S <= 0:
print(Ansn + Acount)
else:
print(Ansn + A) | N,A,B = (int(x) for x in input().split())
S = N % (A+B) - A
Acount = N % (A+B)
Ansn = int(N / (A + B)) * A
if S <= 0:
print(Ansn + Acount)
else:
print(Ansn + A)
| [
"call.arguments.change"
] | 535,769 | 535,770 | u578441226 | python |
p02754 | n, a, b = list(map(int, input().split()))
c, d = divmod(n, (a+b))
if d <= a:
print(c*a+d)
else:
print(c*a) | n, a, b = list(map(int, input().split()))
c, d = divmod(n, (a+b))
if d <= a:
print(c*a+d)
else:
print(c*a+a) | [
"expression.operation.binary.add"
] | 535,773 | 535,774 | u008608569 | python |
p02754 | import math
N, A, B = map(int, input().split())
print(math.floor(A * N / (A + B)) + min(A, N % (A + B)))
| import math
N, A, B = map(int, input().split())
print(A * math.floor(N / (A + B)) + min(A, N % (A + B)))
| [
"expression.operation.binary.remove"
] | 535,785 | 535,786 | u416650504 | python |
p02754 | n,a,b = map(int,input().split())
s = a+b
c = n % s
d = n // s
if c <= a:
print( a*d + s )
else:
print( a*d + a )
| n,a,b = map(int,input().split())
s = a+b
c = n % s
d = n // s
if c <= a:
print( a*d + c )
else:
print( a*d + a ) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,804 | 535,805 | u812867074 | python |
p02754 | n,a,b = map(int,input().split())
s = a+b
c = n % s
d = n // s
if s <= a:
print( a*d + s )
else:
print( a*d + a )
| n,a,b = map(int,input().split())
s = a+b
c = n % s
d = n // s
if c <= a:
print( a*d + c )
else:
print( a*d + a ) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,806 | 535,805 | u812867074 | python |
p02754 | n,a,b = list(map(int,input().split()))
if(a != 0):
kurikaeshi = n // (a + b)
mod = n % (a + b)
ans = a*kurikaeshi
if(mod - a > 0):
ans += mod
if(a == 0):
ans = 0
print(ans) | n,a,b = list(map(int,input().split()))
if(a != 0):
kurikaeshi = n // (a + b)
mod = n % (a + b)
ans = a*kurikaeshi
if(mod - a > 0):
ans += a
else:
ans += mod
if(a == 0):
ans = 0
print(ans) | [] | 535,833 | 535,834 | u178304274 | python |
p02754 | N,B,R = map(int,input().split())
k = N % (B + R)
k2 = int(N / (B + R))
#s = ("b"*B + "r"*R)
#s1 = s[:k]
if k >= B:
print(k2*(B) + k)
else:
print(k2*(B) + B)
| N,B,R = map(int,input().split())
k = N % (B + R)
k2 = int(N / (B + R))
#s = ("b"*B + "r"*R)
#s1 = s[:k]
if k <= B:
print(k2*(B) + k)
else:
print(k2*(B) + B) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 535,837 | 535,838 | u713914478 | python |
p02754 | K = input().split(" ")
N = int(K[0])
A = int(K[1])
B = int(K[2])
if B == 0:
print(0)
else:
M = N%(A+B)
L = N//(A+B)
if M <= A:
K = L*A+M
else:
K = L*A+A
print(K)
| K = input().split(" ")
N = int(K[0])
A = int(K[1])
B = int(K[2])
if A == 0:
print(0)
else:
M = N%(A+B)
L = N//(A+B)
if M <= A:
K = L*A+M
else:
K = L*A+A
print(K)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 535,847 | 535,848 | u217836256 | python |
p02754 | n,a,b = [int(i) for i in input().split()]
k = n // (a + b)
q = n % (a + b)
print(a * k + q) | n,a,b = [int(i) for i in input().split()]
k = n // (a + b)
q = n % (a + b)
print(a * k + min(q,a)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 535,851 | 535,852 | u940765148 | python |
p02754 | n,a,b = map(int,input().split())
dars = n // (a+b)*a
amari = n % (a+b)
dars = min(amari,a)
print(dars) | n,a,b = map(int,input().split())
dars = n // (a+b)*a
amari = n % (a+b)
dars += min(amari,a)
print(dars)
| [
"assignment.value.change"
] | 535,864 | 535,865 | u694810977 | python |
p02754 | n, a, b = map(int, input().split())
repeat = n // (a+b)
remain = n - (a+b) * repeat
remain_blue = max(remain - a, 0)
print(b * repeat + remain_blue) | n, a, b = map(int, input().split())
repeat = n // (a+b)
remain = n - (a+b) * repeat
remain_blue = min(remain, a)
print(a * repeat + remain_blue) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,866 | 535,867 | u729938879 | python |
p02754 | n, a, b = map(int,input().split())
c = n // (a + b)
if c == 0:
d = a + b
assert False
else:
d = n - (c * (a+b))
if d > a:
ans = (c*a) + a
else:
ans = (c*a) + d
print(ans)
| n, a, b = map(int,input().split())
c = n // (a + b)
if c == 0:
d = min(n, a + b)
else:
d = n - (c * (a+b))
if d > a:
ans = (c*a) + a
else:
ans = (c*a) + d
print(ans)
| [
"call.add",
"assignment.value.change"
] | 535,871 | 535,872 | u814781830 | python |
p02754 | def main():
N, A, B = (int(i) for i in input().split())
ans = (N//(A+B)) * A
less = N - (N//(A+B)) * (A+B)
print(ans + min(less, B))
if __name__ == '__main__':
main()
| def main():
N, A, B = (int(i) for i in input().split())
ans = (N//(A+B)) * A
less = N - (N//(A+B)) * (A+B)
print(ans + min(less, A))
if __name__ == '__main__':
main()
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,892 | 535,893 | u312025627 | python |
p02754 | N, A, B = map(int, input().split())
print(A * N // (A + B) + min(A, N % (A + B)))
| N, A, B = map(int, input().split())
print(A * (N // (A + B)) + min(A, N % (A + B)))
| [
"call.arguments.change"
] | 535,896 | 535,897 | u500297289 | python |
p02754 | N,A,B=map(int,input().split())
print(N//(A+B)*A+N%(A+B))
| N,A,B=map(int,input().split())
print(N//(A+B)*A+min(N%(A+B),A))
| [
"call.add",
"call.arguments.add"
] | 535,898 | 535,899 | u375681664 | python |
p02754 | n,a,b = [int(i) for i in input().split()]
div,mod = divmod(n,(a+b))
print(div * a + mod)
| n,a,b = [int(i) for i in input().split()]
div,mod = divmod(n,(a+b))
print(div * a + min(mod,a))
| [
"call.add",
"call.arguments.add"
] | 535,916 | 535,917 | u183840468 | python |
p02754 | l=list(input().split())
N=int(l[0])
A=int(l[1])
B=int(l[2])
syou=N//(A+B)
amari=N%(A+B)
kotae=syou*A+amari
print(kotae)
| l=list(input().split())
N=int(l[0])
A=int(l[1])
B=int(l[2])
syou=N//(A+B)
amari=N%(A+B)
kotae=syou*A+min(amari,A)
print(kotae)
| [
"call.add",
"call.arguments.add"
] | 535,936 | 535,937 | u786490555 | python |
p02754 | N, A, B = map(int,input().split())
ans = N//(A+B)
R = N%(A+B)
ans += min(R, A)
print(ans) | N, A, B = map(int,input().split())
ans = (N//(A+B)) * A
R = N%(A+B)
ans += min(R, A)
print(ans)
| [
"assignment.change"
] | 535,938 | 535,939 | u957872856 | python |
p02754 | N,A,B = map(int,input().split())
a = N//(A+B)*A
b = N % (A+B)
a += min(a,b)
print(a) | N,A,B = map(int,input().split())
a = N//(A+B)*A
b = N % (A+B)
a += min(A,b)
print(a) | [
"identifier.change",
"call.arguments.change"
] | 535,940 | 535,941 | u733132703 | python |
p02754 | a = input().split(" ")
n = int(a[0])
b = int(a[1])
r = int(a[2])
c = a // (b + r)
bb = c * b
d = a % (b + r)
if d >= b:
bb += b
else:
bb += d
print(bb) | a = input().split(" ")
n = int(a[0])
b = int(a[1])
r = int(a[2])
c = n // (b + r)
bb = c * b
d = n % (b + r)
if d >= b:
bb += b
else:
bb += d
print(bb) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 535,946 | 535,947 | u549494450 | python |
p02754 | n,a,b=map(int,input().split());m=n//(a+b);print(m*a+max(a,n-m*(a+b))) | n,a,b=map(int,input().split());m=n//(a+b);print(m*a+min(a,n-m*(a+b))) | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 535,950 | 535,951 | u729133443 | python |
p02754 | n,a,b=map(int,input().split());m=n//(a+b);print(m*a+n-m*(a+b)) | n,a,b=map(int,input().split());m=n//(a+b);print(m*a+min(a,n-m*(a+b))) | [
"call.add",
"call.arguments.change"
] | 535,952 | 535,951 | u729133443 | python |
p02754 | n,a,b=map(int,input().split());m=n//(a+b);print(m*a,n-m*(a+b)) | n,a,b=map(int,input().split());m=n//(a+b);print(m*a+min(a,n-m*(a+b))) | [
"call.arguments.change"
] | 535,953 | 535,951 | u729133443 | python |
p02754 | n,a,b=map(int,input().split())
print(a*n//(a+b)+min(a,n%(a+b))) | n,a,b=map(int,input().split())
print(a*(n//(a+b))+min(a,n%(a+b)))
| [
"call.arguments.change"
] | 535,994 | 535,995 | u780962115 | python |
p02754 | N, A, B = map(int, input().split())
num = A * N // (A + B)
if N % (A + B) > A:
print(num + A)
else:
print(num + (N % (A + B))) | N, A, B = map(int, input().split())
num = A *(N // (A + B))
if N % (A + B) > A:
print(num + A)
else:
print(num + (N % (A + B))) | [] | 535,996 | 535,997 | u870559097 | python |
p02754 | N, A, B = map(int, input().split())
num = A * N // (A + B)
if N % (A + B) > A:
print(num + A)
else:
print(num + N % (A + B)) | N, A, B = map(int, input().split())
num = A *(N // (A + B))
if N % (A + B) > A:
print(num + A)
else:
print(num + (N % (A + B))) | [
"call.arguments.change"
] | 535,998 | 535,997 | u870559097 | python |
p02754 | N, A, B = map(int, input().split())
num = A * N // (A + B)
if N % (A + B) >= A:
print(num + A)
else:
print(num + N % (A + B)) | N, A, B = map(int, input().split())
num = A *(N // (A + B))
if N % (A + B) > A:
print(num + A)
else:
print(num + (N % (A + B))) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 535,999 | 535,997 | u870559097 | python |
p02754 | n, a ,b = list(map(int,(input().split())))
k = n//(a+b)
am = n%(a+b)
print(k+min(am,a)) | n, a ,b = list(map(int,(input().split())))
k = n//(a+b)
am = n%(a+b)
print(a*k+min(am,a)) | [
"expression.operation.binary.add"
] | 536,006 | 536,007 | u619785253 | python |
p02754 | n, a ,b = list(map(int,(input().split())))
k = n//(a+b)
am = n%(a+b)
print(a*k+am) | n, a ,b = list(map(int,(input().split())))
k = n//(a+b)
am = n%(a+b)
print(a*k+min(am,a)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 536,008 | 536,007 | u619785253 | python |
p02754 | n,a,b = input().split(" ")
n = int(n)
a = int(a)
b = int(b)
c = n//(a+b)
ans = c*a+(n-c*(a+b))
print(ans) | n,a,b = input().split(" ")
n = int(n)
a = int(a)
b = int(b)
c = n//(a+b)
ans = c*a+min(n-c*(a+b), a)
print(ans) | [
"call.add",
"call.arguments.add"
] | 536,009 | 536,010 | u572796406 | python |
p02754 | N, A, B = [int(x) for x in input().split(" ")]
print(int(N/(A+B))*A)+int(min(N%(A+B),A))
| N, A, B = [int(x) for x in input().split(" ")]
print(int(N/(A+B))*A+int(min(N%(A+B),A))) | [
"call.arguments.change"
] | 536,030 | 536,031 | u796708718 | python |
p02754 | n,a,b=map(int,input().split())
ans=a*n//(a+b)
if n%(a+b)<=a:
ans+=n%(a+b)
else:
ans+=a
print(ans)
| n,a,b=map(int,input().split())
ans=a*(n//(a+b))
if n%(a+b)<=a:
ans+=n%(a+b)
else:
ans+=a
print(ans)
| [] | 536,032 | 536,033 | u877415670 | python |
p02754 |
n, a, b = list(map(int, input().split()))
sum = a+b
if n < a+b:
if n < a :
print(n)
else:
print(a)
else:
if n%sum > a:
print ((n // sum)*a) + a
else:
res = ((n // sum)*a) + (n % sum)
print(res)
|
n, a, b = list(map(int, input().split()))
sum = a+b
if n < a+b:
if n < a :
print(n)
else:
print(a)
else:
if n%sum > a:
print (((n // sum)*a) + a)
else:
res = ((n // sum)*a) + (n % sum)
print(res)
| [
"call.arguments.change"
] | 536,041 | 536,042 | u574590381 | python |
p02754 | n,a,b=map(int, input().split())
count=n//a+b*a
n=n%(a+b)
count+=min(n,a)
print(count)
| n,a,b=map(int, input().split())
count=n//(a+b)*a
n=n%(a+b)
count+=min(n,a)
print(count) | [] | 536,056 | 536,057 | u730107446 | python |
p02754 | n, a, b = map(int, input().split())
if n%(a+b) >a:
print(int(n//(a+b))*a)
else:
print(int(n//(a+b))*a +n%(a+b)) | n, a, b = map(int, input().split())
if n%(a+b) >a:
print(int(n//(a+b))*a +a)
else:
print(int(n//(a+b))*a +n%(a+b)) | [
"expression.operation.binary.add"
] | 536,086 | 536,087 | u707960254 | python |
p02754 | n, a, b = map(int, input().split())
if n%(a+b) >a:
print((n//(a+b))*a)
else:
print((n//(a+b))*a +n%(a+b)) | n, a, b = map(int, input().split())
if n%(a+b) >a:
print(int(n//(a+b))*a +a)
else:
print(int(n//(a+b))*a +n%(a+b)) | [
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change",
"call.arguments.change"
] | 536,088 | 536,087 | u707960254 | python |
p02754 | n, a, b = map(int, input().split())
l = a + b
print(n // l * a + min(n % l, 4)) | n, a, b = map(int, input().split())
l = a + b
print(n // l * a + min(n % l, a))
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 536,093 | 536,094 | u080364835 | python |
p02754 | # print('input >>')
N, A, B = map(int,(input().split()))
# print('-----output-----')
print(N // (A+B) * A + N % (A+B)) | # print('input >>')
N, A, B = map(int,(input().split()))
# print('-----output-----')
print(N // (A+B) * A + min(N % (A+B), A)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 536,097 | 536,098 | u657994700 | python |
p02754 | # coding: utf-8
# Your code here!
N, a, b = map(int,input().split())
ans = 0
ans += (N // (a+b)) * a
ans += (N % (a+b))
print(ans) | # coding: utf-8
# Your code here!
N, a, b = map(int,input().split())
ans = 0
ans += (N // (a+b)) * a
ans += min((N % (a+b)),a)
print(ans) | [
"call.add",
"call.arguments.add"
] | 536,099 | 536,100 | u681444474 | python |
p02754 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(N: int, A: int, B: int):
print(A*(N//(A+B))+N%(A+B))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_toke... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(N: int, A: int, B: int):
print(A*(N//(A+B))+min(N%(A+B), A))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iter... | [
"call.add",
"call.arguments.add"
] | 536,113 | 536,114 | u386819480 | python |
p02754 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(N: int, A: int, B: int):
print(A*N//(A+B)+min(N%(A+B), A))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterat... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(N: int, A: int, B: int):
print(A*(N//(A+B))+min(N%(A+B), A))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iter... | [
"call.arguments.change"
] | 536,115 | 536,114 | u386819480 | python |
p02754 | n, a, b = map(int, input().split())
ans = n // (a + b) * a + min(n % (a + b), n)
print(ans)
| n, a, b = map(int, input().split())
ans = n // (a + b) * a + min(n % (a + b), a)
print(ans)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 536,116 | 536,117 | u668923019 | python |
p02754 | N,A,B = map(int, input().split())
ans = N // (A+B) * A
r = N % (A+B)
if r < B:
ans += r
else:
ans += A
print(ans) | N,A,B = map(int, input().split())
ans = N // (A+B) * A
r = N % (A+B)
if r < A:
ans += r
else:
ans += A
print(ans) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 536,132 | 536,133 | u591016708 | python |
p02754 | N,A,B = map(int, input().split())
ans = N // (A+B) * A
r = N % (A+B)
if r < B:
ans += r
else:
ans += B
print(ans) | N,A,B = map(int, input().split())
ans = N // (A+B) * A
r = N % (A+B)
if r < A:
ans += r
else:
ans += A
print(ans) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 536,134 | 536,133 | u591016708 | python |
p02754 | n,a,b= map(int,input().split())
if a==0:
print("0")
else:
ans = (n//(a+b))
c = (ans*a)
c+=(n%(a+b))
print(c)
| n,a,b= map(int,input().split())
if a==0:
print("0")
else:
ans = (n//(a+b))
c = (ans*a)
c+=(min(n%(a+b),a))
print(c)
| [
"call.arguments.add"
] | 536,135 | 536,136 | u608277538 | python |
p02754 | N, A, B = map(int, input().split())
AB = A + B
print((N // AB) * A + N % AB) | N, A, B = map(int, input().split())
AB = A + B
print((N // AB) * A + min(N % AB, A)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 536,137 | 536,138 | u066413086 | python |
p02754 | N,A,B=[int(i) for i in input().split(" ")]
ball=N*A//(A+B)
if N%(A+B)>A:
ball+=A
else:
ball+=N%(A+B)
print(ball)
| N,A,B=[int(i) for i in input().split(" ")]
ball=(N//(A+B))*A
if N%(A+B)>A:
ball+=A
else:
ball+=N%(A+B)
print(ball)
| [
"expression.operation.binary.remove"
] | 536,143 | 536,144 | u922952729 | python |
p02754 | import sys
def input():
return sys.stdin.readline()[:-1]
def main():
N, A, B = map(int, input().split())
r = N // (A + B)
l = N - r * (A + B)
cnt = r * A
if l <= N:
cnt += l
else:
cnt += N
print(cnt)
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline()[:-1]
def main():
N, A, B = map(int, input().split())
r = N // (A + B)
l = N - r * (A + B)
cnt = r * A
if l < A:
cnt += l
else:
cnt += A
print(cnt)
if __name__ == "__main__":
main()
| [
"identifier.change"
] | 536,151 | 536,152 | u464244643 | python |
p02754 | n,a,b = map(int,input().split())
s = 0
y = n//(a+b)
x = y*(a+b)
ans = y*a
ans += n-x
print(ans) | n,a,b = map(int,input().split())
s = 0
y = n//(a+b)
x = y*(a+b)
ans = y*a
ans += min(n-x,a)
print(ans) | [
"call.add",
"call.arguments.add"
] | 536,167 | 536,168 | u976169012 | python |
p02754 | n,a,b=map(int,input().split())
q=n//(a+b)
r=n%(a+b)
if r<=a:
print(q*a+r)
else:
print(q*(a+1)) | n,a,b=map(int,input().split())
q=n//(a+b)
r=n%(a+b)
if r<=a:
print(q*a+r)
else:
print((q+1)*a) | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 536,186 | 536,187 | u774539708 | python |
p02754 | # n=int(input())
# a=[int(i) for i in input().split()]
# a=[int(input()) for i in range(n)]
import math
n,a,b=[int(i) for i in input().split()]
cnt=0
print((n//(a+b))*a+(n%(a+b))) | # n=int(input())
# a=[int(i) for i in input().split()]
# a=[int(input()) for i in range(n)]
import math
n,a,b=[int(i) for i in input().split()]
cnt=0
print((n//(a+b))*a+min(n%(a+b),a)) | [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 536,197 | 536,198 | u619197965 | python |
p02754 | import math
N, A, B = map(int, input().split(' '))
r = math.floor(N / (A + B))
ans = r * A + N - r * (A + B)
print(ans)
| import math
N, A, B = map(int, input().split(' '))
r = math.floor(N / (A + B))
ans = r * A + min(N - r * (A + B), A)
print(ans)
| [
"call.add",
"call.arguments.add"
] | 536,199 | 536,200 | u298633786 | python |
p02754 | N, A, B = map(int,input().split())
SYO = N // (A+B)
AMARI = N % (A+B)
if AMARI < A:
print(SYO*A+AMARI)
else:
print(SYO*(A+1)) | N, A, B = map(int,input().split())
SYO = N // (A+B)
AMARI = N % (A+B)
if AMARI < A:
print(SYO*A+AMARI)
else:
print((SYO+1)*A) | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 536,205 | 536,206 | u736641785 | python |
p02754 | n,b,r = map(int, input().split()) # 5 7 2
ans = (n//(b+r)) + min(n%(b+r),b)
print(ans)
| n,b,r = map(int, input().split()) # 5 7 2
ans = (n//(b+r))*b + min(n%(b+r),b)
print(ans)
| [
"assignment.change"
] | 536,211 | 536,212 | u833492079 | python |
p02754 | n, a, b = map(int, input().split())
print(a*n//(a+b)+min(a, n%(a+b))) | n, a, b = map(int, input().split())
print(a*(n//(a+b))+min(a, n%(a+b))) | [
"call.arguments.change"
] | 536,243 | 536,244 | u808916291 | python |
p02754 | N,A,B = map(int, input().split())
if A == 0 or A + B == 0:
print(0)
else:
ans = (N // (A + B)) * A + min(B, (N % (A+B)))
#print(N // (A+B))
#print(min(B, (N%(A+B))))
print(ans)
| N,A,B = map(int, input().split())
if A == 0 or A + B == 0:
print(0)
else:
ans = (N // (A + B)) * A + min(A, (N % (A+B)))
#print(N // (A+B))
#print(min(B, (N%(A+B))))
print(ans)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 536,247 | 536,248 | u106297876 | python |
p02754 | # -*- coding: utf-8 -*-
n, a, b = map(int, input().split())
r1 = n // (a+b)
r2 = n % (a+b)
print(a * r1 + r2)
| # -*- coding: utf-8 -*-
n, a, b = map(int, input().split())
r1 = n // (a+b)
r2 = min(n % (a+b), a)
print(a * r1 + r2)
| [
"call.add",
"call.arguments.add"
] | 536,249 | 536,250 | u056277698 | python |
p02754 | n, a, b = map(int, input().split())
ans = (n // (a + b)) * a
if n % (a + b) >= b:
ans += b
else:
ans += n % (a + b)
print(ans)
| n, a, b = map(int, input().split())
ans = (n // (a + b)) * a
if n % (a + b) >= a:
ans += a
else:
ans += n % (a + b)
print(ans)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 536,257 | 536,258 | u556672233 | python |
p02754 | from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()
N, A, B = read_int()
def solve():
ans = (N / (A + B)) * ... | from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()
N, A, B = read_int()
def solve():
ans = (N // (A + B)) *... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 536,265 | 536,266 | u507613674 | python |
p02754 | N,A,B=map(int,input().split())
if N%(A+B)<=A:
print(N//(A+B)*A+N%(A+B))
else:
print(N//(A+B+1)*A) | N,A,B=map(int,input().split())
if N%(A+B)<=A:
print(N//(A+B)*A+N%(A+B))
else:
print(N//(A+B)*A+A) | [
"expression.operation.binary.remove"
] | 536,273 | 536,272 | u703528810 | python |
p02754 | N, A, B = list(map(int, input().split()))
P = N // (A + B)
Q = N % (A + B)
print(P * A + Q) | N, A, B = list(map(int, input().split()))
P = N // (A + B)
Q = min(N % (A + B), A)
print(P * A + Q) | [
"call.add",
"call.arguments.add"
] | 536,274 | 536,275 | u582333355 | python |
p02754 | N, A, B = map(int, input().split())
print((N // (A + B)) * A + (N % (A + B))) | N, A, B = map(int, input().split())
print((N // (A + B)) * A + min((N % (A + B)), A))
| [
"call.add",
"call.arguments.add"
] | 536,276 | 536,277 | u224353074 | python |
p02754 | n, a, b = map(int, input().split())
if a == 0:
print(0)
elif n <= a:
print(n)
else:
div = n // (a + b)
rem = n % (a + b)
if rem <= a:
print(div * a + rem)
else:
print(div * a+ rem)
| n, a, b = map(int, input().split())
if a == 0:
print(0)
elif n <= a:
print(n)
else:
div = n // (a + b)
rem = n % (a + b)
if rem <= a:
print(div * a + rem)
else:
print(div * a + a)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 536,285 | 536,286 | u614063956 | python |
p02754 | N, A, B = map(int, input().split())
count = 0
t1 = (N * A) // (A + B)
t2 = N % (A + B)
count += t1
count += min(t2, A)
print(count)
| N, A, B = map(int, input().split())
count = 0
t1 = (N // (A + B)) * A
t2 = N % (A + B)
count += t1
count += min(t2, A)
print(count)
| [
"assignment.change"
] | 536,291 | 536,292 | u637918426 | python |
p02754 | n,a,b = (int(x) for x in input().split())
t = a+b
q = n%t
p = (n-q)//t
print(min(p+q,p+a))
| n,a,b = (int(x) for x in input().split())
t = a+b
q = n%t
p = (n-q)//t
print(min(a*p+q,a*p+a)) | [
"expression.operation.binary.add"
] | 536,302 | 536,303 | u970082363 | python |
p02754 | n, a, b = map(int, input().split())
x = n // (a + b)
y = min(n % (a+b), b)
print(x*a + y) | n, a, b = map(int, input().split())
x = n // (a + b)
y = min(n % (a+b), a)
print(x*a + y) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 536,306 | 536,307 | u382423941 | python |
p02754 | N, A, B = map(int, input().split())
t = N // (A + B)
mod = N % (A + B)
print(t * A + mod) | N, A, B = map(int, input().split())
t = N // (A + B)
mod = N % (A + B)
print(t * A + min(mod, A)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 536,308 | 536,309 | u078349616 | python |
p02754 | def main():
N, A, B = map(int, input().split())
ret = 0
AB = A + B
times = N // AB
ret += A
left = min(N - AB*times, A)
ret += left
print(ret)
main() | def main():
N, A, B = map(int, input().split())
ret = 0
AB = A + B
times = N // AB
ret += (times * A)
left = min(N - AB*times, A)
ret += left
print(ret)
main() | [] | 536,314 | 536,315 | u074372598 | python |
p02754 | """
// Author : snape_here - Susanta Mukherjee
"""
from __future__ import division, print_function
import os,sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def ii(): return int(i... | """
// Author : snape_here - Susanta Mukherjee
"""
from __future__ import division, print_function
import os,sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def ii(): return int(i... | [
"call.add",
"call.arguments.add"
] | 536,318 | 536,319 | u554003615 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.