Datasets:

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 = 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(n % (a + b), a))
[ "call.add", "call.arguments.add" ]
536,328
536,329
u530606147
python
p02754
n, a, b = map(int, input().split().rstrip()) k = n // (a + b) r = n % (a + b) print(k * a + min(r, a))
n, a, b = map(int, input().rstrip().split()) k = n // (a + b) r = n % (a + b) print(k * a + min(r, a))
[ "assignment.value.change", "identifier.change", "call.arguments.change" ]
536,330
536,331
u866746776
python
p02754
n,a,b=map(int,input().split()) p=n%(a+b) x=(n-p)//(a+b) res=x*a y=a if p>=a else p res+=y print(y)
n,a,b=map(int,input().split()) p=n%(a+b) x=(n-p)//(a+b) res=x*a y=a if p>=a else p res+=y print(res)
[ "identifier.change", "call.arguments.change", "io.output.change" ]
536,334
536,335
u857330600
python
p02754
n, a, b = map(int, input().split()) # = int(input()) # = input() # = list(map(int, input().split())) pea = (n//(a+b)) cnt = a*pea cnt += n-(a+b)*pea print(cnt)
n, a, b = map(int, input().split()) # = int(input()) # = input() # = list(map(int, input().split())) pea = (n//(a+b)) cnt = a*pea cnt += min(a, n-(a+b)*pea) print(cnt)
[ "call.add", "call.arguments.change" ]
536,340
536,341
u684204084
python
p02754
n, a, b = map(int,input().split()) sum = 0 if a == 0: print(0) elif n <= a: print(n) elif int(n / (a + b)) == 0: print(a) else: nn = int(n / (a + b)) na = n // (a + b) sum = nn * a + min(na,a) print(sum)
n, a, b = map(int,input().split()) sum = 0 if a == 0: print(0) elif n <= a: print(n) elif int(n / (a + b)) == 0: print(a) else: nn = int(n / (a + b)) na = n % (a + b) sum = nn * a + min(na,a) print(sum)
[ "expression.operator.arithmetic.change", "assignment.value.change", "expression.operation.binary.change" ]
536,346
536,347
u791013618
python
p02754
n,a,b=map(int,input().split()) ans=0 each=a+b baisu=n//each amari=n%each ans+=(a*baisu) if amari<=a: ans+=amari print(ans)
n,a,b=map(int,input().split()) ans=0 each=a+b baisu=n//each amari=n%each ans+=(a*baisu) if amari<=a: ans+=amari else: ans+=a print(ans)
[]
536,357
536,358
u044026875
python
p02754
N,A,B = map(int,input().split()) C = A+B D = C//N ans = 0 ans+=D*A ans+=min(N-D*C,A) print(ans)
N,A,B = map(int,input().split()) C = A+B D = N//C ans = 0 ans+=D*A ans+=min(N-D*C,A) print(ans)
[ "expression.operation.binary.remove" ]
536,361
536,362
u268554510
python
p02754
def read(): N, A, B = list(map(int, input().strip().split())) return N, A, B def solve(N, A, B): if A == 0: return 0 repeats = N // (A + B) right = N - (A + B) * repeats blues = A * repeats + right % A return blues if __name__ == '__main__': inputs = read() print("{}".form...
def read(): N, A, B = list(map(int, input().strip().split())) return N, A, B def solve(N, A, B): if A == 0: return 0 repeats = N // (A + B) right = N - (A + B) * repeats blues = A * repeats + min(right, A) return blues if __name__ == '__main__': inputs = read() print("{}"....
[ "call.add", "assignment.value.change", "expression.operation.binary.change", "call.arguments.change" ]
536,367
536,368
u257162238
python
p02754
N,A,B=(int(x) for x in input().split()) #N=int(input()) #A=list(map(int, input().split())) a = N % (A+B) M = N - (A+B)*a if M >= A: print(a*A+A) else : print(a*A+M)
N,A,B=(int(x) for x in input().split()) #N=int(input()) #A=list(map(int, input().split())) a = N // (A+B) M = N - (A+B)*a if M >= A: print(a*A+A) else : print(a*A+M)
[ "expression.operator.arithmetic.change", "assignment.value.change", "expression.operation.binary.change" ]
536,374
536,375
u346207191
python
p02754
n,a,b=list(map(int,input().split())) if b==0: print(0) else: sets=n//(a+b) res=n%(a+b) resa=min(res,a) print(sets*a+resa)
n,a,b=list(map(int,input().split())) if a==0: print(0) else: sets=n//(a+b) res=n%(a+b) resa=min(res,a) print(sets*a+resa)
[ "identifier.change", "control_flow.branch.if.condition.change" ]
536,385
536,386
u860829879
python
p02754
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" ]
536,387
536,388
u970937288
python
p02754
import sys readline = sys.stdin.buffer.readline n,a,b = map(int,readline().split()) if a == 0: print(0) ans = n//(a+b)*a res = n%(a+b) res = min(a,res) ans += res print(ans)
import sys readline = sys.stdin.buffer.readline n,a,b = map(int,readline().split()) if a == 0: print(0) exit() ans = n//(a+b) ans *= a res = n%(a+b) res = min(a,res) ans += res print(ans)
[ "call.add", "expression.operation.binary.change" ]
536,399
536,400
u372144784
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,405
536,406
u894934980
python
p02754
N,A,B = map(int,input().split()) n = int(N/(A+B)) amari = (A+B)%N if amari >= A: Ans = (n*A) + A else: Ans = (n*A) + amari print(Ans)
N,A,B = map(int,input().split()) n = int(N/(A+B)) amari = N%(A+B) if amari >= A: Ans = (n*A) + A else: Ans = (n*A) + amari print(Ans)
[ "expression.operation.binary.remove" ]
536,431
536,432
u225845681
python
p02754
#n = int(input()) n, a, b = [int(x) for x in input().split()] #n, m = [int(x) for x in input().split()] if a == 0: print(0) quit() ans = (n//(a+b))*a if n%a > a: ans += a else: ans += n%(a+b) print(ans)
#n = int(input()) n, a, b = [int(x) for x in input().split()] #n, m = [int(x) for x in input().split()] if a == 0: print(0) quit() ans = (n//(a+b))*a if n%(a+b) > a: ans += a else: ans += n%(a+b) print(ans)
[ "control_flow.branch.if.condition.change" ]
536,468
536,469
u983181637
python
p02754
import collections class Solution: def solve(self, N, A, B): return A * (N//(A+B)) + (N % (A+B)) sol = Solution() [N, A, B] = list(map(int, input().strip().split())) print(sol.solve(N, A, B))
import collections class Solution: def solve(self, N, A, B): return A * (N//(A+B)) + min(N % (A+B), A) sol = Solution() [N, A, B] = list(map(int, input().strip().split())) print(sol.solve(N, A, B))
[ "call.add", "function.return_value.change", "call.arguments.add" ]
536,478
536,479
u006817280
python
p02754
def main(): N, A, B = map( int, input().split()) n = N//(A+B) ans = n*A N -= n*(A+B) if n < A: ans += N else: ans += A print(ans ) if __name__ == '__main__': main()
def main(): N, A, B = map( int, input().split()) n = N//(A+B) ans = n*A N -= n*(A+B) if N <= A: ans += N else: ans += A print(ans ) if __name__ == '__main__': main()
[]
536,497
536,498
u201234972
python
p02754
N,A,B = map(int,input().split()) C=A+B D=N//C #何セットあるか E=C*D if N-E>=A: ans= D*A else: ans= D*A+ (N-E) print(ans)
N,A,B = map(int,input().split()) C=A+B D=N//C #何セットあるか E=C*D #セットの最後までの個数 if N-E>=A: ans= D*A + A else: ans= D*A+ (N-E) print(ans)
[ "assignment.change" ]
536,499
536,500
u089142196
python
p02754
N, A, B = map(int, input().split()) q = N // (A + B) r = N % (A + B) if 0 <= r <= A: blue = q * A + r else: blue = a * A + A print(blue)
N, A, B = map(int, input().split()) q = N // (A + B) r = N % (A + B) if 0 <= r <= A: blue = q * A + r else: blue = q * A + A print(blue)
[ "assignment.value.change", "identifier.change", "expression.operation.binary.change" ]
536,503
536,504
u092646083
python
p02754
N,A,B=map(int,input().split()) C=A+B cnt=N//C p=N%C if p>=B: p=B ans=(cnt*A)+p print(ans)
N,A,B=map(int,input().split()) C=A+B cnt=N//C p=N%C if p>=A: p=A ans=(cnt*A)+p print(ans)
[ "identifier.change", "control_flow.branch.if.condition.change", "assignment.value.change" ]
536,511
536,512
u708890186
python
p02754
n,a,b=map(int,input().split()) c = n//(a+b) d = n%(a+b) if d < a: print(c*a+d) else: print(c*a)
n,a,b=map(int,input().split()) c = n//(a+b) d = n%(a+b) if d < a: print(c*a+d) else: print(c*a+a)
[ "expression.operation.binary.add" ]
536,518
536,519
u608493167
python
p02754
import sys, re, os from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians # from fractions import gcd from itertools import permutations, combinations, product, accumulate from operator import itemgetter, mul from copy import deepcopy from string import ...
import sys, re, os from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians # from fractions import gcd from itertools import permutations, combinations, product, accumulate from operator import itemgetter, mul from copy import deepcopy from string import ...
[ "call.add", "call.arguments.add" ]
536,524
536,525
u161693347
python
p02754
def solve(): N, A, B = map(int, input().split()) ans = A * (N // (A + B)) + N % (A + B) print(ans) if __name__ == '__main__': solve()
def solve(): N, A, B = map(int, input().split()) ans = A * (N // (A + B)) + min(A, N % (A + B)) print(ans) if __name__ == '__main__': solve()
[ "call.add", "call.arguments.change" ]
536,541
536,542
u935984175
python
p02754
N, A, B = map(int, input().split()) X = N // (A + B) R = X * A X += min(A, N % (A + B)) print(X)
N, A, B = map(int, input().split()) X = N // (A + B) R = X * A R += min(A, N % (A + B)) print(R)
[ "identifier.change", "call.arguments.change", "io.output.change" ]
536,551
536,552
u984276646
python
p02754
n, a, b = map(int, open(0).read().split()) q, r = divmod(n, a+b) print(q*a + r)
n, a, b = map(int, open(0).read().split()) q, r = divmod(n, a+b) print(q*a + min(r, a))
[ "call.add", "call.arguments.add", "call.arguments.change" ]
536,561
536,562
u417365712
python
p02754
# -*- coding: utf-8 -*- import sys from collections import Counter def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for...
# -*- coding: utf-8 -*- import sys from collections import Counter def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for...
[ "call.add", "call.arguments.add" ]
536,604
536,605
u588341295
python
p02754
def resolve(): N,A,B=map(int,input().split()) print((N//(A+B))*A+(N%(A+B))) resolve()
def resolve(): N,A,B=map(int,input().split()) print((N//(A+B))*A+min(A,N%(A+B))) resolve()
[ "call.add", "call.arguments.change", "call.arguments.add" ]
536,608
536,609
u992910889
python
p02754
N,A,B = map(int,input().split()) AB = A+B sp_num = N//AB ans = A*sp_num + (N - AB*sp_num) print(ans)
N,A,B = map(int,input().split()) AB = A+B sp_num = N//AB ans = A*sp_num + min(A,(N - AB*sp_num)) print(ans)
[ "call.add", "call.arguments.change" ]
536,620
536,621
u580258754
python
p02754
N,A,B = map(int,input().split()) if A==0: print(0) else: print(N-N//(A+B)*(A+B)+N//(A+B)*A)
N,A,B = map(int,input().split()) if A==0: print(0) else: print(min(A,N-N//(A+B)*(A+B))+N//(A+B)*A)
[ "call.add", "call.arguments.change" ]
536,625
536,626
u073852194
python
p02754
import sys import math import bisect from collections import defaultdict, deque, Counter from heapq import heappush, heappop def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def S(): res = list(sys.stdin.readline()) if res[-1] == "\n": retur...
import sys import math import bisect from collections import defaultdict, deque, Counter from heapq import heappush, heappop def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def S(): res = list(sys.stdin.readline()) if res[-1] == "\n": retur...
[ "call.add", "call.arguments.add" ]
536,659
536,660
u288802485
python
p02754
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy sys.setrecursionlimit(10**7) inf=10**20 mod=10**9+7 dd=[(-1,0),(0,1),(1,0),(0,-1)] ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline(...
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy sys.setrecursionlimit(10**7) inf=10**20 mod=10**9+7 dd=[(-1,0),(0,1),(1,0),(0,-1)] ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline(...
[ "call.add", "call.arguments.add" ]
536,669
536,670
u941753895
python
p02754
N, A, B = map(int, input().split()) ans = N // (A + B) * A + N % (A + B) print(ans)
N, A, B = map(int, input().split()) ans = N // (A + B) * A + min(A, N % (A + B)) print(ans)
[ "call.add", "call.arguments.change" ]
536,673
536,674
u144913062
python
p02754
N,A,B = map(int,input().split()) C = N//(A+B) D = N%(A+B) print(C*A+max(D,A))
N,A,B = map(int,input().split()) C = N//(A+B) D = N%(A+B) print(C*A+min(D,A))
[ "misc.opposites", "identifier.change", "call.function.change", "call.arguments.change", "expression.operation.binary.change", "io.output.change" ]
536,677
536,678
u513900925
python
p02754
N,A,B = map(int,input().split()) C = N//(A+B) D = N%(A+B) print(C*A+D)
N,A,B = map(int,input().split()) C = N//(A+B) D = N%(A+B) print(C*A+min(D,A))
[ "call.add", "call.arguments.add", "call.arguments.change" ]
536,679
536,678
u513900925
python
p02754
def main(): N, A, B = map(int, input().split()) ans = N // (A+B) * A + (N % (A+B)) print(ans) if __name__ == "__main__": main()
def main(): N, A, B = map(int, input().split()) ans = N // (A+B) * A + min(N % (A+B), A) print(ans) if __name__ == "__main__": main()
[ "call.add", "call.arguments.add" ]
536,726
536,727
u155024797
python
p02754
N, A, B = map(int, input().split()) balls = (N // (A + B)) * A balls += N - (A + B) * (N // (A + B)) print(balls)
N, A, B = map(int, input().split()) balls = (N // (A + B)) * A balls += min(A, N - (A + B) * (N // (A + B))) print(balls)
[ "call.add", "call.arguments.change" ]
536,734
536,735
u196697332
python
p02754
def main(): N, A, B = list(map(int, input().split())) return A * N // (A + B) + min(A, N % (A + B)) print(main())
def main(): N, A, B = list(map(int, input().split())) return A * (N // (A + B)) + min(A, N % (A + B)) print(main())
[ "function.return_value.change" ]
536,743
536,744
u858742833
python
p02754
N, A, B = map(int, input().split()) x = N // (A+B) print(x * A + N - x * (A+B))
N, A, B = map(int, input().split()) x = N // (A+B) print(x * A + min(N - x * (A+B), A))
[ "call.add", "call.arguments.add", "call.arguments.change" ]
536,747
536,748
u864197622
python
p02754
N, A, B = map(int, input().split()) p = N//(A+B) print(p*A+N%(A+B))
N, A, B = map(int, input().split()) p = N//(A+B) print(p*A+min(N%(A+B), A))
[ "call.add", "call.arguments.add", "call.arguments.change" ]
536,754
536,755
u677523557
python
p02755
a,b=map(int,input().split()) for i in range(101): if int(i*0.08) == a and int(i*0.1) == b: print(i) break else: print(-1)
a,b=map(int,input().split()) for i in range(100001): if int(i*0.08) == a and int(i*0.1) == b: print(i) break else: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,762
536,763
u347397127
python
p02755
import math a,b=map(int,input().split()) for i in range (11000): if a <= i*0.08 <=a+1: if b<= i*0.1 <=b+1: print(i) exit() print(-1)
import math a,b=map(int,input().split()) for i in range (11000): if a <= i*0.08 <a+1: if b<= i*0.1 <b+1: print(i) exit() print(-1)
[ "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
536,764
536,765
u658600714
python
p02755
# coding: utf-8 def main(): A, B = map(int, input().split()) ans = -1 for i in range(10001): if i * 8 // 100 == A and i / 10 == B: ans = i break print(ans) if __name__ == "__main__": main()
# coding: utf-8 def main(): A, B = map(int, input().split()) ans = -1 for i in range(10001): if i * 8 // 100 == A and i // 10 == B: ans = i break print(ans) if __name__ == "__main__": main()
[ "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
536,766
536,767
u301302814
python
p02755
a,b = map(int,input().split()) for i in range(1,200): if i*8//100==a and i*10//100==b: print(i) break else: print(-1)
a,b = map(int,input().split()) for i in range(1,100000): if i*8//100==a and i*10//100==b: print(i) break else: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,768
536,769
u107915058
python
p02755
import math A, B = map(int, input().split()) b1 = B*10 b2 = b1 + 10 for i in range(b1, b2+1): if math.floor(i*0.08) == A: print(i) break if i == b2: print(-1)
import math A, B = map(int, input().split()) b1 = B*10 b2 = b1 + 10 for i in range(b1, b2): if math.floor(i*0.08) == A: print(i) break if i == b2-1: print(-1)
[ "expression.operation.binary.remove", "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change", "misc.off_by_one" ]
536,770
536,771
u607155447
python
p02755
a, b = map(int, input().split()) ans = -1 for v in range(100*10): t8 = int(v * 0.08) t10 = int(v * 0.1) if t8 > a or t10 > b: break if t8 == a and t10 == b: ans = v break print(ans)
a, b = map(int, input().split()) ans = -1 for v in range((100*10)+100): t8 = int(v * 0.08) t10 = int(v * 0.1) if t8 > a or t10 > b: break if t8 == a and t10 == b: ans = v break print(ans)
[ "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "call.arguments.add" ]
536,775
536,776
u521919054
python
p02755
a, b = map(int, input().split()) for i in range(1000): if int(i * 0.08) == a and int(i * 0.1) == b: print(i) break else: print(-1)
a, b = map(int, input().split()) for i in range(1001): if int(i * 0.08) == a and int(i * 0.1) == b: print(i) break else: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,777
536,778
u675269406
python
p02755
A, B = map(int, input().split(' ')) rst = -1 for i in range(1, 100000): if i * 8 // 100 == A & i * 10 // 100 == B: rst = i break print(rst)
A, B = map(int, input().split(' ')) rst = -1 for i in range(1, 100000): if i * 8 // 100 == A and i * 10 // 100 == B: rst = i break print(rst)
[ "control_flow.branch.if.condition.change" ]
536,783
536,784
u418149936
python
p02755
a,b = map(int,input().split()) if a*12.5 > (b+1) *10 or b*10 > (a+1)*12.5: print(-1) else: m = max([a*12.5,b*10]) M = min([(b+1) *10, (a+1)*12.5]) i = m//1 if m == i: print(int(i)) else: print(int(i+1))
a,b = map(int,input().split()) if a*12.5 >= (b+1) *10 or b*10 >= (a+1)*12.5: print(-1) else: m = max([a*12.5,b*10]) M = min([(b+1) *10, (a+1)*12.5]) i = m//1 if m == i: print(int(i)) else: print(int(i+1))
[ "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
536,805
536,806
u150788544
python
p02755
a,b = map(int,input().split()) # 8% -> [a,a+1) # 10% -> [b,b+1) # max(a*100/8, b*10) <= 元の価格 < min((a+1)*100/8, (b+1)*10) min8 = a*(100/8) max8 = (a+1)*(100/8) min10 = b*10 max10 = (b+1)*10 mi = int(max(min8, min10) - 0.001) ma = int(min(max8, max10) - 0.001) if mi > ma: ans = -1 else: ans = mi + 1 print(ans)
a,b = map(int,input().split()) # 8% -> [a,a+1) # 10% -> [b,b+1) # max(a*100/8, b*10) <= 元の価格 < min((a+1)*100/8, (b+1)*10) min8 = a*(100/8) max8 = (a+1)*(100/8) min10 = b*10 max10 = (b+1)*10 mi = int(max(min8, min10) - 0.001) + 1 ma = int(min(max8, max10) - 0.001) if mi > ma: ans = -1 else: ans = mi print(ans)
[ "expression.operation.binary.remove" ]
536,816
536,817
u598296382
python
p02755
import math A, B = list(map(int,input().split())) if math.floor(A*12.5)>B*10: print(math.floor(A*12.5) if math.floor(A*12.5)<=(B+1)*10 else -1) else: print(B*10 if B*10<=math.ceil((A+1)*12.5) else -1)
import math A, B = list(map(int,input().split())) if math.ceil(A*12.5)>B*10: print(math.ceil(A*12.5) if math.ceil(A*12.5)<(B+1)*10 else -1) else: print(B*10 if B*10<math.floor((A+1)*12.5) else -1)
[ "misc.opposites", "identifier.change", "control_flow.branch.if.condition.change", "call.arguments.change", "io.output.change", "expression.operator.compare.change" ]
536,818
536,819
u913662443
python
p02755
import math a,b = map(int,input().split()) f = math.floor min8, max8 = f(a*12.5), f((a+1)*12.5) min10, max10 = f(b*10), f((b+1)*10) l8, l10 = list(range(min8, max8)), list(range(min10, max10)) s8, s10 = set(l8), set(l10) ss = s8 & s10 print(min(ss) if len(ss) >0 else -1)
import math a,b = map(int,input().split()) c = math.ceil min8, max8 = c(a*12.5), c((a+1)*12.5) min10, max10 = c(b*10), c((b+1)*10) l8, l10 = list(range(min8, max8)), list(range(min10, max10)) s8, s10 = set(l8), set(l10) ss = s8 & s10 #print(min8, max8, min10, max10) print(min(ss) if len(ss) >0 else -1) #print(238*0...
[ "assignment.variable.change", "identifier.change", "misc.opposites", "assignment.value.change", "call.function.change" ]
536,822
536,823
u239368018
python
p02755
A,B = [int(i) for i in input().split()] for n in range(1,101): if int(n*0.08) == A and int(n*0.1) == B: print(n) exit() print("-1")
A,B = [int(i) for i in input().split()] for n in range(1,1200): if int(n*0.08) == A and int(n*0.1) == B: print(n) exit() print("-1")
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,826
536,827
u344276999
python
p02755
A,B = [int(i) for i in input().split()] for n in range(1,101): print(n) if int(n*0.08) == A and int(n*0.1) == B: print(n) exit() print("-1")
A,B = [int(i) for i in input().split()] for n in range(1,1200): if int(n*0.08) == A and int(n*0.1) == B: print(n) exit() print("-1")
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "call.remove" ]
536,828
536,827
u344276999
python
p02755
A,B = [int(i) for i in input().split()] for n in range(101): if int(n*0.08) == A and int(n*0.1) == B: print(n) exit() print(-1)
A,B = [int(i) for i in input().split()] for n in range(1,1200): if int(n*0.08) == A and int(n*0.1) == B: print(n) exit() print("-1")
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "call.arguments.add" ]
536,829
536,827
u344276999
python
p02755
a, b = map(int, input().split()) flag = 0 for i in range(101): if (i*0.08)//1 == a: if (i*0.1)//1 == b: print(i) flag += 1 break else: if flag == 0: print("-1")
a, b = map(int, input().split()) flag = 0 for i in range(2000): if (i*0.08)//1 == a: if (i*0.1)//1 == b: print(i) flag += 1 break else: if flag == 0: print("-1")
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,830
536,831
u146066372
python
p02755
A, B = map(int, input().split()) for i in range(1, 101): if int(i * 0.08) == A: if int(i * 0.1) == B: print(i) break else: print(-1)
A, B = map(int, input().split()) for i in range(1, 1011): if int(i * 0.08) == A and int(i * 0.1) == B: print(i) break else: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,834
536,835
u511824539
python
p02755
#!/usr/bin/env python3 import sys import collections as cl import math def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def main(): A,B = MI() for i in range(1000): if math.floor( i * 0...
#!/usr/bin/env python3 import sys import collections as cl import math def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def main(): A,B = MI() for i in range(11000): if math.floor( i * ...
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,850
536,851
u574922408
python
p02755
#!/usr/bin/env python3 import sys import collections as cl import math def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def main(): A,B = MI() for i in range(101): if math.floor( i * 0....
#!/usr/bin/env python3 import sys import collections as cl import math def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def main(): A,B = MI() for i in range(11000): if math.floor( i * ...
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,852
536,851
u574922408
python
p02755
import math a, b = map(int, input().split()) for i in range(101): if math.floor(i*0.08) == a and math.floor(i*0.1) == b: print(i) exit() print(-1)
import math a, b = map(int, input().split()) for i in range(10**4): if math.floor(i*0.08) == a and math.floor(i*0.1) == b: print(i) exit() print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,853
536,854
u363421241
python
p02755
A, B = list(map(int, input().split())) ans = -1 for i in range(1, 1009): if int(i*0.08) == A and int(i*0.10) == B: ans = i print(ans)
A, B = list(map(int, input().split())) ans = -1 for i in range(1, 1009): if int(i*0.08) == A and int(i*0.10) == B: ans = i break print(ans)
[ "control_flow.break.add" ]
536,870
536,871
u861886710
python
p02755
a, b = map(int, input().split()) for price in range(1,101) : if int(price*0.08) == a and int(price*0.10) == b : print(price) break else : print("-1")
a, b = map(int, input().split()) for price in range(0,1010) : if int(price*0.08) == a and int(price*0.10) == b : print(price) break else : print("-1")
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.lower.change", "control_flow.loop.range.bounds.upper.change" ]
536,873
536,874
u430928274
python
p02755
A,B =map(int,input().split()) flg = False for i in range(1,101): if int(i*8/100) == A and int(i/10) == B: print(i) flg = True break if flg == False: print(-1)
A,B =map(int,input().split()) flg = False for i in range(1,1009): if int(i*8/100) == A and int(i/10) == B: print(i) flg = True break if flg == False: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,882
536,883
u455354923
python
p02755
import math def main(): a, b = [int(i) for i in input().split()] lo = max(1000 * a, 800 * b) hi = min(1000 * (a + 1), 800 + (b + 1)) if lo < hi: print(math.ceil(lo / 80)) else: print(-1) main()
import math def main(): a, b = [int(i) for i in input().split()] lo = max(1000 * a, 800 * b) hi = min(1000 * (a + 1), 800 * (b + 1)) if lo < hi: print(math.ceil(lo / 80)) else: print(-1) main()
[ "expression.operator.arithmetic.change", "assignment.value.change", "call.arguments.change", "expression.operation.binary.change" ]
536,888
536,889
u091307273
python
p02755
a, b = map(int, input().split()) ans = 1000 for n in range(1001): if n * 8 // 100 == a and n * 10 // 100 == b: ans = min(ans, n) if ans < 1000: print(ans) else: print(-1)
a, b = map(int, input().split()) ans = 1001 for n in range(1001): if n * 8 // 100 == a and n * 10 // 100 == b: ans = min(ans, n) if ans < 1001: print(ans) else: print(-1)
[ "literal.number.integer.change", "assignment.value.change", "control_flow.branch.if.condition.change" ]
536,890
536,891
u671889550
python
p02755
a, b = map(int, input().split()) import math flag = True for i in range(1009): if math.floor(i * 0.08) == a and math.floor(i * 0.10): print(i) flag = False break if flag: print(-1)
a, b = map(int, input().split()) import math flag = True for i in range(1009): if math.floor(i * 0.08) == a and math.floor(i * 0.10) == b: print(i) flag = False break if flag: print(-1)
[ "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
536,892
536,893
u581403769
python
p02755
a, b = map(int, input().split()) import math aS = math.ceil(a / 0.08) al = math.floor((a + 1) / 0.08) bs = math.ceil(b / 0.10) bl = math.floor((b + 1) / 0.10) flag = True for i in range(1000): if aS <= i < al and bs <= i < bl: print(i) flag = False break if flag: print(-1)
a, b = map(int, input().split()) import math aS = math.ceil(a / 0.08) al = math.floor((a + 1) / 0.08) bs = math.ceil(b / 0.10) bl = math.floor((b + 1) / 0.10) flag = True for i in range(10000): if aS <= i < al and bs <= i < bl: print(i) flag = False break if flag: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,894
536,895
u581403769
python
p02755
a, b = map(int, input().split()) import math aS = math.ceil(a / 0.08) al = math.floor((a + 1) / 0.08) bs = math.ceil(b / 0.10) bl = math.floor((b + 1) / 0.10) for i in range(1000): if aS <= i < al and bs <= i < bl: print(i) flag = False break if flag: print(-1)
a, b = map(int, input().split()) import math aS = math.ceil(a / 0.08) al = math.floor((a + 1) / 0.08) bs = math.ceil(b / 0.10) bl = math.floor((b + 1) / 0.10) flag = True for i in range(10000): if aS <= i < al and bs <= i < bl: print(i) flag = False break if flag: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,896
536,895
u581403769
python
p02755
a, b = map(int, input().split()) ans = -1 for i in range(1000): if int(i*0.08) == a and int(i*0.1) ==b: ans = i break print(ans)
a, b = map(int, input().split()) ans = -1 for i in range(100000): if int(i*0.08) == a and int(i*0.1) ==b: ans = i break print(ans)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,901
536,902
u011062360
python
p02755
a, b = map(int, input().split()) for n in range(1000): xa = int(n * 0.08) xb = int(n * 0.1) if a == xa and b == xb: print(n) exit() print(-1)
a, b = map(int, input().split()) for n in range(1500): xa = int(n * 0.08) xb = int(n * 0.1) if a == xa and b == xb: print(n) exit() print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,903
536,904
u967864815
python
p02755
A, B = [int(_) for _ in input().split()] aa = [int(i * 0.08) for i in range(1, 100)] bb = [int(i * 0.1) for i in range(1, 100)] for i, a, b in zip(range(1, 100), aa, bb): if (a, b) == (A, B): print(i) exit() print(-1)
A, B = [int(_) for _ in input().split()] aa = [int(i * 0.08) for i in range(1, 10000)] bb = [int(i * 0.1) for i in range(1, 10000)] for i, a, b in zip(range(1, 10000), aa, bb): if (a, b) == (A, B): print(i) exit() print(-1)
[ "literal.number.integer.change", "assignment.value.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,911
536,912
u844789719
python
p02755
A, B = map(int,input().split()) ans = -1 for i in range(10**3): if i*8//100 == A and i*10//100 == B: ans = i break elif i*8//100 > A and i*10//100 > B: break print(ans)
A, B = map(int,input().split()) ans = -1 for i in range(10**5): if i*8//100 == A and i*10//100 == B: ans = i break elif i*8//100 > A and i*10//100 > B: break print(ans)
[ "literal.number.integer.change", "call.arguments.change", "expression.operation.binary.change", "control_flow.loop.range.bounds.upper.change" ]
536,915
536,916
u473291366
python
p02755
A,B=map(int,input().split()) ans=-1 for x in range(1000): if int(x*(8/100))==A and int(x*(10/100))==B: ans=x break print(ans)
A,B=map(int,input().split()) ans=-1 for x in range(1000+1): if int(x*(8/100))==A and int(x*(10/100))==B: ans=x break print(ans)
[ "control_flow.loop.range.bounds.upper.change", "expression.operation.binary.add" ]
536,921
536,922
u970598682
python
p02755
#from statistics import median #import collections #aa = collections.Counter(a) # list to list #from itertools import combinations # (string,3) 3回 # # # pythonで無理なときは、pypyでやると正解するかも!! # # mod = 10**9 + 7 def readInts(): return list(map(int,input().split())) def main(): a,b = readInts() for i in range(1,101)...
#from statistics import median #import collections #aa = collections.Counter(a) # list to list #from itertools import combinations # (string,3) 3回 # # # pythonで無理なときは、pypyでやると正解するかも!! # # mod = 10**9 + 7 def readInts(): return list(map(int,input().split())) def main(): a,b = readInts() for i in range(1,1001...
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,950
536,951
u156815136
python
p02755
a,b = map(int, input().split()) for i in range(1, 1001): if int(i**0.08)==a and int(i*0.1)==b: print(i) exit() print(-1)
a,b = map(int, input().split()) for i in range(1, 1001): if int(i * 0.08) == a and int(i * 0.1) == b: print(i) exit() print(-1)
[ "control_flow.branch.if.condition.change" ]
536,962
536,963
u241159583
python
p02755
A,B = map(int,input().split()) x = -1 for i in range(1,200): if int(i*1.08)-i==A and int(i*1.1)-i==B: x = i break print(x)
A,B = map(int,input().split()) x = -1 for i in range(1,20000): if int(i*1.08)-i==A and int(i*1.1)-i==B: x = i break print(x)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,970
536,971
u644907318
python
p02755
A,B = map(int,input().split()) for i in range(1000): if int(i*0.08) == A and int(i*0.1) == B: print(i) exit() print(-1)
A,B = map(int,input().split()) for i in range(10000): if int(i*0.08) == A and int(i*0.1) == B: print(i) exit() print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,972
536,973
u497952650
python
p02755
a,b =map(int,input().split()) for x in range(101): if (x*0.08)//1==a and (x*1.10)//1==b and x//1==int(x): print(int(x)) exit() print(-1)
a,b =map(int,input().split()) for x in range(1009): if (x*0.08)//1==a and (x*0.10)//1==b and x//1==int(x): print(int(x)) exit() print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "literal.number.float.change", "control_flow.branch.if.condition.change" ]
536,978
536,979
u944886577
python
p02755
a, b = map(int, input().split()) x=10*b import math for i in range(11): if math.floor((x+i)*0.08)==a: print(x+i) exit(0) print(-1)
a, b = map(int, input().split()) x=10*b import math for i in range(10): if math.floor((x+i)*0.08)==a: print(x+i) exit(0) print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
536,982
536,983
u137226361
python
p02755
import itertools import functools import math from collections import Counter from itertools import combinations A,B=map(int,input().split()) flg = 0 for i in range(1,100+1): CHK_A= (i * 8) // 100 CHK_B= (i * 10) // 100 if A == CHK_A and B == CHK_B: print(i) exit() print(-1)
import itertools import functools import math from collections import Counter from itertools import combinations A,B=map(int,input().split()) flg = 0 for i in range(1,1200+1): CHK_A= (i * 8) // 100 CHK_B= (i * 10) // 100 if A == CHK_A and B == CHK_B: print(i) exit() print(-1)
[ "literal.number.integer.change", "call.arguments.change", "expression.operation.binary.change", "control_flow.loop.range.bounds.upper.change" ]
536,984
536,985
u052244548
python
p02755
import math A, B = map(float, input().split()) lowerA = math.ceil(A/0.08) upperA = math.floor((A+1)/0.08) lowerB = math.ceil(B/0.1) upperB = math.floor((B+1)/0.1) answer = -1 for i in range(lowerA, upperA): if (lowerB <= i) and (i <= upperB): answer = i break print(answer)
import math A, B = map(float, input().split()) lowerA = math.ceil(A/0.08) upperA = math.floor((A+1)/0.08) lowerB = math.ceil(B/0.1) upperB = math.floor((B+1)/0.1) answer = -1 for i in range(lowerA, upperA): if (lowerB <= i) and (i < upperB): answer = i break print(answer)
[ "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
536,986
536,987
u660899380
python
p02755
import math A, B = map(float, input().split()) lowerA = math.ceil(A/0.08) upperA = math.floor((A+1)/0.08) lowerB = math.ceil(B/0.1) upperB = math.floor((B+1)/0.1) answer = 0 for i in range(lowerA, upperA): if (lowerB <= i) and (i <= upperB): answer = i break print(answer)
import math A, B = map(float, input().split()) lowerA = math.ceil(A/0.08) upperA = math.floor((A+1)/0.08) lowerB = math.ceil(B/0.1) upperB = math.floor((B+1)/0.1) answer = -1 for i in range(lowerA, upperA): if (lowerB <= i) and (i < upperB): answer = i break print(answer)
[ "assignment.value.change", "expression.operation.unary.add", "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
536,988
536,987
u660899380
python
p02755
import math taxA, taxB= map(int,input().split()) minPriceA = math.floor(taxA / 0.08) maxPriceA = math.ceil((taxA + 1) / 0.08) minPriceB = math.floor(taxB / 0.1) maxPriceB = math.ceil((taxB + 1) / 0.1) minPrice = None finish = False for a in range(minPriceA, maxPriceA): for b in range(minPriceB, maxPriceB): if (...
import math taxA, taxB= map(int,input().split()) minPriceA = math.ceil(taxA / 0.08) maxPriceA = math.ceil((taxA + 1) / 0.08) minPriceB = math.ceil(taxB / 0.1) maxPriceB = math.ceil((taxB + 1) / 0.1) minPrice = None finish = False for a in range(minPriceA, maxPriceA): for b in range(minPriceB, maxPriceB): if (a ...
[ "misc.opposites", "assignment.value.change", "identifier.change" ]
536,989
536,990
u660899380
python
p02755
import math taxA, taxB= map(int,input().split()) minPriceA = math.floor(taxA / 0.08) maxPriceA = math.ceil((taxA + 1) / 0.08) minPriceB = math.floor(taxB / 0.1) maxPriceB = math.ceil((taxB + 1) / 0.1) minPrice = None finish = False for a in range(minPriceA, maxPriceA + 1): for b in range(minPriceB, maxPriceB + ...
import math taxA, taxB= map(int,input().split()) minPriceA = math.ceil(taxA / 0.08) maxPriceA = math.ceil((taxA + 1) / 0.08) minPriceB = math.ceil(taxB / 0.1) maxPriceB = math.ceil((taxB + 1) / 0.1) minPrice = None finish = False for a in range(minPriceA, maxPriceA): for b in range(minPriceB, maxPriceB): if (a ...
[ "misc.opposites", "assignment.value.change", "identifier.change", "expression.operation.binary.remove" ]
536,991
536,990
u660899380
python
p02755
import math taxA, taxB= map(int,input().split()) minPriceA = math.floor(taxA / 0.08) maxPriceA = math.ceil((taxA + 1) / 0.08) #exclusive minPriceB = math.floor(taxB / 0.1) maxPriceB = math.ceil((taxB + 1) / 0.1) #exclusive minPrice = None finish = False for a in range(minPriceA, maxPriceA): for b in range(minPrice...
import math taxA, taxB= map(int,input().split()) minPriceA = math.ceil(taxA / 0.08) maxPriceA = math.ceil((taxA + 1) / 0.08) minPriceB = math.ceil(taxB / 0.1) maxPriceB = math.ceil((taxB + 1) / 0.1) minPrice = None finish = False for a in range(minPriceA, maxPriceA): for b in range(minPriceB, maxPriceB): if (a ...
[ "misc.opposites", "assignment.value.change", "identifier.change" ]
536,992
536,990
u660899380
python
p02755
a, b = map(int, input().split()) ans = -1 for i in range(1000): if int(i * 0.08) == a and int(i * 0.1) == b: ans = i break print(ans)
a, b = map(int, input().split()) ans = -1 for i in range(1010): if int(i * 0.08) == a and int(i * 0.1) == b: ans = i break print(ans)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
537,015
537,016
u630096262
python
p02755
a,b = map(int,input().split()) ten = [] ei = [] for i in range(1,101): if a <= i*0.08 < a+1: ei.append(i) for j in range(1,101): if b <= j*0.1 < b+1: ten.append(j) case = set(ei) & set(ten) if not case: print(-1) else: print(min(case))
a,b = map(int,input().split()) ten = [] ei = [] for i in range(1,1010): if a <= i*0.08 < a+1: ei.append(i) for j in range(1,1010): if b <= j*0.1 < b+1: ten.append(j) case = set(ei) & set(ten) if not case: print(-1) else: print(min(case))
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
537,017
537,018
u999750647
python
p02755
import math a,b = [int(i) for i in input().split()] ans=[] for i in range(1000): if math.floor(i*0.08) == a and math.floor(i*0.1) == b: ans.append(i) if len(ans) != 0: print(min(ans)) else: print(-1)
import math a,b = [int(i) for i in input().split()] ans=[] for i in range(100000): if math.floor(i*0.08) == a and math.floor(i*0.1) == b: ans.append(i) if len(ans) != 0: print(min(ans)) else: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
537,023
537,024
u259975636
python
p02755
a,b=map(int,input().split());l=max(--a*25//2,b*10);print([-1,l][l<min(-~a*25//2,-~b*10)])
a,b=map(int,input().split()) l=max(0--a*25//2,b*10) print([-1,l][l<min(-~a*25//2,-~b*10)])
[ "call.arguments.change" ]
537,025
537,026
u133936772
python
p02755
a,b=map(int,input().split());l=max(--a*25//2,b*10);print([-1,l][l<min(-~a*25//2,-~b*10)])
a,b=map(int,input().split());l=max(0--a*25//2,b*10);print([-1,l][l<min(-~a*25//2,-~b*10)])
[ "call.arguments.change" ]
537,025
537,027
u133936772
python
p02755
a,b=map(int,input().split());l=max(--a*25//2,b*10);print([-1,l][l<min(-~a*25//2,-~b*10)])
a,b=map(int,input().split());l=max(0--a*25//2,b*10);print([-1,l][l<min(0-~a*25//2,-~b*10)])
[ "call.arguments.change" ]
537,025
537,028
u133936772
python
p02755
a, b =map(int, input().split()) for x in range(0,101): ax = (8*x)//100 bx = (10*x)//100 if ax == a and bx == b: print(x) break else: print(-1)
a, b =map(int, input().split()) for x in range(0,10**6): # print('---') # print(x) ax = (8*x)//100 bx = (10*x)//100 # print(ax,bx) if ax == a and bx == b: print(x) break else: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
537,031
537,032
u493520238
python
p02755
a, b =map(int, input().split()) for x in range(0,100): ax = (8*x)//100 bx = (10*x)//100 if ax == a and bx == b: print(x) break else: print(-1)
a, b =map(int, input().split()) for x in range(0,10**6): # print('---') # print(x) ax = (8*x)//100 bx = (10*x)//100 # print(ax,bx) if ax == a and bx == b: print(x) break else: print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
537,033
537,032
u493520238
python
p02755
a, b = map(int, input().split()) for i in range(1200): tax8 = int(a * 0.08) tax10 = int(a * 0.1) if a == tax8 and b == tax10: print(i) exit() else: print(-1)
a, b = map(int, input().split()) for i in range(1010): tax8 = int(i * 0.08) tax10 = int(i * 0.1) if a == tax8 and b == tax10: print(i) exit() print(-1)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "assignment.value.change", "identifier.change", "expression.operation.binary.change" ]
537,034
537,035
u480200603
python
p02755
from collections import defaultdict a,b=map(int,input().split()) dic=defaultdict(lambda:-1) for i in range(100,0,-1): dic[int(i*0.08),int(i*0.10)]=i print(dic[a,b])
from collections import defaultdict a,b=map(int,input().split()) dic=defaultdict(lambda:-1) for i in range(100000,0,-1): dic[int(i*0.08),int(i*0.10)]=i print(dic[a,b])
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.lower.change" ]
537,045
537,046
u474925961
python
p02755
a,b=map(int,input().split()) ans=-1 for i in range(1300): if int(i/25)==a and int(i/10)==b: ans=i break print(ans)
a,b=map(int,input().split()) ans=-1 for i in range(1300): if int(i*2/25)==a and int(i/10)==b: ans=i break print(ans)
[ "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
537,051
537,052
u919235786
python
p02755
a,b=map(int,input().split()) ans=-1 for i in range(101): if int(i/25)==a and int(i/10)==b: ans=i break print(ans)
a,b=map(int,input().split()) ans=-1 for i in range(1300): if int(i*2/25)==a and int(i/10)==b: ans=i break print(ans)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
537,053
537,052
u919235786
python
p02755
a,b=map(int,input().split()) ans=-1 for i in range(101): if int(i*8/100)==a and int(i/10)==b: ans=i break print(ans)
a,b=map(int,input().split()) ans=-1 for i in range(1300): if int(i*2/25)==a and int(i/10)==b: ans=i break print(ans)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "control_flow.branch.if.condition.change" ]
537,055
537,052
u919235786
python
p02755
import math A,B = list(map(int,input().split())) A_min=12*A+math.floor(0.5*A) A_max=12*(A+1)+math.ceil(0.5*(A+1)) B_min=10*B B_max=10*(B+1) if A_max <= B_min: print(-1) elif B_max <= A_min: print(-1) else: print(max(A_min,B_min))
import math A,B = list(map(int,input().split())) A_min=12*A+math.ceil(0.5*A) A_max=12*(A+1)+math.floor(0.5*(A+1)) B_min=10*B B_max=10*(B+1) if A_max <= B_min: print(-1) elif B_max <= A_min: print(-1) else: print(max(A_min,B_min))
[ "misc.opposites", "assignment.value.change", "identifier.change", "expression.operation.binary.change" ]
537,062
537,063
u465101448
python
p02755
import math A,B = list(map(int,input().split())) A_min=12*A+math.floor(0.5*A) A_max=12*(A+1)+math.ceil(0.5*(A+1)) B_min=10*B B_max=10*(B+1) if A_max < B_min: print(-1) elif B_max < A_min: print(-1) else: print(max(A_min,B_min))
import math A,B = list(map(int,input().split())) A_min=12*A+math.ceil(0.5*A) A_max=12*(A+1)+math.floor(0.5*(A+1)) B_min=10*B B_max=10*(B+1) if A_max <= B_min: print(-1) elif B_max <= A_min: print(-1) else: print(max(A_min,B_min))
[ "misc.opposites", "assignment.value.change", "identifier.change", "expression.operation.binary.change", "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
537,064
537,063
u465101448
python
p02755
A, B = list(map(int,input().split())) flag = -1 for x in range(1,101): if (x *0.08) // 1 == A and (x*0.1) // 1 == B: flag = x break print(flag)
A, B = list(map(int,input().split())) flag = -1 for x in range(1,10001): if (x *0.08) // 1 == A and (x*0.1) // 1 == B: flag = x break print(flag)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
537,069
537,070
u006962308
python