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


num1 = A + B
num2 = A - B
num3 = A * B

print(max(num1, num2, num3))

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

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

print(ans)

Submission status: Accepted

Solution code:
a, b = (int(_) for _ in 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 = (int(i) for i in 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())

m = max(a+b, a-b)

print(max(m, a*b))

Submission status: Accepted

Solution code:
a, b = [int(v) for v in 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:
from sys import stdin

# input
a,b = [int(x) for x in stdin.readline().rstrip().split()]

# output
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

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

input = lambda: stdin.readline()
main()

Submission status: Accepted

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


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:
# coding: utf-8
# Your code here!
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:
INF = 10**12
MOD = 10**9 + 7
a, b = [int(item) for item in 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:
import sys
import collections
import copy
import math
input = sys.stdin.readline
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 math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from itertools import permutations
# 組み合わせ {}_len(seq) C_n: combinations(seq, n)
from itertools import combinations
# 一次元累積和
from itertools import accumulate
from bisect import bisect_left, bisect_right

import re
# import numpy as np
# from scipy.misc import comb

# 再帰がやばいとき
# import sys
# sys.setrecursionlimit(10**9)

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

# 四方向: 右, 下, 左, 上
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]
 
def i_inpl(): return int(input())
def l_inpl(): return list(map(int, input().split()))
def line_inpl(x): return [i_inpl() for _ in range(x)]

INF = int(1e30)
MOD = int(1e9)+7 # 10^9 + 7

# field[H][W]
def create_grid(H, W, value = 0):
    return [[ value for _ in range(W)] for _ in range(H)]

########

def main():
    A, B = l_inpl()
    print(max([A+B, A-B, A*B]))
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = (int(num) for num in 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:
n,k = map(int,input().split())

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

Submission status: Accepted

Solution code:
# ABC 137, a
a, b = [int(el) for el in input().split(' ')]
print(max(a + b, a - b, a * b))

Submission status: Accepted

Solution code:
import numpy as np
import math
import sys
sys.setrecursionlimit(10000000)

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

Submission status: Accepted

Solution code:

A, B = list(map(int, input().split()))
t = max(A + B, A - B)
t = max(t, A * B)

print(t)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 
import math
import sys
import itertools
import numpy as np

# なんこか入力
a,b = map(int, input().split())


answer = max(a+b,a-b,a*b)

print(answer)

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 =[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:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa == x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))

a,b = l()

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
import re
from collections import deque
import sys
import math
input = sys.stdin.readline


def int_raw():
    return int(input())


def ss_raw():
    return input().split()


def ints_raw():
    return tuple(map(int, ss_raw()))


DIV = 10**9+7


def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def ncr(n, r, mod=DIV):
	r = min(r, n-r)
	ret = 1
	for i in range(1, r+1):
		ret = ret * (n-i+1) % mod
		ret = ret * mod_inv(i, mod) % mod
	return ret


def main():
    A,B = ints_raw()
    return max(A+B,A-B,A*B)
    
print(main())

Submission status: Accepted

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

c = max(a+b, a-b)
d = max(c, a*b)

print(d)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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= [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 = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools, os
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 _pf(s): return print(s, flush=True)
def perr(s): return print(s, file=sys.stderr)
def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('- {} -> {}'.format(name, val), file=sys.stderr)
            return None
A, B = LI()
print(max(A+B, A-B, A*B))

Submission status: Accepted

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

s = A + B
m = A - B
mul = A * B
print(max(s, m, mul))

Submission status: Accepted

Solution code:
import numpy as np
N,M = map(int,input().split())

a = N + M
b = N * M
c = N - M

print(max(a,b,c))

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

Submission status: Accepted

Solution code:
A, B = [int(s) for s in 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:

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

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 = 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(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:
from collections import defaultdict, deque
import sys
import math

sys.setrecursionlimit(100000)

MIN = -10 ** 9
MAX = 10 ** 9 + 7


def main():
    # N = int(input())
    A,B = [int(a) for a in input().split()]
    # H = [
    #     int(input())
    #     for _ in range(N)
    # ]
    # A = [int(a) for a in input().split()]
    print(max(max(A+B,A-B),A*B))


if __name__ == '__main__':
    main()

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

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

a, b = na()

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:
#!/usr/bin/env python3
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,a+b,a-b]

print(max(x))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
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())
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:

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

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array, use [[0] * N for _ in range(N)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions used
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    A, B = R()
    print(max(A+B, A-B, A*B))
    
    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意

a,b = [int(i) for i in readline().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

A, B = map(int, input().strip().split(' '))
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
#! python

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

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b = map(int, input().split())
print(max(a + b, a - b, a * b))

Submission status: Accepted

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

Submission status: Accepted

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

l = [x+y, x-y, x*y]
print(max(l))

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) = (int(i) for i in input().split(" "))
print(max([A+B,A-B,A*B]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


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


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

if __name__ == '__main__':
    main()

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 = list(map(int,input().split())) #input from array of integer like "1 2 3"

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(max(N+K, max(N-K, N*K)))

Submission status: Accepted

Solution code:
import math
import copy

#n = int(input())
n, k = [int(i) for i in input().split()]
#table = [[int(i) for i in input().split()] for j in range(n)]
#table = [list(input()) for n in range(h)]
#s = [int(i) for i in input().split()]
#num = [int(i) for i in range(n)]
#s = [input() for i in range(n)]
#s = input()
#list = list(s)
#dp = [[0 for _ in range(2)] for _ in range(13)]


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

Submission status: Accepted

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

sys.setrecursionlimit(10**7)
inf=10**20
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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b=LI()
  return max(a+b,a-b,a*b)

# main()
print(main())

Submission status: Accepted

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

Submission status: Accepted

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

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=(int(x) for x in input().split())

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
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())
s=[a+b, a-b, a*b]
print(max(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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
    solve(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())
c=a+b
d=a-b
e=a*b
print(max(c,max(d,e)))

Submission status: Accepted

Solution code:
import sys, math
from collections import deque

readline = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)

def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math

a, b = getList()

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

# print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
A,B = [int(x) for x in stdin.readline().rstrip().split()]
print(max((A+B),(A-B),(A*B)))