input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
x=int(eval(input()))
c=x//500
d=x%500
e=d//5
print((1000*c+e*5)) | x=int(eval(input()))
a=x//500
b=x%500
c=b//5
print((1000*a+5*c)) | p02724 |
x = int(eval(input()))
a = x//500
x -= a*500
b = x//5
ax = a*1000
bx = b*5
print((ax+bx)) | n = int(eval(input()))
x = n//500
y = n-500*x
z = y//5
print((x*1000+z*5)) | p02724 |
s=int(eval(input()))
ans=s//500*1000+(s%500//5)*5
print(ans) | x=int(eval(input()))
print(((x//500)*1000+(x%500)//5*5))
| p02724 |
from operator import itemgetter
n = int(eval(input()))
lr = [list(map(int, input().split())) + [i] for i in range(n)]
l_sort = sorted(lr, key=itemgetter(0), reverse=True)
r_sort = sorted(lr, key=itemgetter(1))
ans = 0
used = []
now = 0
i = 0
j = 0
if abs(l_sort[0][0]) >= abs(r_sort[0][1]):
while len... | from operator import itemgetter
n = int(eval(input()))
lr = [list(map(int, input().split())) for i in range(n)] + [[0, 0]]
l_sort = sorted(lr, key=itemgetter(0), reverse=True)
r_sort = sorted(lr, key=itemgetter(1))
ans = 0
sigma = 0
for i in range(n // 2 + 1):
sigma += 2 * (l_sort[i][0] - r_sort[i][1])... | p03333 |
from heapq import heappush, heappop
N = int(eval(input()))
S = []
for i in range(N):
l, r = list(map(int, input().split()))
S.append((l, r))
S.sort()
if all(l <= 0 <= r for l, r in S):
print((0))
exit(0)
que = []
P = []
Q = [l for l, r in S]
Q.reverse()
ans = 0
a = b = 0
p = 0
for i... | from heapq import heappush, heappop
N = int(eval(input()))
S = []
for i in range(N):
l, r = list(map(int, input().split()))
S.append((l, r))
if all(l <= 0 <= r for l, r in S):
print((0))
exit(0)
P = sorted(r for l, r in S)
Q = sorted(l for l, r in S)
L = R = 0
ans = 0
for i in range(N):... | p03333 |
N=int(eval(input()))
LR=[None]*N
for i in range(N):
LR[i]=list(map(int,input().split()))
if len(LR)%2==1:
LR=LR+[[0,0]]
RAN=(len(LR)+1)//2
LR_L=sorted(LR,key=lambda x: x[0],reverse=True)
LR_R=sorted(LR,key=lambda x: x[1])
ANS=0
for k in range(RAN):
SUB=0
for i in range(k+1):
... | N=int(eval(input()))
LR=[None]*N
for i in range(N):
LR[i]=list(map(int,input().split()))
RAN=(len(LR)+1)//2
LR_L=sorted(LR,key=lambda x: x[0],reverse=True)
LR_R=sorted(LR,key=lambda x: x[1])
ANS_l=[0]*(RAN*2+2)
ANS_r=[0]*(RAN*2+2)
for i in range(RAN):
ANS_l[2*i+1]=ANS_l[2*i]+LR_L[i][0]
AN... | p03333 |
"""
貪欲か？
今いる地点から左のRと右のLの数を比較
多い方の最遠点に行く→そのような点が無くなったら終了
証明は…
まず右のR,左のLは無意味→区間を無駄にするだけ
少ない方に行く→多い方の区間が無駄になる
近い点に行く→ ここがむずい
遠い区間が無駄になるのを防ぐため？
実装は？
多い方の処理→BITで左にあるRの数と右にあるLの数をlogNで
優先度付きキューで最小のRと最大のLを検出
10^5+1 を足して1 ～ 2*10^5 + 1の区間として扱う
初期・終了地点は 10^5+1
"""
import heapq
def bitadd(a,w,bit): #aにw... |
N = int(eval(input()))
L = []
R = []
for i in range(N):
l,r = list(map(int,input().split()))
L.append(2 * l)
R.append(-2 * r)
L.sort()
R.sort()
L.reverse()
R.reverse()
ans = 0
now = 0
for i in range(N):
now += L[i]
ans = max(ans,now)
now += R[i]
ans = max(ans,now... | p03333 |
import sys
import heapq
import copy
input = sys.stdin.buffer.readline
N = int(eval(input()))
pq_L = []
pq_R = []
for i in range(N):
L, R = list(map(int, input().split()))
heapq.heappush(pq_L, (-L, i))
heapq.heappush(pq_R, (R, i))
pq_L2 = copy.deepcopy(pq_L)
pq_R2 = copy.deepcopy(pq_R)
ans1 ... | import sys
import heapq
import copy
input = sys.stdin.buffer.readline
def main():
N = int(eval(input()))
pq_L = []
pq_R = []
for i in range(N):
L, R = list(map(int, input().split()))
heapq.heappush(pq_L, (-L, i))
heapq.heappush(pq_R, (R, i))
pq_L2 = copy.deepcop... | p03333 |
from sys import stdin, stdout
from time import perf_counter
import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7
l = [int(item) for item in input().split()]
if (l[0]==5 and l[1] == 5 and l[2]==7) or (l[0]==5 and l[1] == 7 and l[2]==5) or (l[0]==7 and l[1] == 5 and l[2]==5):
print("YES")
else:
... | from sys import stdin, stdout
from time import perf_counter
import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7
l= sorted(map(int, input().split()))
print(("YES" if l == [5,5,7] else "NO")) | p04043 |
'''To count the number of occurrences of
something in a programs
Use count fucntion of the list
'''
a=list(map(int,input().split()))
if a.count(5)==2 and a.count(7)==1:
print("YES")
else:
print("NO")
| seq = [int(s) for s in input().split()]
if seq.count(5) == 2 and seq.count(7) == 1:
print("YES")
else: print("NO") | p04043 |
L = [int(x) for x in input().split()]
L.sort()
if L == [5,5,7]:
print("YES")
else:
print("NO")
| L = sorted(list(map(int, input().split())))
print(('YES' if L[0]==L[1]==5 and L[2]==7 else 'NO'))
| p04043 |
L = sorted(list(map(int, input().split())))
if L == [5,5,7]:
print("YES")
else:
print("NO") | S = [int(i) for i in input().split()]
S.sort()
if S == [5,5,7]:
print("YES")
else:
print("NO")
| p04043 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
ABC = list(map(int, input().split()))
print(('YES' if ABC.count(5) == 2 and ABC.count(7) == 1 else 'NO'))
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
ABC = list(map(int, input().split()))
ABC.sort()
print(('YES' if [5, 5, 7] == ABC else 'NO'))
if __name__ == "__main__":
main()
| p04043 |
abc = list(map(int,input().split()))
print(("YES" if abc.count(5) == 2 and abc.count(7) == 1 else "NO")) | abc = list(map(int, input().split()))
if abc.count(5) == 2 and abc.count(7) == 1: print("YES")
else: print("NO") | p04043 |
ABC = list(map(int,input().split()))
print(("YES" if ABC.count(5)==2 and ABC.count(7)==1 else "NO")) | X = list(map(int,input().split()))
print(("YES" if X.count(5)==2 and X.count(7)==1 else "NO")) | p04043 |
a = list(map(int,input().split()))
b = sorted(a)
print(('YES' if b[0]==5 and b[1]==5 and b[2]==7 else 'NO')) | a = input().split()
b = sorted(a)
if b == ['5','5','7']:
print('YES')
else:
print('NO') | p04043 |
print((["NO","YES"][eval(input().replace(" ","*"))==175])) | a,b,c=list(map(str,input().split()))
s=a+b+c
if s.count("5")==2 and s.count("7")==1:
print("YES")
else:
print("NO") | p04043 |
a,b,c = list(map(int, input().split()))
print(('YES' if a+b+c==17 else 'NO')) | a = [int(_) for _ in input().split()]
a.sort()
print(('YES' if a[0]==a[1]==5 and a[2]==7 else 'NO')) | p04043 |
a,b,c=sorted(map(int,input().split()))
print((["NO","YES"][a==b==5 and c==7])) | a,b,c=sorted(input().split())
print((["NO","YES"][a==b=="5" and c=="7"])) | p04043 |
#ABC42 A
#リストで書いた場合
myList=[]
myList_int=[]
myList=input().split() #split()でリストに入力をstrで入れる
myList_int=[int(s) for s in myList] #intに変換
#print(myList)
if myList_int== [7,5,5]:
print("YES")
elif myList_int== [5,7,5] :
print("YES")
elif myList_int== [5,5,7] :
print("YES")
else:
print("NO"... | myList=[]
myList_int=[]
myList=input().split() #split()でリストに入力をstrで入れる
myList_int=[int(s) for s in myList] #intに変換
#print(myList)
if myList_int== [7,5,5]:
print("YES")
elif myList_int== [5,7,5] :
print("YES")
elif myList_int== [5,5,7] :
print("YES")
else:
print("NO") | p04043 |
ABC=list(map(int,input().split()))
print(("YES" if ABC.count(5)==2 and ABC.count(7)==1 else "NO"))
| ABC=input().split()
if ABC.count("5")==2 and ABC.count("7")==1:
print("YES")
else:
print("NO")
| p04043 |
# -*- coding: utf-8 -*-
if __name__ == "__main__":
# str_list = [map(int, input().split())]
# if str_list.count(5) == 2 and str_list.count(7) == 1:
# print('YES')
# else:
# print('NO')
str_list = list(map(int, input().split()))
if sum(str_list) == 17:
print('YES')
... | # -*- coding: utf-8 -*-
if __name__ == "__main__":
str_list = list(map(int, input().split()))
if sum(str_list) == 17:
print('YES')
else:
print('NO')
| p04043 |
# ABC158 A
def main():
list = input().split()
list.sort()
if ''.join(list) == '557':
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
| def main():
list = input().split()
list.sort()
if ''.join(list) == '557':
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
| p04043 |
List=list(map(int,input().split()))
print(('YES' if List.count(7)==1 and List.count(5)==2 else 'NO')) | l=list(input().split())
print(('YES' if l.count('5')==2 and l.count('7')==1 else 'NO')) | p04043 |
l = list(input().split())
five = 0
seven = 0
for i in l:
if i == '5':
five += 1
elif i == '7':
seven += 1
else:
pass
if five == 2 and seven == 1:
print('YES')
else:
print('NO') | l = list(map(int, input().split()))
print((['NO', 'YES'][l.count(5) == 2 and l.count(7) == 1])) | p04043 |
import sys
a=list(map(int,input().split()))
s=0
f=0
for i in range(3):
s+=a[i]
if s!=17:
print('NO')
sys.exit()
else:
for t in range(3):
if a[t]==5:
f+=1
if f==2:
print('YES')
else:
print('NO')
| a=list(map(int,input().split()))
b=a[0]+a[1]+a[2]
c=a[2]-a[1]-a[0]
if b==17 and (c==-7 or c==-3):
print('YES')
else:
print('NO')
| p04043 |
def slove():
import sys, collections
input = sys.stdin.readline
a = dict(collections.Counter(list(map(int, input().rstrip('\n').split()))).most_common())
print(("YES" if a[5] == 2 and a[7] == 1 else "NO"))
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
a = "".join(sorted(list(map(str, str(input().rstrip('\n')).split()))))
print(("YES" if a == "557" else "NO"))
if __name__ == '__main__':
slove()
| p04043 |
S = list(map(int, input().split()))
S.sort()
if S[0] == 5 and S[1] == 5 and S[2] == 7:
print("YES")
else:
print("NO") | L = list(map(int, input().split()))
L.sort()
if L[0]==5 and L[1]==5 and L[2] == 7:
print("YES")
else:
print("NO") | p04043 |
import math
import queue
import bisect
import heapq
import time
import itertools
mod = int(1e9+7)
def swap(a,b):
return (b,a)
def gcd(a,b): #最大公約数
if (a<b):
a,b = swap(a,b)
if (b==0):
return a
else:
return gcd(b,a%b)
def divisors(a): # 約数列挙
divisors =... | # import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
mod = int(1e9+7)
class Library():
@staticmethod
def Swap(a,b):
return [b,a]
@staticmethod
def myRound(a,dig=0): # 四捨五入
# dig => 桁数
# dig = 1 => 10の位
... | p04043 |
ABC = list(map(int, input().split()))
if ABC.count(5) == 2 and ABC.count(7):
print('YES')
else:
print('NO') | ABC = list(map(int, input().split()))
if ABC.count(5) == 2 and ABC.count(7) == 1:
print('YES')
else:
print('NO') | p04043 |
l = list(map(int, input().split()))
l.sort(reverse=True)
if l[0] == 7 and l[1] == 5 and l[2] == 5:
print('YES')
else:
print('NO') | a = list(map(int, input().split()))
cnt_5 = 0
cnt_7 = 0
for i in a:
if i == 5:
cnt_5 += 1
if i == 7:
cnt_7 += 1
if cnt_5 == 2 and cnt_7 == 1:
print('YES')
else:
print('NO') | p04043 |
go=0
nana=0
num = input().split()
for i in num:
if i == "5":
go+=1
if i == "7":
nana+=1
if (go==2) and (nana==1):
print("YES")
else:
print("NO") | num = input().split()
go = 0
nana = 0
for i in num:
if i == "5":
go+=1
if i == "7":
nana+=1
if (go==2) and (nana==1):
print("YES")
else:
print("NO")
| p04043 |
input1 = list(map(int,input().split()))
A = input1[0]
B = input1[1]
C = input1[2]
if A == 5:
if B == 5 and C == 7:
print("YES")
elif B == 7 and C == 5:
print("YES")
else:
print("NO")
elif A == 7:
if B == 5 and C == 5:
print("YES")
else:
print("NO")
else:
print("NO") | a,b,c=list(map(int,input().split()))
print(("YES" if a*b*c==175 else "NO")) | p04043 |
a,b,c=list(map(int, input().split()))
if a==5 and b==5 and c==7:
print('YES')
elif a==5 and b==7 and c==5:
print('YES')
elif a==7 and b==5 and c==5:
print('YES')
else:
print('NO') | myList = list(map(int, input().split()))
if myList.count(5)==2 and myList.count(7)==1:
print('YES')
else:
print('NO') | p04043 |
A = sorted([int(i) for i in input().split()])
print(('YES' if A == [5, 5, 7] else 'NO')) | A = sorted(input().split())
print(('YES' if A == ['5', '5', '7'] else 'NO')) | p04043 |
l = input().split()
print(("YES" if sorted(l) == ['5', '5', '7'] else "NO")) | l = list(map(int, input().split()))
print(("YES" if sorted(l) == [5, 5, 7] else "NO")) | p04043 |
N,A,B,C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float('inf')
for i in range(1<<N):
for j in range(1<<N):
a,b,c = [],[],[]
cost = 0
for keta in range(N):
bit_i = i&(1<<keta)
bit_j = j&(1<<keta)
if bit_i... | from itertools import product
N,A,B,C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float('inf')
for p in product(list(range(4)), repeat=N): # 4^Nループ
take = [[] for _ in range(4)] # [A,B,C,使わない]
for i in range(N):
take[p[i]].append(L[i])
a,b,c = take[0],t... | p03111 |
# 8重for
# N,A,B,C = 5,100,90,80
# L = [98,40,30,21,80]
N,A,B,C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float('inf')
for i1 in range(4):
for i2 in range(4):
for i3 in range(4):
for i4 in range(4):
for i5 in range(4):
... | # DFS
# N,A,B,C = 5,100,90,80
# L = [98,40,30,21,80]
N,A,B,C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float('inf')
def dfs(cur,a,b,c)->int:
if cur==N:
if min(a,b,c)>0: return abs(a-A)+abs(b-B)+abs(c-C)-30
else: return float('inf')
... | p03111 |
n, a, b, c = list(map(int, input().split()))
l = []
for _ in range(n):
l.append(int(eval(input())))
def dfs(depth, t, ans):
if depth == n:
sum = calc(t)
if sum < ans:
return sum
else:
return ans
for j in range(4):
tt = t.copy()
... | N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
INF = 10**12
def dfs(depth, a, b, c):
if depth == N:
return abs(A - a) + abs(B - b) + abs(C - c) - 30 if min(a, b, c) > 0 else INF
res1 = dfs(depth + 1, a, b, c)
res2 = dfs(depth + 1, a + l[depth], b, ... | p03111 |
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
def solve(X):
if not ("1" in X and "2" in X and "3" in X):
return 1e10
MS = [[L[i] for i in range(N) if X[i] == j] for j in "123"]
ret = 1e10
ret = min(ret, solve2(MS[0], A) + solve2(MS[1], B) + ... | N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
def solve(X):
if not ("1" in X and "2" in X and "3" in X):
return 1e10
MS = [[L[i] for i in range(N) if X[i] == j] for j in "123"]
ret = 1e10
A_ans = []
B_ans = []
C_ans = []
for i... | p03111 |
n,a,b,c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
answer = a+b+c
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 i in range(1, 4**n):
aa = []
bb = []
cc = []
four = list(str(Base_10_to_n(i,4).z... | #!/usr/bin/env python3
import sys
import itertools
def solve(N: int, A: int, B: int, C: int, l: "List[int]"):
# 0: 使わない 1:A 2:B 3:C
all = list(itertools.product([0,1,2,3], repeat=N))
answer = 10**9
for a in all:
a_sum = 0
a_count = 0
b_sum = 0
b_count = 0
... | p03111 |
def main():
#入力をとる
n,a,b,c = list(map(int,input().split()))
moto = [int(eval(input())) for i in range(n)]
take = []
take.append(a)
take.append(b)
take.append(c)
mp = 10000000000
pt= []
#全探索
for i in range(2**(2*n)):
pt = []
for j in range(n):
... | minmp = 10000000
def dfs(depth, pt):
if depth==n:
mp_tmp = 0
all_used = True
for k in range(3):
if pt.count(k) == 0:
all_used = False
break
sum_tmp = 0
mp_tmp += (pt.count(k) - 1)*10
for l in range... | p03111 |
N,A,B,C = list(map(int, input().split()))
bamboos = [int(eval(input())) for _ in range(N)]
#print("---", bamboos)
ans = float("inf")
def solve(lst, idx):
global ans
if idx == N:
#print("qqqqq")
for i in range(3):
if len(lst[i]) == 0:
return
... |
N,A,B,C = list(map(int, input().split()))
bamboos = [int(eval(input())) for _ in range(N)]
#print("---", bamboos)
INF = float("inf")
ans = INF
def solve(idx, cnt_merge, a, b, c):
if idx == N:
if min(a,b,c) > 0:
return abs(A - a) + abs(B - b) + abs(C - c) + 10 * (cnt_merge-3)
... | p03111 |
N, A, B, C = list(map(int, input().split()))
bamboos = []
for _ in range(N):
l = int(eval(input()))
bamboos.append(l)
ABC = [A, B, C]
import itertools
import sys
ans = sys.maxsize
executed = set()
for i in range(3, N+1):
for bamboos_rearranged in itertools.permutations(bamboos, i):
... | N, A, B, C = list(map(int, input().split()))
bamboos = []
for _ in range(N):
l = int(eval(input()))
bamboos.append(l)
import copy
def dfs(i, bs):
if i == len(bamboos):
#print(bs)
if not bs['A'] or not bs['B'] or not bs['C']:
return []
return [bs]
... | p03111 |
import itertools
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for n in range(N)]
P = []
for n in range(1, N + 1):
P.extend(itertools.combinations([n for n in range(N)], n))
add_len = {s: sum(L[i] for i in s) for s in P}
def cost(v, s):
return 10 * (len(s) - 1) + abs(v -... | import itertools
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for n in range(N)]
P = []
for n in range(1, N + 1):
P.extend(itertools.combinations([n for n in range(N)], n))
add_len = {s: sum(L[i] for i in s) for s in P}
def cost(v, s):
return 10 * (len(s) - 1) + abs(v -... | p03111 |
from itertools import permutations
def main():
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
# full search
ans = 10**9
for perm in permutations(l):
cost = -30
for i in range(1, n-1):
cost1 = cost + 10 * len(perm[:i]) ... | from itertools import product
from sys import stdin
input = stdin.buffer.readline
def main():
n, *abc = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 10**9
for prod in product([0, 1, 2, 3], repeat=n):
cost = 10 * (n-3)
lengths = [0, 0, 0]
... | p03111 |
n,a,b,c = list(map(int,input().split()))
L = [int(eval(input())) for i in range(n)]
MP = []
for i in range(4**n):
i_bit = bin(i)[2:].zfill(2*n)
co_a = 0
co_b = 0
co_c = 0
p_a = 0
p_b = 0
p_c = 0
for j in range(n):
if i_bit[-1-2*j:-3-2*j:-1] == '00':
co_a ... | N,A,B,C = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
minmp = 10**18
for i in range(4**N):
mp = 0
a = []
b = []
c = []
d = []
for j in range(N):
if i>>(2*j) & 1:
if i>>(2*j+1) & 1:
a.append(j)
el... | p03111 |
# ABC119C - Synthetic Kadomatsu
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for i in range(N)]
INF = float('inf')
def dfs(cursor=0, a=0, b=0, c=0): # cursor:カーソル a,b,c:現在の竹の長さ
if cursor == N: # cursorが最後まで行ったら終了する。
return abs(a - A) + abs(b - B) + abs(c - C) - 30 if min(... | n, *goals = list(map(int, input().split()))
bamboos = list(map(int, [input().rstrip() for _ in range(n)]))
def get_best(li, goal):
bam_mp_lis = {0: (-10, tuple())}
li.sort()
for i, v in enumerate(li):
tmp = bam_mp_lis.copy()
for bam, (mp, lis) in list(tmp.items()):
b0... | p03111 |
import sys
from copy import deepcopy
def input(): return sys.stdin.readline().strip()
"""
この関数、xxxxxxxxxをaaabbbcccやaabbbbbbcみたいに分けるのには使えるけど
abcabcabcみたいに入り混じった場合が出てこないからだめだ。。。
def func(n): # 和がnになるような３つの数字の組を全列挙
arr = []
for i in range(1, n - 1):
for j in range(1, n - i):
arr.a... | import sys
def input(): return sys.stdin.readline().strip()
def main():
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
"""
解答方針は正しかったが、選んだ竹のA,B,Cへの割り振り方の実装にてこずったので、
潔く模範解答を写経することにする。
こういう全列挙は再帰を使うと超あっさり書けるのは聞いてたけど、まだ実践力が足らぬ。。
再帰を木構造に書き表... | p03111 |
#18:51
n,A,B,C = list(map(int,input().split()))
D = [A,B,C]
l = []
for _ in range(n):
l.append(int(eval(input())))
l.sort(reverse=True)
def nex(time):
for i in range(n-1,-1,-1):
if time[i] < 3:
time[i] += 1
break
else:
time[i] = 0
else:
time = 'over'
return time
#p... | n,A,B,C = list(map(int,input().split()))
D = [A,B,C]
def nex(time):
for i in range(n):
if time[i] < 3:
time[i] += 1
break
else:
time[i] = 0
else:
time = 'over'
return time
boo = []
for _ in range(n):
boo.append(int(eval(input())))
can = []
time = [0 for _ in range(n... | p03111 |
n,a,b,c = list(map(int,input().split()))
la = [a,b,c]
lt = [int(eval(input())) for i in range(n)]
import itertools as it
ans = 3000
for p in it.product(list(range(4)),repeat=n):
ll = [0]*4
lc = [0]*4
for i in range(n):
ll[p[i]] += lt[i]
lc[p[i]] += 1
if lc[0]*lc[1]*lc[2] > 0:
mp = 10*(... | import sys
input = sys.stdin.readline
n,a,b,c = list(map(int,input().split()))
la = [a,b,c]
lt = [int(eval(input())) for i in range(n)]
import itertools as it
ans = 3000
for p in it.product(list(range(4)),repeat=n):
ll = [0]*4
lc = [0]*4
for i in range(n):
ll[p[i]] += lt[i]
lc[p[i]] += 1
... | p03111 |
def change_base(n, base):
q = n // base
r = n % base
if q == 0:
return str(r)
return change_base(q, base) + str(r)
N, A, B, C = list(map(int, input().split()))
target = [A, B, C]
l = [int(eval(input())) for _ in range(N)]
ans = float('inf')
for n in range(4**N):
bit = change_b... | def dfs(i, a, b, c):
if i == N:
return abs(a-A) + abs(b-B) + abs(c-C) - 30 if min(a, b, c) > 0 else float('inf')
mx = dfs(i+1, a, b, c)
ma = dfs(i+1, a+l[i], b, c) + 10
mb = dfs(i+1, a, b+l[i], c) + 10
mc = dfs(i+1, a, b, c+l[i]) + 10
return min(mx, ma, mb, mc)
N, A, B, C = l... | p03111 |
import sys
sys.setrecursionlimit(10**9)
def search(arr,arr2,cost,flag):
global mincost
if cost>mincost:
return 0
if flag==0:
if len(arr2)==0:
ans.add(cost)
if mincost>cost:
mincost=cost
return 0
for i in range(len(arr)):
search(arr[:i]+arr[i+1:],arr2[1:],... | import collections
from copy import deepcopy
n,a,b,c=list(map(int,input().split()))
arr=[int(eval(input())) for _ in range(n)]
l=collections.deque()
l.append([[],[],[]])
cnt=0
while 1:
if cnt==n:
break
base=l.popleft()
if len(base[0])==0 and len(base[1])==0 and len(base[2])==0:
l.append([[... | p03111 |
import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N, A, B, C = in_nn()
l = list(map(int, read().rstrip().spl... | import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N, A, B, C = in_nn()
l = list(map(int, read().rstrip().spl... | p03111 |
N, A, B, C = list(map(int, input().split(" ")))
l = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
def dfs(cnt, a, b, c):
if cnt == N:
return abs(a-A)+abs(b-B)+abs(c-C)-30 if min(a,b,c)>0 else INF
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+... | N,A,B,C = list(map(int, input().split()))
l = [0]*N
for i in range(N):
l[i] = int(eval(input()))
def dfs(i,a,b,c):
if i == N:
if a==0 or b==0 or c==0:
return 100000
else:
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return min(dfs(i+1,a+l[i],b,c)+10,... | p03111 |
from collections import deque
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
minMP = 10**5
p = deque()
p.append([-1] * len(L))
while p:
stats = p.pop()
stats = list(stats)
a, b, c = 0, 0, 0
MP = 0
cntA = 0; cntB = 0; cntC = 0
for i in rang... | N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
INF = float('inf')
def dfs(cursor=0, a=0, b=0, c=0):
if cursor == N:
return abs(a-A) + abs(b-B) + abs(c-C) - 30 if a*b*c > 0 else INF
no_compound = dfs(cursor+1, a, b, c)
A_compound = dfs(cursor+1, a+L... | p03111 |
n, *abc = [int(x) for x in input().split()]
l = [int(eval(input())) for i in range(n)]
A = 0; B = 1; C = 2;
minmp = 10 ** 9
for k in range(2 ** (2 * n)):
mat = [[], [], [], []] # mat[0]:= Aの材料, mat[1]:=Bの材料, mat[2]:=Cの材料
# for i = 0, ..., N-1
# kの 2*i & 2*i+1ビット目が 0b00: l[i]はAに使う
# ↑lsbから... | n, *abc = [int(x) for x in input().split()]
l = [int(eval(input())) for i in range(n)]
A = 0; B = 1; C = 2;
minmp = 10 ** 9
for k in range(2 ** (2 * n)):
mat = [[], [], [], []] # mat[0]:= Aの材料, mat[1]:=Bの材料, mat[2]:=Cの材料
# for i = 0, ..., N-1
# kの 2*i & 2*i+1ビット目が 0b00: l[i]はAに使う
# ↑lsbから... | p03111 |
from itertools import product
def solve(NUM, LIST):
lst = [l[i] for i, t in enumerate(LIST) if t == NUM]
if len(lst) == 0:
return 10 ** 5
ANS = (len(lst) - 1) * 10
ANS += abs(sum(lst) - tgt[NUM])
return ANS
tgt = list(map(int, input().split()))
l = [int(eval(input())) for _ in r... | from itertools import product
def solve(T, PTTN):
lst = [l[i] for i, t in enumerate(PTTN) if t == T]
if lst:
ANS = (len(lst) - 1) * 10
ANS += abs(sum(lst) - tgt[T])
return ANS
return 10 ** 5
tgt = list(map(int, input().split()))
l = [int(eval(input())) for _ in range... | p03111 |
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,a,b,c=list(map(int,input().split()))
L=[]
for _ in range(n):
L.append(int(eval(input())))
ans=99999
for i in range(4**len(L)):
i_4_list=list(Base_10_to_n(i, 4).zfill(len(L)))
at,... | N,A,B,C=list(map(int,input().split()))
L = []
for i in range(N):
L.append(int(eval(input())))
def dfs(n,a,b,c):
if n == N:
if min(a,b,c)>0:
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return 10000
root1=dfs(n+1,a+L[n],b,c)+10
root2=dfs(n+1,a,b+L[n],c)+... | p03111 |
import sys
sys.setrecursionlimit(1000000000)
INF=10**9
n,a,b,c=list(map(int,input().split()))
l=[int(eval(input())) for i in range(n)]
def dfs(i,x,y,z,m):
if i==n:
if x>0 and y>0 and z>0:
return abs(x-a)+abs(y-b)+abs(z-c)+m
else:
return INF
ans=INF
if x==0... | import sys
sys.setrecursionlimit(1000000000)
INF=10**9
n,a,b,c=list(map(int,input().split()))
l=[int(eval(input())) for i in range(n)]
def dfs(i,x,y,z):
if i==n:
if min(x,y,z)>0:
return abs(x-a)+abs(y-b)+abs(z-c)-30
else:
return INF
ans=dfs(i+1,x,y,z)
ant=... | p03111 |
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 10**9
for m in range(4**n):
length = [0, 0, 0, 0]
counts = [0, 0, 0, 0]
for d in range(n-1, -1, -1):
i = m//(4**d)
length[i] += l[d]
counts[i] += 1
m %= 4**d
... | inf = 10**9
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
def dfs(i, a_cur, b_cur, c_cur):
if i == n:
return abs(a_cur-a) + abs(b_cur-b) + abs(c_cur-c) - 30 if min(a_cur, b_cur, c_cur) > 0 else inf
ans0 = dfs(i+1, a_cur+l[i], b_cur, c_cur) + 10
ans1... | p03111 |
n,a,b,c,*L = list(map(int,open(0).read().split()))
L.sort(reverse = True)
from itertools import product
from copy import deepcopy
li1 = [4,1,2,3]
ans = 10**10
for v in product(li1,repeat = n):
#print(v)
num = 0
A,B,C,NO = [],[],[],[]
for i in range(n):
if v[i] == 1:
#if... | from itertools import product
n,a,b,c,*L = list(map(int,open(0).read().split()))
li1 = [1,2,3,4]
ans = 10**10
for v in product(li1,repeat = n):
num = 0
A,B,C = [],[],[]
for i in range(n):
if v[i] == 1:
A.append(L[i])
elif v[i] == 2:
B.append(L[i])
... | p03111 |
N, *ABC = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
#print(min(min(func(l, abc)) for abc in [[A,B,C], [A,C,B], [B,A,C], [B,C,A], [C,A,B], [C,B,A]]))
def func(l, ABC, point=0):
if len(ABC)==0:
yield point
else:
x = ABC[0]
p = min(abs(x-y) for y i... | N, *ABC = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
def grouping(l, g, h, k):
if all(len(x)>0 for x in [g, h, k]):
yield g, h, k
if len(l)>0:
a, *l = l
yield from grouping(l, g+[a], h, k)
yield from grouping(l, g, h+[a], k)
yield ... | p03111 |
import sys
from itertools import product
inf = float('inf')
n, *target = list(map(int, sys.stdin.readline().split()))
target = [None] + target
*l, = list(map(int, sys.stdin.read().split()))
def main():
costs = []
for p in product(list(range(4)), repeat=n):
tmp = [[] for _ in range(4)]
... | import sys
from itertools import product
n, *abc = list(map(int, sys.stdin.readline().split()))
*l, = list(map(int, sys.stdin.read().split()))
def main():
cand = []
for p in product([0, 1, 2, 3], repeat=n):
group = [[] for _ in range(4)]
for i in range(n):
group[p[i]].ap... | p03111 |
import sys
from functools import lru_cache
inf = float('inf')
n, A, B, C, *l = list(map(int, sys.stdin.read().split()))
@lru_cache(None)
def cost(a, b, c, cnt, i):
if i == n:
if not (a and b and c): return inf
return abs(A - a) + abs(B - b) + abs(C - c) + 10 * (cnt - 3)
return min(c... | import sys
inf = float('inf')
n, A, B, C, *l = list(map(int, sys.stdin.read().split()))
def cost(a, b, c, cnt, i):
if i == n:
if not (a and b and c): return inf
return abs(A - a) + abs(B - b) + abs(C - c) + 10 * (cnt - 3)
return min(cost(a, b, c, cnt, i+1),
cost(a+l[i... | p03111 |
import sys
# import bisect
from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
import itertools
from operator import attrgetter, itemgetter
# import math
# import numpy as np
readline = sys.stdin.readline
MOD =... | import sys
# import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
import itertools
# from operator import attrgetter, itemgetter
# import math
# import numpy as np
readline = sys.stdin.readline
MOD =... | p03111 |
from sys import setrecursionlimit
setrecursionlimit(10 ** 9)
n, a, b, c = [int(i) for i in input().split()]
L = [int(eval(input())) for i in range(n)]
INF = 10 ** 9
def dfs(i, L, A):
if all(a == 0 for a in A):
return 0
if n - L.count(0) < 3:
return INF
if i == n:
ret... | from sys import setrecursionlimit
setrecursionlimit(10 ** 9)
N, A, B, C = [int(i) for i in input().split()]
L = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
def dfs(n, a, b, c):
if n == N:
return abs(a-A) + abs(b-B) + abs(c-C) - 30 if min(a, b, c) > 0 else INF
res = dfs(n+1, a+L[n]... | p03111 |
import sys
sys.setrecursionlimit(10**7)
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = []
def f(i, anum, alen, bnum, blen, cnum, clen):
if i == n:
if alen * blen * clen == 0:
return
mp = abs(anum-a)+10*(alen-1) + abs(bnum-b)+10*... | import sys
sys.setrecursionlimit(10**7)
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
mp = float('inf')
def f(i, anum, alen, bnum, blen, cnum, clen):
global mp
if i == n:
if alen * blen * clen == 0:
return
mp = min(mp, abs(anum-... | p03111 |
N,A,B,C = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
from itertools import product
ans = float("inf")
for p in product(list(range(4)),repeat=N):
a = [L[i] for i in range(N) if p[i]==1]
b = [L[i] for i in range(N) if p[i]==2]
c = [L[i] for i in range(N) if p[i]==3]
... | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# --------------------------------------... | p03111 |
N,A,B,C = list(map(int,input().split()))
l = [int(eval(input())) for i in range(N)]
INF = 10**9+7
def dfs(count,a,b,c):
if count == N:
if min(a,b,c) > 0:
return abs(a-A)+abs(b-B)+abs(c-C)-30
else:
return INF
non = dfs(count+1,a,b,c)
useA = dfs(count+1,a+l[count],b,c)+10
useB = dfs(count+1,a,b... | N,A,B,C = list(map(int,input().split()))
L = [int(eval(input())) for i in range(N)]
def dfs(cnt,la,lb,lc,cost):
if cnt == N:
if la == 0 or lb == 0 or lc == 0:
return 10**10
else:
return cost+abs(A-la)+abs(B-lb)+abs(C-lc)-30
else:
a = dfs(cnt+1,la+L[cnt]... | p03111 |
n,a,b,c = list(map(int,input().split()))
l = [int(eval(input())) for i in range(n)]
def dfs(cnt,A,B,C):
if cnt == n:
if min(A,B,C) == 0:
return float('inf')
else:
return abs(a-A)+abs(b-B)+abs(c-C)-30
else:
ret1 = dfs(cnt+1,A+l[cnt],B,C)+10
ret2 =... | N,A,B,C = list(map(int,input().split()))
L = [int(eval(input())) for i in range(N)]
def dfs(i,la,lb,lc,cost):
if i == N:
if la*lb*lc == 0:
return 10**20
else:
return abs(A-la)+abs(B-lb)+abs(C-lc)-30+cost
ret1 = dfs(i+1,la+L[i],lb,lc,cost+10)
ret2 = dfs(i+1,la... | p03111 |
N = 0
N, A, B, C = [int(s) for s in input().split()]
bamboos = [int(eval(input())) for _ in range(N)]
def divide(l):
if len(l) == 0:
return []
if len(l) == 1:
return [
[[], [], []], # 使わない
[[l[0]], [], []], # A で使う
[[], [l[0]], []], # B で使う
... | N = 0
N, A, B, C = [int(s) for s in input().split()]
bamboos = [int(eval(input())) for _ in range(N)]
# def divide(l):
# if len(l) == 0:
# return []
# if len(l) == 1:
# return [
# [[], [], []], # 使わない
# [[l[0]], [], []], # A で使う
# [[], [l[0]]... | p03111 |
ri = lambda: int(eval(input()))
rl = lambda: list(map(int,input().split()))
N,A,B,C=rl()
l=[0]*N
for i in range(N):
l[i] = ri()
ans = float('inf')
for n in range(4**N):
a,b,c=0,0,0
ans_ = 0
for i in range(N):
sn = format(n>>(2*i),'0{}b'.format(N))[-2:]
if sn=='01':
... | ri = lambda: int(eval(input()))
rl = lambda: list(map(int,input().split()))
N,A,B,C=rl()
l=[ri() for _ in range(N)]
ans = 10**18
import itertools
for seq in itertools.product(list(range(4)),repeat=N):
a,b,c=0,0,0
rst = 0
for i in range(N):
if seq[i]==1:
a+=l[i]
... | p03111 |
# -*- coding: utf-8 -*-
import itertools
INF = 1e10
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = INF
for prod in itertools.product('NABC', repeat=N):
if not ('A' in prod and 'B' in prod and 'C' in prod):
continue
D = {'A': [], 'B': [], 'C... | # -*- coding: utf-8 -*-
import itertools
INF = 1e10
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = INF
for prod in itertools.product('NABC', repeat=N):
if not ('A' in prod and 'B' in prod and 'C' in prod):
continue
D = {'A': [], 'B': [], 'C... | p03111 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03111 |
from itertools import product
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | p03111 |
from itertools import*
n,a,b,c,*l=list(map(int,open(0).read().split()))
d=[a,b,c]
ans=float("inf")
for i in product(list(range(4)),repeat=n):
take=[[],[],[]]
for k,j in enumerate(i): #0を捨てる
if j!=0:
take[j-1].append(l[k])
if all(take):
take2=list(map(sum,take))
... | from itertools import*
n,a,b,c,*l=list(map(int,open(0).read().split()))
ans=float("inf")
for i in product(list(range(4)),repeat=n): #3を捨てる
take=[[],[],[]]
for k,j in enumerate(i):
if j==3:
continue
take[j].append(l[k])
*tmp,=list(map(len,take))
if all(tmp):
... | p03111 |
import itertools
N,A,B,C = list(map(int,input().split()))
comb = [] #0:使用しない,1:竹Aの材料,2:竹Bの材料,3:竹Cの材料
L = []
for i in range(N):
l = int(eval(input()))
L.append(l)
comb.append([0,1,2,3])
All_comb = list(itertools.product(*comb))
min_MP = float('inf')
for i in range(len(All_comb)):
tmp = All_comb[i... | import itertools
N,A,B,C = list(map(int,input().split()))
Comb = itertools.product([0,1,2,3],repeat=N)
L = []
for i in range(N):
l = int(eval(input()))
L.append(l)
# 各竹について
# 0 : 使用しない
# 1 : 竹Aの材料にする
# 2 : 竹Bの材料にする
# 3 : 竹Cの材料にする
# 竹A,B,Cの作成法 :
# とりあえず全部合成 → 目的の長さに合わせる
ans = float('inf'... | p03111 |
import itertools
n,a,b,c=(list(map(int,input().split())))
l=[int(eval(input())) for i in range(n)]
ans=10**9
for k in itertools.product(list(range(4)),repeat=n):
A=[[] for i in range(4)]
for i in range(n):
A[k[i]]+=[l[i]]
if A[1] and A[2] and A[3]:
tmp=10*(n-len(A[0])-3)
tm... | 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):
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)
ret1 = dfs(cur+1,a+l[cur],b,c)+10
ret2 = dfs(cur+1,a,b+l[cur],c)+10
ret3 = dfs(cur+1,a,b,c... | p03111 |
n, A, B, C = (int(i) for i in input().split())
l = [int(eval(input())) for i in range(n)]
a = []
b = []
c = []
def furiwake(x):
global a
global b
global c
a = []
b = []
c = []
for i in range(1, n+1):
if dig4(x, i) == 0:
a.append(l[i-1])
if dig4(x,... | 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):
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)
ret1 = dfs(cur + 1, a + l[cur], b, c) + 10
ret2 = dfs(cur +... | p03111 |
from itertools import product
from collections import Counter as ct
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 10 ** 10
for bit in product([0, 1, 2, 3], repeat=n):
if len(set(bit) - {0}) != 3:
continue
tmpa = 0
tmpb = 0
tmpc = 0
... | from itertools import product
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 10 ** 10
for bit in product([0, 1, 2, 3], repeat=n):
tmp = [0] * 4
mp = 0
for i, j in enumerate(bit):
if j != 3 and tmp[j] != 0:
mp += 10
tmp[... | p03111 |
from itertools import product
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 10 ** 10
for bit in product([0, 1, 2, 3], repeat=n):
tmp = [0] * 4
mp = 0
for i, j in enumerate(bit):
if j != 3 and tmp[j] != 0:
mp += 10
tmp[... | # dfs版
def dfs(d, A, B, C, f):
global ans
if d == n:
if not 0 in [A, B, C]:
ans = min(ans, abs(a - A) + abs(b - B) + abs(c - C) + f - 30)
return
dfs(d + 1, A, B, C, f)
dfs(d + 1, A + l[d], B, C, f + 10)
dfs(d + 1, A, B + l[d], C, f + 10)
dfs(d + 1, A, B, C +... | p03111 |
# ABC119C
# Synthetic Kadomatsu
Enter = list(map(int, input().split()))
N = Enter[0]
L = [int(eval(input())) for _ in range(N)]
ans = 10 ** 10
# 4 bist search
for i in range(4**N):
mask = i
NowCost = 0
Group = [[] * 4 for _ in range(4)]
for j in range(N-1, -1, -1):
Group[mask%4].... | 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:
if min(a, b, c) > 0:
return abs(a-A)+abs(b-B)+abs(c-C)-30
else:
return INF
ret1 = dfs(cur+1, a, b, c)
ret2 = dfs(cur... | p03111 |
import itertools
n, a, b, c = list(map(int, input().split()))
L = [int(eval(input()))for _ in range(n)]
L_perm = list(itertools.permutations(L))
ans = 10**9
for l in L_perm:
for i in range(1, n-1):
A_tree = l[:i]
synthesis_A = 10 * (i-1)
fix_A = abs(a-sum(A_tree))
for j... | import itertools
N, A, B, C = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = 10**9
for pattern in itertools.product(list(range(4)), repeat=N):
if not {1, 2, 3} <= set(pattern):
continue
trees = [0] * 3
synthesis_cost = -30
for num, length in zip(... | p03111 |
#!/usr/bin/env python3
import sys
INF = 10**9
def dfs(cur, l, ia, ib, ic):
if(cur == N):
return abs(ia-A) + abs(ib-B) + abs(ic-C) - 30 if min(ia,ib,ic) > 0 else INF
ret0 = dfs(cur+1, l, ia, ib, ic)
ret1 = dfs(cur+1, l, ia+l[cur], ib, ic) + 10
ret2 = dfs(cur+1, l, ia, ib+l[cur], i... | #!/usr/bin/env python3
import sys
INF = 10**9
def dfs(cur, ia, ib, ic):
if(cur == N):
return abs(ia-A) + abs(ib-B) + abs(ic-C) - 30 if min(ia,ib,ic) > 0 else INF
ret0 = dfs(cur+1, ia, ib, ic)
ret1 = dfs(cur+1, ia+l[cur], ib, ic) + 10
ret2 = dfs(cur+1, ia, ib+l[cur], ic) + 10
... | p03111 |
n, a, b, c = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(n)]
targets = [a, b, c]
ans = 10**9
from itertools import product
for comb in product([0, 1, 2, 3], repeat=n):
if len(set(comb)) in [1, 2]:
continue
# a, b, c
ls = [[], [], []]
for i, c in enumerate(c... | n, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(n)]
INF = 10**9
def rec(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 = rec(cur+1, a, b, c)
ret1 = rec(cur+1, a+L[cur], b, c) + 10
ret2 = rec(c... | p03111 |
N, A, B, C = list(map(int, input().split()))
L = []
for _ in range(N):
L.append(int(eval(input())))
ans = float('inf')
for mask in range(pow(4, N)):
cost = 0
for i, l in enumerate([A, B, C]):
grp = []
for digit in range(N):
if mask // pow(4, digit) % 4 == i:
... | from itertools import product
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = 10**18
for state in product(list(range(4)), repeat=N):
K = [[] for _ in range(4)]
for i, l in enumerate(L):
K[state[i]].append(l)
cost = 0
for d, D in zip((A... | p03111 |
n,a,b,c = list(map(int,input().split()))
L = []
for i in range(n):
L.append(int(eval(input())))
import itertools
ans = 10**9
tmp = 0
for perm in itertools.permutations(list(range(n)),3):
ua,ub,uc = perm
la,lb,lc = L[ua],L[ub],L[uc]
for use in itertools.product([0,1,2,-1] ,repeat=n-3):
... | n,a,b,c = list(map(int,input().split()))
L = []
for i in range(n):
L.append(int(eval(input())))
import itertools
ans = 10**9
tmp = 0
for use in itertools.product([0,1,2,-1] ,repeat=n):
tmp = 0
ls = [0,0,0]
for idx,u in enumerate(use):
if u>-1:
if ls[u] >0:
... | p03111 |
N,A,B,C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
INF = 1<<20
score = INF
import itertools
for ms in itertools.product(list(range(-1,3)), repeat=N):
lens = [0]*3
tmp_score = -30
for i, group in enumerate(ms):
if group>=0:
lens[group] += l[... | def main():
N,A,B,C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
INF = 1<<20
def perm(n, a, b, c):
if n == N:
if all([a, b, c]):
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return INF
... | p03111 |
N, A, B, C = [int(a) for a in input().split(" ")]
ls = [int(eval(input())) for i in range(N)]
tab = [([float("inf")]*N, ref) for ref in (A, B, C)]
INF = float("inf")
from heapq import heappush, heappop, heapreplace
maxtarg = max(A, B, C)
# O(n)
def solve(ls):
n = len(ls)
qs = [[(-INF, -1)]*3 for i in... | N, A, B, C = [int(a) for a in input().split(" ")]
ls = [int(eval(input())) for i in range(N)]
tab = [([float("inf")]*N, ref) for ref in (A, B, C)]
INF = float("inf")
from heapq import heappush, heappop, heapreplace
maxtarg = max(A, B, C)
# O(n)
def solve(ls):
n = len(ls)
qs = [[(-INF, -1)]*3 for i in... | p03111 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,a,b,c=list(map(int,input().split()))
L=[int(eval(input())) for _ in range(n)]
def dfs(v,Idx)->int:
# terminate condition
if(v==n):
s... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,a,b,c=list(map(int,input().split()))
L=[int(eval(input())) for _ in range(n)]
def dfs(v,Idx)->int:
# terminate condition
if(v==n):
s... | p03111 |
N, A, B, C= list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
K = 4
minmp = 1e8
for x in range(pow(4, N)):
v = x
c = [0] * K
s = [0] * K
i = 0
while v > 0:
m = v % K
c[m] += 1
s[m] += L[i]
i += 1
v //= K
if c[1... | N, *P = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
mp = sum(P) - 30
minmp = 1e10
Pcnt = [0] * 3
Ks = [-1] * N
while True:
i = N-1
while i >= 0:
pre = cur = Ks[i]
cur += 1
if cur >= 3:
cur = -1
Ks[i] = cur
... | p03111 |
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dum... | n, a, b, c = [int(it) for it in input().split()]
ls = [int(eval(input())) for it in range(n)]
def dfs(cur, tmpA, tmpB, tmpC):
if cur == n:
return abs(a - tmpA) + abs(b - tmpB) + abs(c - tmpC) if tmpA > 0 and tmpB > 0 and tmpC else 10**20
return min(
dfs(cur + 1, tmpA + ls[cur], tmpB, tmpC)... | p03111 |
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):
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)
ret1 = dfs(cur + 1, a + l[cur], b, c) + 10
... | 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 a * b * c != 0 else 10 ** 9
else:
ret0 = dfs(cur + 1, a, b, c)
reta = dfs(cur + 1, a + l[cur], b, c) + 10
... | p03111 |
from itertools import combinations
def f(in_A,in_B,in_C,A,B,C,ex_l,counter):
if (counter == len(ex_l)):
return abs(in_A-A)+abs(in_B-B)+abs(in_C-C)
else:
tmp = ex_l[counter]
counter +=1
a1 = f(in_A+tmp,in_B,in_C,A,B,C,ex_l,counter)+10
a2 = f(in_A,in_B+tmp,in_C,A,... | n,a,b,c = list(map(int,input().split()))
l = []
ans = []
for i in range(n):
l.append(int(eval(input())))
def f(x,y,z,arr,ca,cb,cc):
global a
global b
global c
global ans
if arr:
f(x + arr[0], y, z, arr[1:],ca+1,cb,cc)
f(x, y + arr[0], z, arr[1:],ca,cb+1,cc)
... | p03111 |
n,a,b,c = list(map(int,input().split()))
l = []
ans = []
for i in range(n):
l.append(int(eval(input())))
def f(x,y,z,arr,ca,cb,cc):
global a
global b
global c
global ans
if arr:
f(x + arr[0], y, z, arr[1:],ca+1,cb,cc)
f(x, y + arr[0], z, arr[1:],ca,cb+1,cc)
... | n,a,b,c = list(map(int,input().split()))
l = []
ans = []
for i in range(n):
l.append(int(eval(input())))
def f(x,y,z,arr,cnt):
global a
global b
global c
global ans
if arr:
f(x + arr[0], y, z, arr[1:],cnt+1)
f(x, y + arr[0], z, arr[1:],cnt+1)
f(x, y, z + ar... | p03111 |
#!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import ite... | #!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import it... | p03111 |
from itertools import product
import bisect
N, A, B, C = list(map(int, input().split()))
tl = [C,B,A]
ll = []
for _ in range(N):
ll.append(int(eval(input())))
ans = 10**8
ite = product(list(range(4)),repeat=N)
for pattern in ite:
bag = [[],[],[]]
singles = []
mp = 0
for i, p ... |
from itertools import product
def main():
n,a,b,c = list(map(int, input().split()))
targetl = [a,b,c]
targetl.sort()
ll = []
for _ in range(n):
l = int(eval(input()))
ll.append(l)
ans = 10**9
ite = product(list(range(4)),repeat=n)
ite = list(ite)
for... | p03111 |
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)
def f(a,A):
if len(a) == 0:
return 1e12
return (len(a)-1)*10 + abs(sum(a)-A)
N,A,B,C = list(map(int,input().split()))
l = [int(eval(input())) for i in range(N)]
ans = 1e12
fo... | 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)
def f(a,la,A):
if la == 0:
return 1e12
return (la-1)*10 + abs(a-A)
N,A,B,C = list(map(int,input().split()))
l = [int(eval(input())) for i in range(N)]
ans = 1e12
for i in ran... | p03111 |
import sys
#+++++
def aaa(ll,a,b,c):
ret=a+b+c
for i,v1 in enumerate(ll):
if v1==0:
continue
t1=abs(a-v1)
if ret < t1:
continue
for j,v2 in enumerate(ll):
if v2==0:
continue
if i==j:
continue
t2=t1 + abs(b-v2)
if ret < t2:
continue
for k,v3 in enumerate... | import sys
import queue
#+++++
def aaa(ll,a,b,c):
ret=a+b+c
for i,v1 in enumerate(ll):
if v1==0:
continue
t1=abs(a-v1)
if ret < t1:
continue
for j,v2 in enumerate(ll):
if v2==0:
continue
if i==j:
continue
t2=t1 + abs(b-v2)
if ret < t2:
continue
for k,v... | p03111 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.