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

Submission status: Accepted

Solution code:
def Base_10_to_n(X, n):
    X_dumy = X
    out = ''
    while X_dumy>0:
        out = str(X_dumy%n)+out
        X_dumy = int(X_dumy/n)
    return out

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


solve()

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:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res

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 LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    a,b = LI()
    print(max(a+b,a-b,a*b))
    return

#B
def B():

    return

#C
def C():

    return

#D
def D():

    return

#E
def E():

    return

#F
def F():

    return

#Solve
if __name__ == "__main__":
    A()

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 = list(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:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

a, b = readmi()
print(max(a + b, a - b, 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:
a, b = [int(i) for i in input().split()]
l = [a+b, a-b, a*b]
print(max(l))

Submission status: Accepted

Solution code:
import numpy as np
from collections import defaultdict
from functools import reduce

# s = input()
# n = int(input())
# A = list(map(int, input().split()))
a, b = map(int, input().split())

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

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:
#!/usr/bin/env python3
import sys


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, max(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:

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 -*-

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

A, B = [int(item) for item 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())
L = [A+B, A-B, A*B]

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

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


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


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

    ans = solve(A, B)
    if ans is not None:
        print(ans)


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:
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
Mod = 1000000007



def main(): #startline--------------------------------------------
    A,B = map(int,input().split())
    print(max(A+B,A-B,A*B))
if __name__ == "__main__":
    main() #endline===============================================




def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n < 2 is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))):
        if prime[i] == 1:
            for j in range(2*i,n):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n):
        if prime[i] == 1:
            res.append(i)
    return res

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

    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

Submission status: Accepted

Solution code:
import sys, math, itertools, bisect, copy, re
from collections import Counter, deque, defaultdict

# from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
# from functools import reduce
# from math import ceil, floor, log10, log2, factorial
# from pprint import pprint

INF = float('inf')
MOD = 10 ** 9 + 7
EPS = 10 ** -7
sys.setrecursionlimit(1000000)

# N = int(input())
# N,M = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]
# A = [int(input()) for _ in range(N)]
# DP = [[0] * 100 for _ in range(100)]
# DP = defaultdict(lambda: float('inf'))


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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
from functools import reduce
import sys
import math
import bisect
import random
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return list(map(float, sys.stdin.readline().split()))
def LS():return sys.stdin.readline().split()
def SR(n): return [list(sys.stdin.readline())[:-1] for i in range(n)]
def IR(n): return [int(sys.stdin.readline()) for i in range(n)]
def LIR(n): return [list(map(int, sys.stdin.readline().split())) for i in range(n)]
def LSR(n): return [list(map(list, sys.stdin.readline().split())) for i in range(n)]
_gcd = lambda x, y: _gcd(y, x%y) if (x%y) else y
_lcm = lambda x, y: x*y // _gcd(x, y)
def gcd(*numbers):
    return reduce(_gcd, numbers)
def lcm(*numbers):
    return reduce(_lcm, numbers)
sys.setrecursionlimit(1000000)
INF = float('inf')
mod = 1000000007
dire4 = [(1,0), (0,1), (-1,0), (0,-1)]
dire8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]


A, B = LI()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [A, B] = string_to_int(inputs[0])
    ret = []
    ret.append(A+B)
    ret.append(A-B)
    ret.append(A*B)
    return max(ret)


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

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

tasu=a+b
hiku=a-b
kake=a*b

print(max(tasu, hiku, kake))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter

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

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
#### import ####
import sys
import math
from collections import defaultdict

#### 設定 ####
sys.setrecursionlimit(10**7)

#### 定数 ####
mod = 10**9 + 7

#### 読み込み ####
def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
  read_all = [tuple(map(int, input().split())) for _ in range(N)]
  return map(list,zip(*read_all))

#################

A,B = II()

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

Submission status: Accepted

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


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

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

Submission status: Accepted

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

import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b = LI()
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())


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())
# n, *a = map(int, open(0))

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

Submission status: Accepted

Solution code:
# Your code here!
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
# -*- coding: utf-8 -*-

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

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

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

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

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


A, B = list(map(int, sys.stdin.readline().split()))
print(max(A+B, A-B, A*B))

Submission status: Accepted

Solution code:
#

import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def Input():
    return mapt(int, input().split(" "))

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


print(main())

Submission status: Runtime Error

Solution code:

a, b = map(int, input().split())
x = a + b
y = a - b
z = a * b
O = [x,y,z]
O = sorted(O,reverse=1)
print(O[0]

Submission status: Runtime Error

Solution code:
a, b = map(int,input().split())
x = a + b
y = a - b
z = a * b
O = sorted(list(x, y, z),reverse=True)
print(O[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

A, B = mapint()
print(mas(A+B, A-B, A*B))

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
s = a+b
t = a-b
u = a*b

if s >= t:
    if t >= u:
        print(s)
    elif s <= u:
        print(u)
else:
    if s >= u:
        print(t)
    elif:
        t <= u:
        print(u)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

p = A+B
m = A-B
M = A*B

L = []

L.append(p)
L.append(m)
L.append(M)

print(max(M))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = map(int,input())
list_ab =[]
list_ab.append(a+b)
list_ab.append(a-b)
list_ab.append(a*b)

print(max(list_ab))

Submission status: Runtime Error

Solution code:
import sys
# from collections import defaultdict, deque
# import math
# import copy
# from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 1000000007

def solve():
    a,b = getList()
    print(max([a+b, a - b. a * b]))
    return
def main():
    n = getN()
    for _ in range(n):
        solve()
if __name__ == "__main__":
    # main()
    solve()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    if(a+b>=a-b&&a+b>=a*b)
        cout<<a+b;
    else if(a-b>=a+b&&a-b>=a*b)
        cout<<a-b;
    else if(a*b>=a-b&&a*b>=a+b)
        cout<<a*b;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
x=a*b
y=a+b
z=a-b
if(x>y and x>z):
    print(x)
if(y>x and y>z):
    print(y)
if (z > y and z > x):
        print(z)

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
x=a*b
y=a+b
z=a-b
m=max(x,y,z)
print(m)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ad = A + B
mi = A - B
mu = A * B
print(max([ad,mi,mu,])

Submission status: Runtime Error

Solution code:
A, B = map(int, input()split())
x = A+B
y = A-B
z = A*B

if B>=0:
  if x - z >= 0:
    print(x)
  else:
    print(z)
else:
  if y - z >= 0:
    print(y)
  else:
    print(z)

Submission status: Runtime Error

Solution code:
A, B = map(int, input()split())
x = A+B
y = A-B
z = A*B

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def solve():
    ans = 0
    N, M, P = map(int, input().split())
    edge = []
    for i in range(M):
        a,b,c = map(int, input().split())
        edge.append([P-c,a-1,b-1])
    d = [10**10]*N
    d[0]=0
    n = 0
    while True:
        n += 1
        update = False
        if n==N:
            updateN = False
        for i in range(M):
            w,u,v = edge[i]
            if d[u]<10**10 and d[v]>d[u]+w:
                d[v] = d[u]+w
                update = True
                if n>=N and v==N-1:
                    updateN = True
        if not update:
            break
        if n==N+M:
            if updateN:
                return -1
            break
    return max(0,-d[-1])
print(solve())

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import factorial
n = int(input())
k = int(input())
print(factorial(n+k-1)//factorial(k)//factorial(n-1) % 1000000007)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import math
import bisect

def main():
    a, b = map(int, input())
    A = []
    A.append(a + b)
    A.append(a - b)
    A.append(a * b)
    print(max(A))
    
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
K,X = map(int, input().split())
max = X + K - 1
min = X - k + 1
for i in range(min,max):
    print(i,end=" ")

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
pl = a+b
di = a-b
mu = a*b
if pl>di and pl>mu:
    print(pl)
elif di>pl and di>mu:
    print(di)
else mu>di and mu>pl:
    print(mu)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

if plus >= minus:
	if plus >= cross:
		print(plus)
    else:
		print(cross)
else:
	print(minus)

Submission status: Runtime Error

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

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

if plus >= minus:
	if plus >= cross:
      print(plus)
    else:
      print(cross)
else:
	print(minus)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections
n=int(input())
s=collections.Counter(["".join(sorted(input())) for _ in range(n)])
v=list(s.values())
res=0
for u in v:
	if u!=1:
		res += u*(u-1)//2
print(res)

Submission status: Runtime Error

Solution code:
P=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101]
n=int(input())
A=[1]*n

for i in range(n):
	s=input()
	for j in range(10):
		A[i] *= P[ord(s[j])-97]

res=0
for i in range(n):
	for j in range(i+1,n):
		if A[i]==A[j]:
			res += 1
print(res)

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
13 3

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(max(mul,sub,add))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
let test a b =
  max (max (a+b) (a-b)) (a*b);;

Scanf.sscanf (read_line ()) "%d %d" (fun a b -> test a b);;

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
ad = a+b
minus = a-b
cross = a*b
lis = [ad, minus, cross]
print(max(lis))

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
add = a+b
minus = a-b
cross = a*b
lis = [add, minus, cross]
print(max(lis))

Submission status: Runtime Error

Solution code:
import numpy as np
a = int(input())
b = int(input())
add = a+b
minus = a-b
cross = a*b
lis = np.array([add, minus, cross])
print(np.max(lis))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ld long double
#define endl '\n'
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vpii vector<pii>
#define gr vector<vpii>
#define str string
#define mask vector<bool>
#define vs vector<str>
#define ordered_set_of(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
#define fi first
#define se second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define nub(x) x.resize(unique(all(x)) - x.begin())
#define TWO class T1, class T2
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define GAME_OVER return 0
using namespace std;
using namespace __gnu_pbds;
char _$ = ' ';
struct sep {sep(char c) {_$ = c;}};
ostream& operator<<(ostream& o, sep s) {return o;}
template<TWO> ostream& operator<<(ostream& o, pair<T1, T2> x) {return o << x.fi << ' ' << x.se;}
template<TWO> istream& operator>>(istream& i, pair<T1, T2>& x) {return i >> x.fi >> x.se;}
template<class T> ostream& operator<<(ostream& o, vector<T> x) {for (auto it : x) o << it << _$; return o;}
template<class T> istream& operator>>(istream& i, vector<T>& x) {for (auto& it : x) i >> it; return i;}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int a, b;
    cin >> a >> b;
    cout << max(a + b, max(a - b, a * b)) << endl;
    GAME_OVER;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())

list_ans = [A+B, A-B, A*B]

print(max(list_ans))

Submission status: Runtime Error

Solution code:
A = int(input())
B = input()

answer = max(
    A + B,
    A - B,
    A * B,
)

print(answer)

Submission status: Runtime Error

Solution code:
from sys import stdin

A = int(stdin.readline().rstrip())
B = int(stdin.readline().rstrip())

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

Submission status: Runtime Error

Solution code:
from sys import stdin

A = int(stdin.readline().rstrip())
B = int(stdin.readline().rstrip())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b = map(int, readline().split())
  print(max(a+b, a-b, a*b)
  
  
if __name__ == '__main__':
  main()