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 9
values |
|---|---|---|---|---|---|---|---|
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 modules according to your need"""
# from bisect import bisect_left, bisect_right, insort
# from heapq import heappop, heapify, heappush
# from random import randint as rn
# from Queue import Queue as Q
# from copy import deepcopy
# from decimal import *
# import re
# import operator
#####################################################################################
# this enables you to write python3 code with PyPy2 (Python 2)
if sys.version_info[0] < 3:
input = raw_input
range = xrange
filter = itertools.ifilter
map = itertools.imap
zip = itertools.izip
#####################################################################################
"""value of mod"""
MOD = 998244353
mod = 10**9 + 7
"""Uncomment next 4 lines if doing huge recursion"""
# import threading
# threading.stack_size(1<<27)
# sys.setrecursionlimit(10000
def prepare_factorial(mod=mod):
""" returns two lists, factorial and inverse factorial modulo argument by default 10**9 +7 """
# Comment code out when you don't need inverse factorial or vice versa
fact = [1]
for i in range(1, 200005):
fact.append((fact[-1] * i) % mod)
ifact = [0] * 200005
ifact[200004] = pow(fact[200004], mod - 2, mod)
for i in range(200004, 0, -1):
ifact[i - 1] = (i * ifact[i]) % mod
return fact, ifact
def modinv(n, p):
""" returns N inverse modulo p """
return pow(n, p - 2, p)
def ncr(n, r, fact, ifact):
""" takes 4 arguments: n , r and factorial and inverse factorial lists"""
t = (fact[n] * (ifact[r]*ifact[n-r]) % MOD)% MOD
return t
def get_n(Sum):
"""this function returns the maximum n for which Summation(n) <= Sum"""
ans = (-1 + sqrt(1 + 8*Sum))//2
return ans
def sieve(n):
""" returns a list of prime numbers till n """
if n < 2: return list()
prime = [True for _ in range(n + 1)]
p = 3
while p * p <= n:
if prime[p]:
for i in range(p * 2, n + 1, p):
prime[i] = False
p += 2
r = [2]
for p in range(3, n + 1, 2):
if prime[p]:
r.append(p)
return r
def divs(n, start=1):
""" returns a list of all divisors till n """
divisors = []
for i in range(start, int(math.sqrt(n) + 1)):
if n % i == 0:
if n / i == i:
divisors.append(i)
else:
divisors.extend([i, n // i])
return divisors
def divn(n, primes):
""" returns the number of divisors, two arguments n and the sieve till n """
divs_number = 1
for i in primes:
if n == 1:
return divs_number
t = 1
while n % i == 0:
t += 1
n //= i
divs_number *= t
def lrfind(d, x, default=-1):
""" Takes 2 arguments an iterable and an element. returns a tuple (firstoccurence,lastoccurence) -1 if not found """
left = right = -1
for i in range(len(d)):
if d[i] == x:
if left == -1: left = i
right = i
if left == -1:
return default, default
else:
return left, right
def gcd(x, y): # math.gcd is slower
""" returns greatest common divisor of x and y """
while y:
x, y = y, x % y
return x
def ceil(n, k=1): return n // k + (n % k != 0) #returns math.ceil but protecting against floating inconsistencies
def input(): return sys.stdin.readline().strip()
def ii(): return int(input()) #inputs integer
def mi(): return map(int, input().split()) # inputting space seperated variables for example x,y,z
def li(): return list(map(int, input().split())) #inputting a space seperated list of integers
def lw(): return input().split() #inputting a space seperated list of strings
def lcm(a, b): return abs(a * b) // gcd(a, b) #returns LCM of two arguments
def prr(a, sep=' ', end='\n'): print(sep.join(map(str, a)), end=end) #For printing an iterable with seperator sep as optional second argument (default : " "), ending character (default: "\n") as optional third
def dd(): return defaultdict(int) #returns a dictionary with values defaulted to 0
def ddl(): return defaultdict(list) #returns a dictionary with values defaulted to []
def write(s): return sys.stdout.write(s)
###################################################################
def main():
#CODE GOES HERE:
n=ii()
c=n/1.08
if int(int(c)*1.08)==n:
print(c)
elif int((int(c)+1 )*1.08)==n:
print(c+1)
else:
print(":(")
""" -------- Python 2 and 3 footer by Pajenegod and c1729 ---------"""
py2 = round(0.5)
if py2:
from future_builtins import ascii, filter, hex, map, oct, zip
range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192
class FastIO(BytesIO):
newlines = 0
def __init__(self, file):
self._file = file
self._fd = file.fileno()
self.writable = "x" in file.mode or "w" in file.mode
self.write = super(FastIO, self).write if self.writable else None
def _fill(self):
s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
return s
def read(self):
while self._fill(): pass
return super(FastIO, self).read()
def readline(self):
while self.newlines == 0:
s = self._fill();
self.newlines = s.count(b"\n") + (not s)
self.newlines -= 1
return super(FastIO, self).readline()
def flush(self):
if self.writable:
os.write(self._fd, self.getvalue())
self.truncate(0), self.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
if py2:
self.write = self.buffer.write
self.read = self.buffer.read
self.readline = self.buffer.readline
else:
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
""" main function"""
if __name__ == '__main__':
main()
# threading.Thread(target=main).start()
|
# 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 modules according to your need"""
# from bisect import bisect_left, bisect_right, insort
# from heapq import heappop, heapify, heappush
# from random import randint as rn
# from Queue import Queue as Q
# from copy import deepcopy
# from decimal import *
# import re
# import operator
#####################################################################################
# this enables you to write python3 code with PyPy2 (Python 2)
if sys.version_info[0] < 3:
input = raw_input
range = xrange
filter = itertools.ifilter
map = itertools.imap
zip = itertools.izip
#####################################################################################
"""value of mod"""
MOD = 998244353
mod = 10**9 + 7
"""Uncomment next 4 lines if doing huge recursion"""
# import threading
# threading.stack_size(1<<27)
# sys.setrecursionlimit(10000
def prepare_factorial(mod=mod):
""" returns two lists, factorial and inverse factorial modulo argument by default 10**9 +7 """
# Comment code out when you don't need inverse factorial or vice versa
fact = [1]
for i in range(1, 200005):
fact.append((fact[-1] * i) % mod)
ifact = [0] * 200005
ifact[200004] = pow(fact[200004], mod - 2, mod)
for i in range(200004, 0, -1):
ifact[i - 1] = (i * ifact[i]) % mod
return fact, ifact
def modinv(n, p):
""" returns N inverse modulo p """
return pow(n, p - 2, p)
def ncr(n, r, fact, ifact):
""" takes 4 arguments: n , r and factorial and inverse factorial lists"""
t = (fact[n] * (ifact[r]*ifact[n-r]) % MOD)% MOD
return t
def get_n(Sum):
"""this function returns the maximum n for which Summation(n) <= Sum"""
ans = (-1 + sqrt(1 + 8*Sum))//2
return ans
def sieve(n):
""" returns a list of prime numbers till n """
if n < 2: return list()
prime = [True for _ in range(n + 1)]
p = 3
while p * p <= n:
if prime[p]:
for i in range(p * 2, n + 1, p):
prime[i] = False
p += 2
r = [2]
for p in range(3, n + 1, 2):
if prime[p]:
r.append(p)
return r
def divs(n, start=1):
""" returns a list of all divisors till n """
divisors = []
for i in range(start, int(math.sqrt(n) + 1)):
if n % i == 0:
if n / i == i:
divisors.append(i)
else:
divisors.extend([i, n // i])
return divisors
def divn(n, primes):
""" returns the number of divisors, two arguments n and the sieve till n """
divs_number = 1
for i in primes:
if n == 1:
return divs_number
t = 1
while n % i == 0:
t += 1
n //= i
divs_number *= t
def lrfind(d, x, default=-1):
""" Takes 2 arguments an iterable and an element. returns a tuple (firstoccurence,lastoccurence) -1 if not found """
left = right = -1
for i in range(len(d)):
if d[i] == x:
if left == -1: left = i
right = i
if left == -1:
return default, default
else:
return left, right
def gcd(x, y): # math.gcd is slower
""" returns greatest common divisor of x and y """
while y:
x, y = y, x % y
return x
def ceil(n, k=1): return n // k + (n % k != 0) #returns math.ceil but protecting against floating inconsistencies
def input(): return sys.stdin.readline().strip()
def ii(): return int(input()) #inputs integer
def mi(): return map(int, input().split()) # inputting space seperated variables for example x,y,z
def li(): return list(map(int, input().split())) #inputting a space seperated list of integers
def lw(): return input().split() #inputting a space seperated list of strings
def lcm(a, b): return abs(a * b) // gcd(a, b) #returns LCM of two arguments
def prr(a, sep=' ', end='\n'): print(sep.join(map(str, a)), end=end) #For printing an iterable with seperator sep as optional second argument (default : " "), ending character (default: "\n") as optional third
def dd(): return defaultdict(int) #returns a dictionary with values defaulted to 0
def ddl(): return defaultdict(list) #returns a dictionary with values defaulted to []
def write(s): return sys.stdout.write(s)
###################################################################
def main():
#CODE GOES HERE:
n=ii()
c=n/1.08
if int(int(c)*1.08)==n:
print(int(c))
elif int((int(c)+1 )*1.08)==n:
print(int(c+1))
else:
print(":(")
""" -------- Python 2 and 3 footer by Pajenegod and c1729 ---------"""
py2 = round(0.5)
if py2:
from future_builtins import ascii, filter, hex, map, oct, zip
range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192
class FastIO(BytesIO):
newlines = 0
def __init__(self, file):
self._file = file
self._fd = file.fileno()
self.writable = "x" in file.mode or "w" in file.mode
self.write = super(FastIO, self).write if self.writable else None
def _fill(self):
s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
return s
def read(self):
while self._fill(): pass
return super(FastIO, self).read()
def readline(self):
while self.newlines == 0:
s = self._fill();
self.newlines = s.count(b"\n") + (not s)
self.newlines -= 1
return super(FastIO, self).readline()
def flush(self):
if self.writable:
os.write(self._fd, self.getvalue())
self.truncate(0), self.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
if py2:
self.write = self.buffer.write
self.read = self.buffer.read
self.readline = self.buffer.readline
else:
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
""" main function"""
if __name__ == '__main__':
main()
# threading.Thread(target=main).start()
|
[
"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
|
p02842
|
n = int(input())
import math
x = math.floor(n / 1.08)
m = math.floor(x * 1.08)
if m == n:
print(int(x))
else:
print(':(')
|
n = int(input())
import math
x = math.ceil(n / 1.08)
m = math.floor(x * 1.08)
if m == n:
print(int(x))
else:
print(':(')
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 647,324
| 647,325
|
u581403769
|
python
|
p02842
|
n = int(input())
a = int(n/1.08)
if int(a*1.08) == n:
print(a)
elif int((a+1)*1.08) == n:
print(a+1)
else:
(':(')
|
n = int(input())
a = int(n/1.08)
if int(a*1.08) == n:
print(a)
elif int((a+1)*1.08) == n:
print(a+1)
else:
print(':(')
|
[
"io.output.change",
"call.add"
] | 647,328
| 647,329
|
u227085629
|
python
|
p02842
|
import math
n = int(1078)
a = math.ceil(n/1.08)
b = math.floor(a*1.08)
print(a*(n == b) or ":(")
|
import math
n = int(input())
a = math.ceil(n/1.08)
b = math.floor(a*1.08)
print(a*(n == b) or ":(")
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"call.add"
] | 647,333
| 647,334
|
u094999522
|
python
|
p02842
|
import math
N = int(input())
a = math.floor(N / 1.08)
b = a + 1
aa = math.floor(a * 1.08)
bb = math.floor(b * 1.08)
if(aa == N):
print(aa)
else:
if(bb == N):
print(bb)
else:
print(":(")
|
import math
N = int(input())
a = math.floor(N / 1.08)
b = a + 1
aa = math.floor(a * 1.08)
bb = math.floor(b * 1.08)
if(aa == N):
print(a)
else:
if(bb == N):
print(b)
else:
print(":(")
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 647,338
| 647,339
|
u257332942
|
python
|
p02842
|
import math
N = int(input())
a = math.floor(N / 1.08)
b = a + 1
aa = math.floor(a * 1.08)
bb = math.floor(b * 1.08)
if(aa == N):
print(aa)
elif(bb == N):
print(bb)
else:
print(":(")
|
import math
N = int(input())
a = math.floor(N / 1.08)
b = a + 1
aa = math.floor(a * 1.08)
bb = math.floor(b * 1.08)
if(aa == N):
print(a)
else:
if(bb == N):
print(b)
else:
print(":(")
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 647,340
| 647,339
|
u257332942
|
python
|
p02842
|
#!/usr/bin/env python
# coding: utf-8
# In[18]:
N = int(input())
# In[23]:
for x in range(int(N * 10/11), N):
if x*1.08//1 == N:
print(x)
break
else:
print(":(")
# In[ ]:
|
#!/usr/bin/env python
# coding: utf-8
# In[39]:
N = int(input())
# In[40]:
for x in range(int(N * 10/11), N+1):
if (x*1.08)//1 == N:
print(x)
break
else:
print(":(")
# In[ ]:
|
[
"control_flow.branch.if.condition.change"
] | 647,345
| 647,346
|
u085717502
|
python
|
p02842
|
import sys
n = int(input())
for i in range(n):
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
|
import sys
n = int(input())
for i in range(1,n+1):
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
|
[
"call.arguments.add"
] | 647,349
| 647,350
|
u448720391
|
python
|
p02842
|
import sys
n = int(input())
for i in range(n):
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
|
import sys
n = int(input())
for i in range(1,n+1):
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
|
[
"call.arguments.add"
] | 647,351
| 647,350
|
u448720391
|
python
|
p02842
|
N = int(input())
for i in range(int(N * 0.9), N):
if int(i * 1.08) == N:
print(i)
break
else:
print(':(')
|
N = int(input())
for i in range(int(N * 0.9), N + 1):
if int(i * 1.08) == N:
print(i)
break
else:
print(':(')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,388
| 647,389
|
u888092736
|
python
|
p02842
|
X=int(input())
for i in range(1,X):
if int(i*1.08)==X:
print(i)
exit()
print(":(")
|
N=int(input())
for i in range(N+1):
if int(i*1.08)==N:
print(i)
exit()
print(":(")
|
[
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 647,392
| 647,393
|
u343977188
|
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+1):
if int(i*1.08) == n:
print(i)
exit()
print(':(')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,396
| 647,397
|
u238940874
|
python
|
p02842
|
n=int(input())
for i in range(1,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)
exit()
print(':(')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,398
| 647,399
|
u238940874
|
python
|
p02842
|
n = int(input())
for i in range(0,n):
if(int(i*1.08) == n):
print(i)
exit()
else:
continue
print(":(")
|
n = int(input())
for i in range(0,n+1):
if(int(i*1.08) == n):
print(i)
exit()
else:
continue
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,405
| 647,406
|
u955691979
|
python
|
p02842
|
import math
import sys
N = int(input())
ans = 1
while ans < N:
if(math.floor(ans * 1.08) == N):
print(ans)
sys.exit()
else:
ans += 1
print(":(")
|
import math
import sys
N = int(input())
ans = 1
while ans <= N:
if(math.floor(ans * 1.08) == N):
print(ans)
sys.exit()
else:
ans += 1
print(":(")
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 647,418
| 647,419
|
u301624971
|
python
|
p02842
|
from math import floor
def main():
N=int(input())
for i in range(1,N):
if floor(i*1.08) == N:
print(i)
exit()
print(':(')
main()
|
from math import floor
def main():
N=int(input())
for X in range(1,N+1):
if int(X*1.08) == N:
print(X)
exit()
print(':(')
main()
|
[
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 647,425
| 647,426
|
u114954806
|
python
|
p02842
|
import sys
N = int(input())
for n in range(N*100//110,N):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
import sys
N = int(input())
for n in range(N*100//108,N+1):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,429
| 647,430
|
u465900169
|
python
|
p02842
|
import sys
N = int(input())
for n in range(N*100//109,N):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
import sys
N = int(input())
for n in range(N*100//108,N+1):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,431
| 647,430
|
u465900169
|
python
|
p02842
|
import sys
N = int(input())
for n in range(N*100//108,N):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
import sys
N = int(input())
for n in range(N*100//108,N+1):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,432
| 647,430
|
u465900169
|
python
|
p02842
|
import sys
N = int(input())
for n in range(N*100//110,N):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
import sys
N = int(input())
for n in range(N*100//110,N+1):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,429
| 647,433
|
u465900169
|
python
|
p02842
|
import sys
N = int(input())
for n in range(N*100//109,N):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
import sys
N = int(input())
for n in range(N*100//110,N+1):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,431
| 647,433
|
u465900169
|
python
|
p02842
|
import sys
N = int(input())
for n in range(N*100//108,N):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
import sys
N = int(input())
for n in range(N*100//110,N+1):
if n*1.08//1 == N:
print(n)
sys.exit()
print(":(")
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,432
| 647,433
|
u465900169
|
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,434
| 647,435
|
u134019875
|
python
|
p02842
|
X = int(input())
for i in range(50000):
if int(i*1.05) == X:
print(i)
break
else:
print(':(')
|
X = int(input())
for i in range(50000):
if int(i*1.08) == X:
print(i)
break
else:
print(':(')
|
[
"literal.number.float.change",
"control_flow.branch.if.condition.change"
] | 647,438
| 647,439
|
u667084803
|
python
|
p02842
|
N = int(input())
for i in range(1,50001):
tmp = int(i * 1.08)
if(tmp == N):
print(str(tmp))
exit()
print(":(")
|
N = int(input())
for i in range(1,50001):
tmp = int(i * 1.08)
if(tmp == N):
print(str(i))
exit()
print(":(")
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 647,440
| 647,441
|
u851704997
|
python
|
p02842
|
N = int(input())
for i in range(1,101):
tmp = int(i * 1.08)
if(tmp == N):
print(str(tmp))
exit()
print(":(")
|
N = int(input())
for i in range(1,50001):
tmp = int(i * 1.08)
if(tmp == N):
print(str(i))
exit()
print(":(")
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"io.output.change"
] | 647,442
| 647,441
|
u851704997
|
python
|
p02842
|
import math
N = int(input())
result = float(N) / 1.08
result_int_floor = math.floor(result)
result_int_ceil = math.ceil(result)
if(math.floor(result_int_floor * 1.08) == N):
print(result_int_floor)
elif(math.floor(result_int_ceil * 1.08) == N):
print(result_int_ceil)
else:
print(": (")
|
import math
N = int(input())
result = float(N) / 1.08
result_int_floor = math.floor(result)
result_int_ceil = math.ceil(result)
if(math.floor(result_int_floor * 1.08) == N):
print(result_int_floor)
elif(math.floor(result_int_ceil * 1.08) == N):
print(result_int_ceil)
else:
print(":(")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 647,443
| 647,444
|
u694649864
|
python
|
p02842
|
import sys
n = int(input())
for i in range(n):
if i*108//100 == n:
print(i)
sys.exit()
print(":(")
|
import sys
n = int(input())
for i in range(n+1):
if i*108//100 == n:
print(i)
sys.exit()
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,447
| 647,448
|
u711238850
|
python
|
p02842
|
import sys
import math
input = sys.stdin.readline
def main():
_is_found = False
n = int(input())
for x in range(n):
if math.floor(x * 1.08) == n:
print(x)
_is_found = True
break
if not _is_found:
print(':(')
if __name__ == '__main__':
main()
|
import sys
import math
input = sys.stdin.readline
def main():
_is_found = False
n = int(input())
for x in range(n+1):
if math.floor(x * 1.08) == n:
print(x)
_is_found = True
break
if not _is_found:
print(':(')
if __name__ == '__main__':
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,449
| 647,450
|
u394731058
|
python
|
p02842
|
import sys
import math
input = sys.stdin.readline
def main():
_is_found = False
n = int(input())
for x in range(n):
if math.floor(x * 1.08) == n:
print(x)
_is_found = True
break
if _is_found:
print(':(')
if __name__ == '__main__':
main()
|
import sys
import math
input = sys.stdin.readline
def main():
_is_found = False
n = int(input())
for x in range(n+1):
if math.floor(x * 1.08) == n:
print(x)
_is_found = True
break
if not _is_found:
print(':(')
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change"
] | 647,452
| 647,450
|
u394731058
|
python
|
p02842
|
import math
N = int(input())
flg = False
for i in range(N):
if N == math.floor(i * 1.08):
flg = True
break
if flg:
print(i)
else:
print(":(")
|
import math
N = int(input())
flg = False
for i in range(N+1):
if N == math.floor(i * 1.08):
flg = True
break
if flg:
print(i)
else:
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,453
| 647,454
|
u922487073
|
python
|
p02842
|
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
from math import gcd
def resolve():
N=int(input())
for i in range(N):
if int(i*1.08)==N:
print(i)
return
print(":(")
#%%submit!
resolve()
|
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
from math import gcd
def resolve():
N=int(input())
for i in range(N+100):
if int(i*1.08)==N:
print(i)
return
print(":(")
#%%submit!
resolve()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,457
| 647,458
|
u857428111
|
python
|
p02842
|
from math import floor
n = int(input())
x = round(n/1.08)
y = floor(x * 1.08)
print(x if n == y else ':(')
|
from math import ceil, floor
n = int(input())
x = ceil(n/1.08)
y = floor(x * 1.08)
print(x if n == y else ':(')
|
[
"assignment.value.change",
"identifier.change",
"call.function.near.change"
] | 647,459
| 647,460
|
u333404917
|
python
|
p02842
|
import math
N = int(input())
ans =0
for i in range(N):
if int(i*1.08) == N:
print(i)
ans += 1
if ans == 0:
print(':(')
|
import math
N = int(input())
ans =0
for i in range(N+1):
if math.floor(i*1.08) == N:
print(i)
ans += 1
if ans == 0:
print(':(')
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 647,461
| 647,462
|
u733132703
|
python
|
p02842
|
import math
N = int(input())
ans =0
for i in range(N):
if math.floor(i*1.08) == N:
print(i)
ans += 1
break
if ans == 0:
print(':(')
|
import math
N = int(input())
ans =0
for i in range(N+1):
if math.floor(i*1.08) == N:
print(i)
ans += 1
if ans == 0:
print(':(')
|
[
"control_flow.break.remove"
] | 647,463
| 647,462
|
u733132703
|
python
|
p02842
|
import math
N = int(input())
ans =0
for i in range(N):
if math.floor(i*1.08) == N:
print(i)
ans += 1
if ans == 0:
print(':(')
|
import math
N = int(input())
ans =0
for i in range(N+1):
if math.floor(i*1.08) == N:
print(i)
ans += 1
if ans == 0:
print(':(')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,464
| 647,462
|
u733132703
|
python
|
p02842
|
N = int(input())
for i in range(1, N):
if int(i*1.08) == N:
print(i)
quit()
print(':(')
|
N = int(input())
for i in range(1, N+1):
if int(i*1.08) == N:
print(i)
quit()
print(':(')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,465
| 647,466
|
u922449550
|
python
|
p02842
|
N = int(input())
ans=-1
for i in range(1,N+1):
if int( i*1.08)==N:
ans = i
if ans == -1:
print(':(')
else:
print(i)
|
N = int(input())
ans=-1
for i in range(1,N+1):
if int( i*1.08) == N:
ans = i
if ans == -1:
print(':(')
else:
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 647,467
| 647,468
|
u827306875
|
python
|
p02842
|
import math
n = int(input())
ans = ':('
a = n / 1.08
for i in range(math.floor(a - 2) , math.ceil(a + 2)):
if math.floor(i * 1.08) == n:
ans = i
print(i)
break
|
import math
n = int(input())
ans = ':('
a = n / 1.08
for i in range(math.floor(a - 2) , math.ceil(a + 2)):
if math.floor(i * 1.08) == n:
ans = i
break
print(ans)
|
[
"control_flow.break.add",
"identifier.change",
"call.arguments.change",
"io.output.change",
"control_flow.break.remove"
] | 647,469
| 647,470
|
u215341636
|
python
|
p02842
|
import math
n = int(input())
for i in range(n):
if (i * 108 //100 == n):
print(i)
break
else:
print(":(")
|
import math
n = int(input())
for i in range(n+1):
if (i * 108 //100 == n):
print(i)
break
else:
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,475
| 647,476
|
u693933222
|
python
|
p02842
|
def resolve():
found = False
N = int(input())
for x in range(int(N/1.08), int((N+1)/1.08+1)):
if N == math.floor(x*1.08):
print(x)
found = True
break
if not found:
print(":(")
resolve()
|
import math
def resolve():
found = False
N = int(input())
for x in range(int(N/1.08), int((N+1)/1.08+1)):
if N == math.floor(x*1.08):
print(x)
found = True
break
if not found:
print(":(")
resolve()
|
[] | 647,477
| 647,478
|
u079626074
|
python
|
p02842
|
n=int(input())
for i in range(50000):
if int(i*1.08)== n:
print(i)
break
else:
print(':(')
break
|
n=int(input())
for i in range(50000):
if int(i*1.08)== n:
print(i)
exit()
print(':(')
|
[
"control_flow.break.remove"
] | 647,490
| 647,491
|
u755545520
|
python
|
p02842
|
import math
n = int(input())
a = math.ceil(n/1.08)
if n+1 > a*1.08 >= n:
print(a)
else:
print(':(')
print(a)
|
import math
n = int(input())
a = math.ceil(n/1.08)
if n+1 > a*1.08 >= n:
print(a)
else:
print(':(')
|
[
"call.remove"
] | 647,505
| 647,506
|
u326775883
|
python
|
p02842
|
import math
N = int(input())
res = []
for i in range(N):
cal = math.floor(i * 1.08)
if cal == N:
res.append(i)
if len(res) == 0:
print(':(')
else:
print(res[0])
|
import math
N = int(input())
res = []
for i in range(1,N+1):
cal = math.floor(i * 1.08)
if cal == N:
res.append(i)
if len(res) == 0:
print(':(')
else:
print(res[0])
|
[
"call.arguments.add"
] | 647,520
| 647,521
|
u956257368
|
python
|
p02842
|
N=int(input())
flg=False
ans=0
for n in range(1, N+1):
if (int(1.08*n) == N):
ans=n
flg=True
if flg:
print(n)
else:
print(':(')
|
N=int(input())
flg=False
ans=0
for n in range(1, N+1):
if (int(1.08*n) == N):
ans=n
flg=True
if flg:
print(ans)
else:
print(':(')
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 647,529
| 647,530
|
u746154235
|
python
|
p02842
|
n = int(input())
for x in range(int(n / 1.1), n):
if int(x * 1.08) == n:
print(x)
exit(0)
print(':(')
|
n = int(input())
for x in range(int(n / 1.1), n + 1):
if int(x * 1.08) == n:
print(x)
exit(0)
print(':(')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,546
| 647,547
|
u578854679
|
python
|
p02842
|
import sys
input=sys.stdin.buffer.readline
N=int(input())
tax=27/25
for i in range(1,N):
money=int(i*tax)
if money==N:
print(i)
exit(0)
print(":(")
|
import sys
input=sys.stdin.buffer.readline
N=int(input())
tax=27/25
for i in range(1,N+1):
money=int(i*tax)
if money==N:
print(i)
exit(0)
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,555
| 647,556
|
u690037900
|
python
|
p02842
|
import sys
input=sys.stdin.buffer.readline
N=int(input())
tax=27/25
for i in range(1,N):
money=int(i*tax)
if money==N:
print(money)
exit(0)
print(":(")
|
import sys
input=sys.stdin.buffer.readline
N=int(input())
tax=27/25
for i in range(1,N+1):
money=int(i*tax)
if money==N:
print(i)
exit(0)
print(":(")
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 647,557
| 647,556
|
u690037900
|
python
|
p02842
|
N = int(input())
flag = 0
for i in range(1,54001):
if math.floor(i*1.08) == N:
print(i)
flag += 1
break
if flag == 0:
print(":(")
|
import math
N = int(input())
flag = 0
for i in range(1,54001):
if math.floor(i*1.08) == N:
print(i)
flag += 1
break
if flag == 0:
print(":(")
|
[] | 647,569
| 647,570
|
u556589653
|
python
|
p02842
|
N = int(input())
ans = 0
k = 0
for i in range(N):
if N<=i*1.08<N+1:
print(i)
ans += 1
break
if ans == 0:
print(":(")
|
N = int(input())
ans = 0
k = 0
for i in range(N+1):
if N<=i*1.08<N+1:
print(int(i))
ans += 1
break
if ans == 0:
print(":(")
|
[
"call.add",
"call.arguments.change"
] | 647,571
| 647,572
|
u556589653
|
python
|
p02842
|
N = int(input())
ans = 0
k = 0
for i in range(N):
if N<=i*1.08<N+1:
print(i)
ans += 1
break
if ans == 0:
print(":(")
|
N = int(input())
ans = 0
k = 0
for i in range(N+1):
if N<=i*1.08<N+1:
print(int(i))
ans += 1
break
if ans == 0:
print(":(")
|
[
"call.add",
"call.arguments.change"
] | 647,571
| 647,573
|
u556589653
|
python
|
p02842
|
N = int(input())
if N%27!=26 and N%27!=13:
print(round(N/1.08))
else:
print(':(')
|
import math
N = int(input())
if N%27!=26 and N%27!=13:
print(math.ceil(N/1.08))
else:
print(':(')
|
[
"call.arguments.change",
"io.output.change"
] | 647,577
| 647,578
|
u779293207
|
python
|
p02842
|
import sys
input = sys.stdin.readline
def main():
n = int(input())
for x in range(1, n):
if int(x * 1.08) == n:
print(x)
return
print(":(")
main()
|
import sys
input = sys.stdin.readline
def main():
n = int(input())
for x in range(1, n+1):
if int(x * 1.08) == n:
print(x)
return
print(":(")
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,581
| 647,582
|
u560867850
|
python
|
p02842
|
import math
N = int(input())
def solve(n):
for i in range(n):
if math.floor(i * 1.08) == n:
print(i)
return
print(':(')
solve(N)
|
import math
N = int(input())
def solve(n):
for i in range(n + 1):
if math.floor(i * 1.08) == n:
print(i)
return
print(':(')
solve(N)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,585
| 647,586
|
u992622610
|
python
|
p02842
|
n = int(input())
ans = -1
for x in range(n):
tmp = int(x*1.08)
if tmp == n:
ans = x
break
if ans == -1:
print(":(")
else:
print(ans)
|
n = int(input())
ans = -1
for x in range(n+1):
tmp = int(x*1.08)
if tmp == n:
ans = x
break
if ans == -1:
print(":(")
else:
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,587
| 647,588
|
u141410514
|
python
|
p02842
|
n=int(input())
for i in range(1,50001):
if i*1.08==n:
print(i)
exit()
print(":(")
|
n=int(input())
for i in range(1,50001):
if int(i*1.08)==n:
print(i)
exit()
print(":(")
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 647,597
| 647,598
|
u518064858
|
python
|
p02842
|
#!/usr/bin/env python3
import sys
import copy
from collections import deque
def main():
n =int(input())
for i in range(n):
if int(i*1.08)==n:
print(i)
sys.exit(0)
print(':(')
main()
|
#!/usr/bin/env python3
import sys
import copy
from collections import deque
def main():
n =int(input())
for i in range(n+1):
if int(i*1.08)==n:
print(i)
sys.exit(0)
print(':(')
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,603
| 647,604
|
u846813901
|
python
|
p02842
|
N = int(input())
def ans(N):
for x in range(1, N):
if int(x * 1.08) == N:
return x
return ":("
print(ans(N))
|
N = int(input())
def ans(N):
for X in range(1, N+1):
if int(X * 1.08) == N:
return X
return ":("
print(ans(N))
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"function.return_value.change"
] | 647,610
| 647,611
|
u997641430
|
python
|
p02842
|
import math
N = int(input())
f = int(N // 1.1)
ok = False
while True:
n = math.ceil(f * 1.08)
if n == N:
ok = True
break
elif N < n:
break
f += 1
if not ok:
print(':(')
else:
print(f)
|
import math
N = int(input())
f = int(N // 1.1)
ok = False
while True:
n = math.floor(f * 1.08)
if n == N:
ok = True
break
elif N < n:
break
f += 1
if not ok:
print(':(')
else:
print(f)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 647,612
| 647,613
|
u593567568
|
python
|
p02842
|
import math
N = int(input())
f = N // 1.1
ok = False
while True:
n = math.ceil(f * 1.08)
if n == N:
ok = True
break
elif N < n:
break
f += 1
if not ok:
print(':(')
else:
print(n)
|
import math
N = int(input())
f = int(N // 1.1)
ok = False
while True:
n = math.floor(f * 1.08)
if n == N:
ok = True
break
elif N < n:
break
f += 1
if not ok:
print(':(')
else:
print(f)
|
[
"call.add",
"call.arguments.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"io.output.change"
] | 647,614
| 647,613
|
u593567568
|
python
|
p02842
|
import math
N = int(input())
x = math.floor(N/1.08)
if x*1.08//1 == N:
print(x)
else:
print(":(")
|
import math
N = int(input())
x = math.ceil(N/1.08)
if x*1.08//1 == N:
print(x)
else:
print(":(")
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 647,617
| 647,618
|
u511457539
|
python
|
p02842
|
N = int(input())
for i in range(0,50001):
if int(i*1.08)==N:
print(N)
exit()
print(":(")
|
N = int(input())
for i in range(0,N+1):
if int(i*1.08)==N:
print(i)
exit()
print(":(")
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"io.output.change"
] | 647,619
| 647,620
|
u497952650
|
python
|
p02842
|
n = int(input())
f = 0
for i in range(n):
if int(i*1.08) == n:
print(i)
exit()
print(':(')
|
n = int(input())
f = 0
for i in range(1, n+1):
if int(i*1.08) == n:
print(i)
exit()
print(':(')
|
[
"call.arguments.add"
] | 647,625
| 647,626
|
u488884575
|
python
|
p02842
|
import math
ans = -1
n = int(input())
for i in range(1, n):
if math.floor(i * 1.08) == n:
ans = i
break
print(ans if ans != -1 else ":(")
|
import math
ans = -1
n = int(input())
for i in range(1, n+1):
if math.floor(i * 1.08) == n:
ans = i
break
print(ans if ans != -1 else ":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,627
| 647,628
|
u148551245
|
python
|
p02842
|
def resolve():
N = int(input())
x = int(N // 1.08)
if math.floor(x * 1.08) == N:
print(x)
elif math.floor((x + 1) * 1.08) == N:
print(x + 1)
else:
print(":(")
if __name__ == "__main__":
resolve()
|
import math
def resolve():
N = int(input())
x = int(N // 1.08)
if math.floor(x * 1.08) == N:
print(x)
elif math.floor((x + 1) * 1.08) == N:
print(x + 1)
else:
print(":(")
if __name__ == "__main__":
resolve()
|
[] | 647,629
| 647,630
|
u234091409
|
python
|
p02842
|
N = int(input())
for i in range(1, 50001):
if int(1.08 * i) == N:
print(i)
break
else:
print(":)")
|
N = int(input())
for i in range(1, 50001):
if int(1.08 * i) == N:
print(i)
break
else:
print(":(")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 647,633
| 647,634
|
u346812984
|
python
|
p02842
|
n = int(input())
for i in range(n):
tmp=i*1.08//1
if tmp==n:
print(i)
exit(0)
print(":(")
|
n = int(input())
for i in range(50000):
tmp=i*1.08//1
if tmp==n:
print(i)
exit(0)
print(":(")
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,649
| 647,650
|
u297651868
|
python
|
p02842
|
n = int(input())
for i in range(n):
tmp=i*1.08//1
if tmp==n:
print(tmp)
exit(0)
print(":(")
|
n = int(input())
for i in range(50000):
tmp=i*1.08//1
if tmp==n:
print(i)
exit(0)
print(":(")
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"io.output.change"
] | 647,651
| 647,650
|
u297651868
|
python
|
p02842
|
import math
n = int(input())
x = math.ceil(n / 1.08)
result = math.floor(x * 1.08)
if (result == n):
print(result)
else:
print(":(")
|
import math
n = int(input())
x = math.ceil(n / 1.08)
result = math.floor(x * 1.08)
if (result == n):
print(x)
else:
print(":(")
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 647,654
| 647,655
|
u994502918
|
python
|
p02842
|
import sys
n=int(input())
for i in range(n):
if (int(i*108/100)==n):
print (i)
sys.exit()
print(":(")
|
import sys
n=int(input())
for i in range(n+10):
if (int(i*108/100)==n):
print (i)
sys.exit()
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,658
| 647,659
|
u791146764
|
python
|
p02842
|
import sys
n=int(input())
for i in range(n):
if (i*108/100==n):
print (i)
sys.exit()
print(":(")
|
import sys
n=int(input())
for i in range(n+10):
if (int(i*108/100)==n):
print (i)
sys.exit()
print(":(")
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 647,660
| 647,659
|
u791146764
|
python
|
p02842
|
n = int(input())
for i in range(n):
if (i * 1.08)//1 == n:
print(i)
break
else:
print(":(")
|
n = int(input())
for i in range(n+1):
if (i * 1.08)//1 == n:
print(i)
break
else:
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,663
| 647,664
|
u136843617
|
python
|
p02842
|
n = int(input())
for i in range(1,n):
txd = int(i*1.08)
if n==txd:
print(i)
exit()
print(":(")
|
n = int(input())
for i in range(1,n+1):
txd = int(i*1.08)
if n==txd:
print(i)
exit()
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,665
| 647,666
|
u987326700
|
python
|
p02842
|
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math
n = int(input())
for i in range(n):
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
|
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math
n = int(input())
for i in range(n+1):
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,680
| 647,681
|
u379142263
|
python
|
p02842
|
N = int(input())
n = 0
import math
for i in range(1, N):
if math.floor(i*1.08) == N:
print(i)
n = 1
break
if n ==0 :
print(':(')
|
N = int(input())
k = 0
import math
for i in range(1, N+1):
if math.floor(i*1.08) == N:
print(i)
k = 1
break
if k ==0 :
print(':(')
|
[
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 647,687
| 647,688
|
u677842374
|
python
|
p02842
|
import math
n = int(input())
ans = 0
for i in range(n):
if math.floor(i * 1.08) == n:
ans = i
break
if ans == 0:
print(":(")
else:
print(ans)
|
import math
n = int(input())
ans = 0
for i in range(n+1):
if math.floor(i * 1.08) == n:
ans = i
break
if ans == 0:
print(":(")
else:
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,697
| 647,698
|
u896791216
|
python
|
p02842
|
import math
N = int(input())
X_MAX = int(math.ceil(50000 / 1.08))
ans = ':('
for i in range(X_MAX + 1):
if i * 1.08 == N:
ans = i
break
print(ans)
|
import math
N = int(input())
X_MAX = int(math.ceil(50000 / 1.08))
ans = ':('
for i in range(X_MAX + 1):
if int(i * 1.08) == N:
ans = i
break
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 647,709
| 647,710
|
u701318346
|
python
|
p02842
|
N = int(input())
flag = True
for i in range(N, 1, -1):
if int(i*1.08) == N:
print(i)
flag = False
break
if flag:
print(':(')
|
N = int(input())
flag = True
for i in range(N, 0, -1):
if int(i*1.08) == N:
print(i)
flag = False
break
if flag:
print(':(')
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 647,727
| 647,728
|
u282657760
|
python
|
p02842
|
n=int(input())
for i in range(n):
if int(1.08*i)==n:
print(i)
exit()
print(':(')
|
n=int(input())
for i in range(n+1):
if int(1.08*i)==n:
print(i)
exit()
print(':(')
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,742
| 647,743
|
u169138653
|
python
|
p02842
|
n=int(input())
for i in range(n):
if int(1.08*i)==n:
print(i)
break
print(':(')
|
n=int(input())
for i in range(n+1):
if int(1.08*i)==n:
print(i)
exit()
print(':(')
|
[
"control_flow.break.remove",
"control_flow.exit.add",
"call.add"
] | 647,744
| 647,743
|
u169138653
|
python
|
p02842
|
import sys
def main():
N=int(input())
for x in range(50001):
if(int(x*1.08)==N):
print(x)
sys.exit()
main()
|
import sys
def main():
N=int(input())
for x in range(50001):
if(int(x*1.08)==N):
print(x)
sys.exit()
print(":(")
main()
|
[
"call.add"
] | 647,754
| 647,755
|
u489762173
|
python
|
p02842
|
n = int(input())
for i in range(n):
if int(i*1.08) == n:
print(i)
exit()
else:
print(':(')
|
n = int(input())
for i in range(1, n+1):
if int(i*1.08) == n:
print(i)
exit()
else:
print(':(')
|
[
"call.arguments.add"
] | 647,756
| 647,757
|
u186838327
|
python
|
p02842
|
N = int(input())
count = 0
for i in range(N):
if N <= int(i*1.08) < N+1:
print(i)
count += 1
break
if count == 0:
print(":(")
|
N = int(input())
count = 0
for i in range(N+1):
if N <= int(i*1.08) < N+1:
print(i)
count += 1
break
if count == 0:
print(":(")
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 647,759
| 647,760
|
u769551032
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.