Problem:


Score : 300 points

Problem Statement

Find the price of a product before tax such that, when the consumption tax rate is 8 percent and 10 percent, the amount of consumption tax levied on it is A yen and B yen, respectively. (Yen is the currency of Japan.)

Here, the price before tax must be a positive integer, and the amount of consumption tax is rounded down to the nearest integer.

If multiple prices satisfy the condition, print the lowest such price; if no price satisfies the condition, print -1.

Constraints

1 \leq A \leq B \leq 100

A and B are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

If there is a price that satisfies the condition, print an integer representing the lowest such price; otherwise, print -1.

Sample Input 1

2 2

Sample Output 1

25

If the price of a product before tax is 25 yen, the amount of consumption tax levied on it is:

When the consumption tax rate is 8 percent: \lfloor 25 \times 0.08 \rfloor = \lfloor 2 \rfloor = 2 yen.

When the consumption tax rate is 10 percent: \lfloor 25 \times 0.1 \rfloor = \lfloor 2.5 \rfloor = 2 yen.

Thus, the price of 25 yen satisfies the condition. There are other possible prices, such as 26 yen, but print the minimum such price, 25.

Sample Input 2

8 10

Sample Output 2

100

If the price of a product before tax is 100 yen, the amount of consumption tax levied on it is:

When the consumption tax rate is 8 percent: \lfloor 100 \times 0.08 \rfloor = 8 yen.

When the consumption tax rate is 10 percent: \lfloor 100 \times 0.1 \rfloor = 10 yen.

Sample Input 3

19 99

Sample Output 3

-1

There is no price before tax satisfying this condition, so print -1.



Sample input:
2 2


Sample output:
25

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
import math
a,b = math.ceil(A/0.08),int((A+1)//0.08)
c,d = math.ceil(A/0.1),int((A+1)//0.1)
if (a>=c)and(a<d):
  print(int(a))
elif (c>=a)and(c<b):
  print(int(c))
else:
  print(-1)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

def isOK(num):
    tax8 = num * 8 // 100
    tax10 = num * 10 // 100
    if tax8 == A and tax10 == B:
        return True
    else:
        return False

for i in range(1, 101):
    if isOK(i):
        print(i)
        break
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
A_under = A * 25 // 2
A_top = (A + 1) * 25 // 2 - 1
B_under = B * 10
B_top = B * 10 - 1

if B_under <= A_under <= A_top:
    print(A_under)
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
def main():
    a, b = map(int, input().split())

    middle = int(a / 0.08)

    for i in range(-10, 10):
        tested = i + middle
        if tested * 8 // 100 == a and tested // 10 == b:
            print(tested)
            return

    print(-1)

main()

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ans=0
for i in range(0,101):
    cnt=0
    if int(i*0.08) == a:
        cnt+=1
    if int(i*0.1) == b:
        cnt+=1
    if cnt == 2:
        print(i)
        ans+=1
        break

if ans==0:
    print(-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
for i in range(1000):
    if int(i * 0.08) == a and int(i * 0.1) == b:
        print(i)
        break
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
A, B = [int(i) for i in input().strip().split(" ")]

base = B * 10
while True:
  price8p = base * 8 // 100
  if price8p == A:
    print(base)
    break
  elif price8p > A:
    print(-1)
    break
  base += 1

Submission status: Wrong Answer

Solution code:
import sys
import math
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a,b = IL()

ans = 1
while ans < 200:
  if int(ans*0.08) == a and int(ans*0.10) == b:
    print(ans)
    exit()
  ans += 1
print(-1)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())

lower1=a*100/8
upper1=(a+1)*100/8

lower2=(b)*10
upper2=(b+1)*10

lower=int(max(lower1,lower2))
upper=int(min(upper1,upper2))

if upper-lower<0:
  print(-1)
else:
  print(lower)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
a_set = set(range(-int(-a//0.08),-int(-(a+1)//0.08)))
b_set = set(range(-int(-b//0.1),-int(-(b+1)//0.1)))
candi = list(a_set&b_set)
print(candi[0] if len(candi)>0 else -1)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
x=a*100/8;y=b*10
if abs(y-x)<10:
  print(int(x))
else:
  print(-1)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
for i in range(1, 101):
    if int(i * 0.08) == A:
        if int(i * 0.1) == B:
            print(i)
            break
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
import math
a,b=map(int,input().split())

ans=-1
for i in range(1000):
    if math.floor(i*0.08) == a and math.floor(i*0.1)==b:
        ans = i
        break
print(ans)

Submission status: Wrong Answer

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

A, B = map(int, input().split())
N = 1
flag = False
for x in range(101):
    if x // 12.5 == A and x // 10 == B:
        flag = True
        print(x)
        break

if not flag:
    print(-1)

Submission status: Wrong Answer

Solution code:
def main():
    A,B=map(int,input().split())
    for i in range(1,101):
        if i*0.08//1 == A and i*0.1//1==B:
            print(i)
            return 0
    print(-1)
main()

Submission status: Wrong Answer

Solution code:
from math import floor
a,b=list(map(int, input().split()))
x=a/(0.08)
if floor(x*0.1)==b:
  print(int(x))
else:
  print(-1)

Submission status: Wrong Answer

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

A, B = map(int, input().split())

for i in range(1, 101):
    if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
        print(i)
        exit(0)

print(-1)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
ans = -1
for p in range(1, 100+1):
    if p * 8 // 100 == A and p * 10 // 100 == B:
        ans = p
        break
print(ans)

Submission status: Wrong Answer

Solution code:
[a,b] = [int(i) for i in input().split()]

a_cand = list(range(a * 100 //8, (a+1)* 100 // 8))
b_cand = list(range(b * 100 //10, (b+1)* 100 // 10))

if min(a_cand) > max(b_cand) or min(b_cand) > max(a_cand):
    print(-1)
else:
    print(max(min(a_cand),min(b_cand)))

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

max_a = (A + 1) / 0.08
min_a = A / 0.08

max_b = (B + 1) / 0.1
min_b = B / 0.1

ans = -1
for i in range(int(min_a), -int(-max_a)+1):
  if i >= int(min_b) and i < -int(-max_b) + 1:
    ans = i
    break

print(ans)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())

ans=-1
for i in range(1,101):
    if i*8//100==A and i//10==B:
        ans=i
        break

print(ans)

Submission status: Wrong Answer

Solution code:
from math import floor
a,b=map(int,input().split())
for i in range(1,101):
    if floor(i*0.08)==a and floor(i*0.1)==b:
        print(i)
        exit()
print(-1)

Submission status: Wrong Answer

Solution code:
from math import floor
A, B = map(int, input().split())
N = -1
for i in range(1, 101):
  if (floor(i * 0.08) == A and floor(i * 0.10) == B):
    print(i)
    exit(0)
print(N)

Submission status: Wrong Answer

Solution code:
b, c = map(int, input().split())
b_before_min = b / 0.08
b_before_max = (b+1) / 0.08
c_before_min = c / 0.1
c_before_max = (c+1) / 0.1

if(c_before_min <= b_before_min and b_before_min <= c_before_max):
    print(b_before_min)
elif(b_before_min <= c_before_min and c_before_min <= b_before_max):
    print(c_before_min)
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

for i in range(101):
    if i*8//100 == a and i*10//100 == b:
        print(i)
        exit()

print(-1)

Submission status: Wrong Answer

Solution code:
import math

A, B = map(int, input().split())

moto_A = math.floor(A / 0.08)
moto_B = math.floor(B / 0.1)

if moto_A == moto_B:
  print(moto_A)
else:
  print(-1)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())


for i in range(1,101):
    if int(i*0.08)==A and int(i*0.1)==B:
        print(i)
        exit()

print(-1)

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の降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

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

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	A,B = inputMap()

	for i in range(1,101):
		tmp = int(i * 0.1)
		tmp2 = int(i * 0.08)

		#print("{} {}".format(tmp,tmp2))

		if tmp2 == A and tmp == B:
			print(i)
			sys.exit()

	print(-1)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())

for i in range(1,101):
  if int(i*0.08)==A and int(i*0.1)==B:
    print(i)
    exit(0)
else:
  print(-1)

Submission status: Wrong Answer

Solution code:
import math

a,b=map(int,input().split())
ma=a*100//8
mb=b*100//10
ma+=1

ans=-1
for i in range(mb,ma+1):
  k=0
  if a==math.floor(i*0.08):
    if b==math.floor(i*0.1):
      ans=i
      k=1
      break
    if k:
      break

print(ans)

Submission status: Wrong Answer

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

#整数値龍力　複数の入力
def input_multiple_number():
    return map(int, input().split())

A,B = input_multiple_number()

for i in range(100):
    price = i+1
    eight = int(price * 0.08)
    ten = int(price * 0.1)
    if eight == A and ten == B:
        print(price)
        exit(0)

print(-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

ans = -1

for i in range(1011):
    _a = i * 0.08
    _b = i * 0.1
    if _a == a and _b == b:
        ans = i
        break
print(ans)

Submission status: Wrong Answer

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

a,b=[int(i) for i in input().split()]
for i in range(1,1000):
    if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
        print(i)
        break
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = -1
for i in range(1, 1000):
    if i * 0.08 // 1 == a and i * 0.1 // 1 == b:
        ans = i
        break
print(ans)

Submission status: Wrong Answer

Solution code:
n,m = map(int,input().split())

x = int(n/0.08)
y = int(m/0.1)

if x == y :
  print(x)
else:
  print(-1)

Submission status: Wrong Answer

Solution code:
from math import floor
a,b = map(int,input().split())
ans = a*10
for i in range(11):
    ans += 1
    if floor(ans*0.08) == b:
        break
    if i == 10:
        ans = -1
print(ans)

Submission status: Wrong Answer

Solution code:
from math import ceil
from math import floor
a,b = map(int,input().split())
l1 = ceil((a-0.50001)/0.08)
r1 = floor((a+0.5)/0.08)
l2 = ceil((a-0.50001)/0.1)
r2 = floor((a+0.5)/0.1)
l3 = max(l1,l2)
r3 = min(r2,r1)
if(l3<=r3):
    print(l3)
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
flag=0
for i in range(1,101):
    if int(i*0.08) == A and int(i*0.1) == B:
        print(i)
        flag=1
        break
if flag==0:
    print(-1)

Submission status: Wrong Answer

Solution code:
import math
import fractions
a,b=map(int,input().split())
mn=math.ceil(max(b/0.1,a/0.08))
#mn=fractions.ceil(max(b/0.1,a/0.08))

mx=min((b+1)/0.1,(a+1)/0.08)
if mn<=mx:
    print(int(mn))
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
A, B = list(map(int, input().split()))

priA = A * 100 // 108
priB = B * 100 // 110

for i in range(1000):
    if int(0.08 * i) == A and int(0.1 * i) == B:
        print(i)
        break

else:
    print(-1)

Submission status: Wrong Answer

Solution code:
A, B = list(map(int, input().split()))
min_ = max(A/0.08, B/0.1)
max_ = min(int((A+1)/0.08),int((B+1)/0.1))
if min_%1!=0:
    min_ = int(min_)+1
else:
    min_ = int(min_)
    
if min_>max_:
    print(-1)
else:
    print(min_)

Submission status: Wrong Answer

Solution code:
a, b = map(int, (input().split()))

n = 1
for i in range(20000):
    if int(n * 0.08) == a:
        if int(n * 0.10) == b:
            print(n)
            exit()

print(-1)

Submission status: Wrong Answer

Solution code:
import sys
from math import ceil, floor
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

def main():
    a,b = map(int, input().split())

    # [k*0.08] = A
    # [k*0.1] = B
    # B <= k*0.1 <= B+1
    k = int(a // 0.08)+2
    l = int(b // 0.1)    

    for i in range(l,k):
        if floor(i*0.08) == a and floor(i*0.1) == b:
            print(i)
            return
    print(-1)
    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
r_a_l = (A * 100) // 8
r_a_r = ((A + 1) * 100) // 8
r_b_l = (B * 100) // 10
r_b_r = ((B + 1) * 100) // 10

ans = -1
for i in range(r_a_l,r_a_r,1):
    for j in range(r_b_l,r_b_r,1):
        if i == j and ans == -1:
            ans = i
        else:
            pass
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
for n in range(1, 101):
    if int(n*0.08) == A and int(n*0.10) == B:
        print(n)
        break
else:
    print('-1')

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
n=1
while n<101:
  aa=int(n*0.08)
  bb=int(n*0.1)
  if a==aa and b==bb:
    print(n)
    exit()
  n+=1
print(-1)

Submission status: Wrong Answer

Solution code:
#
import sys
import math
import numpy as np
import itertools

# いくつか入力
a, b = (int(i) for i in input().split())  

p = []
answer=-1
for i in range(1,101):
    if int(i*0.08) == a:
        p.append(i)
for i in p:
    if int(i*0.1) == b:
        answer = i
        break

print(answer)

Submission status: Wrong Answer

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

def solve(A: int, B: int):
    for i in range(1,1000):
        if A == math.floor(0.08*float(i)) and B == math.floor(0.1*float(i)):
            print(i)
            return
    print(-1)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

ans = -1

for i in range(1, 1000):
    if int(i * 0.08) == A and int(i * 0.1) == B:
        ans = i
        break

print(ans)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
check = 0
for i in range(101):
    if i * 8 // 100 == A:
        if i * 10 // 100 == B:
            ans = i
            check = 1
            break
        if check == 1:
            break
if check == 0:
    ans = -1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a,b = m()

aaa = a * 100 // 8

aa = (a+1) * 100 // 8

bbb = b * 100 // 10

bb = (b+1) * 100 // 10


p = set(range(aaa,aa+1))
pp = set(range(bbb,bb+1))

ppp = p & pp

if len(ppp) != 0:
    print(min(ppp))
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

for i in range(200):
    if int(i * 1.08) - i == a and int(i * 1.1) - i == b:
        print(i)
        exit()

print(-1)

Submission status: Wrong Answer

Solution code:
import math
A,B = map(int,input().split())
flag = 0
for i in range(1,150):
    if math.floor(i*0.08)== A:
        if math.floor(i*0.1) == B:
            print(i)
            flag += 1
            break
if flag == 0:
    print(-1)

Submission status: Wrong Answer

Solution code:
def input_int():
    return map(int, input().split())

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

def one_str():
    return input()

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

A, B = input_int()



flg=True
for i in range(1, 101):
    temp_A = int(i*0.08)
    temp_B = int(i*0.1)
    
    if temp_A == A and temp_B == B:
        print(i)
        flg=False
        break

if flg:
    print(-1)

Submission status: Wrong Answer

Solution code:
import math
A, B = map(int, input().split())
a = A * 25 / 2
b = B * 10
if a >= b + 10 or a + 1 <= b:
    print(-1)
else:
    print(math.ceil(max(a, b)))

Submission status: Wrong Answer

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b=LI()
  for i in range(101):
    _a=i*0.08
    _b=i*0.1

    # print(int(_a),int(_b))

    if int(_a)==a and int(_b)==b:
      return i

  return -1

# main()
print(main())

Submission status: Wrong Answer

Solution code:
#def main(S, b):

if __name__ == '__main__':
    a, b = map(int, input().split())

    ans = -1
    for i in range(100):
        j = i + 1
        if (int(j * 0.08) == a and int(j * 0.1) == b):
            ans = j
            break

    print(ans)

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の降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

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

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	A,B = inputMap()

	for i in range(101):
		tmp = int(i * 0.1)
		tmp2 = int(i * 0.08)

		#print("{} {}".format(tmp,tmp2))

		if tmp2 == A and tmp == B:
			print(i)
			sys.exit()

	print(-1)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
A,B = map (int,input().split())
eight = [0] * 2000
ten = [0] * 2000
for i in range(200):
    eight[i] =(float(i+1) * 0.08)//1
    ten[i] = (float(i+1) * 0.1)//1
ans = 0
for i in range(2000):
    if A == eight[i] and B == ten[i]:
        ans =  i + 1
        break
if ans == 0:
    print(-1)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
for i in range(int(a / 0.08), int(a / 0.07)):
    if int(i * 0.1) == b:
        print(i)
        break
else:
    print(-1)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

for i in range(1000):
    if i*108//100-i==A and i*110//100-i==B:
        print(i)
        exit()

print(-1)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())

for i in range(101):
  if (i*0.08)//1==A and (i*0.1)//1==B:
    print(i)
    exit()
print(-1)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

minA = A / 0.08
maxA = (A+1) / 0.08
minB = B / 0.1
maxB = (B+1) / 0.1

if minB <= minA and minA <= maxB: print(int(minA))
elif minA <= maxB and maxB <= maxA: print(int(maxB))
else: print("-1")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
for i in range(int(a/0.08), int((a+1)/0.08)):
    if int(i * 0.1) == b:
        print(i)
        break
else: print(-1)

Submission status: Wrong Answer

Solution code:
A, B = list(map(int, input().split()))

def main():
    for x in range(200):
        if x * 8 // 100 == A and x * 10// 100 == B:
            print(x)
            return

    print(-1)
    return


main()

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

la = A/0.08
ra = (A+1)/0.08
lb = B/0.1
rb = (B+1)/0.1

ans = max(la, lb)
if ra <= lb or rb <= la:
  print(-1)
else:
  print(int(ans))

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
det = 1

for i in range(101):
    if int(i * 0.08) == A and int(i*0.1) == B:
        print(i)
        det = 0
        break
if det == 1:
    print(-1)

Submission status: Wrong Answer

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

A, B = [int(x) for x in input().split()]

for i in range(10 ** 6):
    if i * 1.08 == A and i * 1.1 == B:
        print(i)
        sys.exit()
print(-1)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def solve(inp):
    (A, B) = map(int, inp.readline().strip().split(' '))

    b1 = B * 11
    b2 = (B + 1) * 11
    for i in range(b1, b2 + 1):
        if int(i * 0.08) == A and int(i * 0.1) == B:
            return str(i)

    return "-1"


def main():
    import sys
    result = solve(sys.stdin)
    if result is not None and result != '':
        print(result)


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の降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

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

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	A,B = inputMap()

	for i in range(102):
		tmp = int(i * 0.1)
		tmp2 = int(i * 0.08)

		#print("{} {}".format(tmp,tmp2))

		if tmp2 == A and tmp == B:
			print(i)
			sys.exit()

	print(-1)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()