input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import itertools
n,*abc=list(map(int,input().split()))
l=[int(eval(input())) for i in range(n)]
inf=100000000000000
mi=inf
for i in list(itertools.product([i for i in range(3)],repeat=n)):#(1)↓
sub=[[] for j in range(3)]
for j in range(n):
sub[i[j]].append(j)
mi_sub=0
for j in range(3)... | N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
def dfs(cur, a, b, c):
'''
深さがNだったら使用MPを評価
N本の竹を使うときに必要な合成回数はN-1のため，最後に-1*10*3(?)
1本も竹を使用していなかったら棄却→MPを無限に使うこととしている
'''
if cur == N:
return abs(a - A) + abs(b - B) + abs(c - ... | p03111 |
N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for i in range(N)]
INF=3000
def mp(co,a,b,c):
if co==N:
return abs(a-A)+abs(b-B)+abs(c-C)-30 if min(a,b,c)>0 else INF
ret0=mp(co+1,a,b,c)
ret1=mp(co+1,a+l[co],b,c)+10
ret2=mp(co+1,a,b+l[co],c)+10
ret3=mp(co+1,a,b,c... | N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for i in range(N)]
inf=3000
def mp(g,a,b,c,):
if g==N:
return abs(A-a)+abs(B-b)+abs(C-c)-30 if min(a,b,c)>0 else inf
l0=mp(g+1,a+l[g],b,c)+10
l1=mp(g+1,a,b+l[g],c)+10
l2=mp(g+1,a,b,c+l[g])+10
l3=mp(g+1,a,b,c)
... | p03111 |
import itertools
import math
import copy
N, A, B, C = list(map(int, input().rstrip().split()))
pattern = [list(itertools.combinations(list(range(x)), 3)) for x in range(3, N+1)]
def stretch_shortening(sticks, A, B, C):
min_cost = 1e10
for i1, i2, i3 in pattern[len(sticks) - 3]:
cos... |
import itertools
import math
import copy
N, A, B, C = list(map(int, input().rstrip().split()))
pattern = [list(itertools.combinations(list(range(x)), 3)) for x in range(3, N+1)]
def stretch_shortening(sticks, A, B, C):
min_cost = 1e10
for i1, i2, i3 in pattern[len(sticks) - 3]:
cos... | p03111 |
N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(N)]
ABC=[A,B,C]
def base2n(Num,n):
if Num<n:
return str(Num)
else:
return base2n(Num//n,n)+str(Num%n)
ans=10**6
for i in range(4**N):
i_4=("0"*N+base2n(i,4))[-N:]
Group=[[] for i in range(4)]... | N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(N)]
inf=10**6
def dfs(cur,a,b,c):
if cur==N:
if min(a,b,c)>0:
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return inf
else:
ret0=dfs(cur+1,a,b,c)
ret1=dfs(cur+1,a+... | p03111 |
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 3000
for bits in range(4**n):
xa = xb = xc = 0
tmp_ans = 0
for i in range(n):
f = (bits//(4**i)) % 4
if f == 1:
if xa != 0:
tmp_ans += 10
xa += l... | n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
INF = 10**9
def dfs(index, x, y, z):
if index == n:
return abs(a-x) + abs(b-y) + abs(c-z) - 30 if min(x, y, z) > 0 else INF
cand1 = dfs(index+1, x+l[index], y, z) + 10
cand2 = dfs(index+1, x, y+l[index... | p03111 |
#!/usr/bin/env python
# coding: utf-8
import itertools
def main():
N, A, B, C = list(map(int, input().split()))
ll = []
for _ in range(N):
ll.append(int(eval(input())))
cand = []
ids = set(range(N))
for a in range(1, N-1):
for b in range(1, N-a):
for... | #!/usr/bin/env python
# coding: utf-8
N, A, B, C = list(map(int, input().split()))
ll = []
for _ in range(N):
ll.append(int(eval(input())))
def dfs(n, a, b, c):
if n == N:
if a == 0 or b == 0 or c == 0: return float('inf')
return abs(A-a) + abs(B-b) + abs(C-c)
ca = dfs(n+1, a+l... | p03111 |
# XをN進数に変換
def base_number(X:int, N:int):
res = ""
while True:
q, mod = divmod(X,N)
res += str(mod)
X = q
if q == 0:
break
return res[::-1]
N,*B = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float("inf")
for i i... | import sys
sys.setrecursionlimit(10 ** 7)
from functools import lru_cache
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
@lru_cache(None)
def dfs(cur, a, b, c):
if cur == N:
return abs(a - A) + abs(b - B) + abs(c - C) if min(a, b, c) > 0 el... | p03111 |
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
l = list(sorted(l))
tar = []
for x in C, B, A:
if x in l:
l.remove(x)
else:
tar.append(x)
if not tar:
print((0))
exit()
ans = float('inf')
for j in range((len(tar) + 1) ** len(l)):
... | N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
INF = float('inf')
def dfs(cur, a, b, c):
if cur == N:
return abs(a - A) + abs(b - B) + abs(c - C) - 30 if min(a, b, c) > 0 else INF
# A,B,Cに使用する材料を合成し、目的の長さの差を加算（必要なMP）
# ret1-3で一つ目の材料にも合成魔法のM... | p03111 |
# 4進数
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
INF = float('inf')
ans = INF
for ptn in range(1 << (2 * N)):
abc = [0 for _ in range(4)]
v = [None for _ in range(N)]
# lの各idxをどの竹用に割り当てるか, ABC無 = 0123
cnt = 0
for j in range(N):
... | # dfs
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
INF = float('inf')
def calc(mask):
abc = [0 for _ in range(4)]
cnt = 0
for j in range(N):
idx = (mask >> (2 * j)) & 3
abc[idx] += l[j]
if 0 <= idx < 3:
cnt += 1
... | p03111 |
inf = float('inf')
n, *goal = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = inf
for q in range(4 ** n):
m = [[] for _ in range(4)]
lm = 0
for j in range(n):
idx = (q // (4 ** j)) % 4
m[idx].append(l[j])
if any(len(m[idx]) == 0 for idx in r... | inf = float('inf')
n, *goal = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = inf
for q in range(4 ** n):
cost = -30
t = [0] * 3
for j in range(n):
idx = (q // (4 ** j)) % 4
if idx == 3: continue
t[idx] += l[j]
cost += 10
... | p03111 |
inf = float('inf')
n, *goal = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = inf
for q in range(4 ** n):
cost = -30
t = [0] * 3
for j in range(n):
idx = (q // (4 ** j)) % 4
if idx == 3: continue
t[idx] += l[j]
cost += 10
... | inf = float('inf')
def calc(mask):
cost = -30
t = [0] * 3
for j in range(n):
idx = (mask >> (2 * j)) & 3
if idx == 3: continue
t[idx] += l[j]
cost += 10
if 0 in t[:3]:
return inf
cost += sum(abs(tt - gg) for tt, gg in zip(t, goal))
retu... | p03111 |
inf = float('inf')
def calc(mask):
cost = -30
t = [0] * 3
for j in range(n):
idx = (mask >> (2 * j)) & 3
if idx == 3: continue
t[idx] += l[j]
cost += 10
if 0 in t[:3]:
return inf
cost += sum(abs(tt - gg) for tt, gg in zip(t, goal))
retu... | inf = float('inf')
def calc(mask):
t = [0] * 3
cnt = 0
for j in range(n):
idx = (mask >> (2 * j)) & 3
if idx == 3:
cnt += 1
continue
t[idx] += l[j]
if 0 in t:
return inf
return sum(abs(tt - gg) for tt, gg in zip(t, goal)) + ... | p03111 |
l=[]
n,a,b,c=list(map(int,input().split()))
for i in range(n):
li=int(eval(input()))
l.append(li)
d=[a,b,c]
d.sort()
mpmin=sum(l)*4+len(l)*10+sum(d)
for i in range(4**n):
k=[]
kj=i%4
k.append(kj)
b=int((i-kj)/4)
l0=[]
l1=[]
l2=[]
l3=[]
if kj==0:
... |
n,a,b,c=list(map(int,input().split()))
l=[0]*n
for i in range(n):
l[i]=int(eval(input()))
import itertools
mpmin=a+b+c+1
for i in itertools.product([0,1,2,3], repeat=n):
aa=0
bb=0
cc=0
mpa=0
mpb=0
mpc=0
ia=0
ib=0
ic=0
for ii in range(n):
if... | p03111 |
n,a,b,c=list(map(int,input().split()))
l=[0]*n
for i in range(n):
l[i]=int(eval(input()))
import itertools
mpmin=a+b+c+1
for i in itertools.product([0,1,2,3], repeat=n):
aa=0
bb=0
cc=0
mpa=0
mpb=0
mpc=0
ia=0
ib=0
ic=0
for ii in range(n):
if... |
n,a,b,c=list(map(int,input().split()))
l=[0]*n
for i in range(n):
l[i]=int(eval(input()))
inf=10**9
def dfs(cur,aa,bb,cc):
if cur==n:
if min(aa,bb,cc)>0:
return abs(a-aa)+abs(b-bb)+abs(c-cc)-30
else:
return inf
ret0=dfs(cur+1,aa,bb,cc)
ret1=dfs(c... | p03111 |
# coding: utf-8
def Base_10_to_n(X, n):
X_dumy = X
out = ''
while X_dumy>0:
out = str(X_dumy%n)+out
X_dumy = int(X_dumy/n)
return out
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float("inf")
for i in range(4**N):
bit... | # coding: utf-8
import sys
sys.setrecursionlimit(10**9)
def Base_10_to_n(X, n):
X_dumy = X
out = ''
while X_dumy>0:
out = str(X_dumy%n)+out
X_dumy = int(X_dumy/n)
return out
N, A, B, C = list(map(int, input().split()))
L = []
for i in range(N):
L.append(int(eval(input())... | p03111 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/2/24
Solved on 2019/2/24
@author: shinjisu
"""
# ABC 119
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n
def getIntLines(n): return [int(input()) for i in... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/2/24
Solved on 2019/2/24
@author: shinjisu
"""
# ABC 119
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n
def getIntLines(n): return [int(input()) for i in... | p03111 |
# coding: utf-8
import sys
import itertools
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# N本の竹それぞれA, B, C, 使わないか
N, A, B, C = lr()
bamboo = [ir() for _ in range(N)]
answer = 10 ** 5
for pattern in itertools.product(list(range(4)), repeat=N):... | # coding: utf-8
import sys
import itertools
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# Nは最大8まで、Aに使う竹はどれ？
N, A, B, C = lr()
bamboo = [ir() for _ in range(N)]
answer = 10 ** 5
for pattern in itertools.product(list(range(4)), repeat=N):
... | p03111 |
from itertools import product, permutations
N, A, B, C = list(map(int, input().split(' ')))
L = [int(eval(input())) for _ in range(N)]
ans = 10 ** 9
for groups in product(list(range(4)), repeat=N):
items = []
group_a = []
group_b = []
group_c = []
for group, length in zip(groups, L):
... | from itertools import product
N, A, B, C = list(map(int, input().split(' ')))
L = [int(eval(input())) for _ in range(N)]
ans = 10 ** 9
for groups in product(list(range(4)), repeat=N):
length_a = 0
length_b = 0
length_c = 0
cost_a = -10
cost_b = -10
cost_c = -10
for group, le... | p03111 |
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
min_cost = 10 ** 18
def func(n, select):
global min_cost
if n == 0:
if len(set(select) - {0}) < 3:
return
#print(select)
cost = 0
a, b, c = 0, 0, 0
for i, t in enumerate(select):
if t == 1:
if ... | N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
INF = 10 ** 12
def solve(n, cost, a, b, c):
if n == N:
if 0 == min(a, b, c):
return INF
return abs(a - A) + abs(b - B) + abs(c - C) + cost - 30
ret1 = solve(n + 1, cost, a, b, c)
ret2 = solve(n + 1, cost + 10,... | p03111 |
n,a,b,c = list(map(int,input().split()))
takelist = [a,b,c]
li = [int(eval(input())) for _ in range(n)]
li2 = [0 for _ in range(n)]
min = 10**100
def movelist(li,n):
for i in range(n):
if li[i] != 3:
li[i] += 1
break
else:
li[i] = 0
for i in rang... | n,A,B,C = list(map(int,input().split()))
li = [int(eval(input())) for _ in range(n)]
def searchans(count,a,b,c):
if count == n:
if not 0 in [a,b,c]:
return abs(A-a) + abs(B-b) + abs(C-c) - 30
else:
return 10**100
else:
ret0 = searchans(count+1,a,b,c)
... | p03111 |
import itertools
n_bamboo, b1, b2, b3 = [int(i) for i in input().split()]
bamboos = [int(eval(input())) for _ in range(n_bamboo)]
ans = float("inf")
# すべての竹について、b1, b2, b3のどの竹に使うかを列挙
# 0のときはどの竹にも使わない
for bit in itertools.product((0, 1, 2, 3), repeat=n_bamboo):
l1, l2, l3 = 0, 0, 0
c1, c2, c3 = 0, ... | def dfs(cursor, a, b, c):
if cursor == N:
return abs(A - a) + abs(B - b) + abs(C - c) - 30 if min(a, b, c) > 0 else float("inf")
ret0 = dfs(cursor + 1, a, b, c)
ret1 = dfs(cursor + 1, a + l[cursor], b, c) + 10
ret2 = dfs(cursor + 1, a, b + l[cursor], c) + 10
ret3 = dfs(cursor + 1, a, b... | p03111 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03111 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**2)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03111 |
def examC():
N, A, B, C = LI()
L = [I() for _ in range(N)]
loop = 4**N; ans = 10**9
for i in range(loop):
cur = 0
curA = 0; curB = 0; curC = 0
for j in range(N):
judge = (i//(4**j))%4
if judge==1:
if curA>0:
c... | def examA():
N = DI()/dec(7)
ans = N
print(N)
return
def examB():
ans = 0
print(ans)
return
def examC():
N, A, B, C = LI()
L = [I()for _ in range(N)]
loop = (1<<(2*N))
ans = inf
for l in range(loop):
cost = 0
bamboo_A = 0
bambo... | p03111 |
import itertools
N, A, B, C = list(map(int, input().split()))
l = []
for i in range(N):
l.append(int(eval(input())))
prod = list(itertools.product(['A','B','C','X'], repeat=N))
mps = []
for prod_e in prod:
if prod_e.count('A') * prod_e.count('B') * prod_e.count('C') != 0:
mp = 0
... | N, A, B, C = list(map(int, input().split()))
l = []
for i in range(N):
l.append(int(eval(input())))
def dfs(syn, n, a, b, c):
if n == N:
if a*b*c != 0:
mp = abs(A-a) + abs(B-b) + abs(C-c)
mp += syn * 10 - 30
return mp
else:
retur... | p03111 |
#https://atcoder.jp/contests/abc119/tasks/abc119_c
#2019-02-24
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
ans = float("inf")
# 00 なら使わない、 01 ならAをつくる、10 ならBをつくる、11ならCをつくる
for i in range(1 << 2*N):
cost = float("inf")
A_hon = 0
B_hon = 0
C_hon = ... | #https://atcoder.jp/contests/abc119/tasks/abc119_c
#2019-02-24
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
ans = []
# 00 なら使わない、 01 ならAをつくる、10 ならBをつくる、11ならCをつくる
for i in range(1 << 2*N):
A_hon = 0
B_hon = 0
C_hon = 0
A_zai = 0
B_zai = 0
... | p03111 |
#https://atcoder.jp/contests/abc119/tasks/abc119_c
#2019-02-24
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
ans = []
# 00 なら使わない、 01 ならAをつくる、10 ならBをつくる、11ならCをつくる
for i in range(1 << 2*N):
A_hon = 0
B_hon = 0
C_hon = 0
A_zai = 0
B_zai = 0
... | import itertools
N, *A = list(map(int,input().split()))
l = [int(eval(input())) for i in range(N)]
li = itertools.product(list(range(4)), repeat=N)
ans = float("inf")
for i in li:
cnt = [0]*3
length = [0]*3
for k in range(N):
if i[k] == 3:
continue
cnt[i[k]] += 1
length[i[k]] += ... | p03111 |
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
import itertools
m = 4
n = N
bit_list = list(itertools.product([i for i in range(m)], repeat=n))
res = 10 ** 18
for b in bit_list:
tmp1 = 0
tmp2 = 0
tmp3 = 0
check1 = False
check2 = False
che... | N, A, B, C = list(map(int, input().split()))
L = []
for i in range(N):
L.append(int(eval(input())))
import itertools
m = 4
bit_list = list(itertools.product([i for i in range(m)], repeat=N))
ans = 10 ** 18
for bit in bit_list:
retA = 0
retB = 0
retC = 0
checkA = False
checkB =... | p03111 |
from itertools import groupby, accumulate, product, permutations, combinations
def calc(x,X):
n = len(x)
ans = 10**10
for q in product([0,1],repeat=n):
point = 0
cnt = 0
for i in range(n):
if q[i]==1:
if cnt>0:
point += 10
cnt += x[i]
if cnt>0:
po... | from itertools import groupby, accumulate, product, permutations, combinations
def calc(x,X):
n = len(x)
if n==0:
return 10**10
ans = abs(sum(x)-X)+(n-1)*10
return ans
def solve():
ans = 10**10
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
for p... | p03111 |
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
from itertools import product
ptns = list(product([0,1,2,-1], repeat = n))
ans = 10**9
for i in range(len(ptns)):
if 0 not in ptns[i] or 1 not in ptns[i] or 2 not in ptns[i]:
continue
abc = [0, 0, 0, -30]... | n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
from itertools import product
ptns = list(product([0,1,2,-1], repeat = n))
anss = []
for i in range(len(ptns)):
if 0 not in ptns[i] or 1 not in ptns[i] or 2 not in ptns[i]:
continue
abc = [0, 0, 0, -30]
... | p03111 |
# ＤＦＳ, パターン列挙_各竹の使用パターンを列挙
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
stack = [[0],[1],[2],[-1]] # 初期化_ここでは竹の使用パターン4つを設置
ptns = [] # パターン候補の器_初期化
while stack: # stackが空になるまでループ
tmp = stack.pop() # パターンの候補を pop
if len(tmp) == n: # 条件に合えば append
... | # ＤＦＳ, パターン列挙_各竹の使用パターンを列挙
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
stack = [[0],[1],[2],[-1]]
ans = 10**9
while stack:
tmp = stack.pop()
if len(tmp) == n:
if 0 not in tmp or 1 not in tmp or 2 not in tmp:
continue
abc = [... | p03111 |
# ＤＦＳ, パターン列挙_竹'n'本の使用パターン
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
stack = [[0],[1],[2],[-1]] # 初期化_ここでは竹の使用パターン4つを設置
ptns = [] # パターン候補の器_初期化
while stack: # stackが空になるまでループ
tmp = stack.pop() # パターンの候補を pop
if len(tmp) == n: # 条件に合えば append
... | # ＤＦＳ, パターン列挙_竹'n'本の使用パターン
'''
from collections import deque
n, a, b, c = map(int, input().split())
l = [int(input()) for _ in range(n)]
queue = deque([[0],[1],[2],[-1]]) # 初期化_ここでは竹の使用パターン4つを設置
ptns = [] # パターン候補の器_初期化
while queue: # stackが空になるまでループ
tmp = queue.pop() # パターンの候補を pop
if len(tmp) ... | p03111 |
"""
できなかった
- 操作 = 四則演算 or 関数
- 交換法則などが成り立つかどうか確認する必要がある
- 再帰的(dfs)に実装する場合、何を初期値として終了条件とするかの理解が必要
- 前提として全探索であること => 1の解に収束する必要がない
全ての葉を訪れたときに最小・最大値・解への到達が判定できれば良い
- dfsの実装: いまどの高さにいるかを引数として渡す = 何を高さとして定義するか
- 階層のインデックスは選択可能な配列のインデックス
- 同階層のノードは選択肢
- ノードが持つ値は、その選択をした時の合計の値
- 終了条件A, B, Cを満たす
... | n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
inf = 10 ** 18
def dfs(i, a, b, c):
if n == i:
if 0 == a or 0 == b or 0 == c:
return inf
return abs(A - a) + abs(B - b) + abs(C - c)
res = dfs(i + 1, a, b, c)
res = min([res, ... | p03111 |
n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
inf = 10 ** 18
def dfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return inf
return abs(A - a) + abs(B - b) + abs(C - c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i +... | n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if n == i:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i + 1, a + l... | p03111 |
n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if n == i:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i + 1, a + l... | n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i + 1, a + l... | p03111 |
n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i + 1, a + l... | n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def bfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
res = bfs(i + 1, a, b, c)
res = min([res, bfs(i + 1, a + l[i... | p03111 |
n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if n == i:
if 1 > a or 1 > b or 1 > c:
return 10 ** 18
return abs(A-a) + abs(B-b) + abs(C-c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i + 1, a + l[i], b, ... | n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i + 1, a + l[i... | p03111 |
n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A-a) + abs(B-b) + abs(C-c)
res = dfs(i + 1, a, b, c)
res = min([res, dfs(i + 1, a + l[i], b, ... | n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
return min([
dfs(i + 1, a, b, c),
dfs(i + 1, a ... | p03111 |
n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if i == n:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A - a) + abs(B - b) + abs(C - c)
return min([
dfs(i + 1, a, b, c),
dfs(i + 1, a ... | n, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a, b, c):
if n == i:
if a < 1 or b < 1 or c < 1:
return 10 ** 18
return abs(A-a) + abs(B-b) + abs(C-c)
return min([
dfs(i + 1, a, b, c),
dfs(i + 1, a + l[i]... | p03111 |
N,*T = list(map(int,input().split()))
L = [int(eval(input())) for i in range(N)]
ans = 3000
for x in range(4**N):
l = [0]*4
t = [0]*4
n = 4
i = 0
for i in range(N):
l[x%n] += L[i]
t[x%n] += 1
x//=n
if 0 in l[:3]:
continue
cost = 0
for ... | from itertools import product
N,*T = list(map(int,input().split()))
L = [int(eval(input())) for i in range(N)]
ans = 3000
for x in product([0,1,2,3], repeat=N):
cost = 0
l = [0]*4
for i,v in enumerate(x):
l[v] += L[i]
if v<3:
cost += 10
if 0 in l[:3]:
... | p03111 |
import sys
import itertools
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
return sys.stdin.readline().rstrip()
def main():
N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(N)]
ps=itertools.permutations(l)
ans=INF
for p in ps:
f... | import sys
import itertools
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
return sys.stdin.readline().rstrip()
def main():
N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(N)]
ps=itertools.permutations(l)
ans=INF
for p in ps:
S... | p03111 |
def calc(T, bam):
mix = len(bam) - 1
total = sum(bam)
return mix * 10 + abs(T - total)
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
var = [[] for _ in range(N + 1)]
var[0].append('')
for i in range(N):
for j in var[i]:
for c in '0abc... | import sys
sys.setrecursionlimit(10 ** 6)
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
INF = 10 ** 12
def dfs(cur, a, b, c):
if cur == N:
return abs(a - A) + abs(b - B) + abs(c - C) - 30 if min(a, b, c) > 0 else INF
ret0 = dfs(cur + 1, a, b, c)
... | p03111 |
import bisect
INF=10**18
n,*a=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(n)]
ans=INF
for i in range(4**n):
x=[[] for _ in range(3)]
for j in range(n):
if (i>>2*j)&1 and not (i>>2*j+1)&1:x[0].append(l[j])
if not (i>>2*j)&1 and (i>>2*j+1)&1:x[1].append(l[j])
if (i>>2*j)&... | n,a,b,c=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(n)]
ans=10**18
for i in range(4**n):
la,lb,lc,ca,cb,cc=0,0,0,0,0,0
for j in range(n):
if (i>>2*j)&1 and not (i>>2*j+1)&1:
ca+=1
la+=l[j]
if not (i>>2*j)&1 and (i>>2*j+1)&1:
cb+=1
lb+=l[j]
if (... | p03111 |
N, A, B, C = list(map(int, input().split()))
L_list = [int(eval(input())) for i in range(N)]
import itertools
Target = itertools.product([0, 1, 2, 3], repeat=N)
INF = 10 ** 9
#Target = [(1,2,2,2,3)]
ans = INF
for T in Target:
A_sum = 0
B_sum = 0
C_sum = 0
A_cost = 0
B_cost = 0
... | N, A, B, C = list(map(int, input().split()))
L_list = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
def dfs(a, b, c, n):
if n == N:
return abs(A - a) + abs(B - b) + abs(C - c) - 30 if min(a, b, c) > 0 else INF
ret1 = dfs(a, b, c, n + 1)
ret2 = dfs(a + L_list[n], b, c, n + 1) + 10... | p03111 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03111 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03111 |
# coding:utf-8
import sys
import itertools
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def... | # coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval... | p03111 |
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for i in range(N)]
def dfs(d, a, b, c):
if d == N:
res = abs(a - A) + abs(b - B) + abs(c - C) - 30
return 1e9 if min(a, b, c) == 0 else res
ret = [0] * 4
ret[0] = dfs(d + 1, a, b, c)
ret[1] = dfs(d + 1, a + l[d], b, c) + 10
... | N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
def rec(itr, a, b, c, mp):
if itr == N:
if a == 0 or b == 0 or c == 0:
return 10 ** 9
return abs(a - A) + abs(b - B) + abs(c - C) + mp - 30
res = rec(itr + 1, a, b, c, mp)
res = min(re... | p03111 |
import itertools
def diff(a,b,c):
return abs(A-a)+abs(B-b)+abs(C-c)
N,A,B,C,*l=list(map(int,open(0).read().split()))
_min=10**6
for i in itertools.product([0,1,2,3],repeat=N):
cnt=0
abc=[0,0,0]
for j in range(N):
if i[j] !=3:
abc[i[j]]+=l[j]
cnt+=1
... | def dfs(cnt,a,b,c):
if cnt == N:
_sum = abs(A-a) + abs(B-b) + abs(C-c) - 30
return _sum if min(a,b,c) > 0 else 10**9
ret0 = dfs(cnt+1, a, b, c)
ret1 = dfs(cnt+1, a+l[cnt] , b, c) + 10
ret2 = dfs(cnt+1, a, b+l[cnt], c) + 10
ret3 = dfs(cnt+1, a, b, c+l[cnt]) + 10
return min... | p03111 |
from itertools import product
n,*B=list(map(int,input().split()))
A=[int(eval(input())) for i in range(n)]
s=10**9
for P in product([0,1,2,3],repeat=n):
if {0,1,2}<=set(P):
m=[0,0,0]
for x,y in zip(P,A):
if x!=3:
m[x]+=y
t=sum(abs(m-y) for m,y in zip(m,B))
l=sum(1 for j in P i... | from itertools import *
N,A,B,C = list(map(int, input().split()))
L = [int(eval(input())) for n in range(N)]
ans = []
for i in product(list(range(4)),repeat=N):
a = 0
b = 0
c = 0
d = 0
for j in range(N):
if i[j]:
d+=1
if i[j]==1:
a+=L[j]
elif i[j]==2:
b+=... | p03111 |
def dfs(depth):
if depth == N:
ans.append(cal(v))
return
for i in range(4):
v[depth] = i
dfs(depth+1)
def cal(v):
tmp = [0] * 3
for i in range(N):
if v[i] == 0:
tmp[0] += l[i]
elif v[i] == 1:
tmp[1] += l[i]
... | from itertools import product
def main():
N, A, B, C = list(map(int, input().split()))
L = list(int(eval(input())) for _ in range(N))
ans = 0
# A => 0
# B => 1
# C => 2
ans = float('inf')
for item in product(list(range(4)), repeat=N):
length_A = 0
cnt_A = 0
... | p03111 |
def dfs(i, A, B, C):
global ans
if i == n:
if A and B and C:
s = 0
ABC = [A, B, C]
for i in range(3):
s += (len(ABC[i]) - 1) * 10 + abs(sum(ABC[i]) - abc[i])
ans = min(ans, s)
else:
dfs(i + 1, A + [l[i]], B, C)
... | def dfs(i, A, B, C):
global ans
if i == n:
if A and B and C:
ans = min(ans, abs(a - sum(A)) + abs(b - sum(B)) + abs(c - sum(C)) + (len(A) + len(B) + len(C) - 3) * 10)
else:
# a の肉焼き器に乗せるか、 b の肉焼き器に乗せるか
dfs(i + 1, A, B, C)
dfs(i + 1, A + [L[i]], B, C)
... | p03111 |
def dfs(i, A, B, C):
global ans
if i == n:
if A and B and C:
ans = min(ans, abs(a - sum(A)) + abs(b - sum(B)) + abs(c - sum(C)) + (len(A) + len(B) + len(C) - 3) * 10)
else:
dfs(i + 1, A, B, C)
dfs(i + 1, A + [L[i]], B, C)
dfs(i + 1, A, B + [L[i]], C)
... | def dfs(i, a, b, c, plus):
global ans
if i == n:
if a and b and c:
mp = abs(a - A) + abs(b - B) + abs(c - C) + (plus - 3) * 10
ans = min(ans, mp)
else:
dfs(i + 1, a, b, c, plus)
dfs(i + 1, a + l[i], b, c, plus + 1)
dfs(i + 1, a, b + l[i], ... | p03111 |
n, a, b, c = list(map(int, input().split()))
take = []
for i in range(n):
t = int(eval(input()))
take.append(t)
def Base_10_to_n(X, n):
X_dumy = X
out = ''
while X_dumy>0:
out = str(X_dumy%n)+out
X_dumy = int(X_dumy/n)
return out
def cal_cost(li, a):
if li ... | n, a, b, c = list(map(int, input().split()))
bamboos = []
for i in range(n):
bamboo = int(eval(input()))
bamboos.append(bamboo)
def Base_10_to_n(X, n):
X_dumy = X
out = ''
while X_dumy>0:
out = str(X_dumy%n)+out
X_dumy = int(X_dumy/n)
return out
def calc_score(gro... | p03111 |
import sys
input=sys.stdin.readline
n,a,b,c=list(map(int,input().split()))
L=[]
A=[a,b,c]
for i in range(n):
L.append(int(eval(input())))
L.sort()
Ans=10**9
for i in range(4**n):
F=[[] for i in range(3)] #竹格納:[A,B,C]
now=i
for j in range(n):
r=now%(4**(j+1))
chk=r//(4**... | import sys
input=sys.stdin.readline
n,a,b,c=list(map(int,input().split()))
L=[]
A=[a,b,c]
for i in range(n):
L.append(int(eval(input())))
L.sort()
ans=10**9
for i in range(4**n):
F=[[] for i in range(3)] #竹格納:[A,B,C]
now=i
for j in range(n):
r=now%(4**(j+1))
chk=r//(4**... | p03111 |
# -*- coding: utf-8 -*-
from itertools import product
def inpl(): return list(map(int, input().split()))
N, A, B, C = inpl()
L = [int(eval(input())) for _ in range(N)]
ans = 1e9
def calc(Q, D):
S = sum(Q)
res = 10*(len(Q)-1) + abs(D-S)
return res
for X in product(list(range(4)), repeat=N... | # -*- coding: utf-8 -*-
from itertools import product
def inpl(): return list(map(int, input().split()))
N, A, B, C = inpl()
L = [int(eval(input())) for _ in range(N)]
ans = 1e9
for X in product(list(range(4)), repeat=N):
P = [[] for _ in range(4)]
for i, x in enumerate(X):
P[x].append(L[... | p03111 |
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
#L1～LNはL[0]~L[N-1]で取り出す。よってこれから竹1~Nのことを竹0~N-1と呼ぶ。
#作られるべきA,B,Cが自らの材料として選んだ竹を、集合memA, memB, memCに格納？
#メンバーの選び方[0]~[255]の「[合計初期サイズ, 本数]」を格納するリスト
initialSum = []
for i in range(2**N): #全てのフラグパターンについて計算する
nowsum = 0
... | N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
#L1～LNはL[0]~L[N-1]で取り出す。よってこれから竹1~Nのことを竹0~N-1と呼ぶ。
#メンバーの選び方[0]~[255]の「[合計初期サイズ, 本数]」を格納するリスト
initialSum = []
for i in range(2**N): #全てのフラグパターンについて計算する
nowsum = 0
nowbamboocnt = 0
for j in range(N): #2^(j+1)乗で割っ... | p03111 |
import itertools
n, a, b, c = list(map(int, input().split()))
_l = [int(eval(input())) for i in range(n)]
cl = ('A', 'B', 'C', 'N')
result = 1e10
for pattern in itertools.product(*[cl]*n):
wands = {'A': 0, 'B': 0, 'C': 0}
point = 0
for i, char in enumerate(pattern):
if char != 'N':
... | n, a, b, c = list(map(int, input().split()))
_l = [int(eval(input())) for i in range(n)]
inf = 10**9
# DP
def f(i, _a, _b, _c):
# A,B,Cにしようとしている枝の長さが現在_a,_b,_cのとき,i番目以降の材料を使って達成される点数の最小値
if i == n:
return abs(a - _a) + abs(b - _b) + abs(c - _c) if min(_a, _b, _c) > 0 else inf
# i番目を使... | p03111 |
from functools import lru_cache
n, a, b, c = list(map(int, input().split()))
_l = [int(eval(input())) for i in range(n)]
inf = 10**9
# DP
@lru_cache(maxsize=10000)
def f(i, _a, _b, _c):
# A,B,Cにしようとしている枝の長さが現在_a,_b,_cのとき,i番目以降の材料を使って達成される点数の最小値
if i == n:
return abs(a - _a) + abs(b - _b... | from functools import lru_cache
n, a, b, c = list(map(int, input().split()))
_l = [int(eval(input())) for i in range(n)]
inf = 10**9
# DP
@lru_cache(maxsize=1000)
def f(i, _a, _b, _c):
# A,B,Cにしようとしている枝の長さが現在_a,_b,_cのとき,i番目以降の材料を使って達成される点数の最小値
if i == n:
return abs(a - _a) + abs(b - _b)... | p03111 |
import math
N, A, B, C = 5, 100, 90, 80
ARR = [
98,
40,
30,
21,
80
]
# N,A,B,C = 8, 100, 90, 80
# ARR = [
# 100,
# 100,
# 90,
# 90,
# 90,
# 80,
# 80,
# 80,
# ]
# N,A,B,C,= 8, 1000, 800, 100
# ARR = [
# 300,
# 333,
# 400,
# ... | import math
N, A, B, C = 5, 100, 90, 80
ARR = [
98,
40,
30,
21,
80
]
# N,A,B,C = 8, 100, 90, 80
# ARR = [
# 100,
# 100,
# 90,
# 90,
# 90,
# 80,
# 80,
# 80,
# ]
# N,A,B,C,= 8, 1000, 800, 100
# ARR = [
# 300,
# 333,
# 400,
# ... | p03111 |
import math
N, A, B, C = 5, 100, 90, 80
ARR = [
98,
40,
30,
21,
80
]
# N,A,B,C = 8, 100, 90, 80
# ARR = [
# 100,
# 100,
# 90,
# 90,
# 90,
# 80,
# 80,
# 80,
# ]
# N,A,B,C,= 8, 1000, 800, 100
# ARR = [
# 300,
# 333,
# 400,
# ... | import math
# N, A, B, C = 7, 100, 90, 80
# ARR = [
# 98,
# 40,
# 30,
# 21,
# 80,
# 25,
# 100
# ]
N, A, B, C = list(map(int, input().split()))
ARR = []
for i in range(N):
ARR.append(int(eval(input())))
result = []
def dfs(deep, crr):
if deep == N:
ok, ... | p03111 |
from collections import Counter
n, a, b, c = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(n)]
def base_n(x, n, zero_padding=8):
retval = [[], ['0']][x == 0]
while x > 0:
x, r = divmod(x, n)
retval.append(str(r))
cnt = zero_padding - len(retval)
pad ... | n, a, b, c = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(n)]
INF = 10**8
def dfs(current_index, sum_a, sum_b, sum_c):
if current_index == n:
if min(sum_a, sum_b, sum_c) > 0:
return sum(abs(x-y) for x, y in
zip([a, b, c], [sum_a, sum_b,... | p03111 |
from itertools import combinations
from itertools import permutations
def f(x, lst, rem):
d = abs(x - min(lst))
min_lst = min(lst)
tpl = None
for v in range(len(lst) - rem + 1):
for t in combinations(lst, v + 1):
if abs(x - sum(t)) + 10 * v < d:
d = abs(x... | from itertools import combinations
from itertools import permutations
def f(x, lst, rem):
d = int(1e9+7)
tpl = ()
for v in range(len(lst) - rem + 1):
for t in combinations(lst, v + 1):
if abs(x - sum(t)) + 10 * v < d:
d = abs(x - sum(t)) + 10 * v
... | p03111 |
from itertools import product
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
t1 = set([0,1,2,3])
t2= set([1,2,3])
def calc(t):
t3 = set(t)
if not (t3 == t1 or t3 == t2): return INF
a, b, c = 0, 0, 0
cnt = 0
for i, v in enumerate(t):
... | from itertools import product
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
ans = INF
def calc(a, b, c):
la, lb, lc = len(a), len(b), len(c)
if la + lb + lc < 3 or 0 in (la, lb, lc): return INF
sa, sb, sc = sum(a), sum(b), sum(c)
t = 0
... | p03111 |
#%%
import itertools
#%%
N, A, B, C = list(map(int, input().split()))
materials = [int(eval(input())) for _ in range(N)]
iterobj = itertools.product(list(range(4)),repeat=N)
ans = 10**8
for use in iterobj:
if 1 in use and 2 in use and 3 in use:
synth = [0,0,0,0]
for m, ... | #%%
import sys
INPUT = sys.stdin.readline
def SINGLE_INT(): return int(INPUT())
def MULTIPLE_INT_LIST(): return list(map(int, INPUT().split()))
def MULTIPLE_INT_MAP(): return list(map(int, INPUT().split()))
def SINGLE_STRING(): return INPUT()
def MULTIPLE_STRING(): return INPUT().split()
#%%
N, A, B, C =... | p03111 |
def main():
n, a, b, c = list(map(int, input().split()))
arr = [int(eval(input())) for i in range(n)]
min_cost = float("inf")
for i in range(1, 2 ** n):
bin_i = "{:08b}".format(i)[::-1]
arr_i = [arr[x] for x in range(n) if bin_i[x] == "1"]
cost_i = (len(arr_i) - 1) * 10
... | from itertools import product
def main():
n, *target = list(map(int, input().split()))
arr = [int(eval(input())) for i in range(n)]
tests = product("0123", repeat=n)
test_arr = [[] for _ in range(3)]
min_cost = float("inf")
for test in tests:
cost = 0
if "1" no... | p03111 |
N, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
used = [0]*N
global pattern
pattern = []
global ans
ans = float('inf')
def dfs(A):
global pattern
global ans
if len(A) == N:
pattern.append(A)
ans = min(ans, MP(A))
return
... |
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
def dfs(cur, a, b, c):
if cur == N:
return abs(a-A) + abs(b-B) + abs(c-C) - 30 if min(a, b, c) > 0 else float('inf')
ret0 = dfs(cur+1, a, b, c)
ret1 = dfs(cur+1, a+l[cur], b, c) + 10
ret2 = d... | p03111 |
import itertools
N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(N)]
d=list(itertools.product([0,1,2,3], repeat=N))
MIN=10**10
for i in range(len(d)):
ans=0
a_num=0
b_num=0
c_num=0
a_kadomatu=A
b_kadomatu=B
c_kadomatu=C
if {0,1,2} <= set(d[i... | def dfs(ka, kb, kc, cnta, cntb, cntc, phase):
global ans
if phase == n:
if 0 < cnta and 0 < cntb and 0 < cntc:
ans = min(ans, abs(a-ka) + abs(b-kb) + abs(c-kc) + 10*(cnta+cntb+cntc-3))
return
dfs(ka+l[phase], kb, kc, cnta+1, cntb, cntc, phase+1)
dfs(ka, kb+l[phase], kc... | p03111 |
from itertools import product
N,a,b,c = list(map(int,input().split()))
L = list(int(eval(input())) for i in range(N))
ans = float("inf")
for prod in product(list(range(4)), repeat=N) :
A = []
B = []
C = []
D = []
for i in range(len(prod)) :
if prod[i] == 1 :
A.ap... | from itertools import product
N,a,b,c = list(map(int,input().split()))
L = list(int(eval(input())) for i in range(N))
ans = float("inf")
for prod in product(list(range(4)), repeat=N) :
A = []
B = []
C = []
for i in range(len(prod)) :
if prod[i] == 1 :
A.append(L[i])
... | p03111 |
class ans:
def __init__(self):
self.N, self.A, self.B, self.C = list(map(int,input().split()))
self.L = [int(eval(input())) for _ in range(self.N)]
print((self.dfs(0, 0, 0, 0)))
exit()
def dfs(self, x, a, b, c):
if(x == self.N):
if(min(a, b, c) > 0):
return abs(a-self.A)... | N, A, B, C = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
def dfs(x, a, b, c):
if(x == N):
if(min(a, b, c) > 0):
return abs(a-A)+abs(b-B)+abs(c-C)-30
else:
return 1e9+7
ret0 = dfs(x+1, a, b, c)
ret1 = dfs(x+1, a+L[x], b, c) + 10
ret2 = dfs(x+1, a, b+L... | p03111 |
n, *li = list(map(int, input().split()))
L = list(map(int, (int(eval(input())) for _ in range(n))))
ans = int(1e9)
def f(A, num, cnt):
if num == n:
if 0 in A:
return
global ans
ans = min(ans, abs(A[0] - li[0]) + abs(A[1] - li[1]) + abs(A[2] - li[2]) + cnt)
return... | INF = float("inf")
n, A, B, C = list(map(int, input().split()))
L = tuple(map(int, (int(eval(input())) for _ in range(n))))
def f(a, b, c, num):
if num == n:
if min(a, b, c) > 0:
return abs(A - a) + abs(B - b) + abs(C - c)
else:
return INF
return min(
f(... | p03111 |
INF = float("inf")
n, A, B, C = list(map(int, input().split()))
L = tuple(map(int, (int(eval(input())) for _ in range(n))))
def f(a, b, c, num):
if num == n:
if min(a, b, c) > 0:
return abs(A - a) + abs(B - b) + abs(C - c)
else:
return INF
return min(
f(... | INF = float("inf")
n, A, B, C = list(map(int, input().split()))
L = tuple(map(int, (int(eval(input())) for _ in range(n))))
def f(a, b, c, num):
if num == n:
return abs(A - a) + abs(B - b) + abs(C - c) if min(a, b, c) > 0 else INF
return min(
f(a + L[num], b, c, num + 1) + (10 if a else 0... | p03111 |
INF = float("inf")
n, A, B, C = list(map(int, input().split()))
L = tuple(map(int, (int(eval(input())) for _ in range(n))))
def f(a, b, c, num):
if num == n:
return abs(A - a) + abs(B - b) + abs(C - c) if min(a, b, c) > 0 else INF
return min(
f(a + L[num], b, c, num + 1) + (10 if a else 0... | INF = int(1e9)
n, A, B, C = list(map(int, input().split()))
L = tuple(map(int, (int(eval(input())) for _ in range(n))))
def f(a, b, c, num):
if num == n:
return abs(A - a) + abs(B - b) + abs(C - c) if min(a, b, c) > 0 else INF
return min(
f(a + L[num], b, c, num + 1) + (10 if a else 0),
... | p03111 |
import itertools
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for i in range(N)]
def min_cost(target, l_list):
if target in l_list:
return 0
else:
res = 1000
for l in l_list:
res = min(res, abs(target - l))
for i, l in enumerate(l_list):
res =... | import itertools
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for i in range(N)]
def min_cost(target, l_list):
return 10*(len(l_list) - 1) + abs(target - sum(l_list))
ans = 1000 * 3
combs = list(itertools.product([0, 1, 2, 3], repeat=N))
for comb in combs:
labcn = [[], [], []... | p03111 |
import itertools
n,a,b,c=list(map(int,input().split()))
x=[a,b,c]
l=[int(eval(input())) for i in range(n)]
ans=1000000
loop='012'
for i in range(2**n):
use=[]
for j in range(n):
if((i>>j)&1):
use.append(l[j])
if(len(use)>=3):
for j in (itertools.product(loop,repeat=le... | def check(s,e,t):
global ans
if(not s or not e or not t):
return
ans=min(ans,(len(s)-1)*10+abs(A-sum(s))+(len(e)-1)*10+abs(B-sum(e))+(len(t)-1)*10+abs(C-sum(t)))
def dfs(s,e,t,i):
if(i==N):
check(s,e,t)
return
dfs(s,e,t,i+1)
dfs(s+[l[i]],e,t,i+1)
dfs(s,e+... | p03111 |
N,A,B,C = list(map(int,input().split()))
L = []
for i in range(N):
L.append(int(eval(input())))
MP = float('inf')
n = 4
def Base_10_to_n(X,n):
if (int(X/n)):
return Base_10_to_n(int(X/n),n)+str(X%n)
return str(X%n)
for X in range(4**N):
STR = Base_10_to_n(X,n).zfill(N)
nU = []
uA = []
... | N,A,B,C = list(map(int,input().split()))
L = []
for i in range(N):
L.append(int(eval(input())))
def Base_10_to_n(X,n):
if (int(X/n)):
return Base_10_to_n(int(X/n),n)+str(X%n)
return str(X%n)
n = 4
ans = float('inf')
for X in range(n**N):
STR = Base_10_to_n(X,n).zfill(N)
cur = 0
TAKEA = 0
... | p03111 |
N,A,B,C=list(map(int,input().split()))
L=[0]*N
for i in range(N):
L[i]=int(eval(input()))
# ある竹を,Aに使う、Bに使う、Cに使う、どれにも使わない の4パターンで全探索
# A,B,C それぞれに対して2つ目以降は10Pかかる
stack=[]
# Aの長さ、Bの長さ、Cの長さ、処理した竹の本数、消費MP
stack.append([0,0,0,0,0])
ans=1000*10
while stack:
a,b,c,num,mp=stack.pop()
if num==N:
if a=... | N,A,B,C=list(map(int,input().split()))
L=[0]*N
for i in range(N):
L[i]=int(eval(input()))
# ある竹を,Aに使う、Bに使う、Cに使う、どれにも使わない の4パターンで全探索
# A,B,C それぞれに対して2つ目以降は10Pかかる
stack=[]
# Aの長さ、Bの長さ、Cの長さ、処理した竹の本数、消費MP
stack.append([0,0,0,0,0])
ans=1000*10
while stack:
a,b,c,num,mp=stack.pop()
if num==N:
if a=... | p03111 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) f... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) f... | p03111 |
from sys import setrecursionlimit
setrecursionlimit(1000000)
def permute(a, idx):
if idx == len(a):
permutations.append(a[::])
for i in range(idx, len(a)):
a[i], a[idx] = a[idx], a[i]
permute(a, idx + 1)
a[i], a[idx] = a[idx], a[i]
def doit(a, b, c, idx):
if (a,... | from itertools import permutations
from sys import setrecursionlimit
setrecursionlimit(1000000)
def doit(a, b, c, idx):
if (a, b, c, idx) in memo:
return memo[a, b, c, idx]
if idx == len(unused):
return abs(a - needA) + abs(b - needB) + abs(c - needC)
memo[a, b, c, idx] = min(
... | p03111 |
import sys
from itertools import product
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *A = list(map(int, readline().split()))
(*L,) = list(map(int, read().split()))
ans = IN... | import sys
from itertools import product
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, A, B, C = list(map(int, readline().split()))
(*L,) = list(map(int, read().split()))
def... | p03111 |
n,A,B,C,=list(map(int,input().split()))
l=[int(eval(input())) for i in range(n)]
INF=1e9
def dfs(i,a,b,c):
if i==n:
if min(a,b,c)>0:
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return INF
ret0 = dfs(i+1,a,b,c)
ret1 = dfs(i+1,a+l[i],b,c)+10
ret2 = dfs(i+1,a,b+l[i],c)+10
ret3 = ... | N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(N)]
inf=10**18
def dfs(cur,a,b,c):
if cur==N:
if min(a,b,c)>0:
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return inf
res0 = dfs(cur+1,a,b,c)
res1 = dfs(cur+1,a+l[cur],b,c)+10
res2 = dfs(cur+1,a,b+l[cur],c)... | p03111 |
import itertools
N,A,B,C = list(map(int,input().split()))
l = [int(eval(input())) for i in range(N)]
inf = float('inf')
ans = inf
for pair in itertools.product(list(range(4)),repeat=N):
mA = 0 ; mB = 0; mC = 0; cnt = 0
for i in range(N):
if pair[i] == 1:
mA += l[i]
cnt ... | N,A,B,C = list(map(int,input().split()))
l = [int(eval(input())) for i in range(N)]
inf = float('inf')
def dfs(depth=0, a=0, b=0, c=0):
if depth == N:
if a*b*c != 0:
return abs(a-A) + abs(b-B) + abs(c-C) - 30
return inf
res0 = dfs(depth+1,a,b,c)
res1 = dfs(depth+1,a+l[... | p03111 |
N,A,B,C = list(map(int,input().split()))
l = [int(eval(input())) for i in range(N)]
inf = float('inf')
def dfs(depth=0, a=0, b=0, c=0):
if depth == N:
if a*b*c != 0:
return abs(a-A) + abs(b-B) + abs(c-C) - 30
return inf
res0 = dfs(depth+1,a,b,c)
res1 = dfs(depth+1,a+l[... | N,A,B,C = list(map(int,input().split()))
l = [int(eval(input())) for _ in range(N)]
ans = float('inf')
def dfs(d=0,a=0,b=0,c=0,mp=0):
if d == N:
mp = mp + abs(A-a) + abs(B-b) + abs(C-c) - 30
global ans
if a*b*c > 0 and mp < ans:
ans = mp
return
dfs(d+1,a,b,c... | p03111 |
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
inf = 10 ** 9
def dfs(cur, a, b, c):
if cur == N:
return abs(a-A)+abs(b-B)+abs(c-C)-30 if min(a,b,c)>0 else inf
non_marge = dfs(cur+1, a, b, c)
marge_a = dfs(cur+1, a+L[cur], b, c) + 10
marge_b = df... | N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
inf = 10**9
def dfs(cur, a, b, c):
if cur == N:
return abs(a-A)+abs(b-B)+abs(c-C)-30 if min(a,b,c)>0 else inf
no_merge = dfs(cur+1, a, b, c)
merge_a = dfs(cur+1, a+L[cur], b, c) + 10
merge_b = dfs(c... | p03111 |
from itertools import product
n,a,b,c=list(map(int,input().split()))
abc=[a,b,c]
l=tuple(int(eval(input())) for _ in range(n))
ans=10**18
for a in product(list(range(4)), repeat=n):
MP=0
take=[[] for _ in range(4)]
for i in range(n):
take[a[i]].append(l[i])
if take[0] and tak... | from itertools import product
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = 10 ** 18
for alloc in product(list(range(4)), repeat=N):
La = 0
Lb = 0
Lc = 0
use_a = 0
... | p03111 |
INF = 10 ** 18
N, A, B, C = list(map(int,input().split()))
ls = [int(eval(input())) for i in range(N)]
def func(pos, a, b, c):return abs(a - A) + abs(b - B) + abs(c - C) - 30 + INF * max(0, 1 - a * b * c) if pos == N else min(func(pos + 1, a + ls[pos] * (i == 0), b + ls[pos] * (i == 1), c + ls[pos] * (i == 2)) +... | N, A, B, C = list(map(int,input().split()))
ls = [int(eval(input())) for i in range(N)]
def func(pos, a, b, c):return abs(a - A) + abs(b - B) + abs(c - C) - 30 + 10000 * max(0, 1 - a * b * c) if pos == N else min(func(pos + 1, a + ls[pos] * (i == 0), b + ls[pos] * (i == 1), c + ls[pos] * (i == 2)) + 10 * (i < 3) for ... | p03111 |
N, A, B, C = list(map(int,input().split()))
ans = [[0, 0, 0, 0]]
for i in range(N):
l = int(eval(input()))
ans = [[p[j] + l * (i == j) for j in [0, 1, 2]] + [p[3]+(i < 3)] for p in ans for i in range(4)]
print((min(abs(p[0] - A) + abs(p[1] - B) + abs(p[2] - C) + p[3] * 10 - 30 for p in ans if min(p[:3]) > ... | N, A, B, C = list(map(int,input().split()))
ans = [[0, 0, 0, -30]]
for i in range(N):
l = int(eval(input()))
ans = [[p[j] + l * (i == j) for j in [0, 1, 2]] + [p[3] + (i < 3) * 10] for p in ans for i in range(4)]
print((min(abs(p[0] - A) + abs(p[1] - B) + abs(p[2] - C) + p[3] for p in ans if min(p[:3]) > 0... | p03111 |
N, A, B, C = list(map(int,input().split()))
ans = [[0, 0, 0, -30]]
for i in range(N):
l = int(eval(input()))
ans = [[p[j] + l * (i == j) for j in [0, 1, 2]] + [p[3] + (i < 3) * 10] for p in ans for i in range(4)]
print((min(abs(p[0] - A) + abs(p[1] - B) + abs(p[2] - C) + p[3] for p in ans if min(p[:3]) > 0... | N,A,B,C=list(map(int,input().split()));a=[[0,0,0,-30]]
for i in range(N):l=int(eval(input()));a=[[p[j]+l*(i==j)for j in[0,1,2]]+[p[3]+(i<3)*10]for i in range(4)for p in a]
print((min(abs(p[0]-A)+abs(p[1]-B)+abs(p[2]-C)+p[3]for p in a if min(p[:3])>0))) | p03111 |
N,*A=list(map(int,input().split()));a=[[0]*4];r=[0,1,2]
for i in range(N):l=int(eval(input()));a=[[p[j]+l*(i==j)for j in r]+[p[3]+(i<3)*10]for i in r+[3]for p in a]
print((min(sum(abs(p[i]-A[i])for i in r)-30+p[3]for p in a if min(p[:3])>0))) | N,*A=list(map(int,input().split()));a=[[0]*4];r=[0,1,2]
for i in range(N):l=int(eval(input()));a+=[[p[j]+l*(i==j)for j in r]+[p[3]+10]for i in r for p in a]
print((min(sum(abs(p[i]-A[i])for i in r)-30+p[3]for p in a if min(p[:3])>0))) | p03111 |
import sys
check_ary = [[0 for i in range(3)]for i in range(2)]
num_ary = [[0 for i in range(3)]for i in range(3)]
check_minus = False
for i in range(3):
num_ary[i] = list(map(int,input().split()))
for i in range(num_ary[0][0]+1):
for x in range(3):
check_ary[1][x] = num_ary[0][x] - i
... | ary = [list(map(int,input().split())) for _ in range(3)]
for i in range(ary[0][0]+1):
a = [ary[0][0]-i,ary[0][1]-i,ary[0][2]-i]
a2 = ary[1][0] - a[0]
a3 = ary[2][0] - a[0]
b = [a2+a[0],a2+a[1],a2+a[2]]
c = [a3+a[0],a3+a[1],a3+a[2]]
if ary == [a,b,c]:print("Yes");exit()
else:print("No") | p03435 |
lis1 = []
lis2 = []
lis3 = []
count = 0
for num in input().split():
lis1.append(int(num))
for num in input().split():
lis2.append(int(num))
for num in input().split():
lis3.append(int(num))
for a1 in range(101):
for a2 in range(101):
for a3 in range(101):
count = 0
... | lis1 = []
lis2 = []
lis3 = []
count = 0
flag = 0
for num in input().split():
lis1.append(int(num))
for num in input().split():
lis2.append(int(num))
for num in input().split():
lis3.append(int(num))
for a1 in range(101):
for a2 in range(101):
for a3 in range(101):
if li... | p03435 |
cij =[]
for i in range(3):
cij.append(list(map(int, input().split(" "))))
bi_list = []
for b1 in range(-500000, 500000):
b2 = b1 - (cij[0][0] - cij[0][1])
b3 = b1 - (cij[0][0] - cij[0][2])
a1 = cij[0][0]+cij[0][1]+cij[0][2] -b1-b2-b3
a2 = cij[1][0]+cij[1][1]+cij[1][2] -b1-b2-b3
a3 =... | cij =[]
for i in range(3):
cij.append(list(map(int, input().split(" "))))
bi_list = []
for b1 in range(-50000, 50000):
b2 = b1 - (cij[0][0] - cij[0][1])
b3 = b1 - (cij[0][0] - cij[0][2])
a1 = cij[0][0]+cij[0][1]+cij[0][2] -b1-b2-b3
a2 = cij[1][0]+cij[1][1]+cij[1][2] -b1-b2-b3
a3 = c... | p03435 |
c=[list(map(int,input().split())) for i in range(3)]
x=c[0][2]-c[0][1]
y=c[0][1]-c[0][0]
for i in range(1,3):
if c[i][1]-c[i][0]!=y:
print("No")
break
if c[i][2]-c[i][1]!=x:
print("No")
break
else:
print("Yes") | c = [list(map(int, input().split())) for i in range(3)]
x = c[0][2] - c[0][1]
y = c[0][1] - c[0][0]
ans = 'Yes'
for i in range(1, 3):
if c[i][2] - c[i][1] != x or c[i][1] - c[i][0] != y:
ans = "No"
break
print(ans)
| p03435 |
# ABC088C - Takahashi's Information
def main():
arr = [list(map(int, input().rstrip().split())) for _ in range(3)]
memo = []
for i, j, k in arr:
memo += [(i - j, j - k)]
print(("Yes" if len(set(memo)) == 1 else "No"))
if __name__ == "__main__":
main() | # ABC088C - Takahashi's Information
def main():
*C, = list(map(int, open(0).read().split()))
memo = {(i - j, j - k) for i, j, k in zip(*[iter(C)] * 3)}
flg = len(memo) == 1
print(("Yes" if flg else "No"))
if __name__ == "__main__":
main() | p03435 |
def calc(a1,c):
As=[a1]
Bs=[]
Bs.append(c[0][0]-As[0])
As.append(c[1][0]-Bs[0])
As.append(c[2][0]-Bs[0])
Bs.append(c[0][1]-As[0])
Bs.append(c[0][2]-As[0])
for a in range(3):
for b in range(3):
if As[a]+Bs[b]!=c[a][b]: return False
return True
c=[]
f... | def calc(a1,c):
As=[a1]
Bs=[]
Bs.append(c[0][0]-As[0])
As.append(c[1][0]-Bs[0])
As.append(c[2][0]-Bs[0])
Bs.append(c[0][1]-As[0])
Bs.append(c[0][2]-As[0])
for a in range(3):
for b in range(3):
if As[a]+Bs[b]!=c[a][b]: return False
return True
c=[]
f... | p03435 |
def confirm(a, b, c):
for i in range(3):
for j in range(3):
if a[i] + b[j] != c[i][j]:
return False
return True
def main():
c = [list(map(int, input().split())) for i in range(3)]
for a1 in range(101):
for a2 in range(101):
for a3 i... | def main():
c = [list(map(int, input().split())) for i in range(3)]
for x in range(101):
b = (c[0][0] - x, c[0][1] - x, c[0][2] - x)
a = (x, c[1][0] - b[0], c[2][0] - b[0])
flag = True
for i in (1, 2):
for j in (1, 2):
if a[i] + b[j] != c[i][j]... | p03435 |
c=[[int(i) for i in input().split()]for i in range(3)]
a=[0]*3
b=[0]*3
for i in range(3):
for j in range(3):
b[j]=c[i][j]-a[0]
for i in range(3):
for j in range(3):
a[j]=c[j][0]-b[0]
judge=True
for i in range(3):
for j in range(3):
if a[j]+b[i]!=c[j][i]:
judg... | s=[list(map(int,input().split()))for i in range(3)]
a=[0]*3
b=[0]*3
for i in range(3):
b[i]=s[0][i]-a[0]
for i in range(3):
a[i]=s[i][0]-b[0]
for i in range(3):
for j in range(3):
if a[i]+b[j]!=s[i][j]:
print("No")
exit()
print("Yes") | p03435 |
#import collections
#aa = collections.Counter(a) # list to list
#mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
C = [readInts() for _ in range(3)]
a = [0] * 3
b = [0] * 3
# a[0] = 0としとく
# 1つ適当に決めることでほかのものが決まる
# それでちょいちょいやればよーい!
for i in range(... | c = [list(map(int,input().split())) for _ in range(3)]
#print(LIST)
# a1 = 0 とする
a,b= [0,0,0],[0,0,0]
for i in range(3):
b[i] = c[0][i] - a[0]
for j in range(1,3):
a[j] = c[j][0] - b[0]
for i in range(1,3):
for j in range(1,3):
#print(a,b)
if c[j][i] == a[j] + b[i]:
p... | p03435 |
from itertools import product
c = [tuple(map(int, input().split())) for _ in range(3)]
maxNum = max(max(c))
for i in product(list(range(maxNum+1)),repeat=3):
if max(i) > maxNum: continue
for x in range(maxNum+1):
row1 = (i[0]+x,i[1]+x,i[2]+x)
if row1 == c[0]:
for y in range(maxNum+1):
... | c = [list(map(int, input().split())) for _ in range(3)]
# 斜め同士を足し合わせ比較をする
if c[0][0] + c[1][1] == c[0][1] + c[1][0]:
if c[0][1] + c[1][2] == c[0][2] + c[1][1]:
if c[1][0] + c[2][1] == c[1][1] + c[2][0]:
if c[1][1] + c[2][2] == c[1][2] + c[2][1]:
print("Yes")
exit()
print("No") | p03435 |
def main():
A = [[int(i) for i in input().split()] for j in range(3)]
from itertools import product
for a1, a2, a3 in product(range(101), repeat=3):
c1 = A[0][0] - a1 == A[1][0] - a2 == A[2][0] - a3
c2 = A[0][1] - a1 == A[1][1] - a2 == A[2][1] - a3
c3 = A[0][2] - a1 == A[1][2] ... | def main():
A = [[int(i) for i in input().split()] for j in range(3)]
for i in range(1, 3):
for j in range(3):
A[i][j] -= A[0][j]
if (A[1][0] == A[1][1] == A[1][2]) and (A[2][0] == A[2][1] == A[2][2]):
print("Yes")
else:
print("No")
if __name__ == '__main... | p03435 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.