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: Runtime Error

Solution code:
num = int(input())
char=[] #appendのために宣言が必要
while True:
    try:
        char.append(list(input()))

    except:
        break
new_char=[]
cnt=0
for i in range(num):
	new_char.append(sorted(char[i]))
for x in range(num):
    for y in range(num):
        if new_char[x]==new_char[y] and x!=y:
            cnt = cnt+1
print(cnt//2)

Submission status: Runtime Error

Solution code:
def key_func(n):
    return int(n)
 
l = [A+B, A-B, A*B]
print(max(l, key=key_func))

Submission status: Runtime Error

Solution code:
num = int(input())
char=[] #appendのために宣言が必要
while True:
    try:
        char.append(list(input()))

    except:
        break
new_char=[]
cnt=0
for i in range(num):
	new_char.append(sorted(char[i]))
for x in range(num):
    for y in range(num):
        if new_char[x]==new_char[y] and x!=y:
            cnt = cnt+1
print(cnt)

Submission status: Runtime Error

Solution code:
n=int(input())
wordlist=[input() for i in range(n)]
sortlist=[]
for i in range(n):
    a=list(wordlist[i])
    a.sort()
    a="".join(a)
    sortlist.append(a)
    
def kaijyo(n):
    ans=1
    for i in range(2,n+1):
        ans*=i
    return ans

count=0
sortlist.sort()


while sortlist:
    a=sortlist.pop()
    times=sortlist.count(a)+1
    for i in range(times-1):
        sortlist.pop()
    count+=kaijyo(times)*kaijyo(times-2)/2
    
print(int(count/2) )

Submission status: Runtime Error

Solution code:
A, B = [int(input()) for _ in range(2)]
 
P = A + B
M = A - B
T = A * B
 
list = [P, M, T]
print(max(list))

Submission status: Runtime Error

Solution code:
A, B = [int(input()) for _ in range(2)]
 
P = A + B
M = A - B
T = A * B
 
list = [P, M, T]
print(list(max))

Submission status: Runtime Error

Solution code:
N, M = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(N)]
info = sorted(info, key=lambda x:(x[0], x[1]), reverse=True)
#print(info)

result = 0
for j in range(len(info)):
    if info[j][0] <= M:
      #print(info[j], i)
      result += info[j][1]
      M -= 1
    if M == 0:
      break
print(result)

Submission status: Runtime Error

Solution code:
import sys

N = int(input())
L = []
for i in range(N):
    L.append(sorted(sys.stdin.readline().strip()))

Sum = 0
for i in range(N):
    if i == N - 1:
        break
    
    for j in range(i+1, N):
        if L[i] == L[j]:
            Sum += 1

print(Sum)

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()) for _ in range(2)]

P = A + B
M = A - B
T = A * B

if P > M or P > T:
  print(P)
elif M > P or M > T:
  print(M)
elif T > M or T > P:
  print(T)
else:
  pass

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:
# -*- config: utg-8 -*-

n = int(input())
s = [input() for i in range(n)]

sort_list = []

for i in s:
	str_sort_list = sorted(i)
	new_str = ''.join(str_sort_list)
	sort_list.append(new_str)

count = 0
for i in sort_list[:]:
  hoge = sort_list.pop(0)
  chohuku_count = sort_list.count(hoge)
  
  count += chohuku_count
  

print(count)

Submission status: Runtime Error

Solution code:
import collections
import math
 
N = int(input())
words = [input() for i in range(N)] 
 
ans = 0
L = []
for ix, word in  enumerate(words):
    word_list = list(word)
    word_list.sort()
    L.append(''.join(map(str, word_list)))
 
c = collections.Counter(L)
 
for i in c.values():    
    ans += factorial(i) / factorial(2) / factorial(i - 2)
 
print(int(ans))
import collections
from math import factorial

N = int(input())
words = [input() for i in range(N)] 

ans = 0
L = []
for ix, word in  enumerate(words):
    word_list = list(word)
    word_list.sort()
    L.append(''.join(map(str, word_list)))

c = collections.Counter(L)

for i in c.values():    
    ans += math.factorial(i) / math.factorial(2) / math.factorial(i - 2)

print(int(ans))
提出情報

Submission status: Runtime Error

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

c= a+b
d= a-b
e= a*b
max = [c,d,e]
print(max)

Submission status: Runtime Error

Solution code:
list = [A+B, A-B, A*B]
max(list)

Submission status: Runtime Error

Solution code:
int(A)
int(B)
list = [A+B, A-B, A*B]

print(max(list))

Submission status: Runtime Error

Solution code:
from collections import Counter

N = int(input())
s = []
for i in range(N):
    s.append(Counter(input()))

ans = 0
for i in range(N):
  for j in range(i+1, N):
    if(s[i] == s[j]):
      ans += 1
    
print(ans)

Submission status: Runtime Error

Solution code:
from collections import Counter


def anagrams(word1,word2):
    def counter(s):
        return Counter(s.upper().replace(' ',''))
    return counter(word1) == counter(word2)

N=int(input())

count=0

list=[]

for i in range(N):
    list.append(input())

for i in list:
    list.remove(i)
    if len(list)==2:
        if anagrams(list[0],list[1])==True:
            count+=1
        break
    for j in list:
        if anagrams(i,j)==True:
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;

int main(){
	int a,b;
	scanf("%d%d",&a,&b);
	
	int c=a+b;
	int d=a-b;
	int e=a*b;
	
	printf("%d\n",max(c,max(d,e)));
	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().splitf())
 
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: Runtime Error

Solution code:
a, b = map(int, input().splitf(' '))
 
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: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = input().splitf(' ')

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: Runtime Error

Solution code:
str = input()
N = int(str.split()[0])
d = []
for i in range(N) :
	s = str = input()
	dict = {}
	for j in range(26):
		dict[j] = 0
	for j in range(10) :
		k = ord(s[j]) - ord("a")
		dict[k] = dict[k] + 1
	d.append(dict)
	
E = 0
while(len(d) != 0) :
	deli = []
	for i in range(1, len(d)) :
		f = 0
		for j in range(26):
			if (d[0][j] != d[i][j]) :
				f = 1
				break
		if (f != 1) :
			deli.append(i)
	a = 0
	while(len(deli) != 0) :
		d.pop(deli[0] - a)
		deli.pop(0)
		a = a + 1
	if (len(d) != 0) :
		if (a != 0) :
			E = E + a * (a - 1) / 2
		d.pop(0)
print(E)

Submission status: Runtime Error

Solution code:
def encode(s):
#  r = [0]*26
#  for n in range(len(s)):
#    r[ord(s[n]) - ord('a')] += 1
#  return r
#  r = list(s)
#  r.sort()
#  return r
  r = 0
  for n in range(len(s)):
    so = ord(s[n]) - ord('a')
    r += 11**so
  return r

N = int(input())

S = []

for n in range(N):
  s = str(input())
  S = S + [encode(s)]

S.sort()
print('a')
ct = 0
M=1
ps=""
for cs in S:
  if cs==ps:
    M+=1
  else:
    ct += int((M**2-M)/2)
    M=1
    ps=cs
ct += int((M**2-M)/2)

print(ct)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
from math import factorial

n = int(input())
strlist = []
for i in range(n):
    strlist.append(list(str(input())))

allcount = 0
while (len(strlist) > 1):
    i = 1
    count = 1
    while True:
        if(set(strlist[0]) == set(strlist[i])):
            count += 1
            strlist.pop(i)
        else:
            i += 1
        if(i==len(strlist)):
            if(count > 1):
                allcount += int(factorial(count) / factorial(2) / factorial(count-2))
            break
    strlist.pop(0)
print(allcount)

Submission status: Runtime Error

Solution code:
def expressionsMatter(A, B)
return max(A+B, A-B, A*B)

Submission status: Runtime Error

Solution code:
def encode(s):
#  r = [0]*26
#  for n in range(len(s)):
#    r[ord(s[n]) - ord('a')] += 1
#  return r
#  r = list(s)
#  r.sort()
#  return r
  r = 0
  for n in range(len(s)):
    so = ord(s[n]) - ord('a')
    r += 11**so
  return r

N = int(input())

S = []

for n in range(N):
  s = str(input())
  S = S + [encode(s)]

S.sort()
ptint('a')
ct = 0
M=1
ps=""
for cs in S:
  if cs==ps:
    M+=1
  else:
    ct += int((M**2-M)/2)
    M=1
    ps=cs
ct += int((M**2-M)/2)

print(ct)

Submission status: Runtime Error

Solution code:
pdic = {1: 0, 2: 1, 3: 3}

def p(a):
	if (a in pdic) :
		return dpic[a]
	else :
		pdic[a] = p(a - a) * a
	return p(a - 1) * a

str = input()
N = int(str.split()[0])
d = []
for i in range(N) :
	s = str = input()
	dict = {}
	for j in range(26):
		dict[j] = 0
	for j in range(10) :
		k = ord(s[j]) - ord("a")
		dict[k] = dict[k] + 1
	d.append(dict)
	
E = 0
while(len(d) != 0) :
	deli = []
	for i in range(1, len(d)) :
		f = 0
		for j in range(26):
			if (d[0][j] != d[i][j]) :
				f = 1
				break
		if (f != 1) :
			deli.append(i)
	a = 0
	while(len(deli) != 0) :
		d.pop(deli[0] - a)
		deli.pop(0)
		a = a + 1
	if (len(d) != 0) :
		if (a != 0) :
			E = E + p(a + 1)
		d.pop(0)
print(E)

Submission status: Runtime Error

Solution code:
def f(si, sj):
    for i in range(10):
        if si.count(sj[i]) != sj.count(sj[i]):
            return 0
    return 1
n = int(input())
s = [input() for i in range(n)]
x = 0
for i in range(n - 1):
    for j in range(i + 1, n):
        x = x + f(s[i], s[j])
print(x)

Submission status: Runtime Error

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

d = a+b
e = a-b
f = a*b
print(max(max(d,e),f))

Submission status: Runtime Error

Solution code:
import json
n = int(input())
S = list()

A = list()
for _ in range(n):
  S.append(input())

for i in range(len(S)):
  hash = dict()
  for a in range(len(S)):
    for b in range(len(S[i])):
      hash[S[a][b]] = 0
  for j in range(len(S[i])):
    
    hash[S[i][j]] += 1
    
  A.append(hash)
  
count = 0

unique_list = list(map(json.loads, set(map(json.dumps, A))))
ans = len(A)-len(unique_list)
print(ans)

Submission status: Runtime Error

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

d = a+b
e = a-b
f = a*b
print(max(max(d,e),f))

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
D = [[] for i in range(M)]
for i in range(N):
    A,B = map(int,input().split())
    if A <= M:
        D[A-1].append(B)
count = 0
Tax = []
for i in range(M):
    for j in D[i]:
        bisect.insort_left(Tax,j)
    if not Tax:
        continue
    count += Tax.pop()
print(count)

Submission status: Runtime Error

Solution code:
import collections
N=int(input())
s=["".join(sorted(input())) for _ in range(N)]
print(int(sum(list(map(lambda x: x*(x-1)/2*1, collections.Counter(s).values())))))

Submission status: Runtime Error

Solution code:
def intersect_list(lst1, lst2):
    arr = []
    lst = lst1.copy()
    for element in lst2:
        try:
            lst.remove(element)
        except ValueError:
            pass
        else:
            arr.append(element)
    return len(arr)

n=int(input())
a=[input() for i in range(n)]
a=list(map(lambda x:list(x),a))
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(len(a[i])):
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
ab=list(map(int,input().split()))
a=ab[0]+ab[1]
b=ab[0]*ab[1]
c=ab[0]-ab[1]
flag=0
if a>b:
  if a>c:
    print(a)
    flag=1
else:
  if b>c:
    print(b)
    flag=1
if flag=0:
  print(c)

Submission status: Runtime Error

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

C=A+B
D=A-B
E=A*B

print(max(C,D,E))

Submission status: Runtime Error

Solution code:
def intersect_list(lst1, lst2):
    arr = []
    lst = lst1.copy()
    for element in lst2:
        try:
            lst.remove(element)
        except ValueError:
            pass
        else:
            arr.append(element)
    return len(arr)

n=int(input())
a=[input() for i in range(n)]
a=list(map(lambda x:list(x),a))
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
num = int(input())
words = []
answer = 0

for i in range(num):
  words.append(sorted(list(input())))

for i in range(num):
  for j in range(num -i - 1):
    p = 0
    for k in range(10):
      if words[i][k] == words[j + 1 + i][k]:
        p += 1
      else:
        break
    if p == 10:
      answer += 1

print(answer)

Submission status: Runtime Error

Solution code:
n=int(input())
a=[input() for i in range(n)]
a=list(map(lambda x:list(x),a))
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
lis = []
for i in range(n):
  word = str(input())
  lis.append({letter:word.count(letter) for letter in word})
counter = 0
while True:
  m = lis.count(lis[0])
  counter += (m*(m-1))//2
  lis.remove(lis[0])
  if len(lis) == 0:
    break
print(counter)

Submission status: Runtime Error

Solution code:
n=int(input())
a=[list(input()) for i in range(n)]
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)

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 itertools

n = int(input())
s_li = []
for i in range(n):
    s = input()
    s_i = {}
    for j in range(10):
        s_i[s[j]] = 0
    for j in range(10):
        s_i[s[j]] += 1    
    s_li.append(s_i)

ans = 0

for i in range(n):
    for j in range(n):
        if i >= j :
            continue
        if s_li[i] == s_li[j]:
            ans += 1
print(ans)

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:
#coding: utf-8
A,B=int(input()),int(input())
L = [A+B, A-B, A*B]
print(max(L))

Submission status: Runtime Error

Solution code:
from sys import stdin
n = int(stdin.readline().rstrip())
a= [stdin.readline().rstrip() for _ in range(n)]
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
from itertools import combinations

N = int(input())
s = [list(input()) for i in range(N)]
 
a = 0
for i,j in combinations(s,2):
  if set(i) == set(j):
    a+=1
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#coding: utf-8
A = int(input())
B = int(input())


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

print(max(L))

Submission status: Runtime Error

Solution code:
from collections import Counter as counter

N = int(input())
char_counts = [counter(input()) for i in range(N)]
match_count = 0
for i, c in enumerate(char_counts):
  for j in range(i+1, N, 1):
    if char_counts[j] == c:
      match_count += 1
print(match_count)

Submission status: Runtime Error

Solution code:
N = int(input())
s = [list(input()) for i in range(N)]
 
from itertools import combinations
 
a = 0
for i,j in combinations(s,2):
  if set(i) == set(j):
    a+=1
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import Counter
n = int(input())

sn = []
count = 0

for i in range(n):
  sn.append(sorted(Counter(list(input())).items()))


for i in range(n - 1):
  for j in range(i+1,n):
    if sn[i] == sn[j]:
      count += 1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x=input().split()

a=x[0]
b=x[1]

p=a + b
q=a - b
r=a * b

max=p
if q > max:
    max = q
    if r > max:
        max = r

print(max)

Submission status: Runtime Error

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

Submission status: Runtime Error

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:
  if B < 0:
    print(m)
if B == 0:
  if A < 0:
    print(x)
if A == 0 and B == 0:
  print(t)

if a_flg and b_flg:
  print(x)
elif a_flg == True and b_flg == False:
  print(m)
elif a_flg == False and b_flg == True:
  print(t)
elif a_flg == False and b-flg == False:
  print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(raw_input())
# スペース区切りの整数の入力
a, b = map(int, raw_input().split())

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

Submission status: Runtime Error

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:
  if B < 0:
    print(m)
if B == 0:
  if A < 0:
    print(x)
if a_flg and b_flg:
  print(x)
elif a_flg == True and b_flg == False:
  print(m)
elif a_flg == False and b_flg == True:
  print(t)
elif a_flg == False and b-flg == False:
  print(x)

Submission status: Runtime Error

Solution code:
a,b = input().split(" ")
a_plus_b = a+b
a_minus_b = a-b
a_mul_b = a*b

max_three = max(a_plus_b, max(a_minus_b, a_mul_b))
print(max_three)

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().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:
  if B < 0:
    print(m)
if B == 0:
  if A < 0:
    print(t)
if a_flg and b_flg:
  print(x)
elif a_flg == True and b_flg == False:
  print(m)
elif a_flg == False and b_flg == True:
  print(t)
elif a_flg == False and b-flg == False:
  print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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:
  if B < 0:
    print(m)
if B == 0:
  if A < 0:
    print(t)
if a_flg and b_flg:
  print(x)
elif a_flg == True and b_flg == False:
  print(m)
elif a_flg == False and b_flg == True:
  print(t)
elif a_flg == False and b-flg == False:
  print(x)

Submission status: Runtime Error

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)

sorted_list = sorted(n_list)

if sorted_list[2] > sorted_list[1]:
    print(sorted_list[2])
elif sorted_list[2] == sorted[1] & sorted_list[1] > sorted_list[0]:
    print(sorted_list[2], sorted_list[1])
else:
    print(sorted_list[2], sorted_list[1], sorted_list[0])

Submission status: Runtime Error

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


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

print(max(L))

Submission status: Runtime Error

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

res1 = A + B
res2 = A - B
res3 = A * B

if res1 > res2:
  if (res1 > res3):
    return res1
  else:
  	return res3
else:
  if (res2 > res3):
    return res2
  else:
    return res3

Submission status: Runtime Error

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)
elif a_flg == False and b_flg == True:
  print(t)
elif a_flg == False and b-flg == False:
  print(x)

Submission status: Runtime Error

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


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

print(min(L))

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = a+b
d = a-b
e = a*b
if(c>=d):
  if(c>=e):
    print(c)
  else:
    print(e)
elif(d>=c):
  if(d>=e):
    print(d)
  else:
    print(e)

Submission status: Runtime Error

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

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

print(min(L))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = int( input() )
B = int( input() )
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: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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_flg and b_flg:
  print(x)
elif a_flg == True and b_flg == False:
  print(m)
elif a_flg == False and b_flg == True:
  print(t)
elif a_flg == False and b-flg == False:
  print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#coding utf-8

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

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

print(max(x))

Submission status: Runtime Error

Solution code:
#coding utf-8

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

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

print(max(x))

Submission status: Runtime Error

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

c1=a+b
c2=a-b
c3=a*b

if c1>=c2 and c1>=c3:
    print(c1)

elif c2>=c1 and c2>=c3:
    print(c2)
else:
    print(c3)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a , b  = int(input.split())
add = a + b
sub = a - b
mul = a * b
if add >= sub and add >= mul:
	max = add
elif sub >= add and sub >= mul:
  	max = sub
else:
    max = mul
print(max)

Submission status: Runtime Error

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

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

print(max)

Submission status: Runtime Error

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

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

ans =0

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#coding utf-8

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

x = []

x.append(a*b)
x.append(a/b)
x.append(a+b)
x.append(a-b)

print(max(x))

Submission status: Runtime Error

Solution code:
"\C-n":history-search-forward
"\C-p":history-search-backward

Submission status: Runtime Error

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

return np.array([a[0]+a[1],a[0]^a[1],a[0]*a[1]]).max()

Submission status: Runtime Error

Solution code:

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

res1 = A + B
res2 = A - B
res3 = A * B

print(max[res1,res2,res3])

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

Submission status: Runtime Error

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

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

ans =0

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define print_array(name,n) for(ll o=0;o<n;o++) cout<<name[o]<<" "
#define fr(i,f,t) for(ll i=(f);i<t;i++)
#define fb(i,f,t) for(ll i=(f);i>=t;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 2e18
bool sortbysecond(const pair<int,int> &a,const pair<int,int> &b){
	return (a.ss>b.ss);
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    ll a,b;
    cin>>a>>b;
    ll temp = max(a+b,a-b);
    ll ans = max(temp,a*b);
    cout<<ans<<endl;
    return 0;
}

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define SZ(v) int((v).size())
#define ALL(vec) (vec).begin(),(vec).end()
typedef long long i64;
template<typename T> inline bool uax(T &x, T y) {return (y > x) ? x = y, true : false;}
template<typename T> inline bool uin(T &x, T y) {return (y < x) ? x = y, true : false;}
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); \
  stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
string to_string(char c) { return "'" + string(1, c) + "'";}
string to_string(string s) { return '"' + s + '"';}
string to_string(const char* s) { return to_string((string) s);}
template<typename A> string to_string(A);
template<typename A, typename B> string to_string(pair<A, B> p){
  return "(" + to_string(p.first) + ": " + to_string(p.second) + ")";}
template<typename A> string to_string(A v) {bool f = false; string r = "{"; 
  for (auto x: v) {if (f) r += ", "; r += to_string(x); f = true;} return r += "}";}
template<typename A> string to_string(vector<vector<A>> v) {string r; 
  for (auto x: v) r += "\n" + to_string(x); return r;}
void err(istream_iterator<string>) { cerr << endl; }
template<typename T,typename... Args> void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " =: " << to_string(a) << "; "; err(++it, args...); }
template<typename T> void orz(T ans) {cout << ans << endl; exit(0);}
int const MOD = 1e9 + 7;
long long const INF = 1e18;
/***********************************************************************/

int32_t main() {
 
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int a, b;
  cin >> a >> b;
  cout << max({a + b, a - b, a * b}) << '\n';
  
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

a,b = list(map(input().split()))
#s = [1 if i=='R' else 0 for i in S]

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





print(max(ans))

Submission status: Runtime Error

Solution code:
def mian():
    a,b=map(jnt,input().split(' '))
    print(max(a+b,a-b,a*b))
if __name__ == '__main__':
    main()

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().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:
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using namespace std;
int main(){
    int a,b;
    cin>>a>>b;
    cout<<max({a+b,a-b,a*b})<<endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
A, B = map(int,inpt().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:
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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