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: Wrong Answer

Solution code:
K, X = map(int, input().split())
l = list(range(X + 1 - K, X + K))
print(" ".join(map(str, l)))

Submission status: Wrong Answer

Solution code:
nums = list(map(int,input().split()))
sum = nums[0] + nums[1]
sub = nums[0] - nums[1]
mul = nums[0] * nums[1]
if sum > sub and sum > mul:
  print (sum)
elif sub > sum and sub > mul:
  print (sub)
else:
  print (mul)

Submission status: Wrong Answer

Solution code:
def acmax(A,B):
    import numpy as np
    b = [A+B, A-B, A*B]
    return np.max(b)

Submission status: Wrong Answer

Solution code:
def abmax(A, B):
    a = A + B
    b = A - B
    c = A * B
    if B >= 0:
      if c - a > 0:
        return c
      else :
        return a
    else:
      if c - b > 0:
        return c
      else:
        return b

Submission status: Wrong Answer

Solution code:
def abmax(A, B):
    a = A + B
    b = A - B
    c = A * B
    if B >= 0:
      if c - a > 0:
        print(c)
      else :
        print(a)
    else:
      if c - b > 0:
        print(c)
      else:
        print(b)

Submission status: Wrong Answer

Solution code:
print ("Hello, World!")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
#K,Xの定義づけ
Y,D=map(int,input().split())
#行列の作成
B=np.array(range(-Y+D+1,Y+D,1))
#printする
for i in B:
  print(i)

Submission status: Wrong Answer

Solution code:
import numpy as np
#K,Xの定義づけ
Y,D=map(int,input().split())
#行列の作成
B=np.array(range(-Y+D+1,Y+D,1))
#printする
for i in B:
  print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K,X = map(int, input().split())
stones = [X]
for i in range(K):
  if i != 0:
  	stones.append(X+i)
  	stones.append(X-i)
stones.sort()
for s in stones:
	print(s)

Submission status: Wrong Answer

Solution code:
a, b = (int(i) for i in input().split())
sum = a + b
sub = a - b
mul = a * b

if sum > sub and sum > mul:
    print(sum)
elif sub > sum and sub > mul:
    print(sub)
else:
    print(mul)

Submission status: Wrong Answer

Solution code:
a, b = (int(i) for i in input().split())
sum = a + b
sub = a - b
mul = a * b

def max(a, b, c):
    if a > b & a > c:
        print(a)
    elif b > c & b > a:
        print(b)
    else:
        print(c)

max(sum, sub, mul)

Submission status: Wrong Answer

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

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

if add > maxval:
    maxval = add
if diff > maxval:
    maxval = diff
if mul > maxval:
    maxval = mul

print(maxval)

Submission status: Wrong Answer

Solution code:
import sys

a, b = map(int, input().split())
 
sum = a + b
minus = a - b
sub = a * b
 
if (sum - minus) > 0:
  print("足し算のが引き算より大きい")
  if (sum - sub) > 0:
    print("足し算のが掛け算より大きい")
    print(sum)
  else:
    print("掛け算のが足し算より大きい")
    print(sub)
else:
  print("引き算のが足し算より大きい")
  if (minus - sub) > 0:
    print("引き算のが掛け算より大きい")
    print(minus)
  else:
    print("掛け算のが引き算より大きい")
    print(sub)

Submission status: Wrong Answer

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

numbers = input().split(" ")
a = int(numbers[0])
b = int(numbers[1])

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

Submission status: Wrong Answer

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

numbers = input().split(" ")
a = int(numbers[0])
b = int(numbers[1])

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

Submission status: Wrong Answer

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

numbers = input().split(" ")
a = int(numbers[0])
b = int(numbers[1])

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

Submission status: Wrong Answer

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

print(a)
print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print("Even" if a*b%2==0 else "Odd")

Submission status: Wrong Answer

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

x = a[0] + a[1]
y = a[0] - a[1]
z = a[0] * a[1]

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
 
x = a[0] + a[1]
y = a[0] - a[1]
z = a[0] * a[1]
 
if x > y and x > z:
  print('x')
elif y > x and y > z:
  print('y')
else:
  print('z')

Submission status: Wrong Answer

Solution code:
fs= [float(f) for f in input().split()]
a,b = fs[0],fs[1]
print(max(a+b,a*b,a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

max = a + b

if a-b > max:
    print(a-b)
elif a*b > max:
    print(a*b)
else:
    print(max)

Submission status: Wrong Answer

Solution code:
print('整数？')
num_int = list(map(int, input('>>').split()))
A = num_int[0]
B = num_int[1]

if(A+B > A-B):
    if(A+B > A*B):
        print(A+B)
    else:
        print(A*B)
else:
    if(A-B > A*B):
        print(A-B)
    else:
        print(A*B)

Submission status: Wrong Answer

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

list1=['A+B','A-B','A*B']
S=max(list1)
print(S)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k,x=map(int, input().split())
o=str(x-(k-1))
for i in range(x-(k-1)+1, x+(k-1)+1, 1):
    o+=" {}".format(i)
print(o)

Submission status: Wrong Answer

Solution code:
k,x=map(int,input().split())
mylist=[k]

for i in range(1,k):
  mylist.append(k-i)
  mylist.append(k+1)
  
mylist.sort()
print(mylist)

Submission status: Wrong Answer

Solution code:
k,x=map(int, input().split())
o_min=max(x-(k-1), -1000000)
o_max=min(x+(k-1),  1000000)
o=str(o_min)
for i in range(o_min+1, o_max+1, 1):
    o+=" {}".format(i)
print(o)

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b = map(int,input().split())
c = np.max([a-b,b-a,a*b])
print("{}".format(c))

Submission status: Wrong Answer

Solution code:
K,X = map(int, input().split())
for a in range(X-K+1, X+K, 1):
	print(a)

Submission status: Wrong Answer

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

def fun(a,b):
    adds = a+b
    subs = a-b
    muls = a*b

    if adds > subs:
        if adds > muls:
            return adds
        else:
            return muls
    else:
        if subs > muls:
            return subs
        else:
            return muls

#a,b = -13,3

fun(a,b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
IN = input()
IN = "40 50"
A, B = [int(x) for x in IN.split()]
C = max(A+B, A-B, A*B)
print(C)

Submission status: Wrong Answer

Solution code:
K, X = map(int, input().split())
print(' '.join(map(str, range(X - K + 1, X + K))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

K, X = map(int, input().split())
Ans = np.arange(X-K+1, X+K)
print(*Ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
k, x = map(int, input().split())
print(np.array(range(x-k+1, x+k-1, 1)))

Submission status: Wrong Answer

Solution code:
def add(A, B):
    print(int(max([A+B, A-B, A*B])))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
max_num = 0
for i in [a*b, a-b, a+b]:
    if i > max_num:
        max_num = i
print(max_num)

Submission status: Wrong Answer

Solution code:
def add(A, B):
    print(max([A+B, A-B, A*B]))

Submission status: Wrong Answer

Solution code:
class Solution(object):
  def maxResult(self, A, B):
    r1 = A + B
    r2 = A - B
    r3 = A * B
    if B > 0 & r1 > r3:
      return r1
    else: return r3
    if b < 0 & r2> r3:
      return r2
    else: return r3

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
plus = a + b
 
minus = a - b
 
kakeru = a * b
 
 
if plus >= minus:
  if plus >= kakeru:
    print(plus)
elif minus >= kakeru:
  print(minus)
else:
  print(kakeru)

Submission status: Wrong Answer

Solution code:
kx=list(map(int,input().split()))
k=kx[0]
x=kx[1]
a=x+1-k
b=x+k
for i in range(a,b):
  print(i,end=" ")

Submission status: Wrong Answer

Solution code:
i = list(map(int,input().split()))
K = i[0]
X = i[1]
print(range(X-K+1,X-K))

Submission status: Wrong Answer

Solution code:
k, x = (int(i) for i in input().split())
arr = []

for i in range(-k + 1, 0):
  for j in range(0, k + 1):
    arr.append(i + j + x) 

sorted_list = sorted(list(set(arr)))

result =  " ".join(map(str, sorted_list))
if (k == 1):
  result = x


print(result)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
tasu = a+b 
hiku = a-b
kake = a*b
if tasu > hiku and tasu > kake:
 print(tasu)
elif hiku > tasu and hiku > kake:
 print(hiku)
else:
 print(kake)

Submission status: Wrong Answer

Solution code:
k, x = map(int, input().split())
for i in range(2*k-1):
    b = abs(x-k+i)
    if b <= 1000000:
        print(x-k+i)

Submission status: Wrong Answer

Solution code:
k, x = (int(i) for i in input().split())

# k = 3
# x = 7
arr = []

for i in range(-k + 1, 0):
  for j in range(0, k + 1):
    arr.append(i + j + x) 

sorted_list = sorted(list(set(arr)))

result =  " ".join(map(str, sorted_list))
if (k == 1):
  result = x


print(result)

Submission status: Wrong Answer

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

if (A+B) >= (A-B) and (A+B) >= (A*B):
    print(A+B)
elif (A+B) >= (A-B) and (A+B) <= (A*B):
    print(A*B)
elif (A+B) <= (A-B) and (A+B) >= (A*B):
    print(A-B)
elif (A+B) <= (A-B) and (A+B) <= (A*B):
    if (A-B) >= (A*B):
        print(A-B)
    else:
        print(A*B)

Submission status: Wrong Answer

Solution code:
def main(A, B):
    A_plus_B = A + B
    A_minus_B = A - B
    A_times_B = A * B

    if A_plus_B > A_minus_B and A_minus_B > A_times_B:
        print(A_plus_B)
        return
    elif A_minus_B > A_times_B and A_times_B > A_plus_B:
        print(A_minus_B)
        return
    elif A_times_B > A_plus_B and A_plus_B > A_minus_B:
        print(A_times_B)
        return


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

    main(A, B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main(text):
    a = list(map(int, text.split()))
    print(a)
    print(max([a[0]+a[1], a[0]-a[1], a[0]*a[1]]))


main(input())

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print((str(abs(a)+abs(b)),str(a*b))[a*b>abs(a)+abs(b)])

Submission status: Wrong Answer

Solution code:
import numpy as np
k, x = map(int, input().split())
n1 = x - k
n2 = x + k
print(np.array(range(n1, n2, 1)))

Submission status: Wrong Answer

Solution code:
a, b = input().strip().split()
a, b = [int(a), int(b)]

def main(a, b):
  s = a + b
  d = a - b
  p = a * b
  num_list = [s, d, p]
  return print(max(num_list))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())

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

Submission status: Wrong Answer

Solution code:
k,x = map(int,input().split())
result = []
for i in range(x-k+1, x+k-1):
  result.append(i)
for s in result:
  print(s, end =" ")

Submission status: Wrong Answer

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

abp = a+b
abm = a-b
abs = a*b

if abp > abm and abp > abs:
  print(abp)
elif abm > abp and abm > abs:
  print(abm)
else:
  print(abs)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
tasu = a+b 
hiku = a-b
kake = a*b
if tasu >hiku and tasu > kake:
 print(tasu)
elif hiku > tasu and hiku > kake:
 print(hiku)
else:
 print(kake)

Submission status: Wrong Answer

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

if x < 0:
    if y < 0:
        print(x*y)
    else:
        print(x*y)
else:
    if y < 0:
        print(x-y)
    else:
        ad = x+y
        mu = x*y
        if ad < mu:
            print(mu)
        else:
            print(ad)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans1 = a + b
ans2 = a - b
ans3 = a * b

if ans1 > ans2 and ans1 > ans3:
    print(ans1)
elif ans2 > ans1 and ans2 > ans3:
    print(ans2)
else:
    print(ans3)

Submission status: Wrong Answer

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

row = input().split()
k = int(row[0])
x = int(row[1])

blacklist = list(range(x-k+1, x+k))
print(" ".join(map(str, blacklist)))

Submission status: Wrong Answer

Solution code:
A , B = (int(x) for x in input().split())
c = A + B
d = A - B
e = A * B

if c < d:
    if d < e:
        print(e)
    if d > e:
        print(d)

if c > d:
    if c > e:
        print(c)

Submission status: Wrong Answer

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

t = A + B
x = A * B
m = A - B

a_flg = False
b_flg = False

if A >= 0:
  a_flg = True
if B >= 0:
  b_flg = True
  
if A == 0 or B == 0:
  print(t)
if a_flg and b_flg:
  print(x)
elif a_flg == True and b_flg == False:
  print(m)

Submission status: Wrong Answer

Solution code:
A = 1
B = 1
l = [A+B, A-B, A*B]
print(max(l, key=int))

Submission status: Wrong Answer

Solution code:
#coding utf-8

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

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

print(max(x))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = list(map(float, input().split(" ")))
ad = x+y
mi = x-y
if ad < mi:
    print(mi)
else:
    mu = x*y
    if ad < mu:
        print(mu)
    else:
        print(ad)

Submission status: Wrong Answer

Solution code:
#coding utf-8

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

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

print(x)

Submission status: Wrong Answer

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

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

if c>d and c>e:
    print(c)
elif d>c and d>e:
    print(d)
elif e>c and e>d:
    print(e)

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
a = input().split()
print(a)

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

l = [0, 0, 0]
l[0] = n + m
l[1] = n - m
l[2] = n * m

print(max(l))

Submission status: Wrong Answer

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

tasu = A+B
hiku = A-B
kakeru = A*B

ans =0

if tasu >= hiku:
  if tasu >= kakeru:
    ans = tasu
elif hiku >= tasu:
  if hiku >= kakeru:
    ans = hiku
elif kakru >= tasu:
  if kakeru >= hiku:
    ans = kakeru

print(ans)

Submission status: Wrong Answer

Solution code:
a,b=(int(x) for x in input().split())
sum=a+b
minus=a-b
kakeru=a*b

if sum>minus and sum>kakeru:
  print(sum)
elif minus>sum and minus>kakeru:
  print(minus)
elif kakeru>sum and kakeru>minus:
  print(kakeru)

Submission status: Wrong Answer

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

wa = A + B
sa = A - B
seki = A * B

if wa <= sa:
    if sa <= seki:
        print(seki)
    else:
        print(sa)

if wa >= sa:
    if wa >= seki:
        print(wa)
    else:
        print(seki)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = list(map(int, input().split(" ")))
ad = x + y
mi = x-y
if ad < mi:
    print(mi)
else:
    mu = x*y
    if ad < mu:
        print(mu)
    else:
        print(ad)

Submission status: Wrong Answer

Solution code:
import numpy as np

A,B=input().split()

array=np.zeros((3))

array[0]=int(A)+int(B)
array[1]=int(A)-int(B)
array[2]=int(A)*int(B)

print(np.max(array))

Submission status: Wrong Answer

Solution code:
a,b = list(map(int,input().split()))
add = a+b
div = a-b
mlt = a*b
if add > div and add> mlt:
  print(add)
if div > add and div > mlt:
  print(div)
if mlt > add and mlt > div:
  print(mlt)

Submission status: Wrong Answer

Solution code:
a=input().split(" ")
A=int(a[0])
B=int(a[1])
p=A+B
q=A-B
r=A*B
if p>=q:
    s=p-r
    if s>=0:
        print(p)
    else:
        print(r)
if q>=p:
    s=q-r
    if s>=0:
        print(q)
    else:
        print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

a,b=map(int, input().split())
 
x = a+b
y = a-b
z = a*b
 
if x>=y:
  if x>=z:
    print(x)
    
elif y>=x:
  if y>=z:
    print(y)   
    
elif z>=x:
  if z>=y:
    print(z)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n_list = []
c = a + b
d = a - c
e = a * b

n_list.append(c)
n_list.append(d)
n_list.append(e)

print(max(n_list))

Submission status: Wrong Answer

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

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

if c>d and c>e:
    print(c)
elif d>c and d>e:
    print(d)
elif e>d and e>c:
    print(e)

Submission status: Wrong Answer

Solution code:
k,x=[int(k) for k in input().split(" ")]

print(" ".join([str(_) for _ in range(max(-1000000,x-k+1),min(1000000,x+k-1))]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

if c>d and c>e:
    print(c)
elif d>c and d>e:
    print(d)
else:
    print(e)

Submission status: Wrong Answer

Solution code:

a, b = list(map(int, input().split()))
m = 0
if m < a + b:
    m = a+b
if m < a - b:
    m = a-b
if m < a*b:
    m = a*b

print(m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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

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

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
K = a+b
L = a-b
M = a*b
G = max(K,L)
ans = (G,M)
print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
res = []
res.append(a+b)
res.append(a-b)
res.append(a*b)
res.sort(reverse=True)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
K = a+b
L = a-b
M = a*b
G = max(K,L)
ans = (G,M)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#
# Yet I'm feeling like
# 	There is no better place than right by your side
# 		I had a little taste
# 			And I'll only spoil the party anyway
# 				'Cause all the girls are looking fine
# 					But you're the only one on my mind


import sys
inf = float("inf")
#sys.setrecursionlimit(1000000)


# abc='abcdefghijklmnopqrstuvwxyz'
# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod,MOD=1000000007,998244353
# vow=['a','e','i','o','u']
# dx,dy=[-1,1,0,0],[0,0,1,-1]

#from cmath import sqrt
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
# from math import ceil,floor,log,sqrt,factorial,pow,pi,gcd,log10
#from bisect import bisect_left,bisect_right
#import numpy as np

def get_array(): return list(map(float , sys.stdin.readline().strip().split()))
def get_ints(): return map(float, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

Solution code:
import time

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

Submission status: Time Limit Exceeded

Solution code:
from subprocess import*
with open('A.py','w')as f:
    f.write('a,b=map(int,input().split())\n')
    for i in range(-100,101):
        f.write('if a==%d:\n'%i)
        for j in range(-100,101):
            f.write('    if b==%d:print(%d)\n'%(j,max(i+j,i-j,i*j)))
call(('pypy3','A.py'))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if (A+B)>=(A-B) and (A+B)>=(A*B):
  print(A+B)
elif (A-B)>=(A+B) and (A-B)>=(A*B):
  print(A-B)
elif (A*B)>=(A+B) and (A*B)>=(A-B):
  print(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 atc_137a(input_value: str) -> int:
    A, B = map(int, input_value.split(" "))
    return max(A + B, A - B, A * B)

input_value = input()
print(atc_137a(input_value))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(max(add, sub, multi))

Submission status: Accepted

Solution code:
# 整数A,Bがあります。A+B,A−B,A×Bの中で最大の数を出力してください。

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

su = a + b
mi = a - b
ka = a * b

print(max([su,mi,ka]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#137-A

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

cal = [A+B,A-B,A*B]
cal.sort()
print(cal[-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(sum, sub, mul))

Submission status: Accepted

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

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

print(max(add, sub, div))

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

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

i = a + b
j = a - b
k = a * b

print(max(i, j, k))

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

Submission status: Accepted

Solution code:
integer1, integer2 = map(int, input().split())
if integer1 + integer2 >= integer1 - integer2:
    if integer1 + integer2 >= integer1 * integer2:
        print(integer1 + integer2)
    else:
        print(integer1 * integer2)
elif integer1 - integer2 >= integer1 * integer2:
    print(integer1 - integer2)
else:
    print(integer1 * integer2)

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(n) for n in input().split()]
print(int(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 - +-x
# https://atcoder.jp/contests/abc137/tasks/abc137_a

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

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

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