Problem:


Score : 100 points

Problem Statement

You are given two integers a and b.
Determine if a+b=15 or a\times b=15 or neither holds.

Note that a+b=15 and a\times b=15 do not hold at the same time.

Constraints

1 \leq a,b \leq 15

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a b

Output

If a+b=15, print +;
if a\times b=15, print *;
if neither holds, print x.

Sample Input 1

4 11

Sample Output 1

+

4+11=15.

Sample Input 2

3 5

Sample Output 2

*

3\times 5=15.

Sample Input 3

1 1

Sample Output 3

x

1+1=2 and 1\times 1=1, neither of which is 15.



Sample input:
4 11


Sample output:
+

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a + b == 15:
    print("+")
else:
    print("*")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if (a+b) == 15:
    print('+')
elif (a*b) == 15:
    print('*')
else:
    print('×')

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a * b == 15:
  print("*")
elif a + b == 15:
  print("+")
else:
  print("×")

Submission status: Wrong Answer

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

if(a + b == 15 or a * b == 15):
  print("*")
else:
  print("x")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a+b==15:
    print("+")
elif a*b=="15":
    print("*")
else:
    print("x")

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 S(): return input().rstrip()
def LS(): return S().split()
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 = 1e10

#solve
def solve():
    a, b = LI()
    if a + b == 15:
        print("+")
        return
    if a * b == 15:
        print("*")
        return
    print("×")
    return


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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = 'x'
if (a+b)%15 == 0:
  ans = '+'
elif (a*b)%3 == 0 and (a*b)%5 == 0:
  ans = '*'
print(ans)

Submission status: Wrong Answer

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

if a + b == 15 or a * b == 15:
    print('*')
else:
    print('x')

Submission status: Wrong Answer

Solution code:
from sys import stdin
from itertools import groupby
a,b = [int(x) for x in stdin.readline().rstrip().split()]
if a+b == 15:
    print("+")
elif a*b == 15:
    print("*")
else:
    print("X")

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print('+' if a+b else '*' if a*b else 'x')

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print('+' if a+b else '*' if a*B else 'x')

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a*b == 15:
  print("*")
if a+b == 15:
  print("+")
else:
  print("x")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a + b == 15:
    print ('+')
elif a * b == 15:
    print('*')
else:
    'x'

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a+b == 15:
  print('+')
if a*b == 15:
  print('*')
else:
  print('x')

Submission status: Wrong Answer

Solution code:
a, b = [ int(v) for v in input().split() ]
if a * b == 15:
  print("*")
if a + b == 15:
  print("+")
else:
  print("x")

Submission status: Wrong Answer

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

if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('×')

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a+b==15 or a*b==15:
    if a*b==15:
        print("X")
    else:
        print("+")
else:
    print("x")

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a+b==15 or a*b==15:
    if a*b==15:
        print("+")
    else:
        print("*")
else:
    print("x")

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a+b == 15:
        print("+")
elif a*b == 15:
        print("*")
else:
        print("×")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a*b==15 and a+b==15:
  print("*")
else:
  print("x")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a+b == 15:
  print("+")
elif a*b == 15:
  print("*")
else:
  print("×")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
 
if (a+b==15):
  print("+")
elif (a*b==15):
  print("*")
else:
  print("×")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a + b == 15:
    print("+")
    exit()
elif a * b == 15:
    print("*")
    exit()
else:
    print("×")

Submission status: Wrong Answer

Solution code:
print("a")

Submission status: Wrong Answer

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

if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('×')

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a+b==15:
    print("+")
else:
    print("*")

Submission status: Wrong Answer

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

if(a + b == 15):
  print("+")
elif(a * b == 15):
  print("*")
else:
  print("✕")

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if (a+b)/15 == 0:
  print("+")
elif (a*b)/15 == 0:
  print("*")
else:
  print("x")

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if (a+b)%15 == 0:
  print("+")
elif (a*b)%15 == 0:
  print("*")
else:
  print("x")

Submission status: Wrong Answer

Solution code:
print('１以上の整数と15以下の整数を入力してください')
a, b = map(int,  input(). split())
if a+b == 15:
 print('+')
elif a*b == 15:
 print('*')
else:
 print('x')

Submission status: Wrong Answer

Solution code:
import itertools
l = list(map(int, input().split(' ')))

Submission status: Wrong Answer

Solution code:
import itertools

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print((a + b == 15) or (a * b == 15))

Submission status: Wrong Answer

Solution code:
l = input().split(' ')
string = l[0]
num = l[1]
# print(string)
# string = string[0]
# num = int(string[1])

num = int(num)
# num = int(l[1])
# print(string)
if num == 0:
    print(string)
else:
    out=string[0]
    for i in [i for i in range(len(string))]:
        if i != 0:
            if i%num == 0:
                out=out+string[i]
    print(out)

Submission status: Wrong Answer

Solution code:
l = input().split(' ')
string = l[0]
num = l[1]
print(string)

Submission status: Wrong Answer

Solution code:
l = input()
string = l
print(string)

Submission status: Wrong Answer

Solution code:
string = input()
print(string)

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
if(n[0] + n[1] == 15):
    print("+")
elif(n[0] * n[1] == 15):
    print("*")
else:
    print("X")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a+b == 15:
    print("+")
    if a*b == 15:
        print("*")
    else:
        print("x")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a*b==15:
	print('*')
elif a+b==15:
	print('+')
else:
	print('*')

Submission status: Wrong Answer

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

if a+b == 15:
	print('+')
elif a*b == 15:
	print('*')
else:
	print('×')

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('X')

Submission status: Wrong Answer

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

if a + b ==15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('×')

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print("+" if a + b == 15 else "*")

Submission status: Wrong Answer

Solution code:
a,b = map(int ,input().split()) 
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else :
    print("×")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a+b==15:
    print('*')
elif a*b==15:
    print('+')
else:
    print('x')

Submission status: Wrong Answer

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

if a*b == 15:
    print("*")
elif a*b == 15:
    print("+")
else:
    print("x")

Submission status: Wrong Answer

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

aplusb = a + b
ab = a * b

if aplusb == 15:
    print("+")
if ab == 15:
    print("*")
else:
    print("x")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a,b = (int(T) for T in input().split())
print(['x',['*','+'][a+b==15]][(a*b==15)or(a+b==15)])

Submission status: Accepted

Solution code:
a,b = (int(T) for T in input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b==15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Submission status: Accepted

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

if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b == 15:
  print("+")
elif a*b == 15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if 15-a == b:
  print("+")
elif 15/a == b:
  print("*")
else:
  print("x")

Submission status: Accepted

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

if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a*b==15:
  print("*")
elif a+b==15:
  print("+")
else:
  print("x")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if(a+b==15):
  print("+")
elif(a*b==15):
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7
#main code here!
    a,b=MI()
    if a+b==15:
        print("+")
    elif a*b==15:
        print("*")
    else:
        print("x")
    

        
        
        
        
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b==15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b == 15:
  print('+')
elif a*b==15:
  print('*')
else:
  print('x')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    A, B = map(int, input().split())
    if A + B == 15:
        print("+")
    elif A * B == 15:
        print("*")
    else:
        print("x")


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    if a + b == 15:
        print("+")
    elif a * b == 15:
        print("*")
    else:
        print("x")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
def input():
    return sys.stdin.readline()[:-1]

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

    if a + b == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
import sys, math
from functools import lru_cache
import numpy as np
import heapq
from collections import defaultdict
sys.setrecursionlimit(10**9)
MOD = 10**9+7

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

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

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def main():
    a, b = mi()
    if a+b == 15:
        print('+')
    elif a*b == 15:
        print('*')
    else:
        print('x')



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b==15:
    ans='+'
elif a*b==15:
    ans='*'
else:
    ans='x'
print(ans)

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b = M()
ans = 'x'
if a+b == 15:
    ans = '+'
elif a*b == 15:
    ans = '*'
print(ans)

Submission status: Accepted

Solution code:
a,b = map (int, input ().split ())
if a+b == 15:
  print ('+')
elif a*b == 15:
  print ('*')
else:
  print ('x')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print("+") if a+b==15 else print("*") if a*b==15 else print("x")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("+" if a+b==15 else "*" if a*b==15 else "x")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b==15:
    print('+')
elif a*b==15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a+b == 15:
  print("+")
elif a*b == 15:
  print("*")
else:
  print('x')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a+b == 15:
  print('+')
elif a*b == 15:
  print('*')
else:
  print('x')

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rm()
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b==15:
    print("+")
elif a*b==15:
    print("*")
else:
    print("x")

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    a, b = LI()

    if a + b  == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b == 15:
  print("+")
elif a * b == 15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a * b == 15:
  print("*")
elif a + b == 15:
  print("+")
else:
  print("x")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A + B == 15:
    print('+')
elif A * B == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

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

if a + b == 15:
    ans = "+"
elif a*b == 15:
    ans = "*"
else:
    ans = "x"

print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a+b) == 15:
    print('+')
elif (a*b) == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

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

if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b == 15:
  print ('+')
elif a*b == 15:
  print ('*')
else:
  print ('x')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print('+' if a+b==15 else '*' if a*b==15 else 'x')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a, b = map(int,input().split())
if a*b == 15:
    print("*")
elif a+b==15:
    print("+")
else:
    print("x")

Submission status: Accepted

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

if a + b == 15:
  print("+")
  exit(0)
if a * b == 15:
  print("*")
  exit(0)
print("x")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c="x"
if a+b==15:c="+"
if a*b==15:c="*"
print(c)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b ==  15:
    print("+")
elif a*b == 15:
    print("*")
else:
    print("x")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b == 15:
    ans = '+'
elif a * b == 15:
    ans = '*'
else:
    ans = 'x'
print(ans)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b == 15:
	print('+')
elif a*b == 15:
	print('*')
else:
	print('x')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a * b == 15:
  print("*")
elif a + b == 15:
  print("+")
else:
  print("x")

Submission status: Accepted

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

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import _heapify_max, _heappop_max, _siftdown_max
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    
    
    a, b = mi()
    if a + b == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b == 15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b == 15:
    print('+')
elif a * b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b == 15:
    print('+')
elif a*b == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A+B==15:
    print('+')
elif A*B==15:
    print('*')
else:
    print('x')

Submission status: Accepted

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

if(a + b == 15):
  print("+")
elif(a * b == 15):
  print("*")
else:
  print("x")

Submission status: Accepted

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

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

def main():
    mod=10**9+7
    a,b=MI()
    if a+b==15:
        print("+")
    elif a*b==15:
        print("*")
    else:
        print("x")

main()

Submission status: Accepted

Solution code:
def main():
    a, b = list(map(int, input().split()))
    if a + b == 15:
        print('+')
    elif a * b == 15:
        print('*')
    else:
        print('x')
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b == 15:
  print('+')
elif a * b == 15:
  print('*')
else:
  print('x')

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
if a+b==15:
  print("+")
elif a*b==15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b == 15:
	print('+')
elif a*b == 15:
	print("*")
else:
	print('x')

Submission status: Accepted

Solution code:
a,b=map(int,input().split());print("+" if a+b==15 else "*" if a*b==15 else "x")

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache

#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b: a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############

A,B = IL()
if A+B == 15:
  print("+")
elif A*B == 15:
  print("*")
else:
  print("x")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b == 15:
    print("+")
elif a*b == 15:
    print("*")
else:
    print("x")

Submission status: Accepted

Solution code:
def resolve():
    a, b = map(int, input().split())
    print("+" if a+b == 15 else "*" if a*b == 15 else "x")
resolve()