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:
n = input().split()

a = int(n[0])
b = int(n[1])

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:
#N=int(input())
#l = list(map(int,input().split()))
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:
#!/usr/bin/env python
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().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:
input_line = input().split()

a = int(input_line[0])
b = int(input_line[1])

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,raw_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 = 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:
#! /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 = 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 = [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 = [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:
#!python
# -*- coding: utf-8 -*-


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:
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 random

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

def rdi():
        return [ int(x) for x in rd().split() ]


a, b = rdi()

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

Submission status: Accepted

Solution code:
a, b = [int(_) for _ 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:
# encoding:utf-8
 
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('+')
    exit()
elif a * b == 15:
    print('*')
    exit()
else:
    print('x')

Submission status: Accepted

Solution code:
def main():
    a, b = [int(i) for i in 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:
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    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:
stra, strb = input().split()
a = int(stra)
b = int(strb)

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

Submission status: Accepted

Solution code:
a,b =  map(int,raw_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()
if a*b==15:
    print("*")
    exit()
print("x")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input().split()
a=int(s[0])
b=int(s[1])
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')

main()

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
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 LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    a,b = LI()
    if a+b == 15:
        return '+'
    if a*b==15:
        return '*'

    return 'x'



print(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:
# -*- 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:
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:
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:
a,b = map(int, raw_input().split())
print "+" if a + b == 15 else "*" if a*b == 15 else "x"

Submission status: Accepted

Solution code:
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# 
# s = 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:
if __name__ == '__main__':
    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 = 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())

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:
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/python
# -*- coding: utf-8 -*-
import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq

# decimal.getcontext().prec = 50
# sys.setrecursionlimit(10000)
# MOD = 10**9 + 7

def solve(f):
    a, b = f.read_int_list()
    if a+b == 15:
        return '+'
    elif a*b == 15:
        return '*'
    else:
        return 'x'


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case #%d\n"%f.case, solve(f)
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

Submission status: Accepted

Solution code:
a,b = map(int, raw_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:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None

def main():
    a, b = [int(_) for _ in input().split()]

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

main()

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())
print('+' if a+b==15 else '*' if a*b==15 else 'x')

Submission status: Accepted

Solution code:
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

setrecursionlimit(10**6)

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import random
import re
import string
import sys

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, raw_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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m,d=map(int,input().split())
#すべての組み合わせの和の平均 = すべての組み合わせからランダムに1つ選んだ時の期待値
#「期待値の線形性」とは「和の期待値は期待値の和に等しい」こと
#E[X+Y]=E[X]+E[Y]
if d==0:
    pro=1/n
else:
    pro=(2*(n-d))/n**2

ans=pro*(m-1)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#ダイクストラ法
#O(ElogV)
import heapq
def dijkstra_heap(s,edge):
  #始点sから各頂点への最短距離
  d = [float("inf")] * (n+1)
  used = [False] * (n+1)
  d[s] = 0
  used[s] = True
  edgelist = []
  #edgelist : [sからの暫定(未確定)最短距離,頂点]のリスト
  #edge[s] : sから出る枝の[重み,終点]の配列
  for e in edge[s]:
    heapq.heappush(edgelist,e) #sの隣の点は枝の重さがそのまま暫定最短距離となる
  while len(edgelist):
    #まだ使われてない頂点の中から最小の距離のものを探す→確定させる
    minedge = heapq.heappop(edgelist)
    #minedge : [sからの(確定)最短距離,頂点]
    v = minedge[1]
    if used[v]:
      continue
    d[v] = minedge[0]
    used[v] = True
    for e in edge[v]:
      if not used[e[1]]:
        heapq.heappush(edgelist,[d[v]+e[0],e[1]])
  return d

################################
n,m,s,t = map(int,input().split()) #n:頂点数　w:辺の数

edge_yen = [[] for _ in range(n+1)]
edge_snuke = [[] for _ in range(n+1)]

for i in range(m):
  u,v,a,b = map(int, input().split())
  edge_yen[u].append([a,v])
  edge_yen[v].append([a,u])
  edge_snuke[u].append([b,v])
  edge_snuke[v].append([b,u])

d_yen = dijkstra_heap(s,edge_yen)
d_snuke = dijkstra_heap(t,edge_snuke)
ans = [0]*(n)
m = float("inf")
for i in range(n,0,-1):
  m = min(d_yen[i]+d_snuke[i],m)
  ans[i-1]=10**15-m
print(*ans,sep='\n')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
def main():
    from sys import stdin
    input = stdin.readline
    import numpy as np
    import scipy.sparse as sp

    n, m, s, t = map(int, input().split())
    uvab = np.array([list(map(int, input().split())) for _ in [0]*m])

    data = np.append(uvab[:, 2], uvab[:, 2])
    row = np.append(uvab[:, 0], uvab[:, 1]) - 1
    col = np.append(uvab[:, 1], uvab[:, 0]) - 1

    matrix = sp.csr_matrix(
        (data, (row, col)), shape=(n, n), dtype=np.int32)
    yen = sp.csgraph.dijkstra(matrix, indices=s-1)

    data = np.append(uvab[:, 3], uvab[:, 3])
    matrix = sp.csr_matrix(
        (data, (row, col)), shape=(n, n), dtype=np.int32)
    snk = sp.csgraph.dijkstra(matrix, indices=t-1)

    cost = yen+snk
    m = cost[-1]
    for i in range(n-1, -1, -1):
        m = min(cost[i], m)
        cost[i] = m

    cost = 10**15-cost

    for i in cost:
        print(int(i))


main()

Submission status: Runtime Error

Solution code:

strings=[input() for string in range(2)]
string=strings[0]
num=int(strings[1])
i=0
check=True

while check:
    s=string[i:i+num]
    if len(s)<num:
        check=False
    print(s)
    i=i+num

Submission status: Runtime Error

Solution code:

a=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: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;

signed main(){
    int a,b;
    cin >> a >> b;
    if(a + b == 15) cout << "+" << endl;
    else if(a * b == 15) cout << "*" << endl;
    else cout << "x" << endl;
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

import numpy as np
from heapq import heappush, heappop

N,M,S,T = map(int,input().split())
graph = [[] for _ in range(N+1)]
for _ in range(M):
    u,v,a,b = map(int,input().split())
    graph[u].append((v,a,b))
    graph[v].append((u,a,b))

def dijkstra(start, mode):
    INF = 10 ** 15
    dist = [INF] * (N+1)
    dist[start] = 0
    q = [(0,start)]
    while q:
        d,v = heappop(q)
        if dist[v] < d:
            continue
        for w,*a in graph[v]:
            d1 = d + a[mode]
            if dist[w] > d1:
                dist[w] = d1
                heappush(q, (d1,w))
    return dist

d1 = np.array(dijkstra(S,0))
d2 = np.array(dijkstra(T,1))

d1 += d2
answer = 10 ** 15 - np.minimum.accumulate(d1[::-1])[::-1][1:]

print('\n'.join(answer.astype(str)))

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
if A+B==15:print("+")
elif A*B==15:print("*")
else :print("x")

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
if A+B==15:print("+")
else if A*B==15:print("*")
else :print("x")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, m, d = list(map(int, input().split()))
if (d == 0):
	ans = (m - 1) * (1 / n)
	print(ans)
else:
	ans = (m - 1) * (2 * (n - d) / n ** 2)
	print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main() {
  int a, b; cin >> a >> b;
  if (a + b == 15) cout << "+" << endl;
  else if (a * b == 15) cout << "*" << endl;
  else cout << "x" << endl;
}

Submission status: Runtime Error

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

if (a+b==15):
  print("+")
elseif (a*b==15):
  print("*")
else:
  print("×")

Submission status: Runtime Error

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

if a+b=15:
  print("+")
elseif a*b=15:
  print("*")
else:
  print("×")

Submission status: Runtime Error

Solution code:
# coding: UTF-8
num = (raw_input("")).split("")
if (num[0] * num[1]) == 15:
    print "*"
el if (num[0] + num[1]) == 15:
    print "+"
else:
    print "x"

Submission status: Runtime Error

Solution code:
# coding: UTF-8
num = (raw_input("")).split("")
if num[0]*num[1] == 15:
    print "*"
el if num[0]+num[1] == 15:
    print "+"
else:
    print "x"

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

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

Submission status: Runtime Error

Solution code:
from heapq import *
import numpy as np

class vertex:
    def __init__(self):
        self.list_adj = []  # list of [no_adjnode, a, b]

    def add_edge(self, adj):
        self.list_adj.append(adj)

n, m, s, t = map(int, input().split())
# zero start
s -= 1
t -= 1

# 
vertices = []
for i in range(n):
    v = vertex()
    vertices.append(v)

print(n, m, s, t)
# load node
for k in range(m):
    u, v, a, b = map(int, input().split())
    vertices[u-1].add_edge([v-1, a, b])
    vertices[v-1].add_edge([u-1, a, b])


#print('-----------------')

#print(n, m, s, t)
#for i in range(n):
#    print(vertices[i].list_adj)

mode = 0
# return list of [no_adj, cost]
def get_adj(v):
    res = []
    for adj in v.list_adj:
        res.append([adj[0], adj[1+mode]])
    return res

#print('show adjcent(a)')
#for k in range(n):
#    print(get_adj(vertices[k]))

mode = 1
#print('show adjcent(b)')
#for k in range(n):
#    print(get_adj(vertices[k]))

def dijkstra(s):
    inf = int(10e20)
    dist = [inf] * n
    h = []
    heappush(h, (0, s))
    while len(h) > 0:
        # pop 1 node
        dv, v = heappop(h)
        # if already decided, continue
        if dist[v] < inf:
            continue
        dist[v] = dv
        # push adjcent node
        list_adj = get_adj(vertices[v])
        for adj in list_adj:
            if dist[adj[0]] == inf:
                heappush(h, (dv + adj[1], adj[0]))
                pass
        pass
    return dist

mode = 0
dist_a = dijkstra(s)
mode = 1
dist_b = dijkstra(t)
#cost = []
#for k in range(len(dist_a)):
#    cost.append(dist_a[k] + dist_b[k])
cost = np.array(dist_a,dtype = 'int') + np.array(dist_b,dtype = 'int')
cost = np.array(cost, dtype='int')
#print(cost)

m0 = int(10e15)
for i in range(n):
    cost_available = cost[i:]
    print(m0-np.amin(cost_available))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
[a, b] = input().split()
if a+b == 15:
  print("+")
  return
if a*b == 15:
  print("*")
  return
print("x")
return

Submission status: Runtime Error

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

"""
#kuso code
start = time.time()
a = [random.randrange(n) for i in range(m)]
a = np.array(a)
b = np.abs(a[1:]-a[:-1])
cnt = np.sum(b == d)
ave = cnt

i = 0
while(time.time() - start < 10):
    a = [random.randrange(n) for i in range(m)]
    a = np.array(a)
    b = np.abs(a[1:]-a[:-1])
    cnt = np.sum(b == d)
    ave = ((i+1)*ave + cnt)/(i+2)
    i += 1
print(ave)
"""

oks*n = 2*np.max(n-2*d,0) + 2*d)
ave = oks*(m-1)/n/n
print(ave)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
l=input()
x=''
for i in range(len(s)):
        if i%l==0:
                x+=s[i]
print(x)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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