input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
a, b, c, x, y = list(map(int, input().split()))
ans = float('inf')
for i in range(200005):
tmp = i * 2 * c
tmp += max(0, x-i) * a
tmp += max(0, y-i) * b
ans = min(ans, tmp)
print(ans) | a, b, c, x, y = list(map(int, input().split()))
ans = float('inf')
for i in range(100005):
tmp = i * 2 * c
tmp += max(0, x-i) * a
tmp += max(0, y-i) * b
ans = min(ans, tmp)
print(ans) | p03371 |
a, b, c, x, y = list(map(int, input().split()))
ans = a * x + b * y
m = max(x, y)
for i in range(1, m+1):
x -= 1
y -= 1
if x < 0:
x = 0
if y < 0:
y = 0
temp = c*(i*2) + x*a + y*b
if temp < ans:
ans = temp
print(ans)
| a, b, c, x, y = list(map(int, input().split()))
ans = a * x + b * y
ans = min(c * max(x, y) * 2, ans)
if x < y:
ans = min(c * x * 2 + (y - x) * b, ans)
else:
ans = min(c * y * 2 + (x - y) * a, ans)
print(ans) | p03371 |
A, B, C, X, Y = list(map(int, input().split()))
# ABピザ以外で考えると
ans = A * X + B * Y
# ABピザを全探索して考える
for i in range(2, max(2*X,2*Y)+1, 2):
x = X - i // 2
y = Y - i // 2
ans = min(ans, A * max(0,x) + B * max(0,y) + C * i)
print(ans)
| A, B, C, X, Y = list(map(int, input().split()))
ans = 1 << 30
# ABピザを全探索して考える
for i in range(0, max(2*X,2*Y)+1, 2):
x = X - i // 2
y = Y - i // 2
ans = min(ans, A * max(0,x) + B * max(0,y) + C * i)
print(ans)
| p03371 |
import math
a,b,c,x,y = list(map(int,input().split()))
# cを全探索？
res = float('inf')
for i in range(max(x,y)*2+1):
money = i * c
if i/2<x:
money += math.ceil(x-i/2) * a
if i/2<y:
money += math.ceil(y-i/2) * b
res = min(res,money)
print(res)
| res = 10**30
a,b,c,x,y = list(map(int,input().split()))
for i in range(0,max(x,y)+1):
# ABを2*iまい買う
tmp = 2 * i * c
xx,yy = x - i, y - i
tmp += max(0,xx) * a
tmp += max(0,yy) * b
res = min(res, tmp)
print(res)
| p03371 |
A, B, C, X, Y = [int(_) for _ in input().split()]
ans = A * X + B * Y
for i in range(max(X, Y) + 1):
cost = 2 * C * i
if X > i:
cost += A * (X - i)
if Y > i:
cost += B * (Y - i)
ans = min(ans, cost)
print(ans) | A, B, C, X, Y = [int(_) for _ in input().split()]
M = max(X, Y)
print((min(2 * C * M, 2 * C * (X + Y - M) + A *
(M - Y) + B * (M - X), A * X + B * Y)))
| p03371 |
A,B,C,X,Y = list(map(int, input().split()))
ans = 5000 * 10**5 * 4 + 1
for c in range(0,max(X,Y)*2+1,2):
a = c * C
x,y = max(0,X-c//2), max(0,Y-c//2)
a += A*x + B*y
ans = min(ans, a)
print(ans) | a,b,c,x,y=list(map(int, input().split()))
c*=2
ans=10**9
for cc in range(max(x,y)+1):
tmp = cc * c
tmp += max(0, x-cc)*a
tmp += max(0, y-cc)*b
ans = min(ans, tmp)
print(ans) | p03371 |
a,b,c,x,y = list(map(int,input().split()))
xy = max(x,y)*2+1
print((min([c*i + max(0,a*(x-i//2)) +max(0,b*(y-i//2)) for i in range(0,xy,2)]))) | a,b,c,x,y = list(map(int,input().split()))
if x < y:
a, b, x, y = b, a, y, x
print((min(a*x+b*y,2*c*y + a*(x-y),2*c*x))) | p03371 |
a, b, c, x, y = list(map(int, input().split(' ')))
c = int(c*2)
m = float('inf')
for i in range(10**5+1):
m = min(m, a*max(0, x-i)+b*max(0,y-i)+c*i)
print(m) | import math
a, b, c, x, y = list(map(int, input().split(' ')))
ans = float('inf')
c = c*2
for i in range(max(x, y)+1):
if i > x:
price = b*(y-i) + c*i
elif i > y:
price = a*(x-i) + c*i
else:
price = a*(x-i) + b*(y-i) + c*i
if ans > price:
ans = price
print(ans) | p03371 |
A, B, C, X, Y = list(map(int, input().split()))
max_iter = max(X, Y) * 2
ans = float("inf")
for i in range(max_iter):
a = max(X - i, 0)
b = max(Y - i, 0)
price = 2*C * i + A * a + B * b
ans = min(ans, price)
print(ans) | A, B, C, X, Y = list(map(int, input().split()))
ans = float("inf")
for i in range(max(X, Y)+1):
x = max(X - i, 0)
y = max(Y - i, 0)
cost = 2*C * i + A * x + B * y
ans = min(ans, cost)
print(ans) | p03371 |
#abc095c
a,b,c,x,y=list(map(int,input().split()))
res=float('inf')
for i in range(100000+2):
t=2*c*i+max(0,x-i)*a+max(0,y-i)*b
res=min(res,t)
print(res)
| #abc095c
a,b,c,x,y=list(map(int,input().split()))
res=float('inf')
for i in range(max(x,y)+2):
t=2*c*i+max(0,x-i)*a+max(0,y-i)*b
res=min(res,t)
print(res)
| p03371 |
# ABC95_C
a,b,c,x,y = list(map(int,input().split()))
ans = 0
if c * 2 > a + b:
ans += a * x + b * y
else:
if x > y:
ans += c * 2 * y
if a > c * 2:
ans += (x - y) * c * 2
else:
ans += (x - y) * a
else:
ans += c * 2 * x
if b > c * 2:
ans += (y - x) * c * 2
else:
ans += (y - x) * b
print(ans) | A, B, C, X, Y = list(map(int, input().split()))
if A + B < 2*C:
print((A*X + B*Y))
else:
Z =min(X,Y)
print((min(2*C*max(X,Y), 2*C*Z+A*(X-Z)+B*(Y-Z)))) | p03371 |
a,b,c,x,y = list(map(int,input().split()))
l = min(x,y)
m = max(x,y)
M = a * x + b * y
for i in range(1,l+1):
K = a * (x-i) + b * (y-i) + 2 * c * i #これだとマイナスになってしまう
M = min(M,K)
for i in range(l+1,m+1):
if x == l:
K = b * (y-i) + 2 * c * i
else:
K = a * (x-i) + 2 * c * i
M = min(M,K)
print(M)
| a,b,c,x,y = list(map(int,input().split()))
l = min(x,y)
m = max(x,y)
M = a * x + b * y
for i in range(1,l+1):
K = a * (x-i) + b * (y-i) + 2 * c * i
M = min(M,K)
for i in range(l+1,m+1):
if x == l:
K = b * (y-i) + 2 * c * i
else:
K = a * (x-i) + 2 * c * i
M = min(M,K)
print(M) | p03371 |
a,b,c,x,y=list(map(int, input().split()))
answer=[]
for i in range(max(x,y)*2+1):
answer.append((x-i//2)*a+(y-i//2)*b+i*c)
if x-i//2<0:
answer[i]=answer[i]-(x-i//2)*a
if y-i//2<0:
answer[i]=answer[i]-(y-i//2)*b
print((min(answer))) | a,b,c,x,y=list(map(int,input().split()));print((min(c*2*min(x,y)+abs(x-y)*min((a if x>y else b),2*c),a*x+b*y))) | p03371 |
a,b,c,x,y=list(map(int,input().split()))
l=sorted([a,b,c*2])
if l[0]==c*2:
print((max(x,y)*c*2))
elif l[1]==c*2:
if l[0]==a:
print((y*c*2+max((x-y),0)*a))
else:
print((x*c*2+max((y-x),0)*b))
else:
if a+b>=c*2:
if x>=y:
print((y*2*c+(x-y)*a))
else:
print((x*2*c+(y-x)*b))
else:
print((x*a+y*b)) | a,b,c,x,y=list(map(int,input().split()))
if x>=y:
if c*2<=min(a,b):
print((c*2*x))
elif c*2<=max(a,b):
if a>=b:
print((c*2*x))
else:
print((c*2*y+a*(x-y)))
elif c*2<=a+b:
print((c*2*y+a*(x-y)))
else:
print((a*x+b*y))
else:
if c*2<=min(a,b):
print((c*2*y))
elif c*2<=max(a,b):
if a<=b:
print((c*2*y))
else:
print((c*2*y+b*(y-x)))
elif c*2<=a+b:
print((c*2*x+b*(y-x)))
else:
print((a*x+b*y)) | p03371 |
#W, H, x, y, r = map(int, input().split())
def main():
a, b, c, x, y = list(map(int, input().split()))
min_sum = 100000 * 5000 + 100000 * 5000 + 200000 * 5000
if a == c and b == c :
min_sum = a * x + b * y
elif a < c and b < c or a == c and b < c or a < c and b == c :
min_sum = a * x + b * y
elif a > c and b > c or a == c and b > c or a > c and b == c :
if x >= y :
min_sum = y * 2 * c
if a > c * 2:
min_sum = min_sum + (x - y) * c * 2
else:
min_sum = min_sum + (x - y ) * a
else:
min_sum = x * 2 * c
if b > c * 2:
min_sum = min_sum + (y - x) * c * 2
else:
min_sum = min_sum + (y - x ) * b
else:
for i in range(0, x+1):
for j in range(0, y+1):
if min_sum > a * i + b * j + max(x-i, y-j) * c * 2:
min_sum =a * i + b * j + max(x-i, y-j) * c * 2
print(min_sum)
main()
# if a >= c and b <= c :
# sum = x * c * 2
# if x <= y :
# sum = sum + ( y - x ) * b
# else:
# sum = y * c * 2
# if x >= y :
# sum = sum + ( x - y ) * a
# if b > c * 2 :
# b_price = c
#
# input_array_list = []
#
# while True:
# input_array = input().split()
# if input_array[0] == "0" and input_array[1] == "0":
# break
# else:
# input_array_list.append(input_array)
#
# for item in input_array_list:
# n = int(item[0])
# k_sum = int(item[1])
#
# count = 0
# for i in range(1,n + 1- 2):
# for j in range(i+1, n + 1 - 1):
# for k in range (j+1, n+ 1):
# if i + j + k == k_sum :
# count = count + 1
# print(count)
#
# for item in input_array_list:
# if item[1] == "+":
# print(str(int(item[0])+int(item[2])))
# elif item[1] =="-":
# print(str(int(item[0])-int(item[2])))
# elif item[1] == "/":
# print(str(int(item[0])//int(item[2])))
# elif item[1] == "*":
# print(str(int(item[0])*int(item[2])))
#
# import sympy as sp
# input_list = []
# a,b,c = map(int, input().split())
# divisors = sp.divisors(c)
#
# count = 0
#
# for divisor in divisors:
# if a <= divisor and divisor <= b:
# count = count + 1
# print(count)
#
# while True:
# pair_str = input().split()
# pair_int = [int(s) for s in pair_str]
# if pair_int[0] == 0 and pair_int[1] == 0 :
# break
# else:
# input_list.append(pair_int)
#
# for pair_int in input_list:
# if pair_int[0] <= pair_int[1]:
# print("{} {}".format(pair_int[0], pair_int[1]))
# else:
# print("{} {}".format(pair_int[1], pair_int[0]))
#for i in range(10000):
# print("Hello World")
#a = input().split()
#a_int = [int(s) for s in a]
#a_sorted = sorted(a_int)
#print(' '.join(map(str, a_sorted)))
| #W, H, x, y, r = map(int, input().split())
def main():
a, b, c, x, y = list(map(int, input().split()))
min_sum = 100000 * 5000 + 100000 * 5000 + 200000 * 5000
if a == c and b == c :
min_sum = a * x + b * y
elif a < c and b < c or a == c and b < c or a < c and b == c :
min_sum = a * x + b * y
elif a > c and b > c or a == c and b > c or a > c and b == c :
if x >= y :
min_sum = y * 2 * c
if a > c * 2:
min_sum = min_sum + (x - y) * c * 2
else:
min_sum = min_sum + (x - y ) * a
else:
min_sum = x * 2 * c
if b > c * 2:
min_sum = min_sum + (y - x) * c * 2
else:
min_sum = min_sum + (y - x ) * b
elif a < c and b > c:
if c - a > b - c : #むだ
min_sum = a * x + b * y
else:
if x >= y :
min_sum = (x-y)* a + y * c * 2
else:
min_sum = (y-x)* b + x * c * 2
elif a > c and b < c:
if c - b > a - c : #むだ
min_sum = a * x + b * y
else:
if x >= y :
min_sum = (x-y)* a + y * c * 2
else:
min_sum = (y-x)* b + x * c * 2
else:
for i in range(0, x+1):
for j in range(0, y+1):
if min_sum > a * i + b * j + max(x-i, y-j) * c * 2:
min_sum =a * i + b * j + max(x-i, y-j) * c * 2
print(min_sum)
main()
# if a >= c and b <= c :
# sum = x * c * 2
# if x <= y :
# sum = sum + ( y - x ) * b
# else:
# sum = y * c * 2
# if x >= y :
# sum = sum + ( x - y ) * a
# if b > c * 2 :
# b_price = c
#
# input_array_list = []
#
# while True:
# input_array = input().split()
# if input_array[0] == "0" and input_array[1] == "0":
# break
# else:
# input_array_list.append(input_array)
#
# for item in input_array_list:
# n = int(item[0])
# k_sum = int(item[1])
#
# count = 0
# for i in range(1,n + 1- 2):
# for j in range(i+1, n + 1 - 1):
# for k in range (j+1, n+ 1):
# if i + j + k == k_sum :
# count = count + 1
# print(count)
#
# for item in input_array_list:
# if item[1] == "+":
# print(str(int(item[0])+int(item[2])))
# elif item[1] =="-":
# print(str(int(item[0])-int(item[2])))
# elif item[1] == "/":
# print(str(int(item[0])//int(item[2])))
# elif item[1] == "*":
# print(str(int(item[0])*int(item[2])))
#
# import sympy as sp
# input_list = []
# a,b,c = map(int, input().split())
# divisors = sp.divisors(c)
#
# count = 0
#
# for divisor in divisors:
# if a <= divisor and divisor <= b:
# count = count + 1
# print(count)
#
# while True:
# pair_str = input().split()
# pair_int = [int(s) for s in pair_str]
# if pair_int[0] == 0 and pair_int[1] == 0 :
# break
# else:
# input_list.append(pair_int)
#
# for pair_int in input_list:
# if pair_int[0] <= pair_int[1]:
# print("{} {}".format(pair_int[0], pair_int[1]))
# else:
# print("{} {}".format(pair_int[1], pair_int[0]))
#for i in range(10000):
# print("Hello World")
#a = input().split()
#a_int = [int(s) for s in a]
#a_sorted = sorted(a_int)
#print(' '.join(map(str, a_sorted)))
| p03371 |
A, B, C, X, Y = list(map(int, input().split()))
ans = 0
if A + B <= 2*C:
ans = A*X + B*Y
else:
ans += 2*C*min(X, Y)
if X >= Y:
ans += min(A, 2*C) * (X-Y)
else:
ans += min(B, 2*C) * (Y-X)
print (ans)
| A,B,C,x,y = list(map(int,input().split()))
ans = 0
if A+B > 2*C:
ans += min(x,y)*C*2
else:
ans += x*A + y*B
print(ans)
exit()
if x >= y:
x -= y
y = 0
if A <2*C:
ans += x*A
else:
ans += x*2*C
else:
y -= x
x = 0
if B < 2*C:
ans += y*B
else:
ans += y*2*C
print(ans) | p03371 |
A, B, C, X, Y = list(map(int, input().split()))
ans = float('inf')
for k in range(0, 2 * max(X, Y) + 1, 2):
i = max(X - k // 2, 0)
j = max(Y - k // 2, 0)
ans = min(ans, A * i + B * j + C * k)
print(ans)
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
A, B, C, X, Y = list(map(int, readline().split()))
ans = INF
for k in range(0, 2 * max(X, Y) + 1, 2):
i = max(0, X - k // 2)
j = max(0, Y - k // 2)
if ans > A * i + B * j + C * k:
ans = A * i + B * j + C * k
print(ans)
return
if __name__ == '__main__':
main()
| p03371 |
a,b,c,x,y=list(map(int,input().split()))
ans=float("inf")
for i in range(2*(max(x,y)+1)):
p=i*c
p+=max(x-i//2,0)*a
p+=max(y-i//2,0)*b
ans=min(p,ans)
print(ans) | a,b,c,x,y=list(map(int,input().split()))
ans=a*x+b*y
n=max(x,y)
for i in range(1,n+1):
ans=min(ans,2*i*c+a*max(0,x-i)+b*max(0,y-i))
print(ans)
| p03371 |
a,b,c,x,y=list(map(int,input().split()))
ans=a*x+b*y
n=max(x,y)
for i in range(1,n+1):
ans=min(ans,2*i*c+a*max(0,x-i)+b*max(0,y-i))
print(ans)
| a,b,c,x,y=list(map(int,input().split()))
ans1=a*x+b*y
ans2=2*c*max(x,y)
ans3=2*c*min(x,y)+a*(x-min(x,y))+b*(y-min(x,y))
print((min(ans1,ans2,ans3))) | p03371 |
# ABC95 C -Half and Half
a,b,c,x,y = list(map(float,input().split()))
ans = 0
if a+b > 2*c:
while x != 0.0 and y != 0.0:
ans += 2*c
x -= 1.0
y -= 1.0
if y == 0.0:
while x != 0.0:
if a > 2*c:
ans += 2*c
x -= 1.0
else:
ans += a
x -= 1.0
if x == 0.0:
while y != 0.0:
if b > 2*c:
ans += 2*c
y -= 1.0
else:
ans += b
y -= 1.0
else:
ans += a*x + b*y
print((int(ans)))
| a,b,c,x,y=list(map(int,input().split()))
ans=0
ans1=0
e=max(x,y)
ans1=e*(2*c)
if 2*c<a+b:
d=min(x,y)
ans+=c*(2*d)
x-=d
y-=d
else:
ans=a*x+b*y
x-=x
y-=y
ans+=x*a
ans+=y*b
print((min(ans,ans1))) | p03371 |
a,b,c,x,y = list(map(int,input().split()))
ans = a*x + b*y
for i in range(max(x,y) + 1):
money = max(0,(x-i)*a) + max(0,(y-i)*b) + 2*i*c
if money <= ans:
ans = money
print(ans) | a,b,c,x,y = list(map(int,input().split()))
if a + b >= 2*c:
if x >= y:
ans = 2*y*c + (x-y)*min(a,2*c)
else:
ans = 2*x*c + (y-x)*min(b,2*c)
else:
ans = (x*a + y*b)
print(ans) | p03371 |
A, B, C, X, Y = list(map(int, input().split()))
ret = A * X + B * Y
x = 0
y = 0
c = 0
while (X + Y) * 2 > c :
c += 2
x += 1
y += 1
tmp = A * max(0, X - x) + B * max(0, Y - y) + c * C
ret = min(ret, tmp)
print(ret) | A, B, C, X, Y = list(map(int, input().split()))
ret = A * X + B * Y
x = 0
y = 0
c = 0
while (X + Y) * 2 > c :
c += 2
x += 1
y += 1
ret = min(ret, A * max(0, X - x) + B * max(0, Y - y) + c * C)
print(ret)
| p03371 |
def resolve():
A, B, C, X, Y = list(map(int, input().split()))
yen = 0
if A - C + B - C > 0:
yen += C * 2 * min(X, Y)
minans = 10 ** 30
rest = max(X, Y) - min(X, Y)
for i in range(rest + 1):
if X > Y:
minans = min((C*2 * i + (rest - i) * A), minans)
else:
minans = min((C*2 * i + (rest - i) * B), minans)
yen += minans
else:
yen = A * X + B * Y
print(yen)
resolve() | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
a, b, c, x, y = list(map(int, input().split()))
ans = 10 ** 10
yen = 0
if a + b > c * 2:
yen += (c * 2 * min(x, y))
x, y = x - min(x, y), y - min(x, y)
if x > 0:
yen += min(x * a, x * 2 * c)
else:
yen += min(y * b, y * 2 * c)
else:
yen += a * x + b * y
print(yen)
resolve() | p03371 |
from heapq import heappop as pop
from heapq import heappush as push
INF = 10 ** 18
class edge:
def __init__(self, to, cost):
self.to = to
self.cost = cost
#V, E, r = map(int,input().split())
N, M, K = list(map(int,input().split()))
G = [[] for i in range(N)]
#G[i]...頂点iからの辺list、(行き先、コスト)
d = [INF for i in range(N)]
#d[i]...スタートからみた頂点iまでの最短距離
def dijkstra(lst):
que = []
for s in lst:
d[s] = 0
push(que, (0,s))
while len(que):
p = pop(que)
v = p[1]
if (d[v] < p[0]):
continue
for i in range(len(G[v])):
e = G[v][i]
if d[e.to] > d[v] + e.cost:
d[e.to] = d[v] + e.cost
push(que, (d[e.to], e.to))
for i in range(M):
s, t, c = list(map(int,input().split()))
s -= 1
t -= 1
G[s].append(edge(t,c))
G[t].append(edge(s,c))
lst = [int(eval(input())) - 1 for i in range(K)]
dijkstra(lst)
anss = []
append = anss.append
for i in range(N):
for e in G[i]:
x = d[i] + d[e.to] + e.cost
if x % 2:
append(x // 2 + 1)
else:
append(x // 2)
print((max(anss)))
| from heapq import heappop as pop
from heapq import heappush as push
def solve():
INF = 10 ** 18
class edge:
def __init__(self, to, cost):
self.to = to
self.cost = cost
N, M, K = list(map(int,input().split()))
G = [[] for i in range(N)]
#G[i]...頂点iからの辺list、(行き先、コスト)
d = [INF for i in range(N)]
#d[i]...スタートからみた頂点iまでの最短距離
def dijkstra(lst):
que = []
for s in lst:
d[s] = 0
push(que, (0,s))
while len(que):
p = pop(que)
v = p[1]
if (d[v] < p[0]):
continue
for i in range(len(G[v])):
e = G[v][i]
if d[e.to] > d[v] + e.cost:
d[e.to] = d[v] + e.cost
push(que, (d[e.to], e.to))
for i in range(M):
s, t, c = list(map(int,input().split()))
s -= 1
t -= 1
G[s].append(edge(t,c))
G[t].append(edge(s,c))
lst = [int(eval(input())) - 1 for i in range(K)]
dijkstra(lst)
anss = []
append = anss.append
for i in range(N):
for e in G[i]:
x = d[i] + d[e.to] + e.cost
if x % 2:
append(x // 2 + 1)
else:
append(x // 2)
print((max(anss)))
solve()
| p00485 |
class Line:
def __init__(self,p1,p2):
if p1[1] < p2[1]:self.s=p2;self.e=p1
elif p1[1] > p2[1]:self.s=p1;self.e=p2
else:
if p1[0] < p2[0]:self.s=p1;self.e=p2
else:self.s=p2;self.e=p1
def dot(a,b):return a[0]*b[0] + a[1]*b[1]
def cross(a,b):return a[0]*b[1] - a[1]*b[0]
def dif(a,b):return [x-y for x,y in zip(a,b)]
def InterSection(l,m):
a = dif(l.e,l.s);b = dif(m.e,l.s);c = dif(m.s,l.s)
d = dif(m.e,m.s);e = dif(l.e,m.s);f = dif(l.s,m.s)
g = lambda a, b : cross(a,b)==0 and dot(a,b)>0 and dot(b,b)<dot(a,a)
if g(a,b) or g(a,c) or g(d,e) or g(d,f):return True
elif l.s == m.e or l.s == m.s or l.e == m.e or l.e == m.s:return True
elif cross(a,b) * cross(a,c) >= 0 or cross(d,e) * cross(d,f) >= 0:return False
else:return True
q = int(eval(input()))
for i in range(q):
x0,y0,x1,y1,x2,y2,x3,y3 = [int(i) for i in input().split()]
a = [x0,y0] ; b = [x1,y1] ; c = [x2,y2] ; d = [x3,y3]
l1 = Line(a,b) ; l2 = Line(c,d)
if InterSection(l1,l2):print((1))
else:print((0)) | class Line:
def __init__(self,p1,p2):
if p1[1] < p2[1]:self.s=p2;self.e=p1
elif p1[1] > p2[1]:self.s=p1;self.e=p2
else:
if p1[0] < p2[0]:self.s=p1;self.e=p2
else:self.s=p2;self.e=p1
def dot(a,b):return a[0]*b[0] + a[1]*b[1]
def cross(a,b):return a[0]*b[1] - a[1]*b[0]
def dif(a,b):return [x-y for x,y in zip(a,b)]
def InterSection(l,m):
a = dif(l.e,l.s);b = dif(m.e,l.s);c = dif(m.s,l.s)
d = dif(m.e,m.s);e = dif(l.e,m.s);f = dif(l.s,m.s)
g = lambda a, b : cross(a,b)==0 and dot(a,b)>0 and dot(b,b)<dot(a,a)
if g(a,b) or g(a,c) or g(d,e) or g(d,f):return True
elif l.s == m.e or l.s == m.s or l.e == m.e or l.e == m.s:return True
elif cross(a,b) * cross(a,c) >= 0 or cross(d,e) * cross(d,f) >= 0:return False
else:return True
q = int(eval(input()))
for i in range(q):
x0,y0,x1,y1,x2,y2,x3,y3 = [int(i) for i in input().split()]
a = [x0,y0] ; b = [x1,y1] ; c = [x2,y2] ; d = [x3,y3]
l1 = Line(b,a) ; l2 = Line(d,c)
if InterSection(l1,l2):print((1))
else:print((0)) | p02294 |
class Line:
def __init__(self,p1,p2):
if p1[1] < p2[1]:self.s=p2;self.e=p1
elif p1[1] > p2[1]:self.s=p1;self.e=p2
else:
if p1[0] < p2[0]:self.s=p1;self.e=p2
else:self.s=p2;self.e=p1
def dot(a,b):return a[0]*b[0] + a[1]*b[1]
def cross(a,b):return a[0]*b[1] - a[1]*b[0]
def dif(a,b):return [x-y for x,y in zip(a,b)]
def InterSection(l,m):
a = dif(l.e,l.s);b = dif(m.e,l.s);c = dif(m.s,l.s)
d = dif(m.e,m.s);e = dif(l.e,m.s);f = dif(l.s,m.s)
g = lambda a, b : cross(a,b)==0 and dot(a,b)>0 and dot(b,b)<dot(a,a)
if g(a,b) or g(a,c) or g(d,e) or g(d,f):return True
elif l.s == m.e or l.s == m.s or l.e == m.e or l.e == m.s:return True
elif cross(a,b) * cross(a,c) >= 0 or cross(d,e) * cross(d,f) >= 0:return False
else:return True
q = int(eval(input()))
for i in range(q):
x0,y0,x1,y1,x2,y2,x3,y3 = [int(i) for i in input().split()]
a = [x0,y0] ; b = [x1,y1] ; c = [x2,y2] ; d = [x3,y3]
l1 = Line(b,a) ; l2 = Line(d,c)
if InterSection(l1,l2):print((1))
else:print((0)) | def cross(a,b):return a[0]*b[1] - a[1]*b[0]
q = list(range(int(eval(input()))))
for i in q:
a,b,c,d,e,f,g,h = [int(x) for x in input().split()]
A = [c-a,d-b]; B = [e-a,f-b]; C = [g-a,h-b];
D = [g-e,h-f]; E = [a-e,b-f]; F = [c-e,d-f];
if max(a,c) < min(e,g) or max(e,g) < min(a,c) or max(b,d) < min(f,h) or max(f,h) < min(b,d):
print("0")
elif cross(A,B) * cross(A,C) <= 0 and cross(D,E) * cross(D,F) <= 0:
print("1")
else:
print("0") | p02294 |
n = int(eval(input()))
a = [list(map(int,input().split())),list(map(int,input().split()))]
ame = 0
ame_l = []
for i in range(n): #重複する列の選択
for j in range(n): #各列足してく
if i > j:
ame += a[0][j]
elif i == j:
ame += a[0][j]+a[1][j]
else:
ame += a[1][j]
if j == n-1:
ame_l.append(ame)
ame = 0
print((max(ame_l))) | n = int(eval(input()))
a = [list(map(int,input().split())) for _ in range(2)]
ame = []
for i in range(n):
ame.append(sum(a[0][:i+1])+sum(a[1][i:]))
print((max(ame))) | p03449 |
nums = int(eval(input()))
ary = [0,0]
for i in range(2):
ary[i] = list(map(int,input().split()))
max = 0
for i in range(nums):
h = 0
w = 0
count = ary[h][w]
for x in range(nums):
if i == x :
h = 1
count += ary[h][w]
continue
w += 1
count += ary[h][w]
if count > max :
max = count
print(max) | n = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))[::-1]
dp = [b[0] for _ in range(n)]
for i in range(1,n):
dp[i] = dp[i-1]+b[i]
dp = dp[::-1]
c = 0
dp2 = [0 for _ in range(n)]
for i in range(n):
c += a[i]
dp2[i] = c +dp[i]
print((max(dp2))) | p03449 |
# coding: utf-8
# hello worldと表示する
# coding: utf-8
# hello worldと表示する
retu = int(eval(input()))
gyo1 = list(map(int,input().split()))
gyo2 = list(map(int,input().split()))
num = 0
kai=0
boss=[]
for i in range(retu):
for ii in range(i + 1):
num += gyo1[ii]
for iii in range(retu-i):
num += gyo2[iii+i]
boss.append(num)
num=0
#print(boss)
oss = sorted(boss)
print((oss[retu-1])) | retu = int(eval(input()))
gyo1 = list(map(int,input().split()))
gyo2 = list(map(int,input().split()))
goal=[]
for i in range(retu):
kai = sum(gyo1[0:i+1]) + sum(gyo2[i:])
goal.append(kai)
print((max(goal))) | p03449 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ans=0
for i in range(n):
ans=max(ans,sum(l1[:i+1]+l2[i:]))
print(ans)
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ans=0
for i in range(n):
cnt=sum(l1[:i+1])+sum(l2[i:])
ans=max(ans,cnt)
print(ans)
resolve() | p03449 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
N = int(eval(input()))
array_1 = list(map(int, input().split()))
array_2 = list(map(int, input().split()))
# 全探索する
# N回移動できる
# どのタイミングで下に移動するかがキーポイント
# 下に移動するタイミングはN通りある
max_candy = 0
for n in range(N):
# n列目で下に移動したときのキャンディの個数をチェック
total = sum(array_1[: n + 1] + array_2[n:])
# 記録更新なら上書き
if max_candy < total:
max_candy = total
print(max_candy)
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
N = int(eval(input()))
array_1 = list(map(int, input().split()))
array_2 = list(map(int, input().split()))
# 全探索する
# N回移動できる
# どのタイミングで下に移動するかがキーポイント
# 下に移動するタイミングはN通りある
max_candy = 0
for n in range(N):
# n列目で下に移動したときのキャンディの個数をチェック
total = sum(array_1[: n + 1]) + sum(array_2[n:])
# 記録更新なら上書き
if max_candy < total:
max_candy = total
print(max_candy)
| p03449 |
## coding: UTF-8
N = int(eval(input()))
s = input().split()
l1 = [int(p) for p in s]
s2 = input().split()
l2 = [int(p) for p in s2]
#print(N)
#print(l1)
#print(l2)
#print(sum(l1[2:]))
def Cumulative_sum(l):
output_list = []
for i in range(len(l)):
output_list.append(sum(l[:i+1]))
return output_list
#print(Cumulative_sum(l1))
#print(Cumulative_sum(l2))
#print(Cumulative_sum(l2)[len(l2)-1])
def calc_sum(cut_off):
if(cut_off != 0):
add = Cumulative_sum(l1)[cut_off] + Cumulative_sum(l2)[len(l2)-1] - Cumulative_sum(l2)[cut_off - 1]
else:
add = Cumulative_sum(l1)[cut_off] + Cumulative_sum(l2)[len(l2)-1]
return add
#print(calc_sum(0))
#print(calc_sum(1))
#print(calc_sum(2))
answer = 0
for i in range(N):
if(answer <= calc_sum(i)):
answer = calc_sum(i)
#print(answer)
print(answer)
'''
answer = 0
mode = 1 #上の段
def countup(mode, index):
if(mode == 1):
add = l1[index]
if(mode == 2):
add = l2[index]
return add
answer += countup(mode, 0)
for i in range(1,N):
#print(sum(l1[i:]))
#print(sum(l2[i-1:]))
if( mode == 1 and sum(l1[i:]) < sum(l2[i-1:]) ):
mode = 2 #下の段に移動
answer += countup(mode, i-1)
#print('mode:{}, index:{}'.format(mode, i))
answer += countup(mode, i)
if(N == 1):
answer += l2[0]
print(answer)
'''
| ## coding: UTF-8
#累積和
N = int(eval(input()))
U = list(map(int,input().split()))
D = list(map(int,input().split()))
U = U[::-1]
D = D[::-1]
up = 0
down = 0
upper = [0]
downer = []
for i in range(N):
up += U[i]
down += D[i]
upper.append(up)
downer.append(down)
upper = upper[::-1]
downer = downer[::-1]
#print(upper)
#print(downer)
ans = 0
for i in range(N):
ret = upper[0] - upper[i+1] + downer[i]
ans = max(ans, ret)
print(ans) | p03449 |
## coding: UTF-8
#累積和
N = int(eval(input()))
U = list(map(int,input().split()))
D = list(map(int,input().split()))
U = U[::-1]
D = D[::-1]
up = 0
down = 0
upper = [0]
downer = []
for i in range(N):
up += U[i]
down += D[i]
upper.append(up)
downer.append(down)
upper = upper[::-1]
downer = downer[::-1]
#print(upper)
#print(downer)
ans = 0
for i in range(N):
ret = upper[0] - upper[i+1] + downer[i]
ans = max(ans, ret)
print(ans) | ## coding: UTF-8
#DP
N = int(eval(input()))
U = list(map(int,input().split()))
D = list(map(int,input().split()))
#dp = [[0] * 2] * N #これだとアドレスごとコピーされている
dp = []
for i in range(N):
dp.append([0] * 2)
dp[0][0] = U[0]
dp[0][1] = U[0] + D[0]
for i in range(1, N):
dp[i][0] = dp[i-1][0] + U[i]
dp[i][1] = max(dp[i-1][1], dp[i][0]) + D[i]
#print(dp)
print((dp[N-1][1])) | p03449 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
ans=0
for i in range(N):
sumn=sum(A[:i+1])+sum(B[i:])
ans=max(sumn,ans)
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
maxn=0
for i in range(n):
maxn=max(maxn,sum(a[:i+1])+sum(b[i:]))
print(maxn) | p03449 |
n = int(eval(input()))
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
a1.reverse()
a2.reverse()
ans = 0
for i in range(n):
c = sum(a1[i:])+sum(a2[:i+1])
ans = max(ans,c)
print(ans) | n = int(eval(input()))
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
ans = 0
for i in range(n):
ans = max(ans,sum(a1[:i+1])+sum(a2[i:]))
print(ans) | p03449 |
import itertools
N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(2)]
L = [0 for _ in range(1,N)] + [1]
PL = list(itertools.permutations(L,N))
MAX = 0
for P in PL:
now = (0,0)
total = A[0][0]
for p in P:
if p == 0:
now = (now[0],now[1]+1)
else:
now = (now[0]+1,now[1])
total += A[now[0]][now[1]]
MAX = max(MAX,total)
print(MAX) | N = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(2)]
MAX = 0
for i in range(N):
MAX = max(MAX,sum(A[0][:i+1])+sum(A[1][i:]))
print(MAX) | p03449 |
import sys
from collections import deque
input=sys.stdin.readline
sys.setrecursionlimit(10**6)
n=int(input().rstrip())
a=[list(map(int,input().split())) for _ in range(2)]
ans=0
print((max([sum(a[0][:i+1])+sum(a[1][i:]) for i in range(n)]))) | import sys
input=sys.stdin.readline
n=int(input().rstrip())
a=[list(map(int,input().split())) for _ in range(2)]
ans=0
for i in range(n):
now=sum(a[0][:i+1])+sum(a[1][i:])
ans=max(ans,now)
print(ans) | p03449 |
n = int(eval(input()))
l = list(map(int, input().split()))
m = list(map(int, input().split()))
m.reverse()
ls = [0]*(n+1)
ms = [0]*(n+1)
for i in range(n):
ls[i+1] = ls[i] + l[i]
ms[i+1] = ms[i] + m[i]
max_a = 0
for j in range(n):
max_a = max(max_a, ls[j+1]+ms[n-j])
print(max_a)
| n = int(eval(input()))
L1 = list(map(int, input().split()))
L2 = list(map(int, input().split()))
ans = 0
for i in range(n):
L1_ = L1[0:i+1]
L2_ = L2[i:]
#print(L1_, L2_)
temp = sum(L1_) + sum(L2_)
ans = max(ans, temp)
print(ans)
| p03449 |
n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
ans = 0
for i in range(n):
ans = max(ans, sum(a1[:i+1])+sum(a2[i:]))
print(ans) | n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(2)]
ans = 0
for i in range(n):
t = sum(a[0][:i+1]) + sum(a[1][i:])
if ans < t: ans = t
print(ans) | p03449 |
n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
count = 0
max1 = 0
for i in range(n):
for j in range(n):
if j < i:
count += a1[j]
elif j==i:
count += (a1[j] + a2[j])
else:
count += a2[j]
if max1 < count:
max1 = count
count = 0
print (max1) | n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
m = 0
for i in range(n):
m = max(m, sum(a1[:i+1])+sum(a2[i:]))
print (m) | p03449 |
n=int(eval(input()))
a1=list(map(int,input().split()))
a2=list(map(int,input().split()))
ans=0
for i in range(n):
tmp=0
tmp+=sum(a1[:i+1])
tmp+=sum(a2[i:])
ans=max(tmp,ans)
print(ans) | n=int(eval(input()))
a1=list(map(int,input().split()))
a2=list(map(int,input().split()))
ans=0
for i in range(n):
top=sum(a1[:i+1])
bottom=sum(a2[i:])
tmp=top+bottom
ans=max(tmp,ans)
print(ans) | p03449 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Ans = 0
for i in range(N):
ans = 0
for j in range(i+1):
ans += A[j]
for j in range(i,N):
ans += B[j]
Ans = max(Ans,ans)
print(Ans) | N = int(eval(input()))
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
Ans = 0
for x in range(N):
ans = 0
for i in range(N):
if i <= x:
ans += A1[i]
if i >= x:
ans += A2[i]
Ans = max(Ans,ans)
print(Ans) | p03449 |
N = int(eval(input()))
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
Ans = 0
for x in range(N):
ans = 0
for i in range(N):
if i <= x:
ans += A1[i]
if i >= x:
ans += A2[i]
Ans = max(Ans,ans)
print(Ans) | # atcoder : python3 (3.4.3)
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
mod = 10**9+7
# main
N = int(eval(input()))
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
ans = 0
for i in range(N):
ans = max(ans, sum(A1[0:i+1])+sum(A2[i:]))
print(ans) | p03449 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
B=B[::-1]
AA=[A[0]]
BB=[B[0]]
for i in range(1,N):
AA.append(AA[i-1]+A[i])
BB.append(BB[i-1]+B[i])
BB=BB[::-1]
CC=[]
for i in range(N):
CC.append(AA[i]+BB[i])
print((max(CC))) | import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(2)]
left = [A[0][0]]
for i in range(1, N):
left.append(left[-1] + A[0][i])
A[1] = A[1][::-1]
right = [A[1][0]]
for i in range(1, N):
right.append(right[-1] + A[1][i])
right = right[::-1]
answer = 0
for i in range(N):
answer = max(answer, left[i] + right[i])
print(answer) | p03449 |
def main():
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
ans = 0
for i in range(N):
cur = 0
for j in range(i, N):
cur = sum(A[0][:i+1]) + sum(A[1][i:])
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
ans = 0
for i in range(N):
cur = sum(A[0][:i+1]) + sum(A[1][i:])
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| p03449 |
def main():
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
ans = 0
for i in range(N):
cur = sum(A[0][:i+1]) + sum(A[1][i:])
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| def main():
from itertools import accumulate
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
accA = list(accumulate(A))
accB = list(accumulate([0] + B))
ans = 0
for i in range(N):
cur = accA[i] + (accB[N] - accB[i])
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| p03449 |
def genSumList(l):
n = len(l)
ret = []
for i in range(1,n+1):
tmp = 0
for j in range(i):
tmp += l[j]
ret.append(tmp)
return ret
n = int(eval(input()))
a = []
ans = []
for i in range(2):
a.append(list(map(int, input().split())))
sum1 = genSumList(a[0])
sum2 = genSumList(a[1][::-1])
for i in range(n):
ans.append(sum1[i] + sum2[(i+1)*(-1)])
print((max(ans))) | n = int(eval(input()))
a = []
for i in range(2):
a.append(list(map(int, input().split())))
l = []
for i in range(1,n):
l.append(sum(a[0][:i]) + sum(a[1][i-1:]))
if len(l) == 0:
print((a[0][0] + a[1][0]))
exit()
print((max(l))) | p03449 |
length = int(eval(input()))
first = input().split(" ")
second = input().split(" ")
i = 0
sweet = 0
sugars = 0
while i < length:
j = i
k = 0
while k<=i:
sweet = sweet + int(first[k])
k = k + 1
while j < length:
sweet = sweet + int(second[j])
j = j + 1
if sweet > sugars:
sugars = sweet
sweet = 0
i = i + 1
print(sugars) | n = int(input())
t = [int(i) for i in input().split(" ")]
b = [int(i) for i in input().split(" ")]
mina = None
tot = sum(t) + sum(b)
tn = sum(t) - t[0]
bn = 0
for s in range(n):
if mina == None or mina > tn + bn:
mina = tn + bn
if s == n-1:
break
tn -= t[s+1]
bn += b[s]
print(tot - mina) | p03449 |
#!/usr/bin/env python3
import sys
def dfs(x:int, y:int):
if(y == 1 and x == (N-1)):
return A[y][x]
elif(y > 1 or x > N-1):
return 0
else:
return max(dfs(x+1, y), dfs(x, y+1)) + A[y][x]
def solve(N: int, A: "List[List[int]]"):
print((dfs(0,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 iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
global N, A
N = int(next(tokens)) # type: int
A = [[int(next(tokens)) for _ in range(N)] for _ in range(2)] # type: "List[List[int]]"
solve(N, A)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, A: "List[List[int]]"):
ans = 0
for i in range(0,N):
ans = max(sum(A[0][:i+1])+sum(A[1][i:]), ans)
print(ans)
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 iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [[int(next(tokens)) for _ in range(N)] for _ in range(2)] # type: "List[List[int]]"
solve(N, A)
if __name__ == '__main__':
main()
| p03449 |
def main():
n = int(eval(input()))
matrix = []
matrix.append([int(num) for num in input().split()])
matrix.append([int(num) for num in input().split()])
# RE: matrix = [int(num) for num in (input().split() for i in range(2))]
candies = [sum(matrix[0][:d+1]) + sum(matrix[1][d:]) for d in range(n)]
print((max(candies)))
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
matrix = [[int(num) for num in input().split()] for _ in range(2)]
candies = [sum(matrix[0][:d+1]) + sum(matrix[1][d:]) for d in range(n)]
print((max(candies)))
if __name__ == '__main__':
main()
| p03449 |
N = int(eval(input()))
A = [[int(i) for i in input().split()] for _ in range(2)]
# dpj[i]: (i,j)でアメの最大値
dp1 = [0] * N
dp2 = [0] * N
# 初期条件
dp1[0] = A[0][0]
dp2[0] = A[0][0] + A[1][0]
# 貰うdp
for i in range(1,N):
dp1[i] = dp1[i-1] + A[0][i]
for i in range(1,N):
dp2[i] = max(dp1[i], dp2[i-1]) + A[1][i]
print((dp2[-1])) | N = int(eval(input()))
A = [[0] + [int(i) for i in input().split()] for _ in range(2)]
for i in range(N):
A[0][i+1] += A[0][i]
A[1][i+1] += A[1][i]
ans = 0
for i in range(1,N+1):
ans = max(ans, A[0][i] + (A[1][-1] -A[1][i-1]))
print(ans) | p03449 |
n = int(eval(input()))
a = list(list(map(int, input().split())) for _ in range(2))
ans = 0
for x in range(n):
buf = 0
for i in range(x + 1):
buf += a[0][i]
for j in range(x, n):
buf += a[1][j]
ans = max(ans, buf)
print(ans) | def main():
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(2)]
dp = [[0] * N for _ in range(2)]
dp[0][0] = A[0][0]
for r in range(2):
for c in range(N):
if r != 0:
dp[r][c] = max(dp[r - 1][c] + A[r][c], dp[r][c])
if c != 0:
dp[r][c] = max(dp[r][c - 1] + A[r][c], dp[r][c])
print((dp[1][N - 1]))
if __name__ == '__main__':
main()
| p03449 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
maxi=0
for i in range(n):
total=0
x=sum(a[:i+1])
y=sum(b[i:])
total=x+y
maxi=max(total,maxi)
print(maxi) | n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
import itertools as it
ac_a=list(it.accumulate(a))
ac_b=list(it.accumulate(b))
sum_b=sum(b)
ans=0
for i in range(n):
if i>0:
tmp=ac_a[i]+sum_b-ac_b[i-1]
elif i==0:
tmp=a[0]+sum_b
ans=max(tmp,ans)
print(ans) | p03449 |
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(2)]
ans = 0
for i in range(n):
s = sum(a[0][0:i+1]) + sum(a[1][i:])
ans = max(ans, s)
print(ans) | n=int(eval(input()))
a=[list(map(int,input().split())) for i in range(2)]
ans=0
if n==1:
print((sum(a[0])+sum(a[1])))
exit()
for i in range(n):
ans=max(ans,sum(a[0][0:i])+sum(a[1][i-1:n]))
print(ans) | p03449 |
import sys
from collections import deque
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(2)]
move = ((1, 0), (0, 1))
maxN = [[0 for _ in range(N)] for i in range(2)]
q = deque()
q.append((0, 0, A[0][0]))
while q:
nx, ny, np = q.popleft()
maxN[nx][ny] = max(maxN[nx][ny], np)
for dx, dy in move:
if 0 <= nx + dx < 2 and 0 <= ny + dy < N:
q.append((nx + dx, ny + dy, maxN[nx][ny] + A[nx + dx][ny + dy]))
print((maxN[1][N - 1]))
return 0
if __name__ == "__main__":
solve() | import sys
from collections import deque
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(2)]
M = ((1, 0), (0, 1))
q = deque()
q.append((0, 0, 0))
C = [[0] * N for _ in range(2)]
while q:
i, j, n = q.popleft()
if n + A[i][j] > C[i][j]:
C[i][j] = n + A[i][j]
for di, dj in M:
if 0 <= i + di < 2 and 0 <= j + dj < N:
q.append((i + di, j + dj, C[i][j]))
print((C[1][N-1]))
return 0
if __name__ == "__main__":
solve() | p03449 |
import sys
from collections import deque
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(2)]
M = ((1, 0), (0, 1))
q = deque()
q.append((0, 0, 0))
C = [[0] * N for _ in range(2)]
while q:
i, j, n = q.popleft()
if n + A[i][j] > C[i][j]:
C[i][j] = n + A[i][j]
for di, dj in M:
if 0 <= i + di < 2 and 0 <= j + dj < N:
q.append((i + di, j + dj, C[i][j]))
print((C[1][N-1]))
return 0
if __name__ == "__main__":
solve() | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(a) for a in input().split()] for _ in range(2)]
first = [0] * N
second = [0] * N
first[0] = A[0][0]
second[N-1] = A[1][N-1]
for i in range(1, N):
first[i] = first[i-1] + A[0][i]
second[N - 1- i] = second[N - i] + A[1][N - 1- i]
maxPoint = 0
for i in range(N):
maxPoint = max(maxPoint, first[i] + second[i])
print(maxPoint)
return 0
if __name__ == "__main__":
solve() | p03449 |
N = int(eval(input()))
A = [list(map(int, input().split())) for k in range(2)]
ans = 0
for k in range(N):
ans = max(ans,sum(A[0][0:k+1])+sum(A[1][k:]))
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
for k in range(N):
ans = max(ans,sum(A[:k+1])+sum(B[k:]))
print(ans)
| p03449 |
n = int(eval(input()))
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
ans = [0]*n
for i in range(n):
ans[i] = a1[0:i+1] + a2[i::]
ans[i] = sum(ans[i])
print((max(ans))) | n = int(eval(input()))
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
ans = [0]*n
for i in range(n):
ans[i] = sum(a1[0:i+1]) + sum(a2[i::])
print((max(ans))) | p03449 |
n = int(eval(input()))
field = [list(map(int, input().split())) for i in range(2)]
for i in range(n - 1):
field[0][i + 1] += field[0][i]
field[1][0] += field[0][0]
for i in range(n - 1):
field[1][i + 1] += max(field[0][i + 1], field[1][i])
print((field[1][n - 1])) | n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
maxv = 0
for i in range(n):
maxv = max(maxv, (sum(A[:i+1]) + sum(B[i:])))
print(maxv) | p03449 |
n = int(eval(input()))
input_data = {}
for r in range(2):
line_data = [int(x) for x in input().split(" ")]
for c, value in enumerate(line_data):
input_data[(r, c)] = value
from collections import defaultdict
answer = defaultdict(int)
#for c, value in enumerate(range(n)):
# answer[(0,c)] = input_data[(0, c)] + answer[(0,c - 1)]
for r in range(2):
for c, value in enumerate(range(n)):
answer[(r,c)] = input_data[(r, c)] + max(answer[(r,c - 1)], answer[(r - 1, c)] )
print((answer[(1,n-1)]))
| #■標準入力ショートカット
def get_next_int():
return int(float(eval(input())))
def get_next_str():
return eval(input())
def get_next_ints(delim=" "):
return tuple([int(float(x)) for x in input().split(delim)])
def get_next_strs(delim=" "):
return tuple(input().split(delim))
def get_next_by_types(*value_types,delim=" "):
return tuple([t(x) for t, x in zip(value_types,input().split(delim))])
def main():
n = get_next_int()
from collections import defaultdict
data = defaultdict(int)
for i in range(2):
for j, value in enumerate(get_next_ints()):
data[(i,j)] = value
max_get = defaultdict(int)
for i in range(2):
for j in range(n):
max_get[(i,j)] = data[(i,j)] + max(max_get[(i-1,j)],max_get[(i,j-1)])
return max_get[(1,n-1)]
if __name__ == '__main__':
print((main()))
| p03449 |
n,*l=list(map(int,open(0).read().split()))
a=l[:n];b=l[n:]
r=t=a[0]+sum(b)
for i,j in zip(a[1:],b):
t+=i-j
r=max(r,t)
print(r) | n,*l=list(map(int,open(0).read().split()));print((max(sum(l[:i+1]+l[n+i:])for i in range(n)))) | p03449 |
n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
ans = [0] * n
for i in range(n):
ans[i] = sum(a1[:i+1]) + sum(a2[i:])
print((max(ans))) | n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
ans = 0
for i in range(n):
ans = max(ans, sum(a1[:i+1]) + sum(a2[i:]))
print(ans) | p03449 |
n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
for i in range(1, n):
a1[i] += a1[i - 1]
for i in range(n - 2, -1, -1):
a2[i] += a2[i + 1]
res = 0
for i in range(n):
tmp = a1[i] + a2[i]
res = max(tmp, res)
print(res)
| n = int(eval(input()))
dp = [[0 for i in range(n)] for i in range(2)]
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
dp[0][0] = a1[0]
for i in range(1, n):
dp[0][i] = dp[0][i - 1] + a1[i]
dp[1][0] = dp[0][0] + a2[0]
for i in range(1, n):
dp[1][i] = max(dp[0][i] + a2[i], dp[1][i - 1] + a2[i])
print((dp[1][-1]))
| p03449 |
n=int(eval(input()))
a=[list(map(int, input().split())) for _ in range(2)]
result=[]
for i in range(n):
total = 0
for j in range(i+1):
total = total + a[0][j]
for m in range(i, n):
total = total + a[1][m]
result.append(total)
print((max(result))) | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(2)]
maximum = 0
for i in range(N):
result = 0
result += sum(A[0][0:i+1])
result += sum(A[1][i:N])
maximum = result if maximum < result else maximum
print(maximum) | p03449 |
n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
l = []
cnt = 0
for i in range(1,n+1):
cnt = sum(a1[:i])+sum(a2[i-1:])
l.append(cnt)
cnt = 0
print((max(l)))
| n = int(eval(input()))
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
total = sum(a2)+a1[0]
ans = total
for i in range(1, n):
total = total + a1[i] - a2[i-1]
ans = max(ans, total)
print(ans)
| p03449 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = []
for n in range(N):
ans+=[sum(A[:n+1])+sum(B[n:])]
print((max(ans))) | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
print((max(sum(A[:n+1]+B[n:]) for n in range(N)))) | p03449 |
N = int(eval(input()))
s1 = list(map(int,input().split()))
s2 = list(map(int,input().split()))
ans = 0
for i in range(N):
tmp = sum(s1[:i+1]) + sum(s2[i:])
ans = max(ans, tmp)
print(ans) | N = int(eval(input()))
S0 = list(map(int,input().split()))
S1 = list(map(int,input().split()))
ans = 0
for i in range(N):
tmp = sum(S0[:i+1]) + sum(S1[i:])
ans = max(tmp,ans)
print(ans) | p03449 |
n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(n):
cnt = sum(A[:i+1]) + sum(B[i:])
ans = max(ans, cnt)
print(ans) | n = int(eval(input()))
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans = 0
for i in range(n):
ans = max(ans, sum(A1[:i+1]) + sum(A2[i:]))
print(ans) | p03449 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
dp=[[0 for i in range(n)] for j in range(2)]
dp[0][0]=a[0]
for i in range(1,n):
dp[0][i]=a[i]+dp[0][i-1]
dp[1][0]=dp[0][0]+b[0]
for i in range(1,n):
dp[1][i]=max(dp[0][i],dp[1][i-1])+b[i]
print((dp[1][n-1]))
| n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
for i in range(n):
z=0
for j in range(i+1):
z+=a[j]
for j in range(i,n):
z+=b[j]
ans=max(ans,z)
print(ans)
| p03449 |
res = 0
n = int(eval(input()))
a = [list(map(int,input().split())) for _ in range(2)]
# したにいくます
for i in range(n):
t = 0
tmp = 0
for j in range(n):
tmp += a[t][j]
if i==j:
t += 1
tmp += a[t][j]
res = max(res,tmp)
print(res)
| n = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
res = 0
for i in range(n):
tmp = 0
for j in range(i + 1):
tmp += a[j]
for j in range(i, n):
tmp += b[j]
res = max(res, tmp)
print(res)
| p03449 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 0
for i in range(n):
ans = max(ans,sum(a[:i+1])+sum(b[i:]))
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 0
for i in range(n):
ans = max(ans,sum(a[:n-i])+sum(b[n-1-i:]))
print(ans) | p03449 |
N = int(eval(input()))
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
ans = 0
for i in range(N):
tmp = sum(A1[0:i+1])
tmp = tmp + sum(A2[i:N])
ans = max(ans,tmp)
print((str(ans))) | N = int(eval(input()))
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
ans = 0
for i in range(N):
ans = max(sum(A1[0:i+1]) + sum(A2[i:N]) , ans)
print((str(ans))) | p03449 |
n,mat = input(),[ list(map(int,input().split())) for i in range(2)]
def f(mat,i,j):
if i<0 or j <0:
return -float('inf')
if i == 0 and j == 0:
return mat[i][j]
return mat[i][j] + max(f(mat,i-1,j),f(mat,i,j-1))
print(f(mat,1,len(mat[0])-1)) | n,mat = input(),[ list(map(int,input().split())) for i in range(2)]
mem = {}
def f(mat,i,j):
if i<0 or j <0: return -float('inf')
if i == 0 and j == 0: return mat[i][j]
if (i,j) not in mem:
mem[(i,j)] = mat[i][j] + max(f(mat,i-1,j),f(mat,i,j-1))
return mem[(i,j)]
print(f(mat,1,len(mat[0])-1)) | p03449 |
N = int(eval(input()))
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
sum = 0
for i in range(len(A1)-1):
temp = 0
for j, (k, l) in enumerate(zip(A1[1:], A2[:-1])):
if j >= i:
temp += l
else:
temp += k
sum = max(sum, temp)
print((sum + A1[0] + A2[-1])) | N = int(eval(input()))
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans = 0
for i in range(N):
ans = max(ans, sum(A1[0:i+1] + A2[i:]))
print(ans) | p03449 |
n = int(eval(input()))
c1 = list(map(int, input().split()))
c2 = list(map(int, input().split()))
ans = 0
for i in range(n):
total = 0
num = i
while num >= 0:
total += c1[num]
num -= 1
for j in range(i,n):
total += c2[j]
ans = max(ans, total)
print(ans)
| n = int(eval(input()))
c1 = list(map(int, input().split()))
c2 = list(map(int, input().split()))
ans = 0
for i in range(n):
ans = max(ans, sum(c1[:i+1] + c2[i:]))
print(ans)
| p03449 |
N = int(eval(input()))
As = []
As.append(list(map(int,input().split())))
As.append(list(map(int,input().split())))
sums = [[-1 for _ in range(N)],[-1 for _ in range(N)]]
sums[0][0] = As[0][0]
for r in range(2):
for c in range(N):
if r < 2-1 and sums[r+1][c] < As[r+1][c] + sums[r][c]:
sums[r+1][c] = As[r+1][c] + sums[r][c]
if c < N-1 and sums[r][c+1] < As[r][c+1] + sums[r][c]:
sums[r][c+1] = As[r][c+1] + sums[r][c]
print((sums[1][N-1])) | N = int(eval(input()))
tmps = []
tmps.append(list(map(int,input().split())))
tmps.append(list(map(int,input().split())))
As = [[0 for _ in range(N+1)] for _ in range(3)]
for r in range(2):
for c in range(N):
As[r][c] = tmps[r][c]
#print(As)
sums = [[-1 for _ in range(N+1)] for _ in range(3)]
sums[0][0] = As[0][0]
for r in range(2):
for c in range(N):
if sums[r+1][c] < As[r+1][c] + sums[r][c]:
sums[r+1][c] = As[r+1][c] + sums[r][c]
if sums[r][c+1] < As[r][c+1] + sums[r][c]:
sums[r][c+1] = As[r][c+1] + sums[r][c]
#print(sums)
print((sums[1][N-1])) | p03449 |
N = int(eval(input()))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
count = x[0]
for i in range(N):
count += y[i]
sums = count
for i in range(N - 1):
count = count + x[i + 1] - y[i]
if count > sums:
sums = count
print(sums) | N = int(eval(input()))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
def down_count():
count = x[0]
for i in range(N):
count += y[i]
return count
x_list = []
def switch_count():
for i in range(N - 1):
sums = x_list[i] + x[i + 1] - y[i]
x_list.append(sums)
down_sum = down_count()
x_list.append(down_sum)
switch_count()
x_list.sort(reverse=True)
print((x_list[0])) | p03449 |
def c_Candies(N, A):
dp = [[0] * N for _ in range(2)]
dp[0][:] = A[0][:]
dp[1][0] = A[0][0] + A[1][0]
for i in range(2):
for j in range(1, N):
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + A[i][j]
return dp[1][-1]
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
print((c_Candies(N, A))) | def c_Candies(N, A):
# dp[i][j]は最もアメが取れるようにi行j列まで進んだときのアメの獲得数
dp = [[0] * N for _ in range(2)]
# 1行目の値と、2行1列の値は先に計算できる
dp[0][0] = A[0][0]
dp[1][0] = dp[0][0] + A[1][0]
for j in range(1, N):
dp[0][j] = dp[0][j - 1] + A[0][j]
for j in range(1, N):
# 2行j+1列の値は、その左か上のうち小さくない値にそのマスのアメの個数を足す
dp[1][j] = max(dp[0][j], dp[1][j - 1]) + A[1][j]
return dp[1][-1]
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
print((c_Candies(N, A))) | p03449 |
from itertools import accumulate
n = int(eval(input()))
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
a1 = list(accumulate(A1))
ans = 0
for i in range(n):
sums = a1[i]
A3 = A2[i:]
a2 = list(accumulate(A3))
sums += max(a2)
ans = max(ans,sums)
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 0
for i in range(n):
ans = max(ans,sum(a[:i+1])+sum(b[i:]))
print(ans) | p03449 |
from itertools import accumulate
n=int(eval(input()))
a1=list(map(int,input().split()))
a2=list(map(int,input().split()))
a2=[0]+a2
a1=list(accumulate(a1))
a2=list(accumulate(a2))
ans=0
s=a2[-1]
for i in range(n):
t=0
t+=a1[i]
t+=s-a2[i]
ans=max(t,ans)
print(ans) | n=int(eval(input()))
a1=list(map(int,input().split()))
a2=[0]+list(map(int,input().split()))
from itertools import accumulate
a1=list(accumulate(a1))
a2=list(accumulate(a2))
ans=0
for i in range(n):
t=a1[i]+a2[-1]-a2[i]
ans=max(ans,t)
print(ans) | p03449 |
while True:
try:
n = int(eval(input()))
count = 0
for a in range(0,10):
for b in range(0,10):
for c in range(0,10):
for d in range(0,10):
if a+b+c+d==n:
count+=1
print(count)
except:
break | from itertools import product
while True:
try:
n = int(eval(input()))
except:
break
print((sum(a+b+c+d==n for a,b,c,d in product(list(range(10)), repeat=4)))) | p00008 |
import sys,itertools
k=list(range(10))
for l in sys.stdin:print([sum(x)for x in list(itertools.product(k,k,k,k))].count(int(l))) | import sys
def f(s,d,g,c):
if d>3:return c
for n in range(10):
if s+n==g:return c+1
elif s+n>g:return c
else:c=f(s+n,d+1,g,c)
return c
for l in sys.stdin:
print(f(0,0,int(l),0)) | p00008 |
import sys
def f(s,d,g,c):
if d>3:return c
for n in range(10):
if s+n==g:return c+1
elif s+n>g:return c
else:c=f(s+n,d+1,g,c)
return c
for l in sys.stdin:
print(f(0,0,int(l),0)) | import sys
r=list(range(10))
x=[0]*51
for a in r:
for b in r:
for c in r:
for d in r:
x[a+b+c+d]+=1
for l in sys.stdin:
print(x[int(l)]) | p00008 |
import sys,itertools
k=range(10)
s=[0]*51
for n in [sum(x)for x in list(itertools.product(k,k,k,k))]:s[n]+=1
for l in sys.stdin:print(s[int(l)]) | import sys
s=[0]*51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
s[a+b+c+d]+=1
for l in sys.stdin:print(s[int(l)]) | p00008 |
while True:
try:
n=int(eval(input()))
cnt=0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==n:
cnt+=1
print(cnt)
except EOFError:
break |
while True:
try:
n=int(eval(input()))
cnt=0
for a in range(10):
for b in range(10):
for c in range(10):
d = n-(a+b+c)
if 0<=d<=9:
cnt+=1
print(cnt)
except EOFError:
break | p00008 |
import itertools
import sys
s=list(range(0,10))
chk=list(itertools.product(s,repeat=4))
for j in sys.stdin:
ans=0
for k in chk:
if sum(k)==int(j):
ans+=1
print(ans) | while 1:
try:
n=int(input())
except EOFError:
break
print(len([1 for i in range(10) for j in range(10) for k in range(10) for l in range(10) if i+j+k+l==n])) | p00008 |
import sys
for e in sys.stdin:
n=0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==int(e):n+=1
print(n)
| import sys
for e in sys.stdin:
e=int(e);x=list(range(10))
print((sum([1 for a in x for b in x for c in x for d in x if a+b+c+d==e])))
| p00008 |
import sys
for e in sys.stdin:
e=int(e);x=list(range(10))
print((sum([1 for a in x for b in x for c in x for d in x if a+b+c+d==e])))
| import sys
a=[0]*51
for i in range(19):
a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6-max(2*(i-9)*(i-8)*(i-7)//3,0)
for e in sys.stdin:
print((a[int(e)]))
| p00008 |
import sys
a=[0]*51;x=list(range(10))
for i in range(51):
a[i]=sum([1 for p in x for q in x for r in x for s in x if p+q+r+s==i])
for e in sys.stdin:
print((a[int(e)]))
| import sys
a=[0]*51
for i in range(10):a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6
for i in range(10,19):a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6-a[i-10]*4
for e in map(int,sys.stdin):print((a[e]))
| p00008 |
memo = [[None for i in range(51)] for j in range(5)]
memo[0][0] = 1
for i in range(1, 51):
memo[0][i] = 0
def f(n, sm):
if memo[n][sm] is not None:
return memo[n][sm]
memo[n][sm] = 0
for i in range(min(10, sm + 1)):
memo[n][sm] += f(n - 1, sm - i)
return memo[n][sm]
try:
while True:
print(f(4, int(input())))
except:
pass | def mlist(n, *args, **keys):
if len(args) == 0:
return [keys.get('default')] * n
else:
return [mlist(*args, **keys) for i in range(n)]
def f(n, sm):
if n == 0:
return int(sm == 0)
if memo[n][sm] is not None:
return memo[n][sm]
memo[n][sm] = 0
for i in range(min(10, sm + 1)):
memo[n][sm] += f(n - 1, sm - i)
return memo[n][sm]
try:
memo = mlist(5, 51)
while True:
print(f(4, int(input())))
except EOFError:
pass | p00008 |
import sys
for line in sys.stdin:
n = int(line)
count = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i + j + k + l == n:
count += 1
print(count) | import sys
t = [0 for i in range(10000)]
c = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
t[c] = i + j + k + l
c += 1
for line in sys.stdin:
print((t.count(int(line)))) | p00008 |
r = range
while True:
try:
n = int(eval(input()))
ans = []
ans = [(a,b,c,d) for a in r(10) for b in r(10) for c in r(10) for d in r(10) if a+b+c+d==n and (a,b,c,d) not in ans]
print((len(ans)))
except:
break | while True:
try:
n = int(eval(input()))
except:
break
ans = 0
for a in range(10):
for b in range(10):
for c in range(10):
d = n - (a + b + c)
ans += 0 <= d <= 9
print(ans)
| p00008 |
import sys
table={}
def dfs(a,b):
global table
if not a in table:
if a==0:return 1
elif b==0 or a < 0:return 0
table[(a,b)]=sum([dfs(a-i,b-1) for i in range(10)])
return table[(a,b)]
for i in sys.stdin.readlines():
print(dfs(int(i.strip()),4)) | import sys
def dfs(a,b):
if a==0:return 1
elif b==0 or a < 0:return 0
return sum([dfs(a-i,b-1) for i in range(10)])
for line in sys.stdin.readlines():
print(dfs(int(line.strip()),4)) | p00008 |
import sys
def dfs(a,b):
if a==0:return 1
elif b==0 or a < 0:return 0
return sum([dfs(a-i,b-1) for i in range(10)])
for line in sys.stdin.readlines():
print(dfs(int(line.strip()),4)) | import sys
table={}
def memorize(f):
global table
def func(*args):
if not args in table:
table[args]=f(*args)
return table[args]
return func
@memorize
def dfs(a,b):
if a==0:return 1
elif b==0 or a < 0:return 0
return sum([dfs(a-i,b-1) for i in range(10)])
for i in sys.stdin.readlines():
print(dfs(int(i.strip()),4)) | p00008 |
memo=[[0]*51 for i in range(5)]
def rec(i,n):
if memo[i][n]!=0:
return memo[i][n]
if i==4:
return 1 if n==0 else 0
for m in range(10):
memo[i][n]+=rec(i+1,n-m)
return memo[i][n]
while True:
try:
n=int(eval(input()))
print((rec(0,n)))
except:
break | memo=[[-1]*51 for i in range(5)]
def rec(i,n):
if memo[i][n]!=-1:
return memo[i][n]
r=0
if i==4:
return 1 if n==0 else 0
for m in range(10):
r+=rec(i+1,n-m)
memo[i][n]=r
return r
while True:
try:
n=int(eval(input()))
print((rec(0,n)))
except:
break | p00008 |
while True:
try:
cnt=0
i=int(eval(input()))
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==i:
cnt+=1
print(cnt)
except:
break | x=[0]*51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
x[a+b+c+d]+=1
while True:
try:
print((x[int(eval(input()))]))
except:
break | p00008 |
import sys,itertools
for n in map(int,sys.stdin):
x=0
for num in itertools.product("0123456789",repeat=4):
eq="{}+{}+{}+{}".format(*(num))
if eval(eq)==n:x+=1
print(x) | import sys
A=list(range(10))
for n in map(int,sys.stdin):
x=0
for a in A:
d=n-a
if 0>d or d>27:continue
for b in A:
e=d-b
if 0>e or e>18:continue
for c in A:
if (e-c)in A:x+=1
print(x) | p00008 |
import sys
def f(a,b):
A=list(range(10))
if b==1:x=1 if a in A else 0
else:x=sum([f(a-e,b-1)for e in A])
return x
for n in map(int,sys.stdin):
print(f(n,4)) | import sys
def f(a,b):
A=list(range(10))
if b==1:x=1 if a in A else 0
elif a<0 or a>b*9:x=0
else:x=sum([f(a-e,b-1)for e in A])
return x
for n in map(int,sys.stdin):
print(f(n,4)) | p00008 |
import sys
def f(a,b):
c=b*9-9
A=list(range(10))
if b==1:x=1 if a in A else 0
else:x=sum([f(a-e,b-1)for e in A if 0<=a-e<=c])
return x
for n in map(int,sys.stdin):print(f(n,4)) | import sys
def f(a,b,c):
if b==1:x=1 if 0<=a<=9 else 0
else:x=sum([f(a-e,b-1,c-9)for e in range(10) if 0<=a-e<=c])
return x
for n in map(int,sys.stdin):print(f(n,4,3*9)) | p00008 |
import sys
from itertools import product
sum = [0] * 51
for k,l in product([i+j for i,j in product(list(range(10)),repeat=2)],repeat=2):
sum[k+l] += 1
for i in sys.stdin:
print((sum[int(i)])) | import sys
import math
def nCr(n, k):
if 0 <= k <= n:
nk,kk = 1,1
for t in range(1, min(k, n - k) + 1):
nk = nk*n
kk = kk*t
n -= 1
return nk // kk
else:
return 0
p = [0] * 51
v = 0
for i in range(19):
t = nCr(i+3, i)
v = v + 4 * nCr(i-8,i-10)
p[i] = t - v
p[36-i] = p[i]
for i in sys.stdin:
print((p[int(i)])) | p00008 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.