Problem:


Score : 100 points

Problem Statement

You are given two integers A and B.
Find the largest value among A+B, A-B and A \times B.

Constraints

-1000 \leq A,B \leq 1000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

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

Sample Input 1

3 1

Sample Output 1

4

3+1=4, 3-1=2 and 3 \times 1=3. The largest among them is 4.

Sample Input 2

4 -2

Sample Output 2

6

The largest is 4 - (-2) = 6.

Sample Input 3

0 0

Sample Output 3

0



Sample input:
3 1


Sample output:
4

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 = [int(x) for x in 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())

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=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())

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

print(max(a,b,c))

Submission status: Accepted

Solution code:
def main():
    a, b = list(map(int, 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(" "))
print(max(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())
print(max(a + b, a - b, a * b))

Submission status: Accepted

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')


a, b = LI()
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:
#ABC098
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
print(max(x, y, z))

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())


A,B = MI()
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 = max(A+B,A-B,A*B)
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ans=max(a+b,a-b)
print(max(ans,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:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


A,B = MI()
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 = max(A + B, A - B, A * B)
print(ans)

Submission status: Accepted

Solution code:
import sys

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 = 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
import sys

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


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

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


if __name__ == '__main__':
    main()

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())
print(max(a+b, a-b, a*b))

Submission status: Accepted

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

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:
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())
print(max(a*b,a+b,a-b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input();print(max(eval(a.replace(" ",k))for k in"+-*"))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
print(max(a+b,a-b,a*b))

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())
s = a + b
t = a - b
w = a * b

print(max(s, t, w))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = []
c.append(a+b)
c.append(a-b)
c.append(a*b)
c = sorted(c, reverse=True)
print(c[0])

Submission status: Accepted

Solution code:
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    a, b = nm()
    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 ())
x = a+b
y = a-b
z = a*b
if x>=y and x>=z:
  print (x)
elif y>=x and y>=z:
  print (y)
else:
  print (z)

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 = max(a*b, max(a+b, a-b))
print(x)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

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,max(A*B,A-B)))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

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:
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 =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());print(max(a+b,a-b,a*b))

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())
ans = max(a+b, a-b, a*b)
print(ans)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B = map(int, readline().split())
    print(max(A+B,A-B,A*B))




if __name__ == '__main__':
    main()

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())
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())
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
if x>=y and x>=z:
    print(x)
elif y>=x and y>=z:
    print(y)
else:
    print(z)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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

A, B = MAP()
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:
ary = input().split(" ")
A = int(ary[0])
B = int(ary[1])
print(max([A + B, A - B, A * B]))

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
from fractions  import gcd
#input=sys.stdin.readline
#import bisect
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())
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())
result = []
result.append(a+b)
result.append(a-b)
result.append(a*b)
print(max(result))

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())

ans = []

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

print(max(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())
print(max(a+b,max(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())

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

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, read().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())
List = [a+b, a*b, a-b]
List.sort()
print(List[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a,b = I()
x = max(a+b,a-b)
print(max(x,a*b))

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:
def solve():
    A, B = map(int, input().split())
    print(max(A + B, A - B, A * B))


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
ans=0
s1=A+B
s2=A-B
s3=A*B
if s1>=s2:
  s=s1
else:
  s=s2
if s<=s3:
  s=s3
print(s)

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()
print(x[2])

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())
a=A+B
b=A-B
c=A*B
print(max(a,b,c))

Submission status: Accepted

Solution code:
a = list(map(int, 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())
if a + b > a * b:
    if a + b > a - b:
        print(a + b)
    else:
        print(a - b)
elif a * b > a - b:
    if a * b > a - b:
        print(a * b)
    else:
        print(a - b)
else:
    print(a - b)

Submission status: Accepted

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

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,max(a-b,a*b)))

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:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

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

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

Submission status: Accepted

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

if not (-1000 <= A <= 1000 and -1000 <= B <= 1000):
    sys.exit()

result = -1000
if A + B > result:
    result = A + B
if A - B > result:
    result = A - B
if A * B > result:
    result = A * B

print(result)

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())
print(max([a+b,a-b,a*b]))

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:
A, B = map(int, input().split())
ans = max(A+B, A-B, A*B)
print(ans)

Submission status: Accepted

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

import sys

DEBUG = False

def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep = " "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    a, b = read_list(int)
    print(max([a + b, a - b, a * b]))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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 = map(int, input().split())
print(max(a*b,a+b,a-b))

Submission status: Accepted

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

AB_add = A + B
AB_dec = A - B
AB_mul = A * B

a = [AB_add, AB_dec, AB_mul]

a.sort()

print(a[2])

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

pl = a + b
mi = a - b
ml = a * b
l = sorted([pl, mi, ml])

print(l[-1])

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

a,b = I()
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())
print(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:
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:
def main():
    A, B = map(int, input().split())
    print(max(A+B, A-B, A*B))
main()

Submission status: Accepted

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

Submission status: Accepted

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


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

# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    print(solve(A, B))

def test():
    import doctest
    doctest.testmod()

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

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:
# input
A, B = map(int, input().split())

# check
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())
print(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:
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())

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)
print(max(x))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def actual(a, b):
    return max((a + b, a - b, a * b))

a, b = map(int, input().split())
print(actual(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 = [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())

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 = max(A + B, A - B, A * B)

print(ans)

Submission status: Accepted

Solution code:
#n=int(input())
a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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

print(max(l))

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())
x=max((a+b),(a-b),a*b)
print(x)

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:
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 = [a+b,a-b,a*b]
print(max(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())

ans = max(a+b, a-b)
ans = max(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())
print(max([a+b,a-b,a*b]))

Submission status: Accepted

Solution code:
from sys import stdin

A, B, = [int(x) for x in stdin.readline().rstrip().split()]  # 空白区切り
ANS = max(A + B, A - B, A * B)
print(ANS)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
s = a+b
t = a-b
p = a*b
li = [s, t, p]
li.sort()
print(li[-1])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = a + b
d = a - b
e = a * b
if d <= c and e <= c:
    print(c)
elif c <= d and e <= d:
    print(d)
else:
    print(e)

Submission status: Accepted

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

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,a*b,a-b]
print(max(A))

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
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())
lst=[A+B,A*B,A-B]
print(max(lst))

Submission status: Accepted

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

Submission status: Accepted

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

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



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    print(max(a + b, a - b, a * b))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])
l = [a+b, a-b, a*b]
print(sorted(l, reverse=True)[0])

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:
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())
compare = []

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

print(max(compare))

Submission status: Accepted

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

Submission status: Accepted

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

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())

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