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 |
|---|---|---|---|---|---|---|---|
p02840 | n, x, d = map(int, input().split())
if d == 0:
if x == 0:
print(1)
exit
else:
print(n + 1)
exit
if d < 0:
y = x
x = x + d * (n - 1)
d = -d
else:
y = x + d * (n - 1)
U = {}
ans = 0
has0 = 0
for k in range(1, n + 1):
r = (x * k) % d
s = k * d * (k - 1) // 2
v1 = k * x + s
v2 = k * ... | n, x, d = map(int, input().split())
if d == 0:
if x == 0:
print(1)
exit()
else:
print(n + 1)
exit()
if d < 0:
y = x
x = x + d * (n - 1)
d = -d
else:
y = x + d * (n - 1)
U = {}
ans = 0
has0 = 0
for k in range(1, n + 1):
r = (x * k) % d
s = k * d * (k - 1) // 2
v1 = k * x + s
v2 = ... | [
"call.add"
] | 646,420 | 646,421 | u956530786 | python |
p02840 | import sys
readline = sys.stdin.readline
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
def solve():
n, x, d = nm()
ans = 0
if d == 0:
print(0 if x == 0 else n)
return
if d < 0:
d = -... | import sys
readline = sys.stdin.readline
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
def solve():
n, x, d = nm()
ans = 0
if d == 0:
print(1 if x == 0 else n+1)
return
if d < 0:
d =... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 646,458 | 646,457 | u543954314 | python |
p02840 | import sys
readline = sys.stdin.readline
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
def solve():
n, x, d = nm()
ans = 0
if d == 0:
print(0 if x == 0 else n)
if d < 0:
d = -d
x = -... | import sys
readline = sys.stdin.readline
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
def solve():
n, x, d = nm()
ans = 0
if d == 0:
print(1 if x == 0 else n+1)
return
if d < 0:
d =... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change",
"control_flow.return.add"
] | 646,459 | 646,457 | u543954314 | python |
p02842 | n=int(input())
flag = False
for i in range(100*n,100*(n+1)):
if i%108 == 0:
x == int(i//108)
print(x)
flag == True
break
if flag == False:
print(':(') | n=int(input())
flag = False
for i in range(100*n,100*(n+1)):
if i%108 == 0:
x = int(i//108)
print(x)
flag = True
break
if flag == False:
print(':(') | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 646,610 | 646,611 | u530071782 | python |
p02842 | n=int(input())
flag == False
for i in range(100*n,100*(n+1)):
if i%108 == 0:
x == int(i//108)
print(x)
flag == True
break
if flag == False:
print(':(')
| n=int(input())
flag = False
for i in range(100*n,100*(n+1)):
if i%108 == 0:
x = int(i//108)
print(x)
flag = True
break
if flag == False:
print(':(') | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 646,612 | 646,611 | u530071782 | python |
p02842 | import math
n = int(input())
for i in range(1,n):
if math.floor(i * 1.08) == n:
print(i)
exit(0)
print(":(") | import math
n = int(input())
for i in range(n+1):
if math.floor(i * 1.08) == n:
print(i)
exit(0)
print(":(") | [
"call.arguments.change"
] | 646,617 | 646,616 | u598684283 | python |
p02842 | import math
n=int(input())
if int(math.ceil(n/1.08)*1.08)==n:
print(math.ceil(n/1.08))
else:
print(":()") | import math
n=int(input())
if int(math.ceil(n/1.08)*1.08)==n:
print(math.ceil(n/1.08))
else:
print(":(") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 646,629 | 646,630 | u629540524 | python |
p02842 | # -*- coding: utf-8 -*-
import math
N = int(input())
for x in range(N,1,-1):
val = int(x * 1.08)
if val == N:
print(x)
exit()
print(':(') | # -*- coding: utf-8 -*-
import math
N = int(input())
for x in range(N,0,-1):
val = int(x * 1.08)
if val == N:
print(x)
exit()
print(':(') | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 646,635 | 646,636 | u540762794 | python |
p02842 | n=int(input())
for i in range(n):
if (i *108)//100 == n:
print(i)
exit()
print(':(') | n=int(input())
for i in range(1,n+1):
if (i *108)//100 == n:
print(i)
exit()
print(':(') | [
"call.arguments.add"
] | 646,639 | 646,640 | u244434589 | python |
p02842 | import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
de... | import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
de... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 646,645 | 646,646 | u190850294 | python |
p02842 | from decimal import Decimal
N = int(input())
a = Decimal('1.08')
for x in range(N):
if int(x*a) == N:
print(x)
exit()
print(':(') | from decimal import Decimal
N = int(input())
a = Decimal('1.08')
for x in range(N+1):
if int(x*a) == N:
print(x)
exit()
print(':(') | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 646,647 | 646,648 | u267718666 | python |
p02842 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def binary_search(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) / 2
if cond(mid):
ok = mid
else:
ng = mid
return ok
candidate = binary_search(n, 0, lambda x: x * 1.08... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def binary_search(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if cond(mid):
ok = mid
else:
ng = mid
return ok
candidate = binary_search(n, 0, lambda x: x * 1.0... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 646,663 | 646,664 | u883621917 | python |
p02842 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def binary_search(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) / 2
if cond(mid):
ok = mid
else:
ng = mid
return ok
candidate = int(binary_search(n, 0, lambda x: x * ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def binary_search(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if cond(mid):
ok = mid
else:
ng = mid
return ok
candidate = binary_search(n, 0, lambda x: x * 1.0... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 646,665 | 646,664 | u883621917 | python |
p02842 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def bs(ok, ng, solve):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if solve(mid):
ok = mid
else:
ng = mid
return ok
ans = bs(n, 0, lambda x: x * 1.08 >= n)
if ans * 1.08 == n... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def bs(ok, ng, solve):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if solve(mid):
ok = mid
else:
ng = mid
return ok
ans = bs(n, 0, lambda x: x * 1.08 >= n)
if int(ans * 1.08)... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 646,666 | 646,667 | u883621917 | python |
p02842 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def bs(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if cond(mid):
ok = mid
else:
ng = mid
return mid
ans = bs(n, 0, lambda x: (x * 1.08) >= n)
if int(ans * 1.08... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def bs(ok, ng, solve):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if solve(mid):
ok = mid
else:
ng = mid
return ok
ans = bs(n, 0, lambda x: x * 1.08 >= n)
if int(ans * 1.08)... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"function.return_value.change",
"call.arguments.change"
] | 646,668 | 646,667 | u883621917 | python |
p02842 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def bs(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if cond(mid):
ok = mid
else:
ng = mid
return mid
ans = bs(n, 0, lambda x: (x * 1.08) >= n)
if int(ans * 1.08... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def bs(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if cond(mid):
ok = mid
else:
ng = mid
return ok
ans = bs(n, 0, lambda x: (x * 1.08) >= n)
if int(ans * 1.08)... | [
"identifier.change",
"function.return_value.change"
] | 646,668 | 646,670 | u883621917 | python |
p02842 | #
# smbc2019 b
#
import sys
from io import StringIO
import unittest
import math
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out ... | #
# smbc2019 b
#
import sys
from io import StringIO
import unittest
import math
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out ... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 646,679 | 646,680 | u481250941 | python |
p02842 | n = int(input())
r = n % 27
if r == 13 or r == 26:
print(':)')
elif r ==0:
x = int(100*n/108)
print(x)
else:
for i in range(1, 25):
if 1.08*(i-1) < r <= 1.08*i:
break
x = int(100*(n - i)/108) + i
print(x) | n = int(input())
r = n % 27
if r == 13 or r == 26:
print(':(')
elif r ==0:
x = int(100*n/108)
print(x)
else:
for i in range(1, 25):
if 1.08*(i-1) < r <= 1.08*i:
break
x = int(100*(n - i)/108) + i
print(x) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 646,689 | 646,690 | u148981246 | python |
p02842 | N=int(input())
for i in range(N+1):
if int(i*1.08)==N:
print(i)
break
if all(int(i*1.08)!=N for i in range(N))==True:
print(":(") | N=int(input())
for i in range(N+1):
if int(i*1.08)==N:
print(i)
break
if all(int(i*1.08)!=N for i in range(N+1))==True:
print(":(") | [
"control_flow.branch.if.condition.change"
] | 646,693 | 646,694 | u591919975 | python |
p02842 | N=int(input())
for i in range(N):
if int(i*1.08)==N:
print(i)
break
if all(int(i*1.08)!=N for i in range(N))==True:
print(":(") | N=int(input())
for i in range(N+1):
if int(i*1.08)==N:
print(i)
break
if all(int(i*1.08)!=N for i in range(N+1))==True:
print(":(") | [
"control_flow.branch.if.condition.change"
] | 646,695 | 646,694 | u591919975 | python |
p02842 | N=int(input())
for i in range(N):
if int(i*1.08)==N:
print(i)
break
if all(int(i*1.08)!=N for i in range(N))==True:
print("No") | N=int(input())
for i in range(N+1):
if int(i*1.08)==N:
print(i)
break
if all(int(i*1.08)!=N for i in range(N+1))==True:
print(":(") | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 646,696 | 646,694 | u591919975 | python |
p02842 | N = int(input())
ans = ":("
for X in range(N-1):
if int(X * 1.08) == N:
ans = X
break
print(ans)
| N = int(input())
ans = ":("
for X in range(N+1):
if int(X * 1.08) == N:
ans = X
break
print(ans)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 646,715 | 646,716 | u909224749 | python |
p02842 | n = int(input())
for i in range(n):
ans = int(i*1.08)
if ans == n:
print(i)
break
else:
print(":(") | n = int(input())
for i in range(1,n+1):
ans = int(i*1.08)
if ans == n:
print(i)
break
else:
print(":(") | [
"call.arguments.add"
] | 646,718 | 646,719 | u397953026 | python |
p02842 | n = int(input())
ans = int(n*100/108)
if int(ans*1.08)==n:
print(ans)
elif int((ans-1)*1.08)==n:
print(ans-1)
elif int((ans-1)*1.08)==n:
print(ans+1)
else:
print(":(")
| n = int(input())
ans = int(n*100/108)
if int(ans*1.08)==n:
print(ans)
elif int((ans-1)*1.08)==n:
print(ans-1)
elif int((ans+1)*1.08)==n:
print(ans+1)
else:
print(":(")
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 646,720 | 646,721 | u035453792 | python |
p02842 | import math
N = int(input())
ans = -1
for i in range(N):
if math.floor(i*1.08) == N:
ans = i
if ans == -1:
print(':(')
else:
print(ans) | import math
N = int(input())
ans = -1
for i in range(N+1):
if math.floor(i*1.08) == N:
ans = i
if ans == -1:
print(':(')
else:
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 646,727 | 646,728 | u456579619 | python |
p02842 | N = int(input())
n = int(N // 1.08)
while n < N:
if int(n * 1.08) == N:
print(n)
exit()
n += 1
print(':(')
| N = int(input())
n = int(N // 1.08)
while n <= N:
if int(n * 1.08) == N:
print(n)
exit()
n += 1
print(':(')
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 646,737 | 646,738 | u891516200 | python |
p02842 | a=int(input())
b=0
for i in range(a):
c=i
c+=(i*8)//100
if c==a:
b=i
print(":("if b==0 else b) | a=int(input())
b=0
for i in range(a+1):
c=i
c+=(i*8)//100
if c==a:
b=i
print(":("if b==0 else b) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 646,739 | 646,740 | u158290747 | python |
p02842 | import math
f = True
N = int(input())
for i in range(N):
if math.floor(i*1.08) == N:
print(i)
f = False
break
if f:
print(":(")
| import math
f = True
N = int(input())
for i in range(N+1):
if math.floor(i*1.08) == N:
print(i)
f = False
break
if f:
print(":(")
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 646,745 | 646,746 | u950174376 | python |
p02842 | import math
f = True
N = int(input())
for i in range(N):
if math.floor(i*1.08) == N:
print(i)
f = False
if f:
print(":(")
| import math
f = True
N = int(input())
for i in range(N+1):
if math.floor(i*1.08) == N:
print(i)
f = False
break
if f:
print(":(")
| [
"control_flow.break.add"
] | 646,747 | 646,746 | u950174376 | python |
p02842 | N = int(input())
import math
X = math.floor(N/1.08)
if N == math.ceil(X*1.08):
print(X)
else:
print(':(') | N = int(input())
import math
X = math.ceil(N/1.08)
if N == math.floor(X*1.08):
print(X)
else:
print(':(') | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 646,748 | 646,749 | u837546225 | python |
p02842 | import math
N = int(input())
X = math.floor(N/1.08)
if N == math.ceil(X*1.08):
print(X)
else:
print(':(') | N = int(input())
import math
X = math.ceil(N/1.08)
if N == math.floor(X*1.08):
print(X)
else:
print(':(') | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 646,750 | 646,749 | u837546225 | python |
p02842 | N = int(input())
for i in range(N):
X = i * 1.08
if int(X) == N:
print(i)
exit()
print(':(') | N = int(input())
for i in range(N+1):
X = i * 1.08
if int(X) == N:
print(i)
exit()
print(':(') | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 646,755 | 646,756 | u776311944 | python |
p02842 | N = int(input())
for i in range(N-1):
X = i * 1.08
if int(X) == N:
print(i)
exit()
print(':(') | N = int(input())
for i in range(N+1):
X = i * 1.08
if int(X) == N:
print(i)
exit()
print(':(') | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 646,757 | 646,756 | u776311944 | python |
p02842 | N = int(input())
for i in range(N):
if int(i * 1.08) == N:
print(i)
exit(0)
else:
print(":(") | N = int(input())
for i in range(N+1):
if int(i * 1.08) == N:
print(i)
exit(0)
else:
print(":(") | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 646,758 | 646,759 | u848535504 | python |
p02839 | def inpl(): return list(map(int, input().split()))
H, W = inpl()
A = [inpl() for _ in range(H)]
B = [inpl() for _ in range(W)]
DP = [[0 for _ in range(W+1)] for _ in range(H+1)]
DP[0][0] = 1 << 12800
for h in range(H):
for w in range(W):
d = abs(A[h][w] - B[h][w])
DP[h+1][w] |= DP[h][w] >> d
... | def inpl(): return list(map(int, input().split()))
H, W = inpl()
A = [inpl() for _ in range(H)]
B = [inpl() for _ in range(H)]
DP = [[0 for _ in range(W+1)] for _ in range(H+1)]
DP[0][0] = 1 << 12800
for h in range(H):
for w in range(W):
d = abs(A[h][w] - B[h][w])
DP[h+1][w] |= DP[h][w] >> d
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change"
] | 646,763 | 646,764 | u777923818 | python |
p02839 | #https://atcoder.jp/contests/abc147/submissions/8874645
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
ofs=6400
h,w=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().s... | #https://atcoder.jp/contests/abc147/submissions/8874645
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
ofs=6400
h,w=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().s... | [
"assignment.value.change"
] | 646,801 | 646,802 | u708618797 | python |
p02839 | #https://atcoder.jp/contests/abc147/submissions/8874645
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
ofs=6400
h,w=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().s... | #https://atcoder.jp/contests/abc147/submissions/8874645
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
ofs=6400
h,w=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().s... | [
"assignment.value.change"
] | 646,803 | 646,802 | u708618797 | python |
p02839 | H,W = map(int,input().split())
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 100
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a =... | H,W = map(int,input().split())
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 6400
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a ... | [
"literal.number.integer.change",
"assignment.value.change"
] | 646,815 | 646,811 | u211160392 | python |
p02839 | H,W = map(int,input().split())
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 10
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a = ... | H,W = map(int,input().split())
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 6400
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a ... | [
"literal.number.integer.change",
"assignment.value.change"
] | 646,816 | 646,811 | u211160392 | python |
p02839 | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 646,832 | 646,829 | u988402778 | python |
p02839 | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 646,836 | 646,829 | u988402778 | python |
p02842 | n = int(input())
import math
for i in range(50000):
if math.floor(i*1.08) == n:
print(i)
exit()
ptiny(":(") | n = int(input())
import math
for i in range(50000):
if math.floor(i*1.08) == n:
print(i)
exit()
print(":(") | [
"identifier.change",
"call.function.change"
] | 646,955 | 646,956 | u289547799 | python |
p02842 | import math
n=int(input())
num=round(n/1.08)
if math.floor(num*1.08)==n:
print(num)
else:
print(":(")
| import math
n=int(input())
num=math.ceil(n/1.08)
if math.floor(num*1.08)==n:
print(num)
else:
print(":(")
| [
"assignment.value.change"
] | 646,961 | 646,962 | u999503965 | python |
p02842 | import math
price = int(input())
tax = 8
price_1 = math.ceil(price / (1 + tax / 100))
price_2 = math.floor(price * tax / 100)
print(price_1 if price == price_1 + price2 else ':(') | import math
price = int(input())
tax = 8
price_1 = math.ceil(price / (1 + tax / 100))
price_2 = math.floor(price_1 * tax / 100)
print(price_1 if price == price_1 + price_2 else ':(') | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 646,977 | 646,978 | u706659319 | python |
p02842 | n=int(input())
ans=0
for i in range(1,50000+1):
z=i*1.08
if n<=z<(n+1):
ans=z
break
if ans==0:
print(":(")
else:
print(ans)
| n=int(input())
ans=0
for i in range(1,50000+1):
z=i*1.08
if n<=z<(n+1):
ans=i
break
if ans==0:
print(":(")
else:
print(ans)
| [
"assignment.value.change",
"identifier.change"
] | 646,995 | 646,996 | u723583932 | python |
p02842 | import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().spl... | import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().spl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 647,004 | 647,005 | u844895214 | python |
p02842 | import math
a = int(input())
for i in range(a):
if math.floor(i*1.08) == a:
print(i)
exit()
print(":(") | import math
a = int(input())
for i in range(50001):
if math.floor(i*1.08) == a:
print(i)
exit()
print(":(") | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,006 | 647,007 | u717762991 | python |
p02842 | import math
N=int(input())
X=N/1.08
X=math.ceil(X)
if X*1.08==N:
print(X)
else:
print(":(") | import math
N=int(input())
X=N/1.08
X=math.ceil(X)
if math.floor(X*1.08)==N:
print(X)
else:
print(":(") | [
"control_flow.branch.if.condition.change",
"call.add"
] | 647,015 | 647,016 | u536017058 | python |
p02842 | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readl... | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readl... | [
"call.arguments.add"
] | 647,026 | 647,027 | u036104576 | python |
p02842 | import math
def solve():
N = int(input())
if round(math.ceil(N / 1.08) * 1.08) == N:
print(math.ceil(N / 1.08))
else:
print(':(')
if __name__ == "__main__":
solve() | import math
def solve():
N = int(input())
if math.floor(math.ceil(N / 1.08) * 1.08) == N:
print(math.ceil(N / 1.08))
else:
print(':(')
if __name__ == "__main__":
solve() | [
"control_flow.branch.if.condition.change"
] | 647,032 | 647,033 | u373442126 | python |
p02842 | import math
def solve():
N = int(input())
if math.floor(round(N / 1.08) * 1.08) == N:
print(round(N / 1.08))
else:
print(':(')
if __name__ == "__main__":
solve() | import math
def solve():
N = int(input())
if math.floor(math.ceil(N / 1.08) * 1.08) == N:
print(math.ceil(N / 1.08))
else:
print(':(')
if __name__ == "__main__":
solve() | [
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 647,034 | 647,033 | u373442126 | python |
p02842 | import math
n=int(input())
x=math.ceil(n/1.08)
nn=n*1.08
if math.floor(nn)==n:
print(x)
else:
print(":(")
| import math
n=int(input())
xc=math.ceil(n/1.08)
nn=xc*1.08
if math.floor(nn)==n:
print(xc)
else:
print(":(")
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 647,042 | 647,043 | u368270116 | python |
p02842 | def main2():
n = int(input())
x = int(math.ceil(n / 1.08))
if int(x*1.08) == n:
print(x)
else:
print(":(")
if __name__ == "__main__":
main2() | import math
def main2():
n = int(input())
x = int(math.ceil(n / 1.08))
if int(x*1.08) == n:
print(x)
else:
print(":(")
if __name__ == "__main__":
main2() | [] | 647,047 | 647,048 | u835283937 | python |
p02842 | N = int(input())
flag = True
for i in range(N):
if int(i * 1.08) == N:
print(i)
flag = False
break
if flag:
print(":(")
| N = int(input())
flag = True
for i in range(100000):
if int(i * 1.08) == N:
print(i)
flag = False
break
if flag:
print(":(")
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,051 | 647,050 | u720558413 | python |
p02842 | n = int(input())
found = False
for i in range(n):
x = int ( i * 1.08 )
if x == n :
print(i)
found = True
break
if not found:
print(":(") | n = int(input())
found = False
for i in range(1, n + 1):
x = int ( i * 1.08 )
if x == n :
print(i)
found = True
break
if not found:
print(":(") | [
"call.arguments.add"
] | 647,052 | 647,053 | u035742291 | python |
p02842 | n=int(input())
for m in range(1,n):
if int(m*1.08)==n:
print(m)
break
else:print(":(") | n=int(input())
for m in range(1,n+1):
if int(m*1.08)==n:
print(m)
break
else:print(":(")
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,060 | 647,061 | u123745130 | python |
p02842 | import numpy
N = int(input())
X0 = N / 1.08
X1 = (N + 1) / 1.08
if numpy.floor(X1) - numpy.floor(X0) == 0:
print(':(')
else:
print(int(numpy.floor(X0) + 1)) | import numpy
N = int(input())
X0 = N / 1.08
X1 = (N + 1) / 1.08
if numpy.ceil(X1) - numpy.ceil(X0) == 0:
print(':(')
else:
print(int(numpy.ceil(X0))) | [
"misc.opposites",
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 647,077 | 647,078 | u169165784 | python |
p02842 | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
from math import floor
n=ni()
for i in range(n):
if floor(i*1.08)==n:
print(i)
exit()
print(':(')
| ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
from math import floor
n=ni()
for i in range(n+1):
if floor(i*1.08)==n:
print(i)
exit()
print(':(')
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,087 | 647,088 | u963915126 | python |
p02842 | import math
N = int(input())
flag = True
for i in range(N):
if math.floor(i * 1.08) == N:
print(i)
flag = False
break
if flag:
print(':(') | import math
N = int(input())
flag = True
for i in range(N+1):
if math.floor(i * 1.08) == N:
print(i)
flag = False
break
if flag:
print(':(') | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,089 | 647,090 | u789290859 | python |
p02842 | N = int(input())
a = int(N / 2)
x = 0
for i in range(a - 1, N):
if N == int(i * 1.08):
print(i)
x += 1
if x == 0:
print(':(') | N = int(input())
a = int(N / 10)
x = 0
for i in range(a,N + 1):
if N == int(i * 1.08):
print(i)
x += 1
if x == 0:
print(':(') | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 647,091 | 647,092 | u569776981 | python |
p02842 | import math
n=int(input())
for i in range(n):
if math.floor(i*1.08)==n:
print(i)
break
elif i*1.08>n:
print(":(")
break
| import math
n=int(input())
for i in range(1,n+1):
if math.floor(i*1.08)==n:
print(i)
break
elif i*1.08>n:
print(":(")
break
| [
"call.arguments.add"
] | 647,097 | 647,098 | u206541745 | python |
p02842 | n = int(input())
for x in range(1, 50005):
if x * 1.08 == n:
print(x)
exit()
else:
print(':(') | n = int(input())
for x in range(1, 50005):
if x * 108//100 == n:
print(x)
exit()
else:
print(':(') | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 647,114 | 647,115 | u960080897 | python |
p02842 | import math
N = int(input())
for i in range(1,N):
if math.floor(i*1.08) == N:
print(i)
break
else:
print(":(") | import math
N = int(input())
for i in range(1,N+1):
if math.floor(i*1.08) == N:
print(i)
break
else:
print(":(") | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,116 | 647,117 | u397384480 | python |
p02842 | n=int(input())
ans=':('
for i in range(1,n):
if int((i*1.08)//1)==n:
ans=i
break
print(ans)
| n=int(input())
ans=':('
for i in range(1,n+1):
if int((i*1.08)//1)==n:
ans=i
break
print(ans)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,130 | 647,131 | u350093546 | python |
p02842 | import math
N = int(input())
X = 0
a = 0
for i in range(N):
X = math.floor(1.08*i)
if(X==N):
print(i)
a+=1
break
if(a ==0):
print(":(") | import math
N = int(input())
X = 0
a = 0
for i in range(50000):
X = math.floor(1.08*i)
if(X==N):
print(i)
a+=1
break
if(a ==0):
print(":(") | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,135 | 647,136 | u696684809 | python |
p02842 | N = int(input())
X = 0
a = 0
for i in range(N):
X = int(1.08*i)
if(X==N):
print(i)
a+=1
break
if(a ==0):
print(":(") | import math
N = int(input())
X = 0
a = 0
for i in range(50000):
X = math.floor(1.08*i)
if(X==N):
print(i)
a+=1
break
if(a ==0):
print(":(") | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change"
] | 647,137 | 647,136 | u696684809 | python |
p02842 | N = int(input())
for i in range(1, N):
if i + (i * 8) // 100 == N:
print(i)
break
else:
print(":(") | N = int(input())
for i in range(1, N + 1):
if i + (i * 8) // 100 == N:
print(i)
break
else:
print(":(") | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,159 | 647,160 | u422242927 | python |
p02842 | N = int(input())
for i in range(1, N):
if i + (i * 8) // 100 == N:
print(i)
else:
print(":(")
| N = int(input())
for i in range(1, N + 1):
if i + (i * 8) // 100 == N:
print(i)
break
else:
print(":(") | [
"control_flow.break.add"
] | 647,161 | 647,160 | u422242927 | python |
p02842 | N = int(input())
for i in range(1, N):
if i + i * 8 // 100 == N:
print(i)
else:
print(":(")
| N = int(input())
for i in range(1, N + 1):
if i + (i * 8) // 100 == N:
print(i)
break
else:
print(":(") | [
"control_flow.branch.if.condition.change",
"control_flow.break.add"
] | 647,162 | 647,160 | u422242927 | python |
p02842 | n = int(input())
dic = {}
for i in range(1,50000):
dic[int(i * 1.08)] = i
print(dic)
if n in dic:
print(dic[n])
else:
print(':(') | n = int(input())
dic = {}
for i in range(1,50000):
dic[int(i * 1.08)] = i
if n in dic:
print(dic[n])
else:
print(':(') | [
"call.remove"
] | 647,163 | 647,164 | u212328220 | python |
p02842 | n=int(input())
num=round(n/1.08)
check=round(num*1.08)
if check==n:
print(num)
else:
print(':(') | import math
n=int(input())
num=math.ceil(n/1.08)
check=int(num*1.08)
if check==n:
print(num)
else:
print(':(') | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 647,188 | 647,189 | u113107956 | python |
p02842 | n=int(input())
num=round(n/1.08)
check=int(num*1.08)
if check==n:
print(num)
else:
print(':(') | import math
n=int(input())
num=math.ceil(n/1.08)
check=int(num*1.08)
if check==n:
print(num)
else:
print(':(') | [
"assignment.value.change"
] | 647,190 | 647,189 | u113107956 | python |
p02842 | n = int(input())
for i in range(n):
if int(i * 1.08) == n:
print(i)
exit()
print(":(") | n = int(input())
for i in range(50001):
if int(i * 1.08) == n:
print(i)
exit()
print(":(") | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,191 | 647,192 | u624613992 | python |
p02842 | n = int(input())
for i in range(n):
if i * 1.08 == n:
print(i)
exit()
print(":(") | n = int(input())
for i in range(50001):
if int(i * 1.08) == n:
print(i)
exit()
print(":(") | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 647,193 | 647,192 | u624613992 | python |
p02842 | n = int(input())
import math
a = n*100/108
b = (n*100+100)/108
ans = math.ceil(a) if math.ceil(a) != b else ":("
print(ans) | n = int(input())
import math
a = n*100/108
b = (n*100+100)/108
ans = math.ceil(a) if math.ceil(a) < b else ":("
print(ans) | [
"expression.operator.compare.change",
"assignment.value.change"
] | 647,198 | 647,199 | u555458045 | python |
p02842 | def readinput():
n=int(input())
return n
def main(n):
x7=int(n/1.07)
x8=int(n/1.08)
x9=int(n/1.09)
n100=n*100
for x in range(max(1,x9-1),x7+1):
xx=x*108//100
if xx==n:
print(x)
break
else:
print(':(')
if __name__=='__main__':
... | def readinput():
n=int(input())
return n
def main(n):
x7=int(n/1.07)
x8=int(n/1.08)
x9=int(n/1.09)
n100=n*100
for x in range(max(1,x9-1),x7+1+1):
xx=x*108//100
#print(x,xx)
if xx==n:
print(x)
break
else:
print(':(')
if _... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,208 | 647,209 | u592547545 | python |
p02842 | def readinput():
n=int(input())
return n
def main(n):
x7=int(n/1.07)
x8=int(n/1.08)
x9=int(n/1.09)
n100=n*100
for x in range(max(1,x9-1),x7+1):
xx=x*108
if xx==n100:
print(x)
break
else:
print(':(')
if __name__=='__main__':
... | def readinput():
n=int(input())
return n
def main(n):
x7=int(n/1.07)
x8=int(n/1.08)
x9=int(n/1.09)
n100=n*100
for x in range(max(1,x9-1),x7+1+1):
xx=x*108//100
#print(x,xx)
if xx==n:
print(x)
break
else:
print(':(')
if _... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 647,210 | 647,209 | u592547545 | python |
p02842 | N = int(input())
for x in range(N):
if int(x*1.08) == N:
print(x)
break
else:
print(':(') | N = int(input())
for x in range(N+1):
if int(x*1.08) == N:
print(x)
break
else:
print(':(') | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,211 | 647,212 | u555767343 | python |
p02842 | def main():
N = int(input())
for i in range(N):
ans = i * 108 // 100
if ans == N:
print(i)
return
print(':(')
main() | def main():
N = int(input())
for i in range(N + 1):
ans = i * 108
ans = ans // 100
if ans == N:
print(i)
return
print(':(')
main() | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add",
"assignment.add"
] | 647,215 | 647,216 | u033642300 | python |
p02842 | def resolve():
import math
N = int(input())
for i in range(N):
if math.floor(i*1.08) == N:
print(i)
exit()
print(":(")
resolve() | def resolve():
import math
N = int(input())
for i in range(N+1):
if math.floor(i*1.08) == N:
print(i)
exit()
print(":(")
resolve() | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,219 | 647,220 | u600261652 | python |
p02842 | import numpy as np
N = int(input())
X = int(np.round(N/1.08))
if np.floor(X*1.08)!=N:
X = ':('
print(X) | import numpy as np
N = int(input())
X = int(np.ceil(N/1.08))
if np.floor(X*1.08)!=N:
X = ':('
print(X) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 647,229 | 647,230 | u232873434 | python |
p02842 | from math import floor
def main(N, rate=1.08):
ans = -1
for x in range(1, N+1):
if floor(x * 1.08) == N:
ans = x
return ans
if __name__ == "__main__":
N = int(input())
ans = main(N)
print(ans if ans > 0 else ':)')
| from math import floor
def main(N, rate=1.08):
ans = -1
for x in range(1, N+1):
if floor(x * 1.08) == N:
ans = x
return ans
if __name__ == "__main__":
N = int(input())
ans = main(N)
print(ans if ans > 0 else ':(')
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 647,235 | 647,236 | u142415823 | python |
p02842 | # template by 3xC and starkizard.
# contributors:
#####################################################################################
from __future__ import division, print_function
import sys
import os
from collections import Counter, deque, defaultdict
import itertools
import math
import io
"""Uncomment modul... | # template by 3xC and starkizard.
# contributors:
#####################################################################################
from __future__ import division, print_function
import sys
import os
from collections import Counter, deque, defaultdict
import itertools
import math
import io
"""Uncomment modul... | [
"call.add",
"call.arguments.change"
] | 647,237 | 647,238 | u436697953 | python |
p02842 | n = int(input())
for i in range(n):
if int(i*1.08) == n:
print(i)
break
else:
print(":(") | n = int(input())
for i in range(1,n+1):
if int(i*1.08) == n:
print(i)
break
else:
print(":(") | [
"call.arguments.add"
] | 647,241 | 647,242 | u496821919 | python |
p02842 | n = int(input())
xmin = int(n/1.08)
xmax = int((n+1)/1.08)
if n%27 == 0:
print(xmax)
elif (n+1)%27 == 0:
print(xmin)
elif xmin == xmax:
print(":(")
else:
print(xmax)
| n = int(input())
xmin = int(n/1.08)
xmax = int((n+1)/1.08)
if n%27 == 0:
print(xmax)
elif (n+1)%27 == 0:
print(":(")
elif xmin == xmax:
print(":(")
else:
print(xmax) | [
"call.arguments.change",
"io.output.change"
] | 647,243 | 647,244 | u492910842 | python |
p02842 | n = int(input())
ans = 0
for i in range(1, N+1):
if int(i * 1.08) == n:
ans = i
if ans == 0:
print(":(")
else:
print(x) | n = int(input())
ans = 0
for i in range(1, n+1):
if int(i * 1.08) == n:
ans = i
if ans == 0:
print(":(")
else:
print(ans) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"io.output.change"
] | 647,250 | 647,251 | u039860745 | python |
p02842 | # sumitb2019_b_bacha.py
N = int(input())
for i in range(N):
if int(i*1.08) == N:
print(i)
exit()
print(":(")
| # sumitb2019_b_bacha.py
N = int(input())
for i in range(50000):
if int(i*1.08) == N:
print(i)
exit()
print(":(")
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,258 | 647,257 | u371132735 | python |
p02842 | # sumitb2019_b.py
import math
N = int(input())
for i in range(N):
if math.floor(i*1.08) == N:
print(i)
exit()
print(":(") | # sumitb2019_b_bacha.py
N = int(input())
for i in range(50000):
if int(i*1.08) == N:
print(i)
exit()
print(":(")
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 647,259 | 647,257 | u371132735 | python |
p02842 | # sumitb2019_b.py
import math
N = int(input())
for i in range(N):
if math.floor(i*1.08) == N:
print(i)
exit()
print(":(") | # sumitb2019_b.py
import math
N = int(input())
for i in range(50000):
if math.floor(i*1.08) == N:
print(i)
exit()
print(":(") | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,259 | 647,260 | u371132735 | python |
p02842 | n = int(input())
for i in range(n):
if int((i * 1.08) // 1) == n:
print(i)
exit()
print(":(")
| n = int(input())
for i in range(n+1):
if int((i * 1.08) // 1) == n:
print(i)
exit()
print(":(")
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,261 | 647,262 | u432853936 | python |
p02842 | n = int(input())
for x in range(n):
if x * 1.08 // 1 == n:
print(x)
break
else:
print(':(') | n = int(input())
for x in range(n+1):
if x * 108 // 100 == n:
print(x)
break
else:
print(':(') | [
"control_flow.branch.if.condition.change",
"literal.number.integer.change"
] | 647,263 | 647,264 | u382423941 | python |
p02842 | N = int(input())
X = int(-(-N//1.08))
print(X)
if N == int(X * 1.08):
print(X)
else:
print(':(') | N = int(input())
X = int(-(-N//1.08))
if N == int(X * 1.08):
print(X)
else:
print(':(') | [
"call.remove"
] | 647,271 | 647,272 | u996564551 | python |
p02842 | from decimal import Decimal
N = int(input())
M = round(N/Decimal(1.08))
if N == int(M*Decimal(1.08)) :
print( int(M))
else :
print(':(') | from decimal import Decimal
N = int(input())
M = int(N/Decimal(1.08)) + 1
if N == int(M*Decimal(1.08)) :
print( int(M))
else :
print(':(') | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 647,275 | 647,276 | u441246928 | python |
p02842 | from decimal import Decimal
N = int(input())
M = N/Decimal(1.08)
if N == int(M*Decimal(1.08)) :
print( int(M))
else :
print(':(') | from decimal import Decimal
N = int(input())
M = int(N/Decimal(1.08)) + 1
if N == int(M*Decimal(1.08)) :
print( int(M))
else :
print(':(') | [
"call.add"
] | 647,277 | 647,276 | u441246928 | python |
p02842 | # N=1079
N=int(input())
a=int(N*100/110)-1
flg=False
for i in range (N-a+1):
if ((a+i)*1.08)//1==N:
print(a+i)
exit
else:
pass
print(':(') | # N=1079
N=int(input())
a=int(N*100/110)-1
flg=False
for i in range (N-a+1):
if ((a+i)*1.08)//1==N:
print(a+i)
exit()
else:
pass
print(':(') | [
"call.add"
] | 647,280 | 647,281 | u674588203 | python |
p02842 | import math
x = int(input())
ans = math.ceil(x/1.08)
if x == round(ans * 1.08):
print(ans)
else:
print(":(") | import math
x = int(input())
ans = math.ceil(x/1.08)
if x == math.floor(ans * 1.08):
print(ans)
else:
print(":(") | [
"control_flow.branch.if.condition.change"
] | 647,298 | 647,299 | u098982053 | python |
p02842 | import math
x = int(input())
ans = math.ceil(x/1.08)
if x == (ans * 1.08):
print(ans)
else:
print(":(") | import math
x = int(input())
ans = math.ceil(x/1.08)
if x == math.floor(ans * 1.08):
print(ans)
else:
print(":(") | [
"control_flow.branch.if.condition.change"
] | 647,300 | 647,299 | u098982053 | python |
p02842 | import math
x = int(input())
ans = round(x/1.08)
if x == math.floor(ans * 1.08):
print(ans)
else:
print(":(") | import math
x = int(input())
ans = math.ceil(x/1.08)
if x == math.floor(ans * 1.08):
print(ans)
else:
print(":(") | [
"assignment.value.change"
] | 647,301 | 647,299 | u098982053 | python |
p02842 | n=int(input())
for i in range(n):
if i*1.08>=n and i*1.08<n+1:
print(i)
break
else:
print(":(") | n=int(input())
for i in range(1,n+1):
if i*1.08>=n and i*1.08<n+1:
print(i)
break
else:
print(":(") | [
"call.arguments.add"
] | 647,308 | 647,309 | u629350026 | python |
p02842 | N = int(input())
for i in range(N):
if int(i * 1.08) == N:
print(i)
exit()
print(':(') | N = int(input())
for i in range(N+100):
if int(i * 1.08) == N:
print(i)
exit()
print(':(') | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,320 | 647,321 | u225845681 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.