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: 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 = list(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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
#from decimal import *
 
a, b = MAP()
if a + b == 15:
	print("+")
elif a * b == 15:
	print("*")
else:
	print("x")

Submission status: Accepted

Solution code:
x, y = map(int,input().split())

if x*y == 15:
    print("*")
elif x+y == 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:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
a,b = readInts()
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:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
from sys import stdin
a, b = [int(_) for _ in stdin.readline().rstrip().split()]
ans = ''
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:
import sys
def input(): return sys.stdin.readline().rstrip()
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 = list(map(int,input().split()))
if a+b == 15:
    print('+')
    exit()
if a*b == 15:
    print('*')
    exit()
print('x')

Submission status: Accepted

Solution code:
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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:
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
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b = map(int, readline().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
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    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:
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:
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:
# SoundHound Inc. Programming Contest 2018 -Masters Tournament-: A – F
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,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("x")
    return


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

Submission status: Accepted

Solution code:
# A
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 copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

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

    if b+c ==15:
        print("+")
    elif b*c ==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:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from fractions import gcd
from copy import deepcopy
import math
import queue
import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main(): #startline-------------------------------------------
    a,b = map(int,input().split())
    if a+b == 15:
        print("+")
    elif a*b == 15:
        print("*")
    else:
        print("x")
if __name__ == "__main__":
    main() #endline===============================================

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

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


a, b = MI()
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==15else"x")

Submission status: Accepted

Solution code:
x, y = map(int, input().split())

if x + y == 15:
    print("+")
elif x * y == 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 = input().split()

for e in ["+", "*"]:
    if eval(a + e + b) == 15:
        print(e)
        exit()

print("x")

Submission status: Accepted

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

r = ''
if a + b == 15:
    r = '+'
elif a * b == 15:
    r = '*'
else:
    r = 'x'

print(r)

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
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:
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:
x,y = map(int,input().split())

if x+y==15:
    print('+')
elif x*y==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:
x,y=map(int,input().split())
if x+y==15:
  print("+")
elif x*y==15:
  print("*")
else:
  print("x")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y = map(int,input().split())

if x+y == 15:
    print('+')
elif x*y == 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 math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools

mod = int(1e9+7)

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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(x) for x 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 = [int(i) for i 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:
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: 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:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
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:
# -*- coding: utf-8 -*-

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():
    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:
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
    return input()
def LS():
    return [i for i in input().split()]
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 NI(n):
    return [int(input()) for i in range(n)]
def NI_(n):
    return [int(input())-1 for i in range(n)]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**5)
input=lambda: sys.stdin.readline().rstrip()

def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True

ans=0


a,b=LI()
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:
s=input().split()
i=int(s[0])
j=int(s[1])
if i+j==15:
  print("+")
elif i*j==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:
import sys
if sys.platform =='ios':
	sys.stdin=open('input.txt')

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:
a=list(map(int, input().split()))

check=0
if a[0]+a[1]==15:
    check=1
elif a[0]*a[1]==15:
    check=2

if check==1:
    print("+")
elif check==2:
    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
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    a,b=map(int,input().split())
    if(a+b==15):
        print('+')
    elif(a*b==15):
        print('*')
    else:
        print('x')
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:
# 2019/12/4

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 examA():
    a, b = LI()
    ans = "x"
    if a+b==15:
        ans = "+"
    elif a*b==15:
        ans = "*"
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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:
import sys
input = sys.stdin.readline
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:
def resolve():
    a,b=map(int,input().split())
    if a+b==15:
        ans='+'
    elif a*b==15:
        ans='*'
    else:
        ans='x'
    print(ans)
resolve()

Submission status: Accepted

Solution code:
#coding:utf-8
a, b = map(int, input().split())

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

Submission status: Accepted

Solution code:
#F
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


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a, b = list(map(int, readline().split()))
    if a + b == 15:
        print("+")
    elif a * b == 15:
        print("*")
    else:
        print("x")


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
a,b = (int(i) for i 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('+')
    exit()
elif a*b==15:
    print('*')
    exit()
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:
# SoundHound Inc. Programming Contest 2018 -Masters Tournament-: A – F
a, b = [int(s) for s 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());print("x*+"[(a*b==15)+(a+b==15)*2])

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 = tuple(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 -*-
import sys
import collections
import copy
import math
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
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)

    # divisors.sort()
    return divisors
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 slove():
    import sys
    input = sys.stdin.readline
    a, b = list(map(int, input().rstrip('\n').split()))
    if a + b == 15:
        print("+")
    elif a * b == 15:
        print("*")
    else:
        print("x")


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
N, M = map(int, input().split())

if N+M == 15:
    print('+')
elif N*M == 15:
    print('*')
else:
    print('x')

Submission status: Accepted

Solution code:
a,b=list(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():
    a, b = (int(i) for i in input().split())
    print("+" if a+b == 15 else("*" if a*b == 15 else "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")