input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
print((["Yay!", ":(", ":("][sum([int(x) > 8 for x in input().split()])]))
| a, b = [int(x) for x in input().split()]
print((["Yay!", ":("][a > 8 or b > 8])) | p03323 |
A, B = list(map(int, input().split()))
if all([A < 9, B < 9]):
print("Yay!")
else:
print(":(")
| A, B = list(map(int, input().split()))
if A > 8 or B > 8:
print(":(")
else:
print("Yay!")
| p03323 |
import sys
tmp = [int(i) for i in input().split()]
a = tmp[0]
b = tmp[1]
if a <= 8 and b <= 8:
print('Yay!')
sys.stdout.flush()
else:
print(':(') | import sys
tmp = [int(i) for i in input().split()]
a = tmp[0]
b = tmp[1]
if a <= 8 and b <= 8:
print('Yay!')
sys.stdout.flush()
else:
print(':(')
sys.stdout.flush() | p03323 |
print(([':(','Yay!'][eval('max('+input().replace(' ',',')+')')<=8])) | a,b=list(map(int,input().split()))
print(([':(','Yay!'][a<9 and b<9])) | p03323 |
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(eval(input()))
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())
at... | A,B = list(map(int, input().split()))
if A<=8 and B<=8:
print('Yay!')
else:
print(':(') | p03323 |
A,B = list(map(int,input().split()))
if max(A,B) <= 8:
print("Yay!")
else:
print(":(") | A, B = list(map(int,input().split()))
if A <= 8 and B <= 8:
print("Yay!")
else:
print(":(") | p03323 |
import functools
import os
INF = float('inf')
def inp():
return int(input())
def inpf():
return float(input())
def inps():
return input()
def inl():
return list(map(int, input().split()))
def inlf():
return list(map(float, input().split()))
def inls():
r... | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
A, B = list(map(int, sys.stdin.buffer.readline().split()))
ok = A <= 8 and B <= 8
if ok:
print('Yay!')
else:
... | p03323 |
#S=input()
#N=int(input())
A,B=list(map(int,input().split()))
if A<=8 and B<=8:
print("Yay!")
else:
print(":(") | A,B=list(map(int,input().split()))
if A<9 and B<9:
print("Yay!")
else:
print(":(")
| p03323 |
a,b=list(map(int,input().split()))
print(("Yay!" if a<9 and b<9 else ":(")) | print(("Yay!" if max(list(map(int,input().split())))<9 else ":(")) | p03323 |
A,B = list(map(int,input().split()))
print(([":(","Yay!"][A<9 and B<9])) | if max(list(map(int,input().split())))<=8:
print("Yay!")
else:
print(":(") | p03323 |
a,b=list(map(int,input().split()))
if a<=8 and b<=8:
print("Yay!")
else:
print(":(") | print(("Yay!" if max(list(map(int,input().split())))<9 else ":(")) | p03323 |
a, b = list(map(int, input().split()))
if a > 8 or b > 8:
print(':(')
else:
print('Yay!')
| parameters = list(map(int, input().split()))
if(parameters[0] <= 8 and parameters[1] <= 8):
print('Yay!')
else:
print(':(') | p03323 |
A, B = list(map(int,input().split()))
if(A < 9 and B < 9):
print("Yay!")
else:
print(":(") | A, B = list(map(int,input().split()))
if(A <= 8 and B <= 8):
print("Yay!")
else:
print(":(")
| p03323 |
A, B = list(map(int, input().split()))
ans = 'Yay!' if A <= 8 and B <= 8 else ':('
print(ans)
| A, B = list(map(int, input().split()))
ans = 'Yay!' if max(A, B) <= 8 else ':('
print(ans)
| p03323 |
A = [int(i) for i in input().split()]
if max(A) <= 8:
print('Yay!')
else:
print(':(') | A, B = list(map(int, input().split()))
print(('Yay!' if A <= 8 and B <= 8 else ':(')) | p03323 |
A, B, C = list(map(int, input().split()))
if B + C <= A:
print((0))
else:
print((B + C - A))
| A, B, C = list(map(int, input().split()))
# if B + C <= A:
# print(0)
# else:
# print(B + C - A)
print((max(0, B + C - A)))
| p02951 |
temp=list(map(int, input().split()))
a=temp[2]-(temp[0]-temp[1])
if a>=0:
print(a)
else:
print((0)) | temp=list(map(int, input().split()))
temp=temp[2]-(temp[0]-temp[1])
if temp<0:
print((0))
else:
print((int(temp))) | p02951 |
a, b, c = list(map(int, input().split()))
print((max(c-(a-b), 0))) | a, b, c = list(map(int, input().split()))
ans = max(c-(a-b), 0)
print(ans)
| p02951 |
A, B, C = list(map(int, input().split()))
C -= A-B
if C < 0:
C = 0
print(C)
| A, B, C = list(map(int, input().split()))
d = min(A-B, C)
print((C-d))
| p02951 |
a, b, c = list(map(int, input().split()))
print((max(0, c - min(c, a - b)))) | a, b, c = list(map(int, input().split()))
print((c - min(c, a - b))) | p02951 |
def main():
A, B, C = list(map(int, input().split()))
ans = C - (A - B)
print((max(ans, 0)))
if __name__ == "__main__":
main()
| def main():
A, B, C = list(map(int, input().split()))
t = min(A - B, C)
ans = C - t
print(ans)
if __name__ == "__main__":
main()
| p02951 |
def slove():
import sys
input = sys.stdin.readline
a, b, c = list(map(int, input().rstrip('\n').split()))
print((max(c - (a - b), 0)))
if __name__ == '__main__':
slove()
| #1行に入力が複数の場合
a, b, c = list(map(int, input().split()))
#容器1に入れることができる水の量
can_ad_a = a - b
#aに追加で注げる水の量は
#「aに入れることができる水の量」、「cに入っている水の量」のうち小さい値
#「aに入れた水の量」を「c」から引けば「cに残る水の量」
#min(value, value)で最小値を取得
print((c - min(can_ad_a, c)))
| p02951 |
a, b, c = list(map(int, input().split()))
tmp = a - b
if tmp - c >= 0:
print((0))
else:
print((c- tmp)) | a, b, c = list(map(int, input().split()))
tmp = a - b
print((c - min(tmp, c))) | p02951 |
A,B,C = list(map(int, input().split()))
if A-B<=C:
print((C-(A-B)))
else:
print((0)) | A, B, C = list(map(int, input().split()))
res1 = A - B
if res1 <= C:
trans = res1
else:
trans = C
print((C - trans)) | p02951 |
a, b, c = list(map(int, input().split()))
x = min(a-b, c)
ans = c - x
print(ans) | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, B, C = list(map(int, input().split()))
x = A-B
print((0 if C-x < 0 else C-x))
| p02951 |
A, B, C = list(map(int, input().split()))
print((0 if A - B >= C else C - A + B)) | A, B, C = list(map(int, input().split()))
if (A - B > C):
print((0))
else:
print((C - A + B))
| p02951 |
A, B, C = [int(i) for i in input().split()]
print((C - min(A - B, C))) | A, B, C = list(map(int, input().split()))
print((max(C - A + B, 0))) | p02951 |
A,B,C=list(map(int,input().split()))
d=C-(A-B)
print((d if d>0 else 0)) | A,B,C=list(map(int,input().split()))
print((max(0,C-A+B))) | p02951 |
A,B,C=list(map(int,input().split()))
print((max(0,C-A+B))) | A, B, C = list(map(int, input().split()))
water = C-(A-B)
print((water if water > 0 else 0)) | p02951 |
A, B, C = list(map(int, input().split(' ')))
print((max(C - (A - B), 0)))
| #!/usr/bin/env python3
import sys
def solve(A: int, B: int, C: int):
print((max(C - (A - B), 0)))
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iter... | p02951 |
a, b, c = list(map(int, input().split()))
if c-(a-b) <= 0:
print((0))
else:
print((c-(a-b))) | a, b, c = list(map(int, input().split()))
print((max(0,c-(a-b)))) | p02951 |
A, B, C = list(map(int, input().split()))
D = B + C - A
print((max(0, D))) | A, B, C = list(map(int, input().split()))
print((max(0, B + C - A))) | p02951 |
A, B, C = list(map(int, input().split()))
if C > (A - B): print((C - (A - B)))
else: print((0)) | import sys
def solve():
input = sys.stdin.readline
A, B, C = list(map(int, input().split()))
print((max(0, C - A + B)))
return 0
if __name__ == "__main__":
solve() | p02951 |
N = list(map(int, input().split()))
a,b,c = N[0],N[1],N[2]
ans = c-(a-b)
if ans < 0:
ans = 0
print(ans) | #一行数値 複数
a,b,c = list(map(int, input().split()))
ans = c-(a-b)
if ans < 0:
ans = 0
print(ans) | p02951 |
import sys
input = sys.stdin.readline
a, b, c = list(map(int, input().split()))
ans = b+c - a
if ans <= 0:
ans = 0
print(ans) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
a, b, c = list(map(int, read().split()))
print((max(0, c - (a - b))))
| p02951 |
a, b, c = list(map(int, input().split()))
if a < b + c:
print((b+c-a))
else:
print((0)) | a,b,c = list(map(int, input().split()))
print((max(0, c-(a-b)))) | p02951 |
a,b,c=list(map(int,input().split()));print((max(0,c-a+b))) | a,b,c = list(map(int,input().split()))
d = a - b
c -= min(c, d)
print(c)
| p02951 |
N = int(eval(input()))
a = list(map(int, input().split()))
def A(i, j):
if i == j:
return 0
elif j == i + 1:
return sum(a[i:i+2])
else:
S = sum(a[i:j+1])
return min([A(i, k) + A(k+1, j) for k in range(i, j)]) + S
print((A(0, N-1))) | N = int(eval(input()))
a = list(map(int, input().split()))
A = [[0 for __ in range(N)] for _ in range(N)]
S = [[0 for __ in range(N)] for _ in range(N)]
for i in range(N-1):
for j in range(i, N):
S[i][j] = sum(a[i:j+1])
for w in range(1, N):
for i in range(N):
j = i + w
i... | p03173 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[float("inf")]*(N-i+1) for i in range(N+1)]
dp[1] = [0] * N
for i in range(2, N+1):
for j in range(N-i+1):
for k in range(1, i):
dp[i][j] = min(dp[k][j] + dp[i-k][j+k] +
... | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
cumsum = [[0]*(N-i+1) for i in range(N+1)]
dp = [[float("inf")]*(N-i+1) for i in range(N+1)]
dp[1] = [0] * N
cumsum[1] = A
for i in range(2, N+1):
for j in range(N-i+1):
cumsum[i][j] = cum... | p03173 |
import sys
sys.setrecursionlimit(10**9)
n = int(eval(input()))
A = list(map(int, input().split()))
memo = [[float('inf')]*410 for _ in range(410)]
visit = [[False]*410 for _ in range(410)]
from itertools import accumulate
B = [0]+A
B = list(accumulate(B))
def dp(l, r):
if l == r:
return 0
if... | n = int(eval(input()))
A = list(map(int, input().split()))
from itertools import accumulate
B = [0] + A
B = list(accumulate(B))
INF = 10**18
dp = [[INF]*(n+1) for i in range(n+1)]
# dp[i][j]: 区間[i, j)のスライムを取り除いたコストの最小値
for i in range(n):
dp[i][i+1] = 0
# 区間の幅(d)が狭い方から更新していく(d: 2, 3, ...n+1)
# d = 0, ... | p03173 |
#!/usr/bin/env python3
#EDPC N
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | #!/usr/bin/env python3
#EDPC N
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | p03173 |
# 大きさがsum(a)のスライムが1匹いる
# dp[l][r]=min(区間[l,r]を分解するための最小コスト)
n=int(eval(input()))
a=list(map(int,input().split()))
INF=10**15
dp=[[0]*n for i in range(n)]
for i in range(n):
dp[i][i]=a[i]
for i in range(n-1):
for j in range(i+1,n):
dp[i][j]=dp[i][j-1]+a[j]
for i in range(n-1):
for j in ... | # dp[l][r]=min(区間[l,r]を合成するための最小コスト)
n=int(eval(input()))
a=list(map(int,input().split()))
INF=10**15
dp=[[0]*n for i in range(n)]
for i in range(n):
dp[i][i]=a[i]
# 合成するときの必要経費を構成
for i in range(n-1):
for j in range(i+1,n):
dp[i][j]=dp[i][j-1]+a[j]
dp[0][-1]=0
# dp[i][j]=min(dp[i][k]+dp[k+1... | p03173 |
from itertools import accumulate
INF = float('inf')
N = int(eval(input()))
As = list(map(int, input().split()))
accAs = [0] + list(accumulate(As))
dp = [[0] * (N) for _ in range(N)]
for num in range(2, N+1):
for i in range(N-num+1):
cost = INF
for j in range(1, num):
co... | from itertools import accumulate
def solve():
INF = 10**15
N = int(eval(input()))
As = list(map(int, input().split()))
accAs = list(accumulate([0]+As))
dp = [[INF]*(N) for _ in range(N)]
for i in range(N):
dp[i][i] = 0
for W in range(2, N+1):
for L in rang... | p03173 |
from itertools import accumulate
def solve():
INF = 10**15
N = int(eval(input()))
As = list(map(int, input().split()))
accAs = list(accumulate([0]+As))
dp = [[INF]*(N) for _ in range(N)]
for i in range(N):
dp[i][i] = 0
for W in range(2, N+1):
for L in rang... | from itertools import accumulate
def solve():
INF = 10**15
N = int(eval(input()))
As = list(map(int, input().split()))
accAs = list(accumulate([0]+As))
dp = [[INF]*(N) for _ in range(N)]
for i in range(N):
dp[i][i] = 0
for L in reversed(list(range(N))):
dp... | p03173 |
import math
from functools import lru_cache, reduce
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def prefix_sum(arr, a):
arr.append(arr[-1]+a)
return arr
def solve():
"""
OPT[i][j] = min(OPT[i][k]+OPT[k+... | import math
from functools import lru_cache, reduce
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def prefix_sum(arr, a):
arr.append(arr[-1]+a)
return arr
def solve():
"""
OPT[i][j] = min(OPT[i][k]+OPT[k+... | p03173 |
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
l = [[10**9+1] * (N+1) for _ in range(N+1)]
s = [[0] * (N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N+1):
s[i][j] = sum(a[k] for k in range(i, j))
for i in range(N):
l[i][i... | def main():
N = int(eval(input()))
a = list(map(int, input().split()))
l = [[10**9+1] * (N+1) for _ in range(N+1)]
s = [[0] * (N+1) for _ in range(N+1)]
for i in range(N-1):
for j in range(i+1, N+1):
s[i][j] = s[i][j-1] + a[j-1]
for i in range(N):
l[i][i+1] =... | p03173 |
# coding: utf-8
from functools import lru_cache
from itertools import accumulate as accum
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
@lru_cache(maxsize = None)
def f(l, r):
if l == r:
return(0)
cost = float('inf')
for x in range(l, r):
cost_ = f(l, x) + ... | # coding: utf-8
from itertools import accumulate as accum
import sys
input = sys.stdin.readline
def f2(n, a):
acsum = list(accum(a)) + [0]
dp = [[float('inf')] * n for _ in range(n)]
for i in range(n):
dp[i][i] = 0
if i + 1 != n:
dp[i][i + 1] = a[i] + a[i + 1]
... | p03173 |
from functools import lru_cache
N = int(eval(input()))
A = list(map(int, input().split()))
INF = 1.0e+100
@lru_cache(maxsize=None)
def f(l, r):
if r - l == 1:
return (A[l], 0)
ret = (INF, INF)
for i in range(l+1, r):
(lr, lc) = f(l, i)
(rr, rc) = f(i, r)
if lr+rr+lc+rc < ret[1]:
... | from functools import lru_cache
N = int(eval(input()))
A = list(map(int, input().split()))
INF = 1.0e+100
dp = [[[None, INF] for _ in range(N+1)] for _ in range(N+1)]
for i in range(N):
dp[i][i+1] = [A[i], 0]
for g in range(2, N+1):
for l in range(N-g+1):
r = l + g
for i in ran... | p03173 |
def f(n, a):
dp = [[0] * n for _ in range(n)]
for i in range(n - 2, -1, -1):
s = a[i]
dpi=dp[i]
for j in range(i + 1, n):
k = []
s += a[j]
for d in range(i, j):
k += [dpi[d] + dp[d + 1][j]]
dp[i][j] = min(k) + s
... | def f(n, a):
inf = float("inf")
dp = [[0] * n for _ in range(n)]
for i in range(n - 2, -1, -1):
s = a[i]
dpi = dp[i]
for j in range(i + 1, n):
mn = inf
s += a[j]
for d in range(i, j):
k = dpi[d] + dp[d + 1][j]
... | p03173 |
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def main():
def cost(l, r):
if l + 2 == r:
return aa[l] + aa[l + 1]
if l + 1 == r:
return 0
if dp[l][r] != -1:
... | import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def main():
def cost(l, r):
if l + 2 == r:
return aa[l] + aa[l + 1]
if l + 1 == r:
return 0
if dp[l][r] != -1:
... | p03173 |
from itertools import accumulate
import sys
# python template for atcoder1
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[float('inf')]*N for _ in range(N)]
a_acc = [0]+list(accumulate(A))
def dfs(l, r):
"""
List[l:r]
... | from itertools import accumulate
import sys
# python template for atcoder1
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[float(0)]*N for _ in range(N)]
a_acc = [0]+list(accumulate(A))
def dfs(l, r):
"""
List[l:r]
... | p03173 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | p03173 |
import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
from functools import lru_cache
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
S = [0] * (n + 1)
for i in range(n):
S[i +... | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
S = [0] * (n + 1)
for i in range(n):
S[i + 1] = S[i] + A[i]
dp = [[N... | p03173 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import... | p03173 |
inf = float('inf')
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
d = [[inf] * n for _ in range(n)]
for i in range(n):
d[i][i] = 0
c = [0]
for aa in a:
c.append(c[-1] + aa)
for i in range(n - 1, -1, -1):
for j in range(i + 1, n):
for k in range(i, j):
... | inf = 10 ** 16
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
d = [[inf] * n for _ in range(n)]
for i in range(n):
d[i][i] = 0
c = [0]
for aa in a:
c.append(c[-1] + aa)
for i in range(n - 1, -1, -1):
for j in range(i + 1, n):
for k in range(i, j):
#... | p03173 |
def solve(n, a):
from itertools import accumulate
inf = (400 ** 2) * (10 ** 9) + 10
# [l,r)
def dfs(l, r):
if memo[l][r] != -1:
return memo[l][r]
if r - l == 1:
return 0
res = inf
for c in range(l + 1, r):
# [l, c), [c, r... | def solve(n, a):
from itertools import accumulate
inf = (400 ** 2) * (10 ** 9) + 10
acc = (0,) + tuple(accumulate(a))
cost = [[inf] * (n + 1) for _ in range(n + 1)]
for i in range(n):
cost[i][i + 1] = 0
for l in range(n - 1, -1, -1):
for r in range(l + 2, n + 1):
... | p03173 |
N = int(eval(input()))
# A = list(map(int, input()))
A = tuple(map(int, input().split()))
from collections import defaultdict, deque
dp = defaultdict(lambda: -1)
q = deque([])
q.append((A, 0))
inf = float("inf")
ans = inf
while q:
t, cost = q.popleft()
if len(t) == 0:
ans = min(ans... | N = int(eval(input()))
A = list(map(int, input().split()))
inf = float("inf")
from itertools import accumulate
Accum = list(accumulate([0] + A))
dp = [ [inf]*(N+1) for _ in range(N+1)]
def dfs(l,r):
if dp[l][r] != inf:
return dp[l][r]
if l == r:
return 0
if l+1 == r:
... | p03173 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03173 |
from itertools import accumulate
N, *A = list(map(int, open(0).read().split()))
S = [0] + list(accumulate(A))
memo = {}
def dp(L, R):
if L == R:
return 0
if (L, R) in memo:
return memo[(L, R)]
memo[(L, R)] = min(dp(L, c) + dp(c + 1, R) + S[R + 1] - S[L] for c in range(L, R))... | from itertools import accumulate
N, *A = list(map(int, open(0).read().split()))
S = [0] + list(accumulate(A))
memo = [[-1] * N for _ in range(N)]
def dp(L, R):
if L == R:
return 0
if memo[L][R] >= 0:
return memo[L][R]
memo[L][R] = min(dp(L, c) + dp(c + 1, R) + S[R + 1] - S[L... | p03173 |
# dp[i][j] - minimum cost from i to j
INF = 1e18+5
n = int(eval(input()))
arr = [int(x) for x in input().split()]
dp = [[0 for _ in range(n)] for _ in range(n)]
def range_sum(arr, L, R):
s = 0
for i in range(L, R+1):
s += arr[i]
return s
for L in reversed(list(range(n))):
... | # dp[i][j] - minimum cost from i to j
INF = 1e18+5
n = int(eval(input()))
arr = [int(x) for x in input().split()]
dp = [[0 for _ in range(n)] for _ in range(n)]
def range_sum(arr, L, R):
s = 0
for i in range(L, R+1):
s += arr[i]
return s
for L in reversed(list(range(n))):
... | p03173 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
INF = 10**18
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
a = LI()
sn = [[0 for _ in range(N)] for _ in range(N)]
dp = [[INF for _ in range(N)] for _ in range(N)]
for i in range(N):
... | import sys
INF = 10**14
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
a = LI()
sn = [[0 for _ in range(N)] for _ in range(N)]
dp = [[INF for _ in range(N)] for _ in range(N)]
for i in range(N):
x = 0
for j in range(i,N):
x += a... | p03173 |
n = int(eval(input()))
a = list(map(int, input().split()))
#dp[l][r] = [l, r)区間のスライムを
dp = [[float("inf")]*(n+1) for i in range(n+1)]
for i in range(n):
dp[i][i] = 0
#cost[r]-cost[l] = [l, r)区間を合計したときのスライムの総和
cost = [0]*(n+1)
for i in range(n):
cost[i+1] = cost[i] + a[i]
#メモ化再帰でdp[0][n]求める
def ... | n = int(eval(input()))
a = list(map(int, input().split()))
#dp[l][r] = [l, r)区間のスライムを合体するときのコストの最小値
dp = [[-1]*(n+1) for i in range(n+1)]
for i in range(n):
dp[i][i] = 0
#cost[r]-cost[l] = [l, r)区間を合計したときのスライムの総和
cost = [0]*(n+1)
for i in range(n):
cost[i+1] = cost[i] + a[i]
#メモ化再帰でdp[0][n]求める
... | p03173 |
n = int(eval(input()))
a = list(map(int, input().split()))
#dp[l][r] = [l, r)区間のスライムを合体するときのコストの最小値
dp = [[float("inf")]*(n+1) for i in range(n+1)]
for i in range(n):
dp[i][i] = 0
#cost[r]-cost[l] = [l, r)区間を合計したときのスライムの総和
cost = [0]*(n+1)
for i in range(n):
cost[i+1] = cost[i] + a[i]
#メモ化再帰でdp[... | n = int(eval(input()))
a = list(map(int, input().split()))
#dp[l][r] = [l, r)区間のスライムを合体するときのコストの最小値
dp = [[float("inf")]*(n+1) for i in range(n+1)]
for i in range(n):
dp[i][i] = 0
#cost[r]-cost[l] = [l, r)区間を合計したときのスライムの総和
cost = [0]*(n+1)
for i in range(n):
cost[i+1] = cost[i] + a[i]
#メモ化再帰でdp[... | p03173 |
n = int(eval(input()))
a = list(map(int, input().split()))
#dp[l][r] = [l, r)区間のスライムを合体するときのコストの最小値
dp = [[float("inf")]*(n+1) for i in range(n+1)]
for i in range(n):
dp[i][i] = 0
#cost[r]-cost[l] = [l, r)区間を合計したときのスライムの総和
cost = [0]*(n+1)
for i in range(n):
cost[i+1] = cost[i] + a[i]
#メモ化再帰でdp[... | n = int(eval(input()))
a = list(map(int, input().split()))
ruiseki = [0] * (n+1)
for i in range(n):
ruiseki[i+1] = ruiseki[i] + a[i]
dp = [[-1]*(n+1) for i in range(n+1)]
def solve(l, r):
if dp[l][r] != -1:
return dp[l][r]
if r - l == 1:
dp[l][r] = 0
return dp[l][r]
... | p03173 |
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [[10**13]*N for i in range(N)]
s = [0] * (N+1)
for i, x in enumerate(a):
s[i+1] = s[i] + x
dp[i][i] = 0
for i in range(N-1, -1, -1):
for j in range(i+1, N):
tmp = s[j+1] - ... | def main():
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [[10**13]*N for i in range(N)]
s = [0] * (N+1)
for i in range(N):
s[i+1] = s[i] + a[i]
dp[i][i] = 0
for i in range(N-1, -1, -1):
for j in range(i+1, N):
tmp = s[j+1] - s[i]... | p03173 |
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
inf = 10 ** 13
dp = [[0]*N for i in range(N)]
s = [0] * (N+1)
for i, x in enumerate(a):
s[i+1] = s[i] + x
dp[i][i] = 0
for i in range(N-2, -1, -1):
... | def main():
import sys
from itertools import accumulate
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
inf = 10 ** 13
dp = [[0]*N for i in range(N)]
s = [0] + list(accumulate(a))
for i, x in enumerate(a):
dp[i][i] = 0
for ... | p03173 |
def calc(A,n,dp):
if n==2:
return A[0]+A[1]
s=10**18
for i in range(0,n-1):
B=[]
B=A[0:i]
B.append(A[i]+A[i+1])
B=B+A[i+2:]
l=str(B)
if l in dp:
s=min(s,A[i]+A[i+1]+dp[l])
else:
d=calc(B,n-1,dp)
... | n=int(eval(input()))
A=list(int(i) for i in input().split())
prefixsum=[0 for i in range(n+1)]
for i in range(1,n+1):
prefixsum[i]=A[i-1]+prefixsum[i-1]
#print(prefixsum)
dp=[[0 for i in range(n)] for j in range(n)]
for i in range(n-1,-1,-1):
for j in range(i,n):
#starting index i and ending j
... | p03173 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
dp = [[0] * N for _ in range(N)]
for d in range(1, N):
for l in range(N-d):
r = l + d
if d == 0:
dp[l][r] = A[l]
else:
dp[l][r] = 10**20
for m in range(l, r):
... | N = int(eval(input()))
A = [int(a) for a in input().split()]
B = [0]
for a in A:
B.append(B[-1]+a)
dp = [[0] * N for _ in range(N)]
for d in range(1, N):
for l in range(N-d):
r = l + d
if d == 0:
dp[l][r] = A[l]
else:
dp[l][r] = 10**2... | p03173 |
n = int(eval(input()))
a = list(map(int,input().split()))
memo = {}
p = [0]
for num in a:
p += [p[-1] + num]
def dp(i,j):
if i >= j:
return 0
if (i,j) not in memo:
ans = float("inf")
for k in range(i,j):
temp = dp(i,k) + dp(k+1,j) + p[j+1] - p[i]
... | n = int(eval(input()))
a = list(map(int,input().split()))
memo = {}
p = [0]
for num in a:
p += [p[-1] + num]
dp = [[0 for _ in range(n)] for _ in range(n)]
for l in range(2,n+1):
for i in range(n-l+1):
dp[i][i+l-1] = min([dp[i][k] + dp[k+1][i+l-1] for k in range(i,i+l-1)]) + p[i+l] - p[i]
pr... | p03173 |
n = int(eval(input()))
a = list(map(int,input().split()))
memo = {}
p = [0]
for num in a:
p += [p[-1] + num]
dp = [[0 for _ in range(n)] for _ in range(n)]
for l in range(2,n+1):
for i in range(n-l+1):
dp[i][i+l-1] = min([dp[i][k] + dp[k+1][i+l-1] for k in range(i,i+l-1)]) + p[i+l] - p[i]
pr... | n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * (n+1) for _ in range(n+1)]
s = [0] * (n+1)
for i in range(n):
s[i+1] = s[i] + a[i]
for l in range(2, n+1):
for i in range(n-l+1):
j = i + l
dp[i][j] = s[j] - s[i] + min(dp[i][k] + dp[k][j] for k in range(i+1, j))
pr... | p03173 |
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**9)
N = int(eval(input()))
A = list(map(int,input().split()))
dp = [[0]*(N+1) for i in range(N+1)]
flag = [[0]*(N+1) for i in range(N+1)]
cA = [0]*(N+1)
for i in range(1,N+1) :
cA[i] = cA[i-1] + A[i-1]
def f(left, right) :
if f... | N = int(eval(input()))
A = list(map(int,input().split()))
dp = [[10**18]*N for i in range(N)]
cA = [0]*(N+1)
for i in range(1,N+1) :
cA[i] = cA[i-1] + A[i-1]
dp[i-1][i-1] = 0
for d in range(1,N) :
for i in range(N-d) :
for cut in range(i, i+d) :
dp[i][i+d] = min(dp[i][i... | p03173 |
def main():
INF = 10 ** 12
N = int(eval(input()))
A = list(map(int, input().split(' ')))
cumsum = [0 for _ in range(N)]
cumsum[0] = A[0]
for i in range(1, N):
cumsum[i] = A[i] + cumsum[i - 1]
dp = [[0 for _ in range(N)] for _ in range(N)]
def solve(left, right):
... | def main():
INF = 10 ** 15
N = int(eval(input()))
A = list(map(int, input().split(' ')))
cumsum = [0 for _ in range(N)]
cumsum[0] = A[0]
for i in range(1, N):
cumsum[i] = A[i] + cumsum[i - 1]
dp = [[0 for _ in range(N)] for _ in range(N)]
def solve(left, right):
... | p03173 |
N = int(eval(input()))
A = list(map(int, input().split()))
cum = [[0]*(N) for i in range(N)]
for i in range(N):
c = 0
for j in range(i, N):
c += A[j]
cum[i][j] = c
dp = [[0]*N for i in range(N)]
for n in range(1, N+1):
for i in range(N-n):
j = i + n
min_cost = 0
for k in ran... | N = int(eval(input()))
A = list(map(int, input().split()))
"""
cum = [[0]*(N) for i in range(N)]
for i in range(N):
c = 0
for j in range(i, N):
c += A[j]
cum[i][j] = c
"""
cum = [0]
for a in A:
cum.append(cum[-1] + a)
dp = [[0]*N for i in range(N)]
for n in range(1, N+1):
for i in... | p03173 |
mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
import time
from bisect import bisect_left, insort_left, bisect_right
import sys
import random
import itertools
#input = sys.stdin.readline
def input():
return sys.stdin.readline().strip("\n").strip(" ")
_NUMINT_ALL = li... | mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
import time
from bisect import bisect_left, insort_left, bisect_right
import sys
import random
import itertools
#input = sys.stdin.readline
def input():
return sys.stdin.readline().strip("\n").strip(" ")
_NUMINT_ALL = li... | p03173 |
mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
import time
from bisect import bisect_left, insort_left, bisect_right
import sys
import random
import itertools
#input = sys.stdin.readline
def input():
return sys.stdin.readline().strip("\n").strip(" ")
_NUMINT_ALL = li... | mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
import time
from bisect import bisect_left, insort_left, bisect_right
import sys
import random
import itertools
#input = sys.stdin.readline
def input():
return sys.stdin.readline().strip("\n").strip(" ")
_NUMINT_ALL = li... | p03173 |
#!/usr/bin/env python3
import sys
from itertools import accumulate
import functools
INF = float("inf")
def solve(N: int, a: "List[int]"):
dp = [[0]*N for _ in range(N)]
acc = [0]+list(accumulate(a))
@functools.lru_cache(maxsize=None)
def rec(l, r):
if l == r:
retur... | #!/usr/bin/env python3
import sys
from itertools import accumulate
import functools
sys.setrecursionlimit(10**8)
INF = float("inf")
def solve(N: int, a: "List[int]"):
dp = [[-1]*N for _ in range(N)]
acc = [0]+list(accumulate(a))
def rec(l, r):
if dp[l][r] > 0:
return d... | p03173 |
n=int(eval(input()))
a= list(map(int, input().split()))
a+=a
INF=10**12
dp=[[[INF,0] for i in range(2*n+1)] for i in range(2*n+1)]
# dp[i][j][0]: コスト
# dp[i][j][1]:合成したスライムの合計
for i in range(n):
for l in range(2*n-i):
r=l+i
if r==l:
dp[l][r][1]=a[l]
dp[l][r][0]=... | import sys
import itertools
input = sys.stdin.readline
n=int(eval(input()))
a= list(map(int, input().split()))
a+=a
b=itertools.accumulate(a)
b=[0]+list(b)
INF=10**15
dp=[[INF] *(2*n+1) for i in range(2*n+1)]
# dp[i][j][0]: コスト
# dp[i][j][1]:合成したスライムの合計
for i in range(n):
for l in range(2*n-i):
... | p03173 |
inf = float('inf')
def accmulate(array):
global cs
cs = [0]*(len(array)+1)
for i in range(len(array)):
cs[i+1] = cs[i] + array[i]
def query(l,r):
return cs[r+1] - cs[l]
N = int(eval(input()))
A = list(map(int,input().split()))
accmulate(A)
dp = [[inf]*(N+1) for _ in range(N+... | inf = float('inf')
def accmulate(array):
global cs
cs = [0]*(len(array)+1)
for i in range(len(array)):
cs[i+1] = cs[i] + array[i]
def query(l,r):
return cs[r+1] - cs[l]
N = int(eval(input()))
A = list(map(int,input().split()))
accmulate(A)
dp = [[inf]*(N+1) for _ in range(N+... | p03173 |
n = int(eval(input()))
*A, = list(map(int, input().split()))
# n = 4
# A = [10, 20, 30, 40]
inf = 10**20
DP = [[None for r in range(n+1)] for l in range(n)]
S = [0]
for i in range(n):
S.append(S[-1]+A[i])
def f(l, r):
if r <= l+1:
DP[l][r] = 0
if DP[l][r] != None:
return DP[... | n = int(eval(input()))
*A, = list(map(int, input().split()))
# n = 4
# A = [10, 20, 30, 40]
DP = [[None for r in range(n+1)] for l in range(n)]
S = [0]
for i in range(n):
S.append(S[-1]+A[i])
def dp(l, r):
# 区間[l,r)での最小コスト
if r <= l+1:
DP[l][r] = 0
if DP[l][r] != None:
r... | p03173 |
n = int(eval(input()))
*A, = list(map(int, input().split()))
# n = 4
# A = [10, 20, 30, 40]
DP = [[None for r in range(n+1)] for l in range(n)]
S = [0]
for i in range(n):
S.append(S[-1]+A[i])
def dp(l, r):
# 区間[l,r)での最小コスト
if r <= l+1:
DP[l][r] = 0
if DP[l][r] != None:
r... | n = int(eval(input()))
*A, = list(map(int, input().split()))
S = [0]
for i in range(n):
S.append(S[-1]+A[i])
DP = [[None for r in range(n+1)] for l in range(n)]
def dp(l, r):
if r <= l+1:
return 0
if DP[l][r] != None:
return DP[l][r]
DP[l][r] = S[r]-S[l]+min([dp(l, i)+dp(i, r)... | p03173 |
def solve(n, k):
MOD = 998244353
if n > k:
return 0
invs = [1] * (k + 1)
pf, kf = 1, 1
for m in range(2, k + 1):
pf = kf
kf *= m
kf %= MOD
invs[m] = pow(kf, MOD - 2, MOD)
ans = 0
if k & 1 == 0:
if n == 1:
ans = 1... | def solve(n, k):
MOD = 998244353
if n > k:
return 0
if n == 1:
return pow(2, k - 1, MOD)
invs = [1] * (k + 1)
pf, kf = 1, 1
for m in range(2, k + 1):
pf = kf
kf *= m
kf %= MOD
invs[m] = pow(kf, MOD - 2, MOD)
ans = 0
if k... | p03431 |
def solve(n, k):
MOD = 998244353
if n > k:
return 0
if n == 1:
return pow(2, k - 1, MOD)
invs = [1] * (k + 1)
pf, kf = 1, 1
for m in range(2, k + 1):
pf = kf
kf *= m
kf %= MOD
invs[m] = pow(kf, MOD - 2, MOD)
ans = 0
if k... | def solve(n, k):
MOD = 998244353
if n > k:
return 0
if n == 1:
return pow(2, k - 1, MOD)
pf, kf = 1, 1
for m in range(2, k + 1):
pf = kf
kf *= m
kf %= MOD
inv = pow(kf, MOD - 2, MOD)
invs = [1] * (k + 1)
invs[k] = inv
for m in... | p03431 |
n,k=list(map(int,input().split()))
p=998244353
r=range
f=[1]
for i in r(k):f+=[-~i*f[i]%p]
a=1<<~-k
for i in r(min(n-1,k)):a-=f[k-1]*pow((f[i]*f[k-1-i])%p,-1,p)
print((a%p)) | n,k=list(map(int,input().split()))
p=998244353
r=range
f=[1]
for i in r(k):f+=[-~i*f[i]%p]
a=0
for i in r(n-1,k):a+=f[k-1]*pow(f[i]*f[k-1-i],-1,p)
print((a%p)) | p03431 |
n,k=list(map(int,input().split()))
p=998244353
r=range
f=[1]
for i in r(k):f+=[-~i*f[i]%p]
a=0
for i in r(n-1,k):a+=f[k-1]*pow(f[i]*f[k-1-i],-1,p)
print((a%p)) | n,k=list(map(int,input().split()))
p=998244353
r=range
f=[1]
for i in r(k):f+=[-~i*f[i]%p]
print((sum(f[k-1]*pow(f[i]*f[k-1-i],-1,p)for i in r(n-1,k))%p)) | p03431 |
def combs_mod(n,k,mod):
#nC0からnCkまで
inv = [1]*(k+1)
for i in range(1,k+1):
inv[i] = pow(i,mod-2,mod)
ans = [1]*(k+1)
for i in range(1,k+1):
ans[i] = ans[i-1]*(n+1-i)*inv[i]%mod
return ans
def solve():
mod = 998244353
N, K = list(map(int, input().split()))
ans = 0
if K<N:
re... | def combs_mod(n,k,mod):
#nC0からnCkまで
inv = [1]*(k+1)
for i in range(1,k+1):
inv[i] = pow(i,-1,mod)
ans = [1]*(k+1)
for i in range(1,k+1):
ans[i] = ans[i-1]*(n+1-i)*inv[i]%mod
return ans
def solve():
mod = 998244353
N, K = list(map(int, input().split()))
ans = 0
if K<N:
retur... | p03431 |
m=998244353
def c(n,r):return (g[n]*h[r]*h[n-r])%m
g=[1,1]
h=g[:]
v=[0,1]
for i in range(2,999999):
g.append((g[-1]*i)%m)
v.append((-v[m%i]*(m//i))%m)
h.append((h[-1]*v[i])%m)
N,K=list(map(int,input().split()))
P=0
for k in range(N-1,K):P+=c(K-1,k)
print((P%m)) | m=998244353
def c(n,r):return (g[n]*h[r]*h[n-r])%m
g=[1,1]
h=g[:]
v=[0,1]
for i in range(2,999999):
g.append(g[-1]*i%m)
v.append(m//i*-v[m%i]%m)
h.append(h[-1]*v[i]%m)
N,K=list(map(int,input().split()))
P=0
for k in range(N-1,K):P+=c(K-1,k)
print((P%m)) | p03431 |
import sys
def solve():
a = int(eval(input()))
b = int(eval(input()))
if a == b:
print((1))
return
t = a ^ b
N = len(bin(t)) - 2
t = 1 << N
a = a & (t - 1)
b = b & (t - 1)
blen = len(bin(b)) - 2
sb = b & (2**(blen - 1) - 1)
if sb ==... | import sys
def solve():
a = int(eval(input()))
b = int(eval(input()))
if a == b:
print((1))
return
t = a ^ b
N = bitlen(t)
a = a & (2**N - 1)
b = b & (2**N - 1)
blen = bitlen(b)
sb = b & (2**(blen - 1) - 1)
sblen = bitlen(sb)
s = ... | p03708 |
N, A, B =(int(x) for x in input().split())
print((min(A*N, B))) | N, A, B = list(map(int, input().split()))
print((min(A*N, B))) | p03501 |
import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(10000)
# Debug output
def chkprint(*args):
names = {id(v):k for k,v in list(inspect.currentframe().f_back.f_locals.items())}
print((', '.join(names.get(id(arg),'?... | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(10000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in list(inspect.currentframe().f_back.f_locals.items())
}
print(('... | p03501 |
a=input().split()
N=int(a[0])
A=int(a[1])
B=int(a[2])
if(N*A<=B):
print((N*A))
else:
print(B) | T,A,B = list(map(int,input().split()))
if(A*T<B):
print((A*T))
else:
print(B)
| p03501 |
N,A,B = list(map(int,input().split()))
print((min(N*A, B)))
| N,A,B = list(map(int,input().split()))
print((min(B,N*A))) | p03501 |
a, b, c = list(map(int, input().split()))
if a * b <= c:
print((a * b))
else:
print(c)
| a, b, c = list(map(int, input().split()))
print((min(a * b, c))) | p03501 |
N, A, B = list(map(int,input().split()))
a = A * N
if(a > B):
print(B)
else:
print(a) | N, A, B = list(map(int,input().split()))
print((min(N*A, B))) | p03501 |
i=list(map(int,input().split()))
a=i[0]
b=i[1]
def max(x,y,z):
if x>y:
m=x
else:
m=y
if z>m:
m=z
return m
ans=max(a+b,a-b,a*b)
print(ans) | a, b = list(map(int, input().split()))
print((max(a+b, a-b, a*b)))
#こぴぺ | p02945 |
a,b = list(map(int, input().split()))
print((max(a+b, a-b, a*b))) | a,b=list(map(int,input().split()))
print((max(a+b,max(a-b,a*b)))) | p02945 |
temp=list(map(int, input().split()))
print((max([temp[0]+temp[1], temp[0]-temp[1], temp[0]*temp[1]]))) | A, B= list(map(int, input().split()))
c= A+B
d= A-B
e= A*B
f=max(c, d, e)
print(f) | p02945 |
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)
| a = list(map(int,input().split()))
x = a[0] + a[1]
y = a[0] - a[1]
z = a[0] * a[1]
print((max([x,y,z])))
| p02945 |
import time
time.sleep(3)
a, b = list(map(int, input().split()))
print((max(a + b, a - b, a * b))) | import time
time.sleep(0.5)
a, b = list(map(int, input().split()))
print((max(a + b, a - b, a * b))) | p02945 |
a,b= list(map(int,input().split()))
print((max((a+b,a-b,a*b))))
| a,b= list(map(int,input().split()))
print((max(a+b,a-b,a*b)))
| p02945 |
# coding: utf-8
# Your code here!
A,B = list(map(int,input().split()))
C = A+B
D = A-B
E = A*B
print((max([C,D,E])))
| A,B = list(map(int, input().split()))
print((max(A*B,A-B,A+B))) | p02945 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.