Problem:


Score: 200 points

Problem Statement

Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.

The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).

Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.

If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.

Constraints

1 \leq N \leq 50000

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If there are values that could be X, the price of the apple pie before tax, print any one of them.

If there are multiple such values, printing any one of them will be accepted.

If no value could be X, print :(.

Sample Input 1

432

Sample Output 1

400

If the apple pie is priced at 400 yen before tax, you have to pay 400 \times 1.08 = 432 yen to buy one.

Otherwise, the amount you have to pay will not be 432 yen.

Sample Input 2

1079

Sample Output 2

:(

There is no possible price before tax for which you have to pay 1079 yen with tax.

Sample Input 3

1001

Sample Output 3

927

If the apple pie is priced 927 yen before tax, by rounding down 927 \times 1.08 = 1001.16, you have to pay 1001 yen.



Sample input:
432


Sample output:
400

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

X = math.ceil(N / 1.08)
converted = int(X * 1.08)
if X == converted:
    print(X)
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

def main():
    N = int(input())

    for Ans in range(N):
        Check = int(Ans * 1.08)
        if Check == N:
            print(Ans)
            return

    print(":(")
        


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
A=int(input())
B=(A*100)//108
if((((B*1.08)//1)==A) or ((((B+1)*1.08)//1)==A)):
    print(B)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
import math
N = int(input())

X=math.floor(N/1.08)
X2=math.floor(X*1.08)

if N==X2:
  print(X)
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
def solve(zeikomi: int):
    for zeinuki in range(zeikomi):
        if int(zeinuki * 1.08) == zeikomi:
            return zeinuki
    return None


zeikomi = int(input().strip())
zeinuki = solve(zeikomi)
if zeinuki is not None:
    print(zeinuki)
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n = int(input())
f = int(n/1.08)
if int(f*1.08) != n and int((f+1)*1.08) != n:
  print(':(')
else:
  print(f)

Submission status: Wrong Answer

Solution code:
n = int(input())
ok = False
for i in range(1,n):
    if int(i*1.08)==n:
        print(i)
        ok = True
        break
if ok==False:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(1, n):
  ans = int(i*1.08)
  if ans == n:
    print(i)
    exit()
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
import sys
n = int(input())
for i in range(1, n+1):
	if i*1.08 == n:
		print(i)
		sys.exit()
print(":(")

Submission status: Wrong Answer

Solution code:
n= int(input())
if int(-(-n//1.08)*1.08) == n:
    print(int(n//1.08))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
N=int(input())
if N%27==13 or N%27==26:
  print(':(')
else:
  print((N*50)//54)

Submission status: Wrong Answer

Solution code:
N = int(input())

origin = N//1.08

if N == origin * 1.08:
  print(int(origin))
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())


if (n+1)/1.08-n/1.08>=1:
    print(int(n/1.08))
elif n/1.08==int(n/1.08) or n/1.08+1<(n+1)/1.08:
    print(int((n+1)/1.08))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
A=int(input())
B=(A*100)//108
print(((B+1)*1.08)//1)
if((((B*1.08)//1)==A) or ((((B+1)*1.08)//1)==A)):
    print(B)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
if math.ceil(N / 1.08) == round(N/1.08):
    print(math.ceil(N / 1.08))
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n = int(input())
x = n /1.08
if x.is_integer():
    print(int(x))
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
N = int(input())
X = N/1.08
if(int(int(X)*1.08)==N):
    print(int(X))
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

for i in range(N):
    if N == math.floor(i * 1.08):
        ans = i
        break
    else:
        ans = ":("
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

for x in range(900000 + 1):
    if round(x * 1.08) == N:
        print(x)
        break
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n=int(input())
if (n+1)%27==0:
    print(':(')
elif(n%27)==0:
    print(n*25//27)
else:
    print(n*25//27+1)

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(N):
    x = i * 108 // 100
    if x == N:
        print(i)
        exit()

print(":(")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

N = int(input())

for n in range(N):
    if int(n * 1.08) == N:
        print(n)
        exit()
    elif int(n * 1.08) > N:
        print(":(")
        exit()

Submission status: Wrong Answer

Solution code:
N=int(input())
if N%54==13 or N%54==26:
  print(':(')
else:
  print((N*50)//54)

Submission status: Wrong Answer

Solution code:
X = int(input())
flag = False
for i in range(X+1):
    if(int(i * 1.08) == X):
        flag = True

if flag:
    print(1)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

NN = math.floor(N / 1.08)

NNN = math.floor(NN*1.08)

print(NN, NNN)

if N == NNN:
    print(NN)
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
import math

n=int(input())

x_lst=[]
for i in range(1,50000):
    x_lst.append(math.floor(i*1.08))

if n in x_lst:
    print(round(n/1.08))
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
A=int(input())
B=(A*100)//108
print(((B+1)*1.08)//1)
if((((B*1.08)//1)==A) or ((((B+1)*1.08)//1)==A)):
    print(B)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#solve
def solve():
    x = II()
    a = x / 1.08
    if a.is_integer():
        print(int(a))
    else:
        print(":(")
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
N = int(input())

tmp = round(N/1.08)
# print(tmp)
# print(tmp*1.08)
if int(tmp * 1.08) == N:
    print(tmp)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
taxoff = n/1.08
if taxoff - round(taxoff) == 0 :
    print(int(taxoff))
else :
    print(":(")

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
a = math.floor(n / 1.08)
b = math.floor(a * 1.08)
print(a if n == b else ":(")

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n):
	if int(i*(108/100)) == n:
		print(i)
		exit(0)
print(":(")

Submission status: Wrong Answer

Solution code:
import math

n = input()
n = int(n)

a = n / 1.08
b = (n+1) / 1.08

x = math.ceil(a)

if x == b:
  print(":(")
else:
  print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())
x = N // 1.08
x = round(x)
if x %2 == 0:
    print(int(x))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n=int(input())
a = n//1.08
if int(a*1.08)==n:
  print(a)
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = (n/108)*100
k = int(a)
p = 0
if a >= k+0.5:
  p = k+1
  if (p*108)//100 != n:
    print(':(')
  else:
    print(p)
else:
  p = k
  if (p*108)//100 != n:
    print(':(')
  else:
    print(p)

Submission status: Wrong Answer

Solution code:
import sys
n = int(input())
for i in range(n):
    if n <= i*1.08 <n+1:
        print(i)
        sys.exit()
print(":(")

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
for i in range(1,50001):
  if math.floor(i*1.08) == N:
    print(math.floor(i*1.08))
    exit()
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())
X = N / 1.08
if X % 1 == 0:
    print(int(X))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
X = int(input())
ans = round(X/1.08,0)
if(X == int(ans*1.08)):
    print(int(ans))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

ans = n // 1.08 + 1
val = math.floor(ans * 1.08)

print(ans, val)
if val == n:
    print(int(ans))
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
N = int(input())

#int(X * 1.08) = N
#∴X = N/1.08

for i in range(N):
  if int(i*1.08)==N:
    print(i)
    break
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
n=int(input())
ans=":("

for i in range(50000):
    if i*1.08==n:
        ans=i

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(N):
    if int(1.08*i) == N:
        print(i)
        exit()
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
N = int(input())
X = N / 1.08
print(int(X))

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(0, N):
    if int(i * 1.08) == N:
        print(i)
        break
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#solve
def solve():
    x = II()
    a = x / 1.08
    if a.is_integer():
        print(a)
    else:
        print(":(")
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
n=int(input())
if int((n+1)/1.08)>=n/1.08:
	print(int((n+1)/1.08))
else:
	print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n):
  ans = int(i*1.08)
  if ans == n:
    print(i)
    exit()
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
import math
N=int(input())
x=N/1.08

if x>0:
  print(math.ceil(x))
else:
  print(":(")

Submission status: Wrong Answer

Solution code:

N= int(input())
X1 = N / 1.08
X = int(X1)
N_calc = int(X*1.08)
if N_calc == N:
  print(X)
else :
  print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
res = ":("
for i in range(n):
    if(int(i * 1.08) == n): 
        res = i
        break
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())
flag=False

for i in range(50000):
  if int(i*1.08) ==N:
    print(i)
    flag=True
    break
    
if flag==False:
  print(":)")

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = n/1.08
ans = round(ans)
if ans*1.08 >= n:
	print(ans)
else:
	print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
f = int(n/1.08)
if (f+1)*1.08 != n:
  print(':(')
else:
  print(f)

Submission status: Wrong Answer

Solution code:
round = lambda x: int((x * 2 + 1) // 2)

N = int(input())
X = round(N / 1.08)
print(X if int(X * 1.08) == N else ':(')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
n = int(input())
ans = n / 1.08
for i in range(n):
    if int(i * 1.08) == n:
        print(i)
        exit()
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
N = int(input())
fX = N / 1.08
iX = int(fX)

if fX > iX:
  print(iX + 1)
else:
  print(iX)

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(a/1.08)
if a==b*1.08:
  print(b)
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())

x = round(N / 1.08)
for i in range(x - 10000, x + 10000):
    if round(x * 1.08) == N:
        print(x)
        break
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
N = int(input())

if N * 100 % (108) != 0:
    print(":(")
else:
    print(N *100// 108)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = int(n / 1.09)
b = int(n / 1.07)

flag = 0
for i in range(a, b):
    if int(1.08 * i) == n:
        print(i)
        flag = 1
        break
if flag == 0:
    print(':(')

Submission status: Wrong Answer

Solution code:
import math

n = input()
n = int(n)

a = n / 1.08
b = (n+1) / 1.08

x = math.ceil(n)

if n == b:
  print(":(")
else:
  print(x)

Submission status: Wrong Answer

Solution code:
import math
n=int(input())

for i in range(n):
  if math.floor(i*1.08)==n:
    print(i)
    exit()
print(':(')

Submission status: Wrong Answer

Solution code:
n = int(input())
x = int((n + 0.000001) // 1.08)
print(x if int(x * 1.08) == n else ':(')

Submission status: Wrong Answer

Solution code:
N=int(input())
X=int(N//1.1)
ans=":("
for i in range(X, N):
  if int(i*1.08)==N:
    ans=i
    break
print(ans)

Submission status: Wrong Answer

Solution code:
n= int(input())
if int(-(-n//1.08)*1.08) == n:
    print(n//1.08)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
# coding:utf-8
N = int(input())
x = int(N/1.08)
if x*1.08 == N:
  print(x)
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())

k = n*100/108
k = int(k)

ans = ":("
for i in range(-1,2):
  if n==int(k*1.08):
    ans = k+i
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
result = N / (108 / 100)
# 再代入しない癖がついてる
result = round(result)
reversed_result = int(result * 1.08)
if reversed_result != N:
    print(':(')
    exit(0)
print(result)

Submission status: Wrong Answer

Solution code:
from sys import stdin


def input():
    return stdin.readline()[:-1]


def intput():
    return int(input())


def sinput():
    return input().split()


def intsput():
    return map(int, sinput())


# Code

n = intput()

x = round(n / 1.08)


for t in range(x - 1000, x + 1000):
    if round(t * 1.08) == n and t > 0:
        print(t)
        break
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = ":("
for x in range(1, N):
  n = int(x * 1.08)
  if n == N:
    ans = x
    break
print(ans)

Submission status: Wrong Answer

Solution code:
print(round(int(input())/1.08))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=int(n/1.08)
if a*1.08==n:
    print(a)
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
#[int(i) for i in input().split()]
import math

n = int(input())
genka_min = (n-1) * 100 // 108
genka_max = (n+2) * 100 // 108
ok = 0
if genka_min == genka_max:
    ok = 1
    ans = genka_min

for i in range(genka_min,genka_max):
    #print(i)
    if math.floor(i * 1.08) == n:
        ok = 1
        ans = i
if ok:
    print(ans)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if int(i*1.08)==n:
        print(i)
        break
else:print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(1, N+1):
    if round(i * 1.08) == N:
        print(i)
        exit()


print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = (n + 0.5) / 1.08
b = n / 1.08
# print(a,b)
ans = -1
for i in range(int(b)-2,int(a)+2):
    if n <= i*1.08 < n+0.5:
        ans = i
        break
if ans == -1:
    print(":(")
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(a / 1.08)
if int(b * 1.08) == a:
  print(b)
else:
  print(':(')

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
for i in range(50001):
  if math.floor(i*1.08) == N:
    print(math.floor(i*1.08))
    exit()
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
a = n / 1.08
b = math.floor(a * 1.08)
print(a if n == b else ":(")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N = inputInt()

	ans = N / 1.08

	if isinstance(ans, int):
		print(int(ans))
	else:
		print(":(")






if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(1, N):
    if N <= i * 1.08  < N + 1:
        print(i)
        exit()
print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())

flag = 1
X_ = -1
for X in range(N):
    money = int(X * 1.08)
    if N == money:
        X_ = X
        flag = 0
        break

if flag == 0:
    print(X)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())
flag=False

for i in range(50000):
  if int(i*1.08) ==N:
    print(i)
    flag=True
    
if flag==False:
  print(":)")

Submission status: Wrong Answer

Solution code:
N = int(input())

M = N / 1.08
A = int(int(M) * 1.08)
if A == N:
    print(int(M))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
def num():
    return int(input())

def nums():
    return list(map(int,input().split()))

#A
"""
M1,D1 = nums()
M2,D2 = nums()
print(int(M1 != M2))
"""
#B
N = num()
without_tax = N / 1.08
if int(int(without_tax) * 1.08) == N:
    print(int(without_tax))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
N=int(input())
a=N/1.08
b=(N+1)/1.08
if a//1 == a:
  print(int(a))
elif a//1 ==b//1:
  print(":(")
else:
  print(int(a//1+1))

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
for  i in range(N):
    if  math.floor(i * 1.08) == N:
        print(i)
        exit()
print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())
x = N / 1.08
if x %2 == 0:
    print(int(x))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
taxoff = n/1.08
if taxoff - round(taxoff) == 0 :
    print(round(taxoff))
else :
    print(":(")

Submission status: Wrong Answer

Solution code:
n=int(input())
x=n//1.08
if x*1.08//1==n:
    print(x)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n):
	if i*108//100 == n:
		print(i)
		exit(0)
print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
for i in range(1,n):
    res = int(i*1.08)
    if res == n:
        ans = i
if ans == 0:
    print(':(')
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = 1
while x < n:
    if int(x * 1.08) == n:
        break
    else:
        x += 1
if(x < n):
    print(x)
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n/1.08
b = (n+1)/1.08
if int(b) < a:
    print(':(')
else:
    print(int(b))

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
ans=n/1.08
ans=int(math.ceil(ans))
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
for i in range(N):
    if int(i*1.08)==N:
        print(i)
        break
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = (n + 0.5) / 1.08
b = n / 1.08
# print(a,b)
ans = -1
for i in range(int(b)-2,int(a)+2):
    if b <= i < a:
        ans = i
        break
if ans == -1:
    print(":(")
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
if (n+1)%27==0:
    print(':(')
elif(n%27)==0:
    print(int(n*25/27))
else:
    print(int(n*25/27+1))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

N = int(input())
# X, Y = map(int,input().split())
# Z, W = map(int,input().split())
# vA = list(map(int, input().split()))

for x in range(N):
    if int(x * 1.08) == N:
        print(x)
        exit(0)
print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
x = int(n*0.8)

for i in range(x,n):
    if int(i*1.08)==n:
        print(i)
        exit()
print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())


def ans(N):
    for x in range(1, N):
        if int(x * 1.08) == N:
            return x
    return ":("


print(ans(N))

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

X = math.ceil(N / 1.08)
print(X)

Submission status: Wrong Answer

Solution code:
n=int(input())

ans = 0
for i in range(n):
    if int(i*1.08)==n:
        ans = i
        break
if ans!=0:
    print(ans) 
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = N/1.08
if ans.is_integer():
    print(int(ans))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())
X = round(N / 1.08)
print(X if int(X * 1.08) == N else ':(')

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
a = n / 1.08
b = math.floor(a * 1.08)
print(a if a == b else ":(")

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=':('
for i in range(n):
  if i*1.08//1==n:
    ans=i
    break
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

A = int(N // 1.1)

for a in range(A, N):
    if int(a * 1.08) == N:
        print(a)
        break

else:
    print(':(')

Submission status: Wrong Answer

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

N=one_int()

flg=True
for i in range(N):
    if int(i*1.08) == N:
        print(i)
        flg=False
        break
if flg:
    print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ":("
for i in range(N):
    if int(i*1.08) == N:
        ans = i
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

if ((N*100)%108 == 0):
    print(int(N/1.08))
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
for x in range(n):
    if x*1.08//1 == n:
        print(x)
        break
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n = int(input())
for x in range(n):
    if x * 108 // 100 == n:
        print(x)
        break
else:
    print(':(')

Submission status: Wrong Answer

Solution code:


def main():
    import math
    N=int(input())
    ans=-1
    for i in range(N):
        if math.floor(i*1.08)==N:
            ans=i
            print(ans)
            break
    if ans==-1: print(":(")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys

NO = ":("
def solve(N: int):
    for i in range(1,50001):
        if i >= N:
            break

        if int(i*1.08) == N:
            print(i)
            return
    
    print(NO)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


show_flg = False
# show_flg = True


def main():
    N = int(input())

    for i in range(math.floor(N * 1.08)):
        if N == math.floor(i * 1.08):
            print(i)
            return

    print(':(')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N = inputInt()

	ans = -(-N // 1.08)

	print(int(ans))


if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:

N = int(input())

def solve(N):
    for i in range(N):
        if int(i * 1.08) == N:
            return i
    return ":("
print(solve(N))

Submission status: Wrong Answer

Solution code:
from math import floor

n = int(input())

bl = False
for x in range(1, 60000):
    if floor(x * 1.08) == n:
        bl = True
        break

print(x if bl else -1)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import floor
N = int(input())
for t in range(1, N):
    if floor(t * 1.08) == N:
        print(t)
        exit()
print(":(")

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
for i in range(N):
    if int(i*1.08) == N:
        print(i)
        sys.exit()
    else:
        None
print(":(")

Submission status: Wrong Answer

Solution code:
n = int(input())
x = round(n / 1.08)
print(x if int(x * 1.08) == n else ":(")

Submission status: Wrong Answer

Solution code:
import math
import sys
n = int(input())

for i in range(n):
  if math.floor(i*1.08) == n:
    print(i)
    sys.exit(0)
    

print(':(')

Submission status: Wrong Answer

Solution code:
n=int(input())
res=0
for i in range(1,50000):
    if i*108==n*100:
        res=i
        break
print(res if res>0 else ':(')

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = n / 1.08
ans = int(ans)
if int(ans * 1.08) == n:
    print(ans)
elif int((ans + 1) * 1.08) == n:
    print(ans + 1)
elif (ans + 1) * 1.08 > n and ans + 1.08 < n:
    print(":(")

Submission status: Wrong Answer

Solution code:

N = int(input())
import sys
for i in range(N):
    if (i*1.08//1 == N):
        print (i)
        sys.exit()
print(':(')

Submission status: Wrong Answer

Solution code:
n = int(input())
if n % 1.08 != 0:
  print(":(")
else:
  print(int(n/1.08))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = -1
for X in range(1, N):
    if int(X*1.08)==N: ans = X
print(ans if ans>-1 else ':(')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

n = int(input())

x = int(n/1.08)
if int(x*1.08) != n:
    print(':(')
else:
    print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())

X = N//1.08
for n in range(10):
    X += n
    if X*1.08 == N:
        print(X)
        exit(0)
print(":(")

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
for i in range(n):
    if int(i * 1.08) == n:
        print(i)
        exit()
print(':(')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = (n + 0.5) / 1.08
b = n / 1.08
# print(a,b)
ans = 0
for i in range(int(b),int(a)+1):
    if b <= i < a:
        ans = i
        break
if ans == 0:
    print(":(")
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

for n in range(N):
    ans = int(n * 1.08)
    if ans == N:
        print(n)
        break
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n):
    if int(i * 1.08) == n:
        print(i)
        break
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = -1
for x in range(N):
  if(int(x*1.08) == N):
    ans = x
    break
    
if(ans == -1): print(':(')
else: print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
k=1.08
for i in range(n):
    if int(i*k)==n:
        print(i)
        break
else:
    print(":(")