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())
if n%(a+b) < 3:
print(n//(a+b)*a+n%(a+b))
else:
print(n//(a+b)*a+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) | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 532,947 | 532,948 | u854992222 | python |
p02754 | n, a, b = map(int, input().split())
ab = a + b
syou = ab // n
amari = ab % n
print(syou * a + min(amari, a)) | n, a, b = map(int, input().split())
ab = a + b
syou = n // ab
amari = n % ab
print(syou * a + min(amari, a)) | [
"expression.operation.binary.remove"
] | 532,949 | 532,950 | u268674745 | python |
p02754 | N,A,B=[int(s) for s in input().split()]
C=A+B
Q=N//C
R=N%C
if R<=A:
print(Q*A+C)
else:
print((Q+1)*A) | N,A,B=[int(s) for s in input().split()]
C=A+B
Q=N//C
R=N%C
if R<=A:
print(Q*A+R)
else:
print((Q+1)*A)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 532,953 | 532,954 | u918601425 | python |
p02754 | N ,Blue,Red = map(int,input().split())
ans = N //(A+B) *A
rem = N % (A+B)
ans += min(rem,A)
print(ans) | N ,A,B = map(int,input().split())
ans = N //(A+B) *A
rem = N % (A+B)
ans += min(rem,A)
print(ans) | [
"assignment.variable.change",
"identifier.change"
] | 532,955 | 532,956 | u208464243 | python |
p02754 | n, a, b = map(int, input().split())
x = n // (a + b)
ans = a * a + min(a, n - (a + b)*x)
print(ans)
| n, a, b = map(int, input().split())
x = n // (a + b)
ans = a * x + min(a, n - (a + b) * x)
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 532,963 | 532,964 | u263660661 | python |
p02754 | n, a, b = map(int, input().split())
x = n // (a + b)
ans = a * a + min(a, n - (a + b)*x)
print(ans)
| n,a,b = map(int, input().split())
x = n // (a + b)
ans = a * x + min(a,n - (a + b) * x)
print(ans)
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 532,963 | 532,965 | u263660661 | python |
p02754 | N,A,B=map(int, input().split())
s=N//(A+B)
NA=N%(A+B)
if(A!=0):
if(NA<A):
sA=0
sAG=NA
else:
sA=1
sAG=0
else:
sA=0
print(s*A+sA*A+sAG) | N,A,B=map(int, input().split())
s=N//(A+B)
NA=N%(A+B)
if(A!=0):
if(NA<A):
sA=0
sAG=NA
else:
sA=1
sAG=0
else:
sA=0
sAG=0
print(s*A+sA*A+sAG) | [
"assignment.add"
] | 532,980 | 532,981 | u051218477 | python |
p02754 | N,A,B = map(int,input().split())
ans = (N//(A+B))*A
ans += N%(A+B)
print(ans) | N,A,B = map(int,input().split())
ans = (N//(A+B))*A
ans += min(N%(A+B),A)
print(ans) | [
"call.add",
"call.arguments.add"
] | 532,990 | 532,991 | u347920118 | python |
p02754 | N, A, B = map(int, input().split())
combo = A + B
num_of_combo = N // combo
remaining = N - combo * num_of_combo
print(num_of_combo * A + remaining)
| N, A, B = map(int, input().split())
combo = A + B
num_of_combo = N // combo
remaining = N - combo * num_of_combo
print(num_of_combo * A + min(remaining, A))
| [
"call.add",
"call.arguments.add"
] | 532,993 | 532,994 | u917013605 | python |
p02754 | #!/usr/bin/env python3
import sys
# import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popl... | #!/usr/bin/env python3
import sys
# import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popl... | [
"call.add",
"call.arguments.add"
] | 532,999 | 533,000 | u480300350 | python |
p02754 | from sys import stdin
N,A,B = list(map(int,stdin.readline().strip().split()))
C=A+B
ans=A*(N//C)
if N%C>A:
ans+=N%C-B
else:ans+=N%C
print(ans) | from sys import stdin
N,A,B = list(map(int,stdin.readline().strip().split()))
C=A+B
ans=A*(N//C)
if N%C>A:
ans+=A
else:ans+=N%C
print(ans) | [
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 533,015 | 533,016 | u459419927 | python |
p02754 | n,a,b = map(int, input().split())
tmp = int(n /(a+b))
amari = int(n %(a+b))
print(tmp*a)
if amari >= a:
print(tmp*a + a)
else:
print(tmp*a + amari) | n,a,b = map(int, input().split())
# n,a,b = map(int, "6 2 4".split())
tmp = int(n /(a+b))
amari = int(n %(a+b))
if amari >= a:
print(tmp*a + a)
else:
print(tmp*a + amari) | [
"call.remove"
] | 533,026 | 533,027 | u320763652 | python |
p02754 | n,a,b = map(int, input().split())
tmp = int(n /(a+b))
amari = int(n %(a+b))
if amari >= a:
print(tmp*a + a)
else:
print(tmp*a + a-amari) | n,a,b = map(int, input().split())
# n,a,b = map(int, "6 2 4".split())
tmp = int(n /(a+b))
amari = int(n %(a+b))
if amari >= a:
print(tmp*a + a)
else:
print(tmp*a + amari) | [
"expression.operation.binary.remove"
] | 533,028 | 533,027 | u320763652 | python |
p02754 | N, A ,B =map(int,input().split())
print(N//(A+B)*A+min(N%(A+B),B)) | N, A ,B =map(int,input().split())
print(N//(A+B)*A+min(N%(A+B),A))
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 533,034 | 533,035 | u113631524 | python |
p02754 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, a, b = map(int, readline().split())
if n <= a + b:
print(a)
else:
ans = n // (a + b) * a
if n % (a + b) < a:
ans += n % (a + b)
else:
ans... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, a, b = map(int, readline().split())
if n <= a + b:
print(min(n, a))
else:
ans = n // (a + b) * a
if n % (a + b) < a:
ans += n % (a + b)
else:
... | [
"call.add",
"call.arguments.change"
] | 533,049 | 533,050 | u691018832 | python |
p02754 | N, A, B = map(int, input().split())
C = N%(A+B)
if C> A:
print(A*N//(A+B)+A)
else:
print(A*N//(A+B)+C)
| N, A, B = map(int, input().split())
C = N%(A+B)
if C> A:
print(A*(N//(A+B))+A)
else:
print(A*(N//(A+B))+C)
| [
"call.arguments.change"
] | 533,053 | 533,054 | u860657719 | python |
p02754 | N,A,B = list(map(int, input().split()))
S = A+B
ans = (S // N) * A
res = S % N
ans += min(A,res)
print(ans)
| N,A,B = list(map(int, input().split()))
S = A+B
ans = (N // S) * A
res = N % S
ans += min(A,res)
print(ans)
| [
"expression.operation.binary.remove"
] | 533,057 | 533,058 | u457901067 | python |
p02754 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_... | [
"call.add",
"call.arguments.add"
] | 533,074 | 533,075 | u285891772 | python |
p02754 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_... | [
"call.add",
"call.arguments.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 533,076 | 533,075 | u285891772 | python |
p02754 | N, A, B= map(int, input().split())
print(A*N//(A+B)+min(N%(A+B), A)) | N, A, B= map(int, input().split())
print(A*(N//(A+B))+min(N%(A+B), A)) | [
"call.arguments.change"
] | 533,104 | 533,105 | u127285813 | python |
p02754 | n, a, b = map(int, input().split())
if a == 0:
print(0)
else:
print( (n //(a+b))*a + max(a, n%(a+b)) ) | n, a, b = map(int, input().split())
if a == 0:
print(0)
else:
print( (n //(a+b))*a + min(a, n%(a+b)) ) | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 533,108 | 533,109 | u597017430 | python |
p02754 | n,b,r = [int(i) for i in input().split()]
k = n // (r+b) * b
l = min(n % (r+b), b)
print(k,l) | n,b,r = [int(i) for i in input().split()]
k = n // (r+b) * b
l = min(n % (r+b), b)
print(k+l)
| [
"call.arguments.change",
"io.output.change"
] | 533,148 | 533,149 | u738287470 | python |
p02754 | n,b,r = [int(i) for i in input().split()]
k = n * b // (r+b)
l = min(n % (r+b), b)
print(k+l) | n,b,r = [int(i) for i in input().split()]
k = n // (r+b) * b
l = min(n % (r+b), b)
print(k+l)
| [
"expression.operation.binary.remove"
] | 533,150 | 533,149 | u738287470 | python |
p02754 | N, A, B = map(int, input().split())
ans = A * N // (A + B) + min(N % (A + B), A)
print(ans) | N, A, B = map(int, input().split())
ans = A * (N // (A + B)) + min(N % (A + B), A)
print(ans) | [] | 533,185 | 533,186 | u291303494 | python |
p02754 | n,a,b=map(int,input().split())
c=n//(a+b)
d=n%(a+b)
blue=c*a+b if d>=b else c*a+d
print(blue) | n,a,b=map(int,input().split())
c=n//(a+b)
d=n%(a+b)
blue=c*a+a if d>=a else c*a+d
print(blue) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 533,193 | 533,194 | u482743994 | python |
p02754 | N, A, B = map(int,input().split())
x = N // (A+B)
y = N % (A+B)
ans = x + min(A, y)
print(ans) | N, A, B = map(int,input().split())
x = A * (N // (A+B))
y = N % (A+B)
ans = x + min(A, y)
print(ans) | [
"assignment.change"
] | 533,217 | 533,218 | u066551652 | python |
p02754 | N,A,B=map(int,input().split())
d=int(N%(A+B))
ans = A*d+min(A,(N%(A+B)))
print(ans) | N,A,B=map(int,input().split())
d=int(N//(A+B))
ans = A*d+min(A,(N%(A+B)))
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 533,247 | 533,248 | u372670441 | python |
p02754 | n,a,b=map(int, input().split())
mod = n % (a+b)
num = n // (a+b)
if a == 0:
print(0)
else:
print(num*a+mod) | n,a,b=map(int, input().split())
mod = n % (a+b)
num = n // (a+b)
if a == 0:
print(0)
else:
print(num*a+min(mod,a)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 533,259 | 533,260 | u300579805 | python |
p02754 | n,a,b = map(int,input().split())
ans = a*(n//(a+b)) + min(N%(a+b),a)
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"
] | 533,267 | 533,268 | u209275335 | python |
p02754 | N, A, B = map(int, input().split())
ans = N // (A+B) * A
rem = n % (A+B)
ans += min(rem, A)
print(ans) | N, A, B = map(int, input().split())
ans = N // (A+B) * A
rem = N % (A+B)
ans += min(rem, A)
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 533,269 | 533,270 | u268504600 | python |
p02754 | N, A, B = map(int,input().split())
ans = (N//(A+B)) + min(N%(A+B),A)
print(ans) | N, A, B = map(int,input().split())
ans = A*(N//(A+B)) + min(N%(A+B),A)
print(ans)
| [
"assignment.change"
] | 533,295 | 533,296 | u453623947 | python |
p02754 | import math
a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
num_one_gr = y + z
num_gr = math.floor(x/num_one_gr)
amari = x - num_one_gr*num_gr
if amari <= y:
total = y * num_gr + amari
else:
total = y*(num_gr + 1) | import math
a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
num_one_gr = y + z
num_gr = math.floor(x/num_one_gr)
amari = x - num_one_gr*num_gr
if amari <= y:
total = y * num_gr + amari
else:
total = y*(num_gr + 1)
print(total) | [
"call.add"
] | 533,316 | 533,317 | u224554402 | python |
p02754 | N, A, B = map(int, input().split())
A_amari = A % 2
B_amari = B % 2
# print(A_amari)
# print(B_amari)
if A+B == 0:
print(0)
exit()
else:
cnt = N // (A+B)
amari = N % (A+B)
# print(cnt)
# print(amari)
if amari <= A:
print(A*cnt+amari)
else:
if amari <= B:
print(A*(cnt+1)) | N, A, B = map(int, input().split())
A_amari = A % 2
B_amari = B % 2
# print(A_amari)
# print(B_amari)
if A+B == 0:
print(0)
exit()
else:
cnt = N // (A+B)
amari = N % (A+B)
# print(cnt)
# print(amari)
if amari <= A:
print(A*cnt+amari)
else:
if amari <= B or amari > A:
print(A*(cnt+1)) | [
"control_flow.branch.if.condition.change"
] | 533,329 | 533,330 | u604874738 | python |
p02754 | N,A,B = map(int,input().split())
if A == 0 and B == 0:
print(0)
kumi = N // (A + B)
amari = N % (A + B)
if amari > A:
print(kumi * A + N)
else:
print(kumi * A + amari) | N,A,B = map(int,input().split())
if A == 0 and B == 0:
print(0)
kumi = N // (A + B)
amari = N % (A + B)
if amari > A:
print(kumi * A + A)
else:
print(kumi * A + amari) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 533,358 | 533,359 | u699330893 | python |
p02754 |
N, A, B = map(int, input().split())
out = N // (A + B) * A
rem = N % (A + B)
print(out + rem)
|
N, A, B = map(int, input().split())
out = N // (A + B) * A
rem = min(N % (A + B), A)
print(out + rem)
| [
"call.add",
"call.arguments.add"
] | 533,378 | 533,379 | u450898610 | python |
p02754 | n,a,b=map(int,input().split())
kaisu = int(n // (a+b))
amari = int(n % (a + b))
ans = kaisu * b
if amari > b:
ans += b
else:
ans += amari
print(ans) | n,a,b=map(int,input().split())
kaisu = int(n // (a+b))
amari = int(n % (a + b))
ans = kaisu * a
if amari > a:
ans += a
else:
ans += amari
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 533,387 | 533,388 | u652892331 | python |
p02754 | n,a,b=map(int,input().split())
kaisu = int(n // (a+b))
amari = int(n % (a + b))
ans = kaisu * a
if amari > b:
ans += b
else:
ans += amari
print(ans) | n,a,b=map(int,input().split())
kaisu = int(n // (a+b))
amari = int(n % (a + b))
ans = kaisu * a
if amari > a:
ans += a
else:
ans += amari
print(ans) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 533,389 | 533,388 | u652892331 | python |
p02754 | n, a, b = map(int, input().split())
r = a+b
if n%r <= a:
print(n//r * a + n%r)
else:
print(n//r + a) | n, a, b = map(int, input().split())
r = a+b
if n%r <= a:
print(n//r * a + n%r)
else:
print(n//r * a + a) | [
"expression.operation.binary.add"
] | 533,414 | 533,415 | u485566817 | python |
p02754 | n, a, b = map(int, input().split())
l, m = divmod(n, a+b)
print(l*a+m)
| n, a, b = map(int, input().split())
l, m = divmod(n, a+b)
print(l*a+min(a, m))
| [
"call.add",
"call.arguments.change"
] | 533,432 | 533,433 | u891217808 | python |
p02754 | n, a, b = map(int,input().split())
tot = a + b
bcnt = (n // tot) * b
n -= (n // tot) * tot
bcnt += min(n,b)
print(bcnt)
| n, a, b = map(int,input().split())
tot = a + b
bcnt = (n // tot) * a
n -= (n // tot) * tot
bcnt += min(n,a)
print(bcnt)
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 533,448 | 533,449 | u890233117 | python |
p02754 | N,A,B = map(int,input().split())
s = N/(A+B)
a = N-(A+B)*s
print(int(A*s+a if A>a else A*(s+1))) | N,A,B = map(int,input().split())
s = int(N/(A+B))
a = N-(A+B)*s
print(int(A*s+a if A>a else A*(s+1))) | [
"call.add",
"call.arguments.change"
] | 533,452 | 533,453 | u627213696 | python |
p02754 | n, a, b = [int(i) for i in input().split()]
answer, amari = divmod(n, a+b)
answer *= a
print(answer + max(a, amari)) | n, a, b = [int(i) for i in input().split()]
answer, amari = divmod(n, a+b)
answer *= a
print(answer + min(a, amari)) | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 533,458 | 533,459 | u479835943 | python |
p02754 | n, a, b = map(int,input().split())
x = int(n/(a+b)) #何周目か
y = n%(a+b)
if y > a:
ans = (x+1) * a
else:
x * a + y
print(ans) | n, a, b = map(int,input().split())
x = int(n/(a+b)) #何周目か
y = n%(a+b) #余り
if y > a:
ans = (x+1) * a
else:
ans = x * a + y
print(ans) | [
"assignment.add"
] | 533,460 | 533,461 | u106181248 | python |
p02754 | n, a, b = map(int, input().split(' '))
print(int(n%(a+b))+int((n//(a+b))*a)) | n, a, b = map(int, input().split(' '))
print(min(int(n%(a+b)),a)+int((n//(a+b))*a)) | [
"call.arguments.add"
] | 533,485 | 533,483 | u891422384 | python |
p02754 | n, a, b = map(int, input().split(' '))
r = n//(a+b)
print(int(r*a+(n-r*(a+b)))) | n, a, b = map(int, input().split(' '))
r = n//(a+b)
print(int(r*a+min((n-r*(a+b),a)))) | [
"call.add",
"call.arguments.change"
] | 533,486 | 533,487 | u891422384 | python |
p02754 | # problem B
N,A,B = map(int,input().split())
syou = N // (A+B)
amari = N % (A+B)
ans = syou * A
if amari >= A:
ans += B
else:
ans += amari
print(ans) | # problem B
N,A,B = map(int,input().split())
syou = N // (A+B)
amari = N % (A+B)
ans = syou * A
if amari >= A:
ans += A
else:
ans += amari
print(ans) | [
"identifier.change"
] | 533,496 | 533,497 | u133174241 | python |
p02754 | n,a,b=map(int,input().split())
x=n//(a+b)
if (a+b)*x<=a:
t=n-x*(a+b)
else:
t=a
print(a*x+t)
| n,a,b=map(int,input().split())
x=n//(a+b)
if n-(a+b)*x<=a:
t=n-x*(a+b)
else:
t=a
print(a*x+t)
| [
"control_flow.branch.if.condition.change"
] | 533,502 | 533,503 | u357230322 | python |
p02754 | N, A, B = map(int, input().split())
cy = N // (A + B)
cynum = N % (A + B)
tmpans = cy * A
#print(cy)
#print(cynum)
#print(tmpans)
if 0 <= cynum and cynum < A:
ans = cynum + tmpans
else:
ans = cynum + A
print(ans) | N, A, B = map(int, input().split())
cy = N // (A + B)
cynum = N % (A + B)
tmpans = cy * A
#print(cy)
#print(cynum)
#print(tmpans)
if 0 <= cynum and cynum < A:
ans = cynum + tmpans
else:
ans = tmpans + A
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 533,508 | 533,509 | u318233626 | python |
p02754 | n , a , b= list(map(int,input().split()))
s = n//(a+b)
t = n% (a+b)
if t>=a:
print(a*s+a)
if t<=a:
print(a*s+t) | n , a , b= list(map(int,input().split()))
s = n//(a+b)
t = n% (a+b)
if t>a:
print(a*s+a)
if t<=a:
print(a*s+t)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 533,517 | 533,518 | u231038326 | python |
p02754 |
n, a, b = map(int, input().split())
if a==0:
print(0)
else:
s= n//(a+b)
sn = n%(a+b)
if sn > a:
print (s*a+a)
else:
print (s*a+a-sn)
|
n, a, b = map(int, input().split())
if a==0:
print(0)
else:
s= n//(a+b)
sn = n%(a+b)
if sn > a:
print (s*a+a)
else:
print (s*a+sn)
| [
"expression.operation.binary.remove"
] | 533,530 | 533,531 | u236666830 | python |
p02754 | a,b,n = map(int, input().split())
if a==0 and b==0:
print(0)
else:
set = n//(a+b)
rem = n % (a+b)
if rem >= a:
print( set * a + a)
else:
print( set * a + rem) | n,a,b = map(int, input().split())
if a==0 and b==0:
print(0)
else:
set = n//(a+b)
rem = n % (a+b)
if rem >= a:
print( set * a + a)
else:
print( set * a + rem) | [] | 533,532 | 533,533 | u596297663 | python |
p02754 | from sys import stdin
def main():
N, A, B = map(int,input().split())
k = N/(A+B)
val = k*A+ min(A, N-k*(A+B))
print(int(val))
if __name__ == "__main__":
main() | from sys import stdin
def main():
N, A, B = map(int,input().split())
k = int(N/(A+B))
val = k*A+ min(A, N-k*(A+B))
print(int(val))
if __name__ == "__main__":
main() | [
"call.add",
"call.arguments.change"
] | 533,543 | 533,544 | u843433688 | python |
p02754 | import math
N,A,B = list(map(int,input().split()))
ans = math.ceil(A*(N/(A+B)))
if N%(A+B)>=A:
ans+=A
else: ans+=N%(A+B)
print(ans) | import math
N,A,B = list(map(int,input().split()))
ans = A*(N//(A+B))
if N%(A+B)>=A:
ans+=A
else: ans+=N%(A+B)
print(ans) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 533,549 | 533,550 | u657786757 | python |
p02754 | N,A,B = list(map(int,input().split()))
ans = A*N//(A+B)
if N%(A+B)>=A:
ans+=A
else: ans+=N%(A+B)
print(ans) | import math
N,A,B = list(map(int,input().split()))
ans = A*(N//(A+B))
if N%(A+B)>=A:
ans+=A
else: ans+=N%(A+B)
print(ans) | [] | 533,551 | 533,550 | u657786757 | python |
p02754 | N, A, B = map(int, input().split())
blue = N // (A + B) * A
rem = N % (A + B)
ans = blue + min(rem, B)
print(ans) | N, A, B = map(int, input().split())
blue = N // (A + B) * A
rem = N % (A + B)
blue = blue + min(rem, A)
print(blue)
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 533,565 | 533,566 | u729836751 | python |
p02754 | n, a, b = map(int, input().split())
ans = n // (a+b) * n
tmp = n % (a+b)
ans += min(a, tmp)
print(ans) | n, a, b = map(int, input().split())
ans = n // (a+b) * a
tmp = n % (a+b)
ans += min(a, tmp)
print(ans)
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 533,568 | 533,569 | u534450736 | python |
p02754 | N, A, B = map(int, input().split())
repeat = N / (A+B)
mod = N % (A+B)
print(A*repeat + min(A, mod)) | N, A, B = map(int, input().split())
repeat = N // (A+B)
mod = N % (A+B)
print(A*repeat + min(A, mod)) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 533,572 | 533,573 | u132049876 | python |
p02754 | n,a,b = map(int,input().split())
c = n//(a+b)
d = n % (a+b)
if d > a:
ans = c * (a+1)
else:
ans = c * a + d
print(ans) | n,a,b = map(int,input().split())
c = n//(a+b)
d = n % (a+b)
if d > a:
ans = a * (c+1)
else:
ans = c * a + d
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 533,584 | 533,585 | u247830763 | python |
p02754 | # -*- coding: utf-8 -*-
import sys
def prob_b(n, a, b):
x = int(n / (a + b)) * a
y = n % (a + b)
print(x+y)
if __name__ == '__main__':
#args = sys.argv
#n = args[1]
#a = args[2]
#b = args[3]
n, a, b = map(int, input().split())
prob_b(n,a,b)
| # -*- coding: utf-8 -*-
import sys
def prob_b(n, a, b):
x = int(n / (a + b)) * a
y = min(n % (a + b), a)
print(x+y)
if __name__ == '__main__':
#args = sys.argv
#n = args[1]
#a = args[2]
#b = args[3]
n, a, b = map(int, input().split())
prob_b(n,a,b)
| [
"call.add",
"call.arguments.add"
] | 533,609 | 533,610 | u283605799 | python |
p02754 | N,A,B=map(int,input().split())
x=N//(A+B)
y=N%(A+B)
if y<A:
print(x*A+y)
else:
print(x*a+a) | N,A,B=map(int,input().split())
x=N//(A+B)
y=N%(A+B)
if y<A:
print(x*A+y)
else:
print(x*A+A) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 533,611 | 533,612 | u455642216 | python |
p02754 | n,a,b=map(int,input().split())
a*(n//(a+b))+min(n%(a+b),a) | n,a,b=map(int,input().split())
print(a*(n//(a+b))+min(n%(a+b),a)) | [
"call.add",
"call.arguments.change"
] | 533,631 | 533,632 | u921617614 | python |
p02754 | from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools
logging.basi... | from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools
logging.basi... | [
"call.add",
"call.arguments.change"
] | 533,893 | 533,894 | u339715842 | python |
p02754 | n, a, b = map(int, input().split(' '))
div, mod = divmod(n, a+b)
ans = div*a+(mod if mod < b else b)
print(ans) | n, a, b = map(int, input().split(' '))
div, mod = divmod(n, a+b)
ans = div*a+(mod if mod < a else a)
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 533,915 | 533,916 | u360061665 | python |
p02754 | N, A, B = map(int, input().split())
phrase = A + B
ans = N // phrase * A
ans += N % phrase if N % phrase <= A else 0
print(ans)
| N, A, B = map(int, input().split())
phrase = A + B
ans = N // phrase * A
ans += N % phrase if N % phrase <= A else A
print(ans)
| [
"identifier.replace.add",
"literal.replace.remove"
] | 533,920 | 533,921 | u482019060 | python |
p02754 | a = list(map(int, input().split()))
N = a[0]
A = a[1]
B = a[2]
count = 0
i = N % (A + B)
j = N //(A + B)
if i >= A:
i = A
count = j * A + i | a = list(map(int, input().split()))
N = a[0]
A = a[1]
B = a[2]
count = 0
i = N % (A + B)
j = N //(A + B)
if i >= A:
i = A
count = j * A + i
print(count) | [
"call.add"
] | 533,931 | 533,932 | u689835643 | python |
p02754 | a = list(map(int, input().split()))
N = a[0]
A = a[1]
B = a[2]
count = 0
i = N % (A + B)
j = N //(A + B)
if i >= A:
i == A
count = j * A + i
print(count) | a = list(map(int, input().split()))
N = a[0]
A = a[1]
B = a[2]
count = 0
i = N % (A + B)
j = N //(A + B)
if i >= A:
i = A
count = j * A + i
print(count) | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 533,933 | 533,932 | u689835643 | python |
p02754 | a = list(map(int, input().split()))
N = a[0]
A = a[1]
B = a[2]
count = 0
i = N % (A + B)
j = N //(A + B)
if i >= A:
i == A
count = j * A + i
| a = list(map(int, input().split()))
N = a[0]
A = a[1]
B = a[2]
count = 0
i = N % (A + B)
j = N //(A + B)
if i >= A:
i = A
count = j * A + i
print(count) | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"call.add"
] | 533,934 | 533,932 | u689835643 | python |
p02754 | n,a,b=map(int,input().split())
s=n//(a+b)
ans1=a*s
rem=n%(a+b)
if rem>=a:
print(ans1+a)
else:
print(ans1+a-rem)
| n,a,b=map(int,input().split())
s=n//(a+b)
ans1=a*s
rem=n%(a+b)
if rem>=a:
print(ans1+a)
else:
print(ans1+rem) | [
"expression.operation.binary.remove"
] | 533,937 | 533,938 | u664546626 | python |
p02754 | import sys
n,a,b=(int(x) for x in input().split())
j=0
c=a+b
q, mod=divmod(n,c)
A=q*a+mod
print(A)
| import sys
n,a,b=(int(x) for x in input().split())
j=0
c=a+b
q, mod=divmod(n,c)
A=q*a+min(mod,a)
print(A) | [
"call.add",
"call.arguments.add"
] | 533,948 | 533,949 | u233477833 | python |
p02754 | n,a,b=map(int,input().split())
sho=n//(a+b)
amari=n%(a+b)
if amari > 3:
ex=3
else:
ex=amari
blue=a*sho+ex
print(blue) | n,a,b=map(int,input().split())
sho=n//(a+b)
amari=n%(a+b)
if amari > a:
ex=a
else:
ex=amari
blue=a*sho+ex
print(blue) | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 533,964 | 533,965 | u403562465 | python |
p02754 | n,a,b=map(int,input().split())
q,mod=divmod(n,(a+b))
if mod<=a:
print(q*a+mod)
else:
print(q*b+mod)
| n,a,b=map(int,input().split())
q,mod=divmod(n,(a+b))
if mod<=a:
print(q*a+mod)
else:
print(q*a+a) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 533,966 | 533,967 | u049725710 | python |
p02754 | N, A, B = map(int, input().split())
amari = N % (A+B)
sho = N // (A+B)
blue_num = 0
if amari <= B:
blue_num += A * sho + amari
else:
blue_num += A * sho + B
print(blue_num) | import sys
N, A, B = map(int, input().split())
amari = N % (A+B)
sho = N // (A+B)
blue_num = 0
if amari <= A:
blue_num += A * sho + amari
else:
blue_num += A * sho + A
print(blue_num) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.change"
] | 533,981 | 533,982 | u938256038 | python |
p02754 | N, A, B= map(int, input().split())
re += N//(A+B) *A
re += min(N%(A+B),A)
print(re) | N, A, B = map(int, input().split())
result = 0
result += N // (A + B) * A
result += min(N % (A + B), A)
print(result) | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 533,985 | 533,986 | u645568816 | python |
p02754 | # A = [list(map(int, input().split())) for _ in range(3)]
# n = int(input())
# B = [int(input()) for _ in range(n)]
# X = list(map(int, input().split()))
n, b, r = map(int, input().split())
total = b+r
circle = total//n
diff = n % total
if b < diff:
print(diff + circle*b)
else:
print(b + circle*b)
| # A = [list(map(int, input().split())) for _ in range(3)]
# n = int(input())
# B = [int(input()) for _ in range(n)]
# X = list(map(int, input().split()))
n, b, r = map(int, input().split())
total = b+r
circle = n//total
diff = n % total
if b <= diff:
print(b + circle*b)
else:
print(diff + circle*b)
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.arguments.change",
"call.add"
] | 534,000 | 534,001 | u143492911 | python |
p02754 | x, b, r = map(int, input().split())
k=x/(b+r)
print(int(k*b+min(x%(b+r), b))) | x, b, r = map(int, input().split())
k=int(x/(b+r))
print(k*b+min(x%(b+r), b)) | [
"call.add",
"call.arguments.change"
] | 534,004 | 534,005 | u604269317 | python |
p02754 | x, b, r = map(int, input().split())
k=x/(b+r)
print(k*b+min(x%(b+r), b)) | x, b, r = map(int, input().split())
k=int(x/(b+r))
print(k*b+min(x%(b+r), b)) | [
"call.add",
"call.arguments.change"
] | 534,006 | 534,005 | u604269317 | python |
p02754 | N,A,B=map(int,input().split)
ans=N//(A+B)*A
rem=N%(A+B)
ans=ans+min(rem,A)
print(ans) | N,A,B=map(int,input().split())
ans=(N//(A+B))*A
rem=N%(A+B)
ans=ans+min(rem,A)
print(ans) | [
"call.add"
] | 534,007 | 534,008 | u642418876 | python |
p02754 | N,A,B=map(int,input().split)
ans=N//(A+B)*A
rem=N%(A+B)
ans=ans+min(rem,A)
print(ans) | N,A,B=map(int,input().split())
ans=(N//(A+B))*A
rem=N%(A+B)
ans=ans+min(rem,A)
print(ans)
| [
"call.add"
] | 534,007 | 534,009 | u642418876 | python |
p02754 | import math
N, A, B = map(int, input().split())
QUO = math.floor(N / (A + B))
if N - (A + B) < A:
print(QUO * A + N - (A + B))
else:
print(QUO * A + A)
| import math
N, A, B = map(int, input().split())
QUO = math.floor(N / (A + B))
if N - (A + B) * QUO < A:
print(QUO * A + N - (A + B) * QUO)
else:
print(QUO * A + A)
| [
"control_flow.branch.if.condition.change"
] | 534,025 | 534,026 | u642823003 | python |
p02754 | n,a,b=map(int,input().split())
print((n//(a+b))*a + min((n-(a+b)),a)) | n,a,b=map(int,input().split())
print((n//(a+b))*a + min(n%(a+b),a)) | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 534,031 | 534,032 | u071361440 | python |
p02754 | # coding:utf-8
from math import ceil
import numpy as np
strInput = input()
N, A, B = np.array(strInput.split(' ')).astype(int)
numGroup = floor(N / (A + B))
numExtendBall = N % (A + B)
if numExtendBall >= A:
numExtendBlueBall = A
else:
numExtendBlueBall = numExtendBall
print(numGroup * A + numExtendBlueBall... | # coding:utf-8
from math import floor
import numpy as np
strInput = input()
N, A, B = np.array(strInput.split(' ')).astype(int)
numGroup = floor(N / (A + B))
numExtendBall = N % (A + B)
if numExtendBall >= A:
numExtendBlueBall = A
else:
numExtendBlueBall = numExtendBall
print(numGroup * A + numExtendBlueBal... | [
"misc.opposites",
"identifier.change"
] | 534,041 | 534,042 | u489963060 | python |
p02754 | balls=map(int,input().split())
print((n//(a+b))*a+min(a,n%(a+b))) | n,a,b=map(int,input().split())
print((n//(a+b))*a+min(a,n%(a+b))) | [
"assignment.variable.change"
] | 534,059 | 534,060 | u358747500 | python |
p02754 | #https://atcoder.jp/contests/abc158/tasks/abc158_b
# -*- coding: utf-8 -*-
N,A,B = map(int,input().split())
syou = N//(A+B)
amari = N%(A+B)
if amari>A:
amari=amari
ans = syou*A+amari
print(ans) | #https://atcoder.jp/contests/abc158/tasks/abc158_b
# -*- coding: utf-8 -*-
N,A,B = map(int,input().split())
syou = N//(A+B)
amari = N%(A+B)
if amari>A:
amari=A
ans = syou*A+amari
print(ans) | [
"assignment.value.change",
"identifier.change"
] | 534,079 | 534,080 | u044251893 | python |
p02754 | n,a,b=list(map(int,input().split()))
print(n//(a+b)*a+n%(a+b)) | n,a,b=list(map(int,input().split()))
print(n//(a+b)*a+min(a,n%(a+b))) | [
"call.add",
"call.arguments.change"
] | 534,089 | 534,090 | u464205401 | python |
p02754 | n,a,b = map(int,input().split())
left = n - (n // (a+b)) * (a+b)
print((n//(a+b))*a + left) | n,a,b = map(int,input().split())
left = n - (n // (a+b)) * (a+b)
print((n//(a+b))*a + min(a,left)) | [
"call.add",
"call.arguments.change"
] | 534,108 | 534,109 | u370429695 | python |
p02754 | a,b,c=input().strip().split(" ")
a,b,c=[int(a),int(b),int(c)]
p=b+c
x=a//p
m=a%p
pp=min(b,m)
print(pp+x*a) | a,b,c=input().strip().split(" ")
a,b,c=[int(a),int(b),int(c)]
p=b+c
x=a//p
m=a%p
pp=min(b,m)
print(pp+x*b)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 534,120 | 534,121 | u719238648 | python |
p02754 | n, a, b = map(int, input().split())
f = n // (a+b)
g = n % (a+b)
if g <= a:
print(f * a + g)
else:
print(f * (a+1)) | n, a, b = map(int, input().split())
f = n // (a+b)
g = n % (a+b)
if g <= a:
print(a * f + g)
else:
print(a * (f+1)) | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 534,141 | 534,142 | u607558942 | python |
p02754 | N,A,B=map(int,input().split())
ans=N//(A+B)*A
X=N%(A+B)
ans+=min(X,B)
print(ans) | N,A,B=map(int,input().split())
ans=N//(A+B)*A
X=N%(A+B)
ans+=min(X,A)
print(ans) | [
"identifier.change",
"call.arguments.change"
] | 534,150 | 534,151 | u314252953 | python |
p02754 | n,a,b = map(int,input().split())
ans = n//(a+b)*a
rem = n%(a+b)
ans +=(rem,a)
print(ans) | n,a,b = map(int,input().split())
ans = n // (a+b) * a
rem = n % (a+b)
ans += min(rem,a)
print(ans) | [
"call.add"
] | 534,159 | 534,160 | u374784428 | python |
p02754 | N, A, B = map(int, input().split())
if A == 0:
print(0)
else:
print(A * N // (A + B) + min(N % (A + B), A)) | N, A, B = map(int, input().split())
if A == 0:
print(0)
else:
print(A *(N // (A + B)) + min(N % (A + B), A)) | [
"call.arguments.change"
] | 534,161 | 534,162 | u565476466 | python |
p02754 | N, A, B = map(int, input().split())
q, mod = divmod(N, A+B)
print(q, mod)
if A < mod:
mod_A = A
else:
mod_A = mod
print(A * q + mod_A)
| N, A, B = map(int, input().split())
q, mod = divmod(N, A+B)
if A < mod:
mod_A = A
else:
mod_A = mod
print(A * q + mod_A)
| [
"call.remove"
] | 534,173 | 534,174 | u078957995 | python |
p02754 | # -*- coding: utf-8 -*-
# 整数の入力
#a = int(input())
# スペース区切りの文字列の入力
st = input().split()
#商
div = int(st[0]) // (int(st[1]) + int(st[2]))
#余り
rem = int(st[0]) % (int(st[1]) + int(st[2]))
if(rem < int(st[1])):
print(div * int(st[1]) + rem)
else:
print(div * int(st[1]) + st[1])
| # -*- coding: utf-8 -*-
# 整数の入力
#a = int(input())
# スペース区切りの文字列の入力
st = input().split()
#商
div = int(st[0]) // (int(st[1]) + int(st[2]))
#余り
rem = int(st[0]) % (int(st[1]) + int(st[2]))
if(rem < int(st[1])):
print(div * int(st[1]) + rem)
else:
print(div * int(st[1]) + int(st[1]))
| [
"call.add",
"call.arguments.change"
] | 534,183 | 534,184 | u182139295 | python |
p02754 | # input
N,A,B = map(int, input().split())
# calc
blue = A*(N//(A+B)) + N%(A+B)
# output
print(blue) | # input
N,A,B = map(int, input().split())
# calc
blue = A*(N//(A+B)) + min(A,N%(A+B))
# output
print(blue) | [
"call.add",
"call.arguments.change"
] | 534,196 | 534,197 | u814885356 | python |
p02754 | stop,blue,red = map(int,input().split())
set = blue+red
if blue == 0:
end = 0
else:
end = blue*int(stop/set)+stop%set
print(end) | stop,blue,red = map(int,input().split())
set = blue+red
if blue == 0:
end = 0
else:
end = blue*int(stop/set)+min(stop%set,blue)
print(end) | [
"call.add",
"call.arguments.add"
] | 534,198 | 534,199 | u889390649 | python |
p02754 | N, A, B = map(int, input().split())
k = N % (A+B)
n = N // (A+B)
if n < A:
print(n+k*A)
else:
print(A+k*A) | N, A, B = map(int, input().split())
n = N % (A+B)
k = N // (A+B)
if n < A:
print(n+k*A)
else:
print(A+k*A) | [
"assignment.variable.change",
"identifier.change"
] | 534,210 | 534,211 | u366928732 | python |
p02754 | N, A, B = map(int, input().split())
k = N % (A+B)
n = N / (A+B)
if n < A:
print(n+k*A)
else:
print(A+k*A) | N, A, B = map(int, input().split())
n = N % (A+B)
k = N // (A+B)
if n < A:
print(n+k*A)
else:
print(A+k*A) | [
"assignment.variable.change",
"identifier.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 534,212 | 534,211 | u366928732 | python |
p02754 | N, A, B = map(int, input().split())
len_loop = A + B
n_comp_loop = N//len_loop
blue_res = max(A, N % len_loop)
print(n_comp_loop * A + blue_res)
| N, A, B = map(int, input().split())
len_loop = A + B
n_comp_loop = N//len_loop
blue_res = min(A, N % len_loop)
print(n_comp_loop * A + blue_res)
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 534,217 | 534,218 | u729008627 | python |
p02754 | N, A, B = map(int, input().split())
len_loop = A + B
n_comp_loop = N//len_loop
blue_res = N % len_loop
print(n_comp_loop * A + blue_res) | N, A, B = map(int, input().split())
len_loop = A + B
n_comp_loop = N//len_loop
blue_res = min(A, N % len_loop)
print(n_comp_loop * A + blue_res)
| [
"call.add",
"call.arguments.change"
] | 534,219 | 534,218 | u729008627 | python |
p02754 | n,b,r = map(int,input().split())
loop = n/(b+r)
mod = n%(b+r)
extra = min([b,mod])
print(int(loop*b + extra)) | n,b,r = map(int,input().split())
loop = n//(b+r)
mod = n%(b+r)
extra = min([b,mod])
print(loop*b+extra) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 534,222 | 534,223 | u410026319 | python |
p02754 | n,b,r = map(int,input().split())
loop = n/(b+r)
mod = n%(b+r)
extra = min([b,mod])
print(loop*b + extra)
| n,b,r = map(int,input().split())
loop = n//(b+r)
mod = n%(b+r)
extra = min([b,mod])
print(loop*b+extra) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 534,224 | 534,223 | u410026319 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.