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:
I0 = lambda :map(int,input().split())
I1 = lambda :int(input())
I2 = lambda :list(map(int,input().split()))
#####################################################
A,B = I0()
print(max([A*B,A-B,A+b]))

Submission status: Runtime Error

Solution code:
def int(A)=input()
def int(B)=input()
x=A+B
y=A-B
z=A*B
if x>y>z:
  print('x')
elif x>y>z:
  print('x')
elif y>x>z:
  print('y')
elif y>z>x:
  print('y')
else: 
  print('z')

Submission status: Runtime Error

Solution code:
def A=input()
def B=input()
x=A+B
y=A-B
z=A*B
if x>y>z:
  print('x')
elif x>y>z:
  print('x')
elif y>x>z:
  print('y')
elif y>z>x:
  print('y')
else: 
  print('z')

Submission status: Runtime Error

Solution code:
A=input()
B=input()
x=A+B
y=A-B
z=A*B
if x>y>z:
  print('x')
elif x>y>z:
  print('x')
elif y>x>z:
  print('y')
elif y>z>x:
  print('y')
else: 
  print('z')

Submission status: Runtime Error

Solution code:
input()=A
input()=B
x=A+B
y=A-B
z=A*B
if x>y>z:
  print('x')
elif x>y>z:
  print('x')
elif y>x>z:
  print('y')
elif y>z>x:
  print('y')
else: 
  print('z')

Submission status: Runtime Error

Solution code:
input()=A
input()=B
x=A+B
y=A-B
z=A*B
if x>y>z:
  print(x)
elif x>y>z:
  print(x)
elif y>x>z:
  print(y)
elif y>z>x:
  print(y)
else: 
  print(z)

Submission status: Runtime Error

Solution code:
input()=A
input()=B
x=A+B
y=A-B
z=A*B
if A>B>C:
  print(A)
elif A>C>B:
  print(A)
elif B>A>C:
  print(B)
elif B>C>A:
  print(B)
else: 
  print(C)

Submission status: Runtime Error

Solution code:
A = int (input('please enter number'))
B = int (input('please enter number'))
ans_plus = A + B
ans_minus = A - B
ans_by = A * B
print (max(ans_plus,ans_minus,ans_by))

Submission status: Runtime Error

Solution code:

from collections import Counter

n = int(input())
s =  Counter("".join(sorted(input())) for i in range(n))

print(sum(map(lambda x : x * (x - 1) // 2, s.values())))

Submission status: Runtime Error

Solution code:
from collections import Counter
n = int(input())
s = Counter(''.join(sorted(input())) for i in range(n))#文字列をsortedした時点でlistになる
print(sum(map(lambda x : x * (x-1) // 2, s.values())))

Submission status: Runtime Error

Solution code:
date = inp.readline().rstrip().split(' ')
x = int(date[0])
y = int(date[1])
num1 = x + y
num2 = x - y
num3 = x * y

if num1 > num2:
    if num1 > num3:
        ans = num1
    else:
        ans = num3
elif num2 > num3:
    ans = num2
else:
    ans = num3

print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np
arr = np.array([[1,2,3],
                [1,2,3],
                [1,2,2]])
uniq, cnt = np.unique(arr, return_counts=True, axis=0)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, C = 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())
li = [a+b,a-b,a＊b]

print(max(li))

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
z=A+B
if (A>B):
   y=A-B
else:
   y=B-A
x=A*B

print(max(x,y,z))

Submission status: Runtime Error

Solution code:
A = input()
B = input()
print("A+B =", A+B)
print("A-B =", A-B)
print("A x B =", A*B)
print("のなかのさいた☻いすうは", max([A+B,A-B,A*B]))

Submission status: Runtime Error

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

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

print(x)

Submission status: Runtime Error

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

minimum = max(x - k + 1, -1000000)
maximum = min(x + k - 1, 1000000)

ran = [str(i) for i in range(minimum, maximum+1)]
print(' '.join(ran)

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

Submission status: Runtime Error

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

ab1=a+b
ab2=a-b
ab3=a*b
print (max(ab1,ab2,ab3))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

if a>b and a>c:
    print(str(a))

elif b>c and b>a:
    print(str(b))

else:
    print(str(c))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

m = a+b
if m<a*b:
  m = a*b:
if m<a-b:
  m=a-b
print(m)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

target = list()

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

print(map(target))

Submission status: Runtime Error

Solution code:
import numpy as np
a,b=map(int,input())
s=np.max([a+b,a-b,a*b])
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
inputs = input().split()
 
if -100 <= inputs[0] and inputs[1] <= 100:
	print(max([inputs[0]+inputs[1], inputs[0]-inputs[1], inputs[0]*inputs[1]]))
else:
	raise ValueError

Submission status: Runtime Error

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

if -100 <= input[0] and input[1] <= 100:
	print(max([input[0]+input[1], input[0]-input[1], input[0]*input[1]]))
else:
	raise ValueError

Submission status: Runtime Error

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

print(max(A+B, A-B, int(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(input())

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = [''.join(sorted(input())) for _ in range(n)]
count = {}
ans = 0
for i in s:
    count[i] = count.get(i, 0) + 1
for key, value in count.items():
    ans += value * (value - 1) // 2
print(ans)

Submission status: Runtime Error

Solution code:
from functools import reduce
n = int(input())
s = [''.join(sorted(input())) for _ in range(n)]
count = {}
ans = 0
for i in s:
    count[i] = count.get(i, 0) + 1
for key, value in count.items():
    ans += value * (value - 1) // 2
print(ans)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
c = A + B
d = A - B
e = A * B

Submission status: Runtime Error

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

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

Solution code:

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

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

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: 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=int(input())
B=int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import Counter
import math


def ncr(val):
    if val<2:
        return 0
    else:
        return math.factorial(val)//(math.factorial(2)*math.factorial(val-2))


n = int(input())
s = [sum(map(ord,input())) for i in range(n)]
d,y = dict(Counter(s)),0
for k,v in d.items():
    y += int(ncr(v))
print(int(y))

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()
plus = a + b
mai  = a - b
kake = a * b

print(max(plus,mai,kake))

Submission status: Runtime Error

Solution code:
li = list(map(int,input().split()))
li1 = []
for i in range(len(list)):
  li1.append(li[i]+li[i+1])
  li1.append(li[i]*li[i+1])
  li1.append(li[i]-li[i+1])
print(max(li1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def return_sorted_string(string):
    lst=list(map(ord,list(string)))
    lst.sort()
    lst=list(map(chr,lst))
    string="".join(lst)
    return string
    



n = int(input())
strings=[input() for i in range(n)]
dic={}
for i in range(n):
    string=return_sorted_string(strings[i])
    if string in dic:
        dic[string]+=1
    else:
        dic[string]=1

count=0        

for i in dic.values():
    count += i*(i-1)/2


print(int(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:
def larger(x, y):
	if x > y: return x
	return y

A, B = map(int, input().split())
p = A + B
m = A - B
t = A * B
print(larger(p. larger(m, t)))

Submission status: Runtime Error

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

Solution code:
n = map(int, input().split())
print(max(sum(n), n(0)-n(1), n(0)*n(1)))

Submission status: Runtime Error

Solution code:
# coding: utf-8

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

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

Submission status: Runtime Error

Solution code:
A,B = input().split()
A,B = int(A),int(B)
ans = [A+B,A-B,A*B]
sort(ans)
print(ans.pop())

Submission status: Runtime Error

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

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=input().split()

wa = a + b
sa = a - b
seki = a * b

if wa >= sa and wa >= seki:
    print(str(wa))
elif sa >= wa and sa >= seki:
    print(str(sa))
else:
    print(str(seki))

Submission status: Runtime Error

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

wa = int(a) + int(b)
sa = int(a) - int(b)
seki = int(a) * int(b)

if wa >= sa and wa >= seki:
    print(str(wa))
elif sa >= wa and sa >= seki:
    print(str(sa))
else:
    print(str(seki))

Submission status: Runtime Error

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

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

Submission status: Runtime Error

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

wa = int(a) + int(b)
sa = int(a) - int(b)
seki = int(a) * int(b)

if wa >= sa and wa >= seki:
    print(str(wa))
elif sa >= wa and sa >= seki:
    print(str(sa))
else:
    print(str(seki))

Submission status: Runtime Error

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

wa = int(a) + int(b)
sa = int(a) - int(b)
seki = int(a) * int(b)

if wa >= sa and wa >= seki:
    print(str(wa))
elif sa >= wa and sa >= seki:
    print(str(sa))
else:
    print(str(seki))

Submission status: Runtime Error

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(str(wa))
elif sa >= wa and sa >= seki:
    print(str(sa))
else:
    print(str(seki))

Submission status: Runtime Error

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

wa = int(a) + int(b)
sa = int(a) - int(b)
seki = int(a) * int(b)

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

Submission status: Runtime Error

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

wa = int(a) + int(b)
sa = int(a) - int(b)
seki = int(a) * int(b)

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

Submission status: Runtime Error

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

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

Submission status: Runtime Error

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

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

Submission status: Runtime Error

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

seki = a * b
sa = a - b
wa = a + b

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;

int N, M;

int main()
{
    int A, B;
    cin >> A >> B;
    cout << max({A + B, A - B, A * B});
}

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
s = []
for i in range (N):
    word = input()
    word_lst = []
    for j in range (len(word)):
        word_lst.append(word[j])
    word_lst = np.sort(word_lst)
    words = ""
    for j in range (len(word_lst)):
        words += word_lst[j]
    s.append(words)
#print (s)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

list = []

for i in range(X-K+1,X+K):
    list.append(i)

print(" ".join(map(str,list))

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = list(map(int,input().split()))
t = max(s[0]+s[1],s[0]-s[1],s[0]*s[1],s[0]/s[1])
print(t)

Submission status: Runtime Error

Solution code:
s = list(map(int,input().split()))
t = max(s[0]+s[1],s[0]-s[1],s[0]*s[1],s[0]/s[1])
print(t)
print('A+B={0},A-B={1},A*B={2},A/B={3}の中で最大の数{4}はです'.format(s[0]+s[1],s[0]-s[1],s[0]*s[1],s[0]/s[1],t))

Submission status: Runtime Error

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

maxi = A + B
if A - B >= maxi:
  maxi = A - B
if A*B >= maxi:
  maxi = A*B

print(maxi)

Submission status: Runtime Error

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

Solution code:
import numpy as np
a = [A + B, A - B, A * B]
print(np.max(a))

Submission status: Runtime Error

Solution code:
a,b = 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 = input().split(' ')
index = a + b
if(a - b > index):
  index = a - b
elif(a * b > index):
  index = a * b
print(index)

Submission status: Runtime Error

Solution code:
a,b = input().rstrip().split(' ')
sum = a + b
sub = a - b
by = a * b

return max(sum,sub,by)

Submission status: Runtime Error

Solution code:

k, x = map(int, input().split())

axis = list(range(-10, 11, 1))
df = pd.DataFrame(axis)
df = df.rename(columns = {0 : 'var'})

res = []

if k == 1:
    print(x)
else:
    for i in range(1, k):

        a = df[df['var'] == x + i]
        a = list(a['var'])
        res.append(a)
        
        a = df[df['var'] == x - i]
        a = list(a['var'])
        res.append(a)
    res.append([x])
    res = sum(res, []) #リスト一段解除
    res = sorted(res) #並び替え
    print(*res)

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

x = a + b
y = a - b
z = a * b
m = max(x, y, z)

print('A + B =', str(x), 'A - B =', str(y), 'A ×　B =', str(z), 'の中で最大の数は', str(m), 'です。')

Submission status: Runtime Error

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

plus = a+b
minus = a-b
multipiled_by = a*b
ans = max([plus, minus, multipiled_by])
print(ans)

Submission status: Runtime Error

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

plus = a+b
minus = a-b
multipiled_by = a*b
ans = max([plus, minus, multipiled_by])
print(ans)

Submission status: Runtime Error

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

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

print(max(x, y, z))

Submission status: Runtime Error

Solution code:
# your code goes here
a, b = int(input().split())
c1 = a+b
c2 = a-b
c3 = a*b
if c1>c2 and c1>c3:
	print(c1)
elif c2>c3:
	print(c2)
else:
	print(c3)

Submission status: Runtime Error

Solution code:

S = input().split()
X = int(S[0])+int(S[1])
Y = int(S[0])-int(S[1])
Z = int(S[0])*int(S[1])
intS[0] = ss
intS[1] = dd
if X >= Y:
    if X >= Z:
        print(X)
    else:
        print(Z)
else:
    if Y >= Z:
        print(Y)
    else:
        print(Z)

Submission status: Runtime Error

Solution code:
X = int(S[0])+int(S[1])
Y = int(S[0])-int(S[1])
Z = int(S[0])*int(S[1])
intS[0] = ss
intS[1] = dd
if X >= Y:
    if X >= Z:
        print(X)
    else:
        print(Z)
else:
    if Y >= Z:
        print(Y)
    else:
        print(Z)

Submission status: Runtime Error

Solution code:
S = int(input().split())
print(max(S))

Submission status: Runtime Error

Solution code:
S = int(input()).split()
print(max(S))

Submission status: Runtime Error

Solution code:
job = list()
salary = list()
m_total = 0
j = 0
n,m = map(int,input().split())
for i in range(n):
    a,b = map(int,input().split())
    job.append((a,b))
    job.sort(reverse = True)
for i in range(n):
    a,b = job[i]
    salary.append(b)
    if a + j > m :
        salary.remove(min(salary))
        continue
    j += 1
print(sum(salary))

Submission status: Runtime Error

Solution code:
m,n=map(int,input())
s=[m*n,m-n,m+n]
print(max(s))

Submission status: Runtime Error

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
print = sys.stdout.write
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for _ in range(N)]
A = []
cnt = 0
for k in S:
   A.append(''.join(sorted(k)))
for i in A[:]:
    cnt += A.count(i) - 1
    A.remove(i)
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import heapq
n,m=map(int, input().split())
s = [list(map(int, input().split())) for i in range(n)]
q = []
ans=0
#ヒープソート
heapq.heapify(s)
for k in range(m-1,-1,-1):
    while True:
        if s!=[]:
            #最小値を返す
            p=heapq.heappop(s)
            if p[0]+k<=m:
                #heappush(list,item) listの葉にitemを追加して小さい要素を上に持ち上げる
                heapq.heappush(q,-p[1])
            else:
                heapq.heappush(s,p)
                break
        else:
            break
        if q!=[]:
            #最小値をヒープから取り出す
            p=heapq.heappop(q)
            ans+=-p
print(ans)

Submission status: Runtime Error

Solution code:
import heapq
n,m=map(int, input().split())
s = [list(map(int, input().split())) for i in range(n)]
q = []
ans=0

for k in range(m-1,-1,-1):
    while True:
        if s!=[]:
            #最小値を返す
            p=heapq.heappop(s)
            if p[0]+k<=m:
                #heappush(list,item) listの葉にitemを追加して小さい要素を上に持ち上げる
                heapq.heappush(q,-p[1])
            else:
                heapq.heappush(s,p)
                break
        else:
            break
        if q!=[]:
            #最小値をヒープから取り出す
            p=heapq.heappop(q)
            ans+=-p
print(ans)

Submission status: Runtime Error

Solution code:
import heapq
n,m=map(int, input().split())
s = [list(map(int, input().split())) for i in range(n)]
q = []
ans=0
#ヒープソート
heapq.heapify(s)
heapq.heapify(q)
for k in range(m-2,-1,-1):
    if s!=[]:
        #最小値を返す
        p=heapq.heappop(s)
        if p[0]+k<=m:
            #heappush(list,item) listの葉にitemを追加して小さい要素を上に持ち上げる
            heapq.heappush(q,-p[1])
        else:
            heapq.heappush(s,p)
            break
    else:
        break
    if q!=[]:
        #最小値をヒープから取り出す
        p=heapq.heappop(q)
        ans+=-p
print(ans)

Submission status: Runtime Error

Solution code:
import heapq
n,m=map(int, input().split())
s = [list(map(int, input().split())) for i in range(n)]
q = []
ans=0
#ヒープソート
heapq.heapify(s)
for k in range(m-2,-1,-1):
    if s!=[]:
        #最小値を返す
        p=heapq.heappop(s)
        if p[0]+k<=m:
            #heappush(list,item) listの葉にitemを追加して小さい要素を上に持ち上げる
            heapq.heappush(q,-p[1])
        else:
            heapq.heappush(s,p)
            break
    else:
        break
    if q!=[]:
        #最小値をヒープから取り出す
        p=heapq.heappop(q)
        ans+=-p
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for _ in range(N)]
A = []
cnt = 0
for k in S:
   B = sorted(k)
   C = ''.join(B)
   A.append(C)
for i in range(N):
    for j in range(N):
        if i >= j:
            continue
        elif A[i] == A[j]:
            cnt += 1
print(cnt)

Submission status: Runtime Error

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

input_cal = []
input_cal.append(a + b)
input_cal.append(a - b)
input_cal.append(a * b)
print(max(input_cal))

Submission status: Runtime Error

Solution code:
n = int(input())

input_patterns = []

patterns = {}

def init_key():
    ini_key = []
    for i in range(26):
        ini_key.append(0)
    return ini_key

for i in range(n):
    val = input()
    input_patterns.append(val)

#input_patterns = ['acornistnt', 'peanutbomb', 'constraint']
count = 0
for inp in input_patterns:
#    key = init_key()
    #for j in range(len(inp)):
        # make [0, 0, 1, 0, 2, 3, ...]
        #       a  b  c  d  e  f  
    #    for k in range(26):
    #        if inp[j] == chr(ord('a') + k):
    #            key[k] = key[k] + 1
    
    key = sorted(inp)
    skey = ''

    for k in range(len(key)):
        skey = skey + key[k]

    if skey in patterns:
        patterns[skey] = patterns[skey] + 1
    else:
        patterns[skey] = 1

    if patterns[skey] > 1:
        count = count + patterns[skey] - 1
    
result = 0

#for skey in patterns:
#    if patterns[skey] > 1:
#        for i in range(1, int(patterns[skey])):
#            result = result + i

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N1, N2 = input().strip().split()

total = str(N1 + N2)
sub = str(N1 - N2)
cross = str(N1 * N2)

ls = [total, sub, cross]

print(max(ls))

Submission status: Runtime Error

Solution code:
from collections import defaultdict
import sys

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

N = read_int()[0]
d = defaultdict(lambda: int())
to_str = "".join

for _ in range(N):
    row = to_str(sorted(input()))
    d[row] += 1

def solve():
    ans = 0
    for _, v in d.items():
        ans += v * (v - 1) // 2
    return ans

if __name__ == "__main__":
    print(solve())

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
# スペース区切りの整数の入力
ar = []
for i in range(n):
  ar.append("".join(sorted(input())))

#for t in ar:
#  print(t)
#for i in range(n):
#  for j in range(i+1, n):
#    if ar[i] == ar[j]:
#      ar[j] = ar[i]

count = 0
#for i in range(n):
#  for j in range(i+1, n):
#    if ar[i] is ar[j]:
#      count = count + 1

for i in range(n):
  count = count + ar[i+1:].count(ar[i])

print(count)

Submission status: Runtime Error

Solution code:
あｓｄｆ

Submission status: Runtime Error

Solution code:
import sys
 
a = []
for l in sys.stdin:
    if l == '\n' or l == '\r' or l == '\r\n':
        break
    else :
        a.append(l)
 
target = a[int(a[0])]
num = 0

sortedA = []

for i in a:
    sortedA.append(''.join(sorted(a[i])))
sortedA.pop(0)

for i in range(1, len(a) - 1):
    for j in range(i + 1, len(a)):
        flag = False
        if sortedA[i]==sortedA[j]:
            flag = True
        else:
            flag = False
        if flag:
            num = num + 1
print(num)

Submission status: Runtime Error

Solution code:
っっｊ

Submission status: Runtime Error

Solution code:
hh

Submission status: Runtime Error

Solution code:
jh

Submission status: Runtime Error

Solution code:
a,b = map(int, input().split())
x = a + b
y = a - b
z = a * b
i[1] = x
i[2] = y
i[3] = z
i.sort
print(i[2])

Submission status: Runtime Error

Solution code:
sfdsad

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
# a = int(input())
# スペース区切りの整数の入力
a, b = map(int, input().split())
# 文字列の入力
# s = input()
# 出力
print("{}".format(max(max(a+b, a-b), a*b))

Submission status: Runtime Error

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

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

print(max(tasu,kakeru,hiku))

Submission status: Runtime Error

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

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

print(max(tasu,kakeru,hiku))

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
X = A + B
Y = A - B
Z = A * B
if X >= Y:
    if X >= Z:
        print('',X)
    else:
        print('',Z)
else:
    if Y >= Z:
        print('',Y)
    else:
        print('',Z)

Submission status: Runtime Error

Solution code:

A = int(input())
B = int(input())
X = A + B
Y = A - B
Z = A * B
if X >= Y:
    if X >= Z:
        print(X)
    else:
        print(Z)
else:
    if Y >= Z:
        print(Y)
    else:
        print(Z)

Submission status: Runtime Error

Solution code:
from sys import stdin

#Slist = list(S)
#A = list(map(int, input().split()))
chinpo = True
A = int(input())
B = int(input())
X = A + B
Y = A - B
Z = A * B
listo = []
listo.append(X)
listo.append(Y)
listo.append(Z)
print(max(listo))

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
X = A + B
Y = A - B
Z = A * B
listo = []
listo.append(X)
listo.append(Y)
listo.append(Z)
print(max(listo))

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
X = A + B
Y = A - B
Z = A * B

print(max([X, Y, Z]))