Problem:


Score : 100 points

Problem Statement

We have two integers: A and B.

Print the largest number among A + B, A - B, and A \times B.

Constraints

All values in input are integers.

-100 \leq A,\ B \leq 100

Input

Input is given from Standard Input in the following format:

A B

Output

Print the largest number among A + B, A - B, and A \times B.

Sample Input 1

-13 3

Sample Output 1

-10

The largest number among A + B = -10, A - B = -16, and A \times B = -39 is -10.

Sample Input 2

1 -33

Sample Output 2

34

The largest number among A + B = -32, A - B = 34, and A \times B = -33 is 34.

Sample Input 3

13 3

Sample Output 3

39

The largest number among A + B = 16, A - B = 10, and A \times B = 39 is 39.



Sample input:
-13 3


Sample output:
-10

Submission status: Accepted

Solution code:

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

x=A+B
y=A-B
z=A*B

if x>y and x>z:
    print(x)
elif z>y and z>x:
    print(z)
else:
    print(y)

Submission status: Accepted

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

a = x + y
b = x - y
c = x * y

if a > b:
    if a > c:
        print(a)
    else:
        print(c)
else:
    if b > c:
        print(b)
    else:
        print(c)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
plu = a + b
dis = a - b
multi = a * b

print(max(plu, dis, multi))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = a - b
d = a + b
e = a * b
print(max(c, d, e))

Submission status: Accepted

Solution code:
import numpy as np
a = [int(i) for i in input().split()] 

print(np.array([a[0]+a[1],a[0]-a[1],a[0]*a[1]]).max())

Submission status: Accepted

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

li=[n*m,n+m,n-m]
print(max(li))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = a + b
d = a - b
e = a*b
print(max([c, d, e]))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
result=0
if a+b>a-b:
    result=a+b
    if a*b>result:
        result=a*b
else:
    result=a-b
    if a*b>result:
        result=a*b
print(result)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A+B<=A-B:
    if A-B<=A*B:
        print(A*B)
    else:
        print(A-B)
else:
    if A+B<=A*B:
        print(A*B)
    else:
        print(A+B)

Submission status: Accepted

Solution code:
A,B=map(int, input().split())
print(max(max(A+B,A-B),A*B))

Submission status: Accepted

Solution code:
# A
A, B = map(int, input().split())
print(max(A + B, A - B, A * B))

Submission status: Accepted

Solution code:
(A, B) = map(int, input().split())
x = A+B
y = A-B
z = A*B
ans = [x, y, z]
print(max(ans))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c1 = a + b
c2 = a - b
c3 = a * b
print(max(c1, c2, c3))

Submission status: Accepted

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

kakeru=a*b
minus=a-b
plus=a+b


if kakeru > minus:
    grater=kakeru
else:
    grater=minus

if grater > plus:
    max=grater
else:
    max=plus

print(max)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    a, b = [int(i) for i in input().split()]
    print(max([a + b, a - b, a * b]))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

sum = a + b
sub = a - b
multi = a* b

x = [sum, sub, multi]

print(max(x))

Submission status: Accepted

Solution code:
A, B   = map(int, input().split())
x= A+B
y= A-B
z=A*B
print(max([x,y,z]))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
by=a*b
plus=a+b
mi=a-b
print(max(by,plus,mi))

Submission status: Accepted

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

plus = a + b
minus1 = a - b
kake = a * b

result = max(plus, minus1, kake)

print(result)

Submission status: Accepted

Solution code:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
 
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！
 
def main():
    a,b=map(int,input().split())
    print(max(a+b,a-b,a*b))
                    
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=(int(x) for x in input().split())
print(max([a+b,a-b,a*b]))

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
a = int(x + y)
b = int(x - y)
c = int(x * y)
l = [a, b, c]
print(max(l))

Submission status: Accepted

Solution code:
X = input().split()
A = int(X[0])
B = int(X[1])

ans = -999999999

a = []

a.append(A+B)
a.append(A-B)
a.append(A*B)

add = A+B
sub = A-B
mul = A*B

if add > ans:
    ans = add

if sub > ans:
    ans =sub

if mul > ans:
    ans = mul

print(ans)

Submission status: Accepted

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

sum = a + b
diff = a - b
mul = a * b
ans = sum

if sum > diff:
    ans = sum
else:
    ans = diff

if ans > mul:
    print(ans)
else:
    print(mul)

Submission status: Accepted

Solution code:
a, b = map(int, input("").split())
print (max([a + b, a - b, a * b]))

Submission status: Accepted

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

tmp1 = a + b
tmp2 = a - b
tmp3 = a*b

m = tmp1
if m < tmp2:
  m = tmp2
if m < tmp3:
  m = tmp3

print(m)

Submission status: Accepted

Solution code:
str = input()

A = (int(str.split()[0]))
B = (int(str.split()[1]))

X = A + B
Y = A - B
Z = A * B
E = 0
if (X < Y) :
	if (Y < Z) :
		E = Z
	else :
		E = Y
else :
	if (X < Z) :
		E = Z
	else :
		E = X
print("{}".format(E))

Submission status: Accepted

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

c=[]
c.append(a+b)
c.append(a-b)
c.append(a*b)

print(max(c))

Submission status: Accepted

Solution code:
A,B= map(int,input().split())
x=A+B
y=A-B
z=A*B
s=[x,y,z]
s.sort()
print(s[2])

Submission status: Accepted

Solution code:
tmp = input().split()
a = int(tmp[0])
b = int(tmp[1])
array = [a + b, a - b, a * b]
print(max(array))

Submission status: Accepted

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

kouho = []
kouho.append(a + b)
kouho.append(a - b)
kouho.append(a * b)
print(max(kouho))

Submission status: Accepted

Solution code:
s = input().split()
a = int(s[0])
b = int(s[1])

print(max(a+b,max(a-b,a*b)))

Submission status: Accepted

Solution code:
import math
a, b= map(int, input().split())
s = max([a+b, a-b, a*b])
print(s)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())			# "5 7" -> ["5", "7"] -> 5, 7 => N=5,K=7

print( max( a+b, a-b, a*b ) )

Submission status: Accepted

Solution code:
ab = input()
a = int(ab.split(' ')[0])
b = int(ab.split(' ')[1])

apb = a+b
amb = a-b
akb = a*b

if apb > amb:
    if apb > akb:
        print(apb)
    else:
        print(akb)
else:
    if amb > akb:
        print(amb)
    else:
        print(akb)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
print(str(max(A+B, A-B, A*B)))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ls = [a + b, a - b, a * b]
ls.sort()
print(ls[2])

Submission status: Accepted

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

plus =  A + B
minus = A - B
mult =  A * B

a_list = []
a_list.append(plus)
a_list.append(minus)
a_list.append(mult)

print(max(a_list))

Submission status: Accepted

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

max_num = - float('inf')

if A + B > max_num:
    max_num = A + B

if A - B > max_num:
    max_num = A - B

if A * B > max_num:
    max_num = A * B

print(max_num)

Submission status: Accepted

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

ans = [x*y,x+y,x-y]

print(max(ans))

Submission status: Accepted

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

x = [a+b, a-b, a*b]

print(max(x))

Submission status: Accepted

Solution code:
def main():
    s = input()
    [a, b] = [int(number) for number in s.split()]

    if b > 0:
        print(max(a + b, a * b))
    else:
        print(max(a - b, a * b))    

if __name__ == '__main__':
    main()

Submission status: Accepted

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

plus = a + b
minus = a - b
mul = a * b

print(max(plus, minus, mul))

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))[:2]
ans = max(a + b, max(a - b, a * b))
print(ans)

Submission status: Accepted

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

P = A + B
Q = A - B
R = A * B

li = [P,Q,R]

print(max(li))

Submission status: Accepted

Solution code:
def greater(A,B):
    sum1 = A + B
    diff = A - B
    multi = A * B
    
    ans = max(sum1,diff,multi)
    return ans
A, B = [int(i) for i in input().split(" ")]
print(greater(A,B))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
	  
print(max([a + b, a - b, a*b ]))

Submission status: Accepted

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


sum = A + B
diff = A - B
kake = A * B

if ( sum < diff ):
  res = diff
else:
  res = sum

if ( res < kake ):
  res = kake

print(res)

Submission status: Accepted

Solution code:
s = input().split(" ");
a = int(s[0]);
b = int(s[1]);

ans = -100000;

if a+b > ans :
	ans = a+b;

if a-b > ans :
	ans = a-b;
	
if a*b > ans :
	ans = a*b;
	
print(ans);

Submission status: Accepted

Solution code:
a, b = map(int, input().split(' '))
print(max([a + b, a - b, a * b]))

Submission status: Accepted

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

x.append(A+B)
x.append(A-B)
x.append(A*B)

x.sort(reverse=True)

print(x[0])

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
print(max([A+B, A-B, A*B]))

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
print(max(A*B,A- B,A+B))

Submission status: Accepted

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

ans = -10000000

if a + b >= ans:
    ans = a + b
if a - b >= ans:
    ans = a - b
if a * b >= ans:
    ans = a * b

print(ans)

Submission status: Accepted

Solution code:
s = input().split()
a=int(s[0])
b=int(s[1])
print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
l = [A+B , A-B, A*B]
print(max(l))

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
a = A + B
b = A - B
c = A * B
list = [a, b, c]
print(max(list))

Submission status: Accepted

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

print(max([(A + B), (A - B), (A * B)]))

Submission status: Accepted

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

q = A+B
r = A-B
s = A*B
num_list = [q, r, s]
print(max(num_list))

Submission status: Accepted

Solution code:
a, b = input().split()
a, b = int(a), int(b)
print(max(a+b, a-b, a*b))

Submission status: Accepted

Solution code:
a,b = map(int, raw_input().split())
print max(a+b,a-b,a*b)

Submission status: Accepted

Solution code:
tmp = input()

a = int(tmp.split(' ')[0])
b = int(tmp.split(' ')[1])

x = [0,0,0]

x[0] = a + b
x[1] = a - b
x[2] = a * b

print(max(x))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
a=A+B 
b=A-B
c=A*B

if a>=b and a>=c:
	print(a)
elif b>=c and b>=a:
	print(b)
else:
	print(c)

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
one = A+B
two = A-B
thr = A*B

print(max(one,two,thr))

Submission status: Accepted

Solution code:
[A,B] = map(int, input().split(" ") )
array = [A+B, A-B, A*B]
print(max(array))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if (A+B>=A-B):
  if (A+B>=A*B):
    print(A+B)
  else:
    print(A*B)
else:
  if (A-B>=A*B):
    print(A-B)
  else:
    print(A*B)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
ls=[]
ls.append(A+B)
ls.append(A-B)
ls.append(A*B)
print(max(ls))

Submission status: Accepted

Solution code:
a, b= (int(i) for i in input().split()) 
p = a + b
m = a - b
k = a * b

max = p
if m > max:
    max = m
if k > max:
    max = k

print(max)

Submission status: Accepted

Solution code:
a,b= map(int, input().split())
m =[]
m.append(a+b)
m.append(a-b)
m.append(a*b)
print(max(m))

Submission status: Accepted

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

print str(max(A+B, A-B, A*B))

Submission status: Accepted

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

Submission status: Accepted

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

add = a +b
sub = a-b
mul =a*b

print(max(add,sub,mul))

Submission status: Accepted

Solution code:
# スペース区切りの整数の入力
a, b = map(int, input().split())

print(max([a - b, a + b, a * b]))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
list = [A + B, A - B , A * B]
print(max(list))

Submission status: Accepted

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

p=a*b
sn=a+b
sb=a-b

mx=max(p,sn,sb)

print(mx)

Submission status: Accepted

Solution code:
a,b =map(int,input().split())                                                                                                             
s=a+b       
t=a-b       
u=a*b       
if s>=t and s>=u:print(s)
elif t>=s and t >=u:print(t)
else:print(u)

Submission status: Accepted

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

x=a+b
y=a-b
z=a*b

if x>=y and x>=z:
    print(x)
elif y>=z:
    print(y)
else:
    print(z)

Submission status: Accepted

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

x = A + B
y = A - B
z = A * B

print(max(x, y, z))

Submission status: Accepted

Solution code:
a,b = (int(x) for x in input().split())

print(max(a+b, a-b, a*b))

Submission status: Accepted

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

print(max([l[0]+l[1],l[0]-l[1],l[0]*l[1]]))

Submission status: Accepted

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

a = A + B
b = A - B
c = A * B

print(max([a,b,c]))

Submission status: Accepted

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

ans = [ a*b,a-b,a+b ]
print(max(ans))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('{}'.format(max(a+b, a-b, a*b)))

Submission status: Accepted

Solution code:

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

r0 = A + B
r1 = A - B
r2 = A * B

print(str(max(r0, r1, r2)))

Submission status: Accepted

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

A, B = map(int, input().split())
ans = []
ans.append(A+B)
ans.append(A-B)
ans.append(A*B)
print(max(ans))

Submission status: Accepted

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

sum1=A+B
sum2=A-B
sum3=A*B

list=[sum1,sum2,sum3]
print(max(list))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = [A+B, A-B, A*B]
ans.sort(reverse=True)
print(ans[0])

Submission status: Accepted

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

c = a + b
d = a - b
e = a * b

print(max([c,d,e]))

Submission status: Accepted

Solution code:
A,B =map(int , input().split(" "))
tmp=[A+B,A-B,A*B]
print(max(tmp))

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
def input(): return sys.stdin.readline().strip()
def gcd(x, y): return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y): return (x * y) // gcd(x, y)
MOD = 10 **9 + 7

# N = int(input())
# S = input()
A, B = map(int, input().split())
# 横
# L = [int(x) for x in input().split()]
# 縦
# A = [int(input()) for _ in range(N)]
# 多次元
# L = [[int(x) for x in input().split()] for _ in range(N)]

print(max(max(A + B, A - B), A * B))

Submission status: Accepted

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

print(max(a+b,max(a-b, a*b)))

Submission status: Accepted

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

print(max(n*m,n+m,n-m))

Submission status: Accepted

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

li.append(x+y)
li.append(x-y)
li.append(x*y)

print(max(li))

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
plus = a[0] + a[1]
minus = a[0] - a[1]
kakeru = a[0] * a[1]
print(max(plus, minus, kakeru))

Submission status: Accepted

Solution code:
a, b = (int(i) for i in input().split())  
sum = a+b
diff = a-b
mult = a*b
if b > 0:
    ret = sum if sum > mult else mult
else:
    ret = diff if diff > mult else mult
print(ret)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
C = []
C.append(A + B)
C.append(A - B)
C.append(A * B)
print(max(C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(map(int, input().split()))
A = N[0]
B = N[1]

ans = max(A+B,A-B,A*B)
print(ans)

Submission status: Accepted

Solution code:
a, b =map(int,input().split())
if a+b > a-b:
  c = a+b
else:
  c= a-b

if c > a*b:
  print(c)
else:
  print(a*b)

Submission status: Accepted

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

a1 = a[0] + a[1]

a2 = a[0] - a[1]

a3 = a[0] * a[1]

print(max([a1, a2, a3]))

Submission status: Accepted

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

a, b =  map(int, input().split())

x = a + b
y = a - b
z = a * b

if x >= y:
    if x >= z:
        print(x)
    else:
        print(z)
else:
    if y >= z:
        print(y)
    else:
        print(z)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
ans = sorted([a[0] + a[1],a[0] - a[1],a[0] * a[1]])
print(ans[2])

Submission status: Accepted

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

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

x = A + B
y = A - B
z = A * B

if x >= y and x >= z:
    print(x)
elif y >= z:
    print(y)
else:
    print(z)

Submission status: Accepted

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

a = A + B
b = A - B
c = A * B

if a >= b:
    if a >= c:
        print(a)
    else:
        print(c)
else:
    if b >= c:
        print(b)
    else:
        print(c)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
num = []
num.append(a+b)
num.append(a-b)
num.append(a*b)
print(max(num))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
l = a * b
m = a - b
n = a + b
print(max(l,m,n))

Submission status: Accepted

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

# 標準入力
a, b = map(int, input().split())
#input_num_str= input()
#input_num = int(input())

# スペース区切りの整数の入力
#num_list = list(map(int,input().split()))

result = a + b

if result <  (a -b ):
    result = a-b

if result < (a * b):
    result = a * b

print(result)

Submission status: Accepted

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

a, b = map(int, input().split())

ans = max(a+b, a-b)
ans = max(ans, a*b)
print(ans)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
seki =  A * B 
sums = A + B 
hiku = A - B
print(max(seki, sums, hiku))

Submission status: Accepted

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

a_list = [a + b, a - b, a * b]

print(max(a_list))

Submission status: Accepted

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


def solve(A, B):
    ans = max(A+B, A-B, A*B)
    return ans


if __name__ == '__main__':
    A, B = map(int, input().split())

    ans = solve(A, B)

    print(ans)

Submission status: Accepted

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

ans = [a + b, a- b ,a * b] 

print(max(ans))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
x = A+B
y = A-B
z = A*B
l = []
l.append(x)
l.append(y)
l.append(z)

print(max(l))

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
S = a + b
D = a - b
M = a * b

print(max(S,D,M))

Submission status: Accepted

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

x = a + b
y = a - b
z = a * b

max = 0

if(x > y):
  max = x
else:
  max = y

if(z > max):
  max = z

print(max)

Submission status: Accepted

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

Submission status: Accepted

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

sum = A+B
diff = A-B
multi = A*B

max = sum
if diff > max:
    max = diff

if multi > max:
    max = multi

print(max)

Submission status: Accepted

Solution code:
ab = map(int, raw_input().split())
list = [ab[0]+ab[1], ab[0]-ab[1], ab[0]*ab[1]]
print(max(list))

Submission status: Accepted

Solution code:
nums = [int(s) for s in input().split()]
a = nums[0]
b = nums[1]

box = []
box.append(a + b)
box.append(a - b)
box.append(a * b)
print(max(box))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(max([a+b ,a-b, a*b]))

Submission status: Accepted

Solution code:
a, b = map(int, input().split(' '))
print(max(a*b, a+b, a-b))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
x,y,z = A-B ,A+B,A*B
print(max([x,y,z]))

Submission status: Accepted

Solution code:
a,b=map(int,input().split(" "))
s=[a+b,a-b,a*b]
print(max(s))

Submission status: Accepted

Solution code:
import numpy as np

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

x = np.array([A+B, A-B, A*B])

ans = np.max(x)
print(ans)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
plus = a + b
cross = a*b
minas = a - b
result = [plus,cross,minas]
print(max(result))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
sum = A + B
dif = A - B
pro = A * B

max = sum
if dif > max:
    max = dif
if pro > max:
    max = pro

print(max)

Submission status: Accepted

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

Submission status: Accepted

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

a = A+B
b = A*B
c = A-B
print(max(a,b,c))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
data=[a+b, a-b, a*b]
print(max(data))

Submission status: Accepted

Solution code:
a, b = input().rstrip().split()
a = int(a)
b = int(b)
ab_plus = a + b
ab_minus = a - b
ab_mult = a * b
lst = [ab_plus, ab_mult, ab_minus]
print(max(lst))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
ab = [a + b, a - b, a * b]
print(max(ab))

Submission status: Accepted

Solution code:
def p_a():
    a, b = map(int, input().split())
    a1 = a*b
    a2 = a+b
    a3 = a-b

    if a1 > a2:
        if a1 > a3:
            print(a1)
        else:
            print(a3)
    else:
        if a2 > a3:
            print(a2)
        else:
            print(a3)

if __name__ == '__main__':
    p_a()

Submission status: Accepted

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

n = []
n.append(a+b)
n.append(a-b)
n.append(a*b)

m = sorted(n, reverse=True)
print(m[0])

Submission status: Accepted

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

A = int(A)
B = int(B)
x = A+B
y = A-B
z = A*B
print(max(x, y, z))

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
print(max([a[0]+a[1], a[0] - a[1], a[0]*a[1]]))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
l=[a+b,a-b,a*b]
print(max(l))

Submission status: Accepted

Solution code:
a, b = input().split()
c = int(a) + int(b)
d = int(a) - int(b)
e = int(a) * int(b)
number_list = [c, d, e]
print(max(number_list))

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
a = n[0]
b = n[1]
print(max([(a+b),(a-b),(a*b)]))

Submission status: Accepted

Solution code:
num = input().split()
A = int(num[0])
B = int(num[1])
s = [A+B,A-B,A*B]
print(max(s))

Submission status: Accepted

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

p = A[0] + A[1]
m = A[0] - A[1]
s = A[0] * A[1]

print(max([p, m, s]))

Submission status: Accepted

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

AtasuB = A + B
AhikuB = A - B 
AkakeruB = A*B 
print(max(AtasuB,AhikuB,AkakeruB))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
ans = max([a+b, a-b, a*b])
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
#a = int(input())
b = list(map(int, input().split(" ")))
a = []
a.append(b[0] + b[1]) 
a.append(b[0] - b[1])
a.append(b[0] * b[1])
a.sort()
print(a[2])

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a, b = map(int, input().split())
    max = -10000000
    sum = a+b
    minnus = a-b
    cros = a*b
    if max < sum:
        max = sum
    if max < minnus:
        max = minnus
    if max < cros:
        max = cros
    print(max)

Submission status: Accepted

Solution code:
A, B = (int(i) for i in input().split())
print(max(A + B, A - B, A *B))

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
Answer = max(A + B, A-B, A*B)
print(Answer)

Submission status: Accepted

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

plus_number = a + b
minus_number = a - b
muliple_number = a * b

data_list = [plus_number, minus_number, muliple_number]

max_number = max(data_list)

print(max_number)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
add = a + b
diff = a - b
kake = a * b
max1 = max(add, diff)
max_all = max(max1, kake)
print(max_all)

Submission status: Accepted

Solution code:
A,B  = map(int,input().split())
print(max([A+B, A-B,A*B]))

Submission status: Accepted

Solution code:
a, b = (int(i) for i in input().split())
print(max([a+b,a-b,a*b]))

Submission status: Accepted

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

lists = []

lists.append(a + b)
lists.append(a - b)
lists.append(a * b)


print(max(lists))

Submission status: Accepted

Solution code:
a,b = [int(c) for c in input().split(' ')]
ans0 = a + b
ans1 = a - b
ans2 = a * b
print(max(ans0, ans1, ans2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B = map(int,input().split())

L = []
L.append(A+B)
L.append(A-B)
L.append(A*B)

print(max(L))

Submission status: Accepted

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

p = a+b
m = a-b
k = a*b

print(max(p,m,k))

Submission status: Accepted

Solution code:
inp = [int(v) for v in input().split(' ')]
a = inp[0]
b = inp[1]

m = max([a + b, a - b, a * b])
print(m)

Submission status: Accepted

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


a,b = map(int, input().split())

a1 = a + b
a2 = a - b
a3 = a * b

ans = max(a1, a2, a3)
print(ans)

Submission status: Accepted

Solution code:
s = input().split() 
a = int(s[0])+int(s[1])
b = int(s[0])-int(s[1])
c = int(s[0])*int(s[1])

print(max(a,b,c))

Submission status: Accepted

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

def main():
    A, B = map(int, input().split())

    return max(A + B, A - B, A * B)

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
def main():
    ab = input().split()
    a, b = int(ab[0]), int(ab[1])

    add = a+b
    sub = a-b
    mul = a*b
    maxv = max(add, sub, mul)
    print(maxv)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
c=a+b
d=a-b
e=a*b
print(max([c,d,e]))

Submission status: Accepted

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

from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

A, B = map(int, raw_input().split())
print max(A + B, A - B, A * B)

Submission status: Accepted

Solution code:
a, b = map(int, input().split()) 
anser = a + b
anser2 = a-b
anser3 = a*b
print(max(anser,anser2,anser3))

Submission status: Accepted

Solution code:
point = [int(i) for i in input().split()] 
a = point[0] + point[1]
b = point[0] - point[1]
c = point[0] * point[1]
print(max(a,b,c))

Submission status: Accepted

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

coins = 0

ApB = A + B
AmB = A - B
AxB = A * B

_max = max(ApB, AmB)
_max = max(_max, AxB)

print(_max)

Submission status: Accepted

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

plus =S[0]+S[1]
mini = S[0]-S[1]
kakeru = S[0]*S[1]
arr = [plus,mini,kakeru]
print(max(arr))

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
print(max(l[0]+l[1],l[0]-l[1],l[0]*l[1]))

Submission status: Accepted

Solution code:
# coding: utf-8
# ABC137 A

a,b = map(int, input().split())

res = []
res.append(a + b)
res.append(a - b)
res.append(a * b)

print(max(res))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
a=list()
a.append(A*B)
a.append(A+B)
a.append(A-B)
print(max(a))

Submission status: Accepted

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

result = a+b
if result < a-b:
  result = a-b
if result < a*b:
  result = a*b

print(result)

Submission status: Accepted

Solution code:
data = [int(x) for x in input().split(" ")]
print(max(sum(data),data[0]-data[1],data[0]*data[1]))

Submission status: Accepted

Solution code:
a,b = map(int, raw_input().split())
print max([a+b, a-b, a*b])

Submission status: Accepted

Solution code:
import numpy as np
li = list(map(int,input().split()))
A = li[0]
B = li[1]
print(np.max([A+B,A-B,A*B]))

Submission status: Accepted

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

ans = A+B
if(ans < A-B):
    ans = A-B

if(ans < A*B):
    ans = A*B

print(ans)

Submission status: Accepted

Solution code:
import sys

a, b = map(int, input().split())
print(max(a + b, a - b, a * b))

Submission status: Accepted

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

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

plus = A + B
minus = A - B
times = A * B

print(max(plus, minus, times))

Submission status: Accepted

Solution code:
import numpy as np

Input   =   input().split()
A       =   int(Input[0])
B       =   int(Input[1])
ans     =   [A*B,A+B,A-B]
print(max(ans))

Submission status: Accepted

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

plus = A + B
minus = A - B
multiple = A * B

ma = max(plus, minus)
ma = max(ma, multiple)

print(ma)

Submission status: Accepted

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

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    token = lines[0].split()
    a = int(token[0])
    b = int(token[1])

    return (a, b)


def solve(a, b):




    return max(a+b, max(a-b, a*b))


def main():
    # 出力

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Submission status: Accepted

Solution code:
lst = [int(i) for i in input().split()]
ans = []
ans.append(lst[0] + lst[1])
ans.append(lst[0] - lst[1])
ans.append(lst[0] * lst[1])
print(max(ans))

Submission status: Accepted

Solution code:
x=input().split()
A,B=int(x[0]),int(x[1])
print(max([A*B,A-B,A+B]))

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
print(max(A + B, A- B, A*B))

Submission status: Accepted

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

li=[]

li.append(a+b)
li.append(a-b)
li.append(a*b)

li.sort(reverse=True)

print(li[0])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
lis = [a+b,a-b,a*b]
print(max(lis))

Submission status: Accepted

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

if a+b>a-b:
  if a*b>a+b:
    print(a*b)
  else:
    print(a+b)
    
else:
  if a*b>a-b:
    print(a*b)
  else:
    print(a-b)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
plusAB = A+B
minusAB = A-B
multiAB = A*B
print(max(max(plusAB,minusAB),multiAB))