input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
dp=[0]*100
dp[0],dp[1]=2,1
for i in range(90):
dp[i+2]=dp[i]+dp[i+1]
print((dp[int(eval(input()))])) | n=int(eval(input()))
dp=[0]*100
dp[0]=2
dp[1]=1
for i in range(90):
dp[i+2]=dp[i]+dp[i+1]
print((dp[n])) | p03544 |
N = int(eval(input()))
R = [None] * (N+1)
R[0] = 2
if N == 0:
print((R[0]))
exit()
R[1] =1
if N == 1:
print((R[1]))
exit()
if N >= 2:
for i in range(2, N+1):
R[i] = R[i-1] + R[i-2]
print((R[N])) | N = int(eval(input()))
R = [2, 1]
if N < 2:
print((R[N]))
exit()
for i in range(2, N+1):
R.append(R[i-1] + R[i-2])
print((R[N])) | p03544 |
n = int(eval(input()))
a, b = 2, 1
for _ in range(n):
a, b = b, a+b
print(a) | a,b = 2,1
n = int(eval(input()))
for _ in range(n-1):
a,b = b,a+b
print(b) | p03544 |
n = int(eval(input()))
l = [2,1]
for i in range(n+1):
l.append(l[i]+l[i+1])
print((l[n])) | n = int(eval(input()))
a = [2,1]
for i in range(2,n+2):
a.append(a[i-1]+a[i-2])
print((a[n])) | p03544 |
from functools import lru_cache
N = int(eval(input()))
@lru_cache(maxsize=None)
def luca(n):
if n == 0:
return 2
if n == 1:
return 1
return luca(n - 1) + luca(n - 2)
print((luca(N))) | n = int(eval(input()))
luca = [0]*(n+1)
luca[0] = 2
luca[1] = 1
for i in range(2, n+1):
luca[i] = luca[i-1] + luca[i-2]
print((luca[n]))
| p03544 |
a = int(eval(input()))
b = [2, 1]
for i in range(2, a+1):
b.append(b[i-1]+b[i-2])
print((b[a]))
| a = int(eval(input()))
b = [2, 1]
for i in range(1, a):
b.append(b[i] + b[i-1])
print((b[len(b)-1]))
| p03544 |
a,b=2,1
for i in range(int(eval(input()))):a,b=b,a+b
print(a) | N=int(eval(input()))
a,b=2,1
for i in range(N):
a,b=b,a+b
print(a) | p03544 |
N = int(eval(input()))
l = [2,1]
i = 2
while len(l)<N+1:
l.append(l[i-1]+l[i-2])
i+=1
print((l[N])) | n = int(eval(input()))
l = [0]*100
l[0] = 2
l[1] = 1
for i in range(2,100):
l[i] = l[i-1] + l[i-2]
print((l[n])) | p03544 |
N = int(eval(input()))
L = [0]*(N+1)
L[0],L[1]=2,1
for i in range(2,N+1):
L[i] = L[i-1]+L[i-2]
print((L[N])) | def solve():
ans = 0
N = int(eval(input()))
dp = [0]*(N+1)
dp[0]=2
dp[1]=1
for i in range(2,N+1):
dp[i] = dp[i-1]+dp[i-2]
return dp[-1]
print((solve())) | p03544 |
n = int(eval(input()))
cnt = 1
l = [2, 1]
while True:
cnt += 1
l.append(l[len(l)-1] + l[len(l)-2])
if cnt == n:
print((l[len(l) - 1]))
exit()
| n = int(eval(input()))
cnt = 1
l = [2, 1]
if n == 0:
print((2))
elif n == 1:
print((1))
else:
while True:
cnt += 1
l.append(l[len(l)-1] + l[len(l)-2])
if cnt == n:
print((l[len(l) - 1]))
exit()
| p03544 |
a = int(eval(input()))
b = []
for i in range(a+1):
if i==0:
b.append(2)
elif i==1:
b.append(1)
else:
b.append(b[i-2]+b[i-1])
else:
print((b[a])) | N = int(eval(input()))
L = [2,1]
for i in range(2,N+1):
L.append(L[i-2]+L[i-1])
print((L[N])) | p03544 |
n = int(eval(input()))
ans = 0
l = [2, 1]
for i in range(n-1):
l.append(l[i]+l[i+1])
print((l[n])) | n = int(eval(input()))
l = [2, 1]
for i in range(n-1):
l.append(l[i]+l[i+1])
print((l[n])) | p03544 |
N=int(eval(input()))
lst=[2,1]
for i in range(2,N+1):
lst.append(lst[i-1]+lst[i-2])
print((lst[N])) | N=int(eval(input()))
lucas=[2,1]
for i in range(2,N+1):
lucas.append(lucas[i-1]+lucas[i-2])
print((lucas[N])) | p03544 |
N = int(eval(input()))
L = [0] * 87
L[0], L[1] = 2, 1
for i in range(2, N+1):
L[i] = L[i-1] + L[i-2]
print((L[N])) | N = int(eval(input()))
L = [2, 1]
for i in range(2, N+1):
L.append(L[i-1]+L[i-2])
print((L[N])) | p03544 |
N = int(eval(input()))
L = [0] * 87
L[0] = 2
L[1] = 1
for i in range(2, len(L)):
L[i] = L[i - 1] + L[i - 2]
print((L[N]))
| import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
L = [-1] * 100
L[0] = 2
L[1] = 1
for i in range(2, 100):
L[i] = L[i - 1] + L[i - 2]
# print('L', L)
print((L[N]))
| p03544 |
N = int(eval(input()))
ans = [2,1]
for i in range(2,87):
ans.append(ans[i-1] + ans[i-2])
print((ans[N])) | N = int(eval(input()))
lucas = [0]*(N+1)
lucas[0] = 2
lucas[1] = 1
for i in range(N-1):
lucas[i+2] = lucas[i+1] + lucas[i]
print((lucas[N])) | p03544 |
n = int(eval(input()))
l = [2, 1]
for i in range(2, n + 1):
l.append(l[i - 2] + l[i - 1])
print((l[n])) | n = int(eval(input()))
if n == 1:
print((1))
else:
Li = 2
Lj = 1
cnt = 2
while True:
Lk = Li + Lj
if cnt == n:
print(Lk)
break
cnt += 1
Li = Lj
Lj = Lk | p03544 |
from itertools import combinations
D, G = list(map(int, input().split()))
PC = []
for i in range(D):
p, c = list(map(int, input().split()))
total = ((i + 1) * 100) * p + c
PC.append([p, c, total])
A = []
B = {i for i in range(D)}
for i in range(D+1):
A += list(combinations(B, i))
# prin... | D, G = list(map(int, input().split()))
PC = []
for i in range(D):
p, c = list(map(int, input().split()))
s = (i+1) * 100
PC.append([p, c, s])
P = []
for i in range(2 ** D):
b = format(i, 'b').zfill(D)
P.append(b)
def get_high_score_q(p):
if p.count('0') == 0:
return None
... | p03290 |
d,g = list(map(int,input().split()))
a = [list(map(int,input().split())) for _ in range(d)]
s = set(range(d))
ans = float("Inf")
x = []
for i in zip(*a):
x.append(list(i))
c = []
for i in range(2**d):
b = []
for j in range(d):
if i>>j & 1:
b.append(j)
c.append(b)
for i ... | d,g = list(map(int,input().split()))
ary = [list(map(int,input().split())) for _ in range(d)]
s = set(i for i in range(d))
ans = float("Inf")
for i in range(2**d):
a = []
total,count = 0,0
for j in range(d):
if i >> j & 1:
a.append(j)
for x in a:
total += 100*(x+1)... | p03290 |
import copy
from typing import List, Tuple
def main():
d, g = list(map(int, input().split()))
v = []
for _ in range(d):
p, c = list(map(int, input().split()))
v.append((p, c))
print((ag(v, g)))
def ag(v: List[Tuple[int, int]], g: int) -> int:
# ex. [(3, 500), (5... | import itertools
from typing import List, Tuple
def main():
d, g = list(map(int, input().split()))
v = []
for _ in range(d):
p, c = list(map(int, input().split()))
v.append((p, c))
print((ag(v, g)))
def ag(v: List[Tuple[int, int]], g: int) -> int:
# ex. [(3, 500),... | p03290 |
# n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import math
import sys
input = sys.stdin.readline
D, G = list(map(int, input().split()))
# print(D, G)
P = []
C = []
... | # n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import math
import sys
input = sys.stdin.readline
D, G = list(map(int, input().split()))
# print(D, G)
P = []
C = []
... | p03290 |
ans = float("inf")
def solve():
d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
# まだ解いてない配点を nokori として持つ
def dfs(i, sum, count, nokori):
global ans
if i == d:
# G 点に満たなければ nokori のうち一番大きいものを解く
if ... | d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
# まだ解いてない配点を nokori として持つ
ans = float("inf")
def dfs(i, sum, count, nokori):
global ans
if i == d:
# G 点に満たなければ nokori のうち一番大きいものを解く
if sum < g:
use = max(nokori)
... | p03290 |
D,G = list(map(int,input().split()))
X = [list(map(int,input().split())) for _ in range(D)]
ans = 0
for i in range(2**D):
point = 0
count = 0
for j in range(D):
if (i>>j)&1:
point += 100*(j+1)*X[j][0]+X[j][1]
count += X[j][0]
if G > point:
for k in range(D)[::-1]:
if (i>>k)&1==0:
if... | D,G = list(map(int,input().split()))
X = [list(map(int,input().split())) for _ in range(D)]
ans = 0
for i in range(2**D):
point = 0
count = 0
for j in range(D):
if (i>>j)&1:
point += 100*(j+1)*X[j][0]+X[j][1]
count += X[j][0]
if G > point:
for k in range(D)[::-1]:
if (i>>k)&1==0:
i... | p03290 |
from itertools import product
def main():
d, g = list(map(int, input().split()))
score_set = []
score_set_qnum = []
for i1 in range(1, d + 1):
kazu, bonus = list(map(int, input().split()))
score_p = []
for i2 in range(kazu):
score_p.append(i1 * 100 * i2)
... | from itertools import product
from math import ceil
def main():
d, g = list(map(int, input().split()))
scoremax_set = []
numq_set = []
for i1 in range(1, d + 1):
kazu, bonus = list(map(int, input().split()))
scoremax_set.append(i1 * 100 * kazu + bonus)
numq_set.append(ka... | p03290 |
n,k = list(map(int,input().split()))
l = []
for i in range(n):
array = list(map(int,input().split()))
line = [int(j)*100*(i+1) for j in range(array[0])]
line.append(array[0]*100*(i+1)+array[1])
l.append(line)
chk = []
def f(a,b,c):
if a==n:
if b>=k:
chk.append(c)
return
else:
... | n,k = list(map(int,input().split()))
l = []
for i in range(n):
array = list(map(int,input().split()))
l_append=l.append
l_append(array)
chk = []
chk_append=chk.append
def f(a,b,c):
if a==n:
if b>=k:
chk_append(c)
return
else:
return [f(a+1,b+100*(a+1)*i,c+i) for i in range(... | p03290 |
### ABC104C - All Green
from itertools import permutations
def main():
D, G = list(map(int, input().split()))
A = [(0, 0)] + [tuple(map(int, input().split())) for _ in range(D)]
ans = float("inf")
for perm in permutations(list(range(1, D + 1)), D):
cur, cnt = G, 0
for i in pe... | ### ABC104C - All Green
def rec(score: int, idx: int) -> int:
if idx == 0:
return float("inf")
point, (num, bonus) = idx * 100, A[idx]
cnt = min(score // point, num)
cur_score = cnt * point + bonus if cnt == num else cnt * point
rest = score - cur_score
if rest > 0:
cnt ... | p03290 |
import sys
sys.setrecursionlimit(2000)
D, goal = list(map(int, input().split()))
q_num, bonus = [], []
for i in range(1,D+1):
q, b = list(map(int, input().split()))
q_num.append(q)
bonus.append(b)
ans = 100000
def rec(comb, next_n, current_score):
if next_n == D + 1:
global ans
if curren... | import sys
sys.setrecursionlimit(2000)
D, goal = list(map(int, input().split()))
q_num, bonus = [], []
for i in range(1,D+1):
q, b = list(map(int, input().split()))
q_num.append(q)
bonus.append(b)
ans = 100000
def rec2(current_qn, next_n, current_score, tyuuto_done):
if next_n == D + 1:
globa... | p03290 |
d, g = list(map(int, input().split()))
test = []
point = []
for i in range(1, d+1):
p, c = list(map(int, input().split()))
test.append([p, c])
point.append([c + (p * i * 100), p])
inf = 10 ** 9
ans = inf
for i in range(2 ** d):
b = bin(i)[2:]
b = (d - len(b)) * "0" + b
temp = 0
... | d, g = list(map(int, input().split()))
point = []
for i in range(d):
p, c = list(map(int, input().split()))
point.append([p, c])
def f(g, i):
if i == -1:
return 10000000
n = min(g // ((i + 1) * 100), point[i][0])
s = n * (i + 1) * 100
if n == point[i][0]:
s += ... | p03290 |
def main():
D, G = list(map(int, input().split()))
A = []
for i in range(D):
p, c = list(map(int, input().split()))
A.append([i, p, c])
A = A[::-1]
cur = [[0, 0]]
used = [set()]
for i, p, c in A:
temp = []
temp_used = []
for j in rang... | def main():
D, G = list(map(int, input().split()))
A = []
for i in range(D):
p, c = list(map(int, input().split()))
A.append([i, p, c])
A = A[::-1]
hs = [[0, 0, 0]]
for i, p, c in A:
temp = []
for h, v, q in hs: temp.append([h|(1 << i), v+100*(i+1)*p... | p03290 |
import math
D,G = list(map(int,input().split()))
p = []
c = []
for i in range(D):
p_tmp,c_tmp = list(map(int,input().split()))
p.append(p_tmp)
c.append(c_tmp)
ans = sum(p)
for i in range(D):
for j in range(p[i]):
for k in range(2**D-1):
... | import math
D,G = list(map(int,input().split()))
p=[]
c=[]
for i in range(D):
p_tmp,c_tmp = list(map(int,input().split()))
p.append(p_tmp)
c.append(c_tmp)
ans = sum(p)
for i in range(2**D):
score_tmp = 0
ans_tmp = 0
for j in range(D):
if (i>>j)%2 == 1:
score_t... | p03290 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
D, G = na()
p = []
c = []
for i in range(D):
x, y = na()
p.append(x)
c.append(y)
ans = 99999999
for i in range(1<<D):
ct = 0
score = 0
f... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
D, G = na()
p = []
c = []
for i in range(D):
x, y = na()
p.append(x)
c.append(y)
ans = 99999999
for i in range(1<<D):
ct = 0
score = 0
f... | p03290 |
d , g = list(map(int, input().split()))
pc = [list(map(int, input().split()))for i in range(d)]
x=[]
y=[0]*d
ac=[0]*d
for i in range(d):
ac[i]=pc[i][0]*(i+1)*100+pc[i][1]
def dfs(n,m,y,now):
if now==n:
z=y.copy()
x.append(z)
return
for i in range(m):
y[now]=i
... | d , g = list(map(int, input().split()))
pc = [list(map(int, input().split()))for i in range(d)]
x=[]
y=[0]*d
ac=[0]*d
for i in range(d):
ac[i]=pc[i][0]*(i+1)*100+pc[i][1]
def dfs(n,m,y,now):
if now==n:
z=y.copy()
x.append(z)
return
for i in range(m):
y[now]=i
... | p03290 |
import itertools
n, g = list(map(int, input().split()))
L = []
for i in range(n):
t = list(map(int, input().split()))
# 得点の情報を追加
t.append((i+1)*100)
L.append(t)
ans = 100 * n
for v in itertools.permutations(L):
# print(v)
score = 0
count = 0
k = 0
p = v[k][0]
whi... | import itertools
n, g = list(map(int, input().split()))
L = []
for i in range(n):
t = list(map(int, input().split()))
# 配点
t.append((i+1)*100)
# この配点の問題を全部解いた時の得点
t.append((i+1)*100*t[0]+t[1])
L.append(t)
# print(L)
ans = g//100
# https://img.atcoder.jp/abc104/editorial.pdf bit全探索
... | p03290 |
# coding: utf-8
def solve(*args: str) -> str:
d, g = list(map(int, args[0].split()))
g //= 100
pc = [tuple(map(int, a.split())) for a in args[1:]]
inf = 10**12
dp = {}
for i, (p, c) in enumerate(pc):
c //= 100
if i == 0:
for k in range(p):
... | # coding: utf-8
def solve(*args: str) -> str:
d, g = list(map(int, args[0].split()))
pc = [tuple(map(int, a.split())) for a in args[1:]]
inf = 10**5
count = inf
for b in range(2**d):
score, cnt = 0, 0
for i in range(d):
p, c = pc[i]
if b >> i... | p03290 |
import itertools
d, g = list(map(int, input().split()))
lst = [list(map(int, input().split())) for i in range(d)]
#print(lst)
new_lst = [[] for i in range(len(lst))]
for i, j in enumerate(lst):
#print(i, j)
for k in range(j[0] + 1):
new_lst[i].append([k, (k * 100 * (i + 1))])
if k... | d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
min_ac1 = 1000
min_ac2 = 1000
for i in range(2 ** d):
points = 0
ac = 0
for j in range(d):
if ((i >> j) & 1) == 1:
points += pc[j][0] * 100 * (j + 1) + pc[j][1]
ac += p... | p03290 |
d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
min_ac1 = 1000
min_ac2 = 1000
for i in range(2 ** d):
points = 0
ac = 0
for j in range(d):
if ((i >> j) & 1) == 1:
points += pc[j][0] * 100 * (j + 1) + pc[j][1]
ac += p... | def dfs(i, sum, cnt, memo):
if i == d + 1:
if sum >= g:
tmp.append(cnt)
else:
cnt += min(p_lst[max(memo) - 1], -(-(g - sum) // (max(memo) * 100)))
if sum + min(p_lst[max(memo) - 1], -(-(g - sum) // (max(memo) * 100))) * max(memo) * 100 >= g:
... | p03290 |
import itertools
d,g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
a = [i for i in range(d)]
b = itertools.permutations(a,d)
ans = float('inf')
for x in b:
c = 0
e = 0
flag = False
for i in x:
for j in range(pc[i][0]):
... | import itertools
import math
d,g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
a = [i for i in range(d)]
b = itertools.permutations(a,d)
ans = float('inf')
for x in b:
c = 0
e = 0
flag = False
for i in x:
if e+100*(i+1)*pc[i][0]<... | p03290 |
class Problem:
def __init__(self, score, number, bonus):
self.score = score
self.number = number
self.bonus = bonus
def score_at(self, number):
if number >= self.number:
return self.number * self.score + self.bonus
return number * self.score
D, G = (int(x) for x in input... | import sys
INF = sys.maxsize
D, G = list(map(int, input().split()))
class P:
def __init__(self, index, number, bonus):
self.index = index
self.number = number
self.bonus = bonus
@property
def score(self):
return (self.index + 1) * 100
@property
def complete_score(sel... | p03290 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p03290 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p03290 |
D,G = list(map(int,input().split()))
G = G/100
P = []; C = []
for i in range(D):
p,c = list(map(int,input().split()))
P.append(p)
C.append(c/100)
m = 10**3
for k in range(2**D):
R = list(range(D))[::-1]
point = G
prob = 0
for d in range(D):
if k%(2**(d+1)) >= 2**d:
p = P[d]; c = C[... | D,G = list(map(int,input().split()))
G = G/100
P = []; C = []
for i in range(D):
p,c = list(map(int,input().split()))
P.append(p)
C.append(c/100)
m = 10**3
for k in range(2**D):
R = list(range(D))[::-1]
point = G
prob = 0
for d in range(D):
if k & 1<<d:
p = P[d]; c = C[d]
po... | p03290 |
import itertools
# 入力もらう
D,G = list(map(int,input().split()))
PC = []
for i in range(D):
PC.append(list(map(int,input().split())))
#[0,0,0,0,0,0,0,0,0,0]という形で、どのボーナスをもらうかを管理したい
#例えば[1,0,0,0,1,0,0,0,0,0]は100点問題と500点問題のボーナスをもらうということ
#2^D通り(D<=10)だから全探索できる(もちろん全部0というのはありえないけど)
#itertools使って2^D通りのケースを用意
a =... | import itertools
# 入力もらう
D,G = list(map(int,input().split()))
PC = []
for i in range(D):
PC.append(list(map(int,input().split())))
#[0,0,0,0,0,0,0,0,0,0]という形で、どのボーナスをもらうかを管理したい
#例えば[1,0,0,0,1,0,0,0,0,0]は100点問題と500点問題のボーナスをもらうということ
#2^D通り(D<=10)だから全探索できる
#itertools使って2^D通りのケースを用意
a = [0,1]
Ls = list(ite... | p03290 |
def dfs(i,total_p,total_q):
if total_q >= min(ans):
return
if total_p >= g:
ans.append(total_q)
return
if i == d:
return
for n in range(pc_list[i][0]+1):
if n == pc_list[i][0]:
dfs(i+1, total_p+100*(i+1)*n+pc_list[i][1], total_q+n)
... | def dfs_biggest_added(i, total_p, total_q):
if total_p >= g:
ans.append(total_q)
return
if i == 0:
return
dfs_biggest_added(i-1, total_p + 100*i*pc_list[i-1][0] + pc_list[i-1][1], total_q+pc_list[i-1][0])
dfs_biggest_added(i-1, total_p, total_q)
def dfs_not_biggest_... | p03290 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from math import ceil
D, G = [int(t) for t in input().split()]
p = []
c = []
for i in range(D):
p_, c_ = [int(t) for t in input().split()]
p.append(p_)
c.append(c_)
cache = {}
def minsolve(G, p, c, i):
"""100i点以下の問題だけでGを達成する最小問題数"""
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from math import ceil
D, G = [int(t) for t in input().split()]
p = []
c = []
for i in range(D):
p_, c_ = [int(t) for t in input().split()]
p.append(p_)
c.append(c_)
def minsolve(G, p, c, i):
"""100i点以下の問題だけでGを達成する最小問題数"""
if i <= 0:... | p03290 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from math import ceil
D, G = [int(t) for t in input().split()]
p = []
c = []
for i in range(D):
p_, c_ = [int(t) for t in input().split()]
p.append(p_)
c.append(c_)
def minsolve(G, p, c, i):
"""100i点以下の問題だけでGを達成する最小問題数"""
if i <= 0:... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from math import ceil
D, G = [int(t) for t in input().split()]
p = []
c = []
for i in range(D):
p_, c_ = [int(t) for t in input().split()]
p.append(p_)
c.append(c_)
cache = {}
def minsolve(G, i):
"""100i点以下の問題だけでGを達成する最小問題数"""
if i ... | p03290 |
D, G = list(map(int, input().split()))
problems = []
for i in range(D):
b = (i + 1) * 100
p, c = list(map(int, input().split()))
problems.append((b, p, c)) # 基本点, 問題数, ボーナス
nsolved = {0: 0} # 総合点 → 必要問題数
for b, p, c in problems:
nsolved2 = {}
for k in nsolved:
for n in range(... | D, G = list(map(int, input().split()))
G //= 100
problems = []
for i in range(D):
b = i + 1
p, c = list(map(int, input().split()))
c //= 100
problems.append((b, p, c)) # 基本点, 問題数, ボーナス
nsolved = {0: 0} # 総合点 → 必要問題数
for b, p, c in problems:
nsolved2 = {}
for k in nsolved:
... | p03290 |
from collections import defaultdict
d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for _ in range(d)]
dp = defaultdict(int)
dp[0] = 0
for i, (p, c) in enumerate(pc):
dp_cur = list(dp.items())
for p_cur, n_cur in dp_cur:
for n in range(1, p+1):
if n < ... | d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for _ in range(d)]
ans = 10**9
for bit in range(1<<d):
score = 0
n = 0
for i in range(d):
if bit & 1<<i: # Problems completely answered
score += pc[i][1] + pc[i][0]*100*(i+1)
n += p... | p03290 |
import itertools
from pprint import pprint
import sys
d,g = list(map(int,input().split()))
plist=[]
clist=[]
bonus_masterlist=[]
for _ in range(d):
p_temp,c_temp = list(map(int,input().split()))
plist.append(p_temp)
clist.append(c_temp)
bonus_masterlist = list(itertools.product(lis... | import itertools
from pprint import pprint
d,g = list(map(int,input().split()))
plist=[]
clist=[]
bonus_masterlist=[]
for _ in range(d):
p_temp,c_temp = list(map(int,input().split()))
plist.append(p_temp)
clist.append(c_temp)
bonus_masterlist = list(itertools.product(list(range(2)), ... | p03290 |
import math
import itertools
import sys
input = sys.stdin.readline
def main():
D, G = list(map(int, input().split()))
spc_list = [[(i+1) * 100] + [int(v) for v in input().split()] for i in range(D)]
max_scores = [spc[0] * spc[1] + spc[2] for spc in spc_list]
min_q = float("inf")
for q_lis... | import math
def dfs(i, sum, count, remain, d, g, pc):
global ans
if i == d:
if sum < g:
q = max(remain)
n = min(pc[q][0] - 1, math.ceil((g - sum) / (100 * (q + 1))))
#n = min(pc[q][0], -(-(g - sum) // ((q + 1) * 100)))
count += n
sum... | p03290 |
from collections import deque
D,G = [int(i) for i in input().split()]
P = [0]*D
n = 0
for i in range(D):
p,c = [int(j) for j in input().split()]
P[i] = [int(k) * 100 * (i+1) for k in range(p+1)]
P[i][-1] += c
n += p
deq = deque()
ans = n
deq.append((0,0,0))
while(len(deq)>0):
tmp = deq.... | from collections import deque
D,G = [int(i) for i in input().split()]
P = [0]*D
n = 0
for i in range(D):
p,c = [int(j) for j in input().split()]
P[i] = [int(k) * 100 * (i+1) for k in range(p+1)]
P[i][-1] += c
n += p
deq = deque()
ans = n
deq.append((0,0,0))
dic = {}
while(len(deq)>0):
... | p03290 |
import itertools
D, G = list(map(int, input().split()))
P = [None] * D
C = [None] * D
count = [None] * D
score = [None] * D
for i in range(D):
p, c = list(map(int, input().split()))
P[i] = p
C[i] = c
count[i] = list(range(p+1))
score[i] ... | import itertools
D, G = list(map(int, input().split()))
P = [None] * D
C = [None] * D
count = [None] * D
score = [None] * D
for i in range(D):
p, c = list(map(int, input().split()))
P[i] = p
C[i] = c
count[i] = list(range(p+1))
score[i] ... | p03290 |
from collections import deque
def solve(d, g, pcs):
queue = deque()
queue.append((0, d, g, pcs, 0))
while True:
count, d, g, pcs, n = queue.popleft()
#print(count, d, g, pcs)
if g <= 0:
return count
if n > 0:
p, c = pcs[n - 1]
... | from collections import deque
def solve(count, i, g, pcs, rem):
if g <= 0:
return count
if pcs == []:
index, p = rem
if index == 0:
return count
plus = g // (100 * index) + (1 if g % (100 * index) != 0 else 0)
return count + plus if plus < p else fl... | p03290 |
D, G = list(map(int, input().split()))
G /= 100
l = [[0]*3 for i in range(D)]
for i in range(D):
p, c = list(map(int, input().split()))
l[i][0] = i+1
l[i][1] = p
l[i][2] = c/100
l = sorted(l, key=lambda x: x[0], reverse=True)
def dfs(i, scores):
if scores <= 0:
return 0
... | from math import ceil
D, G = [int(t) for t in input().split()]
p = []
c = []
for i in range(D):
p_, c_ = [int(t) for t in input().split()]
p.append(p_)
c.append(c_)
def minsolve(G, i):
"""100i点以下の問題だけでGを達成する最小問題数"""
if i <= 0:
return float('inf')
n = min(ceil(G / (100 *... | p03290 |
INF = float('inf')
D, G = list(map(int, input().split()))
pcs = [tuple(map(int, input().split())) for i in range(D)]
sumP = sum([p for p, c in pcs])
def max2(a, b):
return a if a >= b else b
# 【配るDP】
# dp[i+1][j]: pcs[i]まで考慮したとき、j問で達成できるスコアの最大値
dp = [[-INF] * (sumP + 1) for i in range(D + 1)]
dp[... | from math import ceil
D, G = list(map(int, input().split()))
ps, cs = [], []
for _ in range(D):
p, c = list(map(int, input().split()))
ps.append(p)
cs.append(c)
ans = 1000
for pat in range(2 ** D):
score = 0
num = 0
for i in range(D):
if pat & (1 << i):
score... | p03290 |
def count(P, idx, score, G, mn, cnt):
# print(idx, score, mn, cnt)
if score >= G and mn > cnt:
return cnt
if idx == 0:
return mn
for i in range(P[idx][0]+1):
tmp = P[idx][1] if i == P[idx][0] else 0
# print(idx, i)
mn = count(P, idx-1, score+idx*100*i+t... | from math import ceil
d,g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
ans = float('INF')
inf = float('INF')
for i in range(2**d):
tmp = 0
cnt = 0
for j in range(d):
p,c = pc[j]
if i & (1 << j):
tmp += p * (j+1) * 100 + c... | p03290 |
"""解説から写経
D種類の配点の問題があり、それらを最低何問解けばG点以上取ることができるかを求める。
続くD行の入力から、配点iの問題数p[i]と追加点c[i]が与えられ、配点は100*(i+1)点となる。
追加点は配点i問題を全て解いたときに得られる追加点。
条件が成立する最小の問題数をansとし、とても大きな値で初期化しておく。
各配点の問題を全て解くか、解かないかを最初に決め、G点以上取れるかどうか、また、その時の解答数を確認していく。(bit全探索)
現在の点数、解答数、解かなかった問題の中で最も配点の高かったものをそれぞれ、s, num, rest_maxとする。
完全に解く問題を解き終えて、G点に満... | D, G = list(map(int, input().split()))
P = [tuple(map(int, input().split())) for _ in range(D)]
ans = float('inf')
for bit in range(1 << D):
score = 0
count = 0
rest = -1
for i, pc in enumerate(P):
p, c = pc
if bit >> i & 1:
score += 100 * (i + 1) * p + c
... | p03290 |
D, G = list(map(int, input().split()))
p = [list(map(int, input().split())) for _ in range(D)]
plst = [0] * D
ans = 0
for i in range(D):
ans += p[i][0]
def dfs(n):
global ans
if n == D:
cnt = 0
total = 0
for i in range(D):
if plst[i] == 0:
c... | D, G = list(map(int, input().split()))
p = [list(map(int, input().split())) for _ in range(D)]
plst = [0] * D
ans = 0
for i in range(D):
ans += p[i][0]
def dfs(n):
global ans
if n == D:
cnt = 0
total = 0
for i in range(D):
if plst[i] == 0:
c... | p03290 |
import math
d, g = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(d)]
ans = float('inf')
for i in range(2 ** d):
sum = 0
count = 0
s = set(_ for _ in range(1, d + 1))
for j in range(d):
if (i >> j) & 1 == 1:
sum += l[j][0] * (j + 1) ... | import math
d, g = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(d)]
ans = float('inf')
for i in range(2 ** d):
sum = 0
count = 0
s = set(k for k in range(1, d + 1))
for j in range(d):
if (i >> j) & 1 == 1:
sum += l[j][0] * (j + 1) ... | p03290 |
D, G = list(map(int, input().split()))
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
p = []
c = []
for _ in range(D):
p_tmp, c_tmp = list(map(int,input().split()))
p.append(p_tmp)
c.append(c_tmp)
... | import itertools
D,G = list(map(int, input().split()))
PC = [list(map(int, input().split())) for _ in range(D)]
P_list = list(range(D))
cnt = float('inf')
for i in range(D):
for bonus in itertools.combinations(P_list, i):
tmp_cnt = 0
score = 0
for j in bonus:
score += PC[j][0] * 100 * (j+1... | p03290 |
INF = float('inf')
d, g = list(map(int, input().split()))
data = []
for i in range(d):
p, c = list(map(int, input().split()))
data.append([p, c, (i + 1) * 100, (i + 1) * 100 * p + c])
def f(data, total, targets):
if total <= 0:
return 0
result = INF
for i in range(len(targets)):
p, c, score... | INF = float('inf')
d, g = list(map(int, input().split()))
data = []
calced = set()
for i in range(d):
p, c = list(map(int, input().split()))
data.append([p, c, (i + 1) * 100, (i + 1) * 100 * p + c])
def f(data, total, targets):
if total <= 0:
return 0
result = INF
for i in range(len(targets)):
... | p03290 |
import itertools
d,g=list(map(int,input().split()))
pc=[list(map(int,input().split())) for _ in range(d)]
num=list(itertools.permutations(list(range(1,d+1))))
ans=100000
for i in range(d):
pc[i][1]=pc[i][1]//100
g//=100
for i in range(len(num)):
cnt=g
cnt2=0
for j in range(d):
num3=n... | import itertools
d,g=list(map(int,input().split()))
p=[]
c=[]
for i in range(d):
p1,c1=list(map(int,input().split()))
p.append(p1)
c.append(c1//100)
n=list(itertools.permutations(list(range(1,d+1))))
ans=3000
g//=100
for i in range(len(n)):
cnt=g
cnt2=0
for j in range(d):
... | p03290 |
import itertools
d,g=list(map(int,input().split()))
p=[]
c=[]
for i in range(d):
p1,c1=list(map(int,input().split()))
p.append(p1)
c.append(c1//100)
n=list(itertools.permutations(list(range(1,d+1))))
ans=3000
g//=100
for i in range(len(n)):
cnt=g
cnt2=0
for j in range(d):
... | import itertools
d,g=list(map(int,input().split()))
p=[]
c=[]
for i in range(d):
p1,c1=list(map(int,input().split()))
p.append(p1)
c.append(c1//100)
n=list(itertools.permutations(list(range(1,d+1))))
ans=2000
g//=100
for i in range(len(n)):
cnt=g
cnt2=0
for j in range(d):
... | p03290 |
d,g=list(map(int,input().split()))
p=[]
c=[]
for i in range(d):
p1,c1=list(map(int,input().split()))
p.append(p1)
c.append(c1//100)
ans=1100
g//=100
import itertools
n=list(itertools.permutations(list(range(1,d+1))))
for i in range(len(n)):
cnt=g
cnt2=0
for j in range(d):
... | import itertools
d,g=list(map(int,input().split()))
p=[]
c=[]
for i in range(d):
p1,c1=list(map(int,input().split()))
p.append(p1)
c.append(c1//100)
n=list(itertools.permutations(list(range(1,d+1))))
ans=1100
g//=100
for i in range(len(n)):
cnt=g
cnt2=0
for j in range(d):
... | p03290 |
from itertools import*
from math import*
d,g=list(map(int,input().split()))
g//=100
xxx=[tuple([i])+tuple(map(int,input().split()))for i in range(1,d+1)] #問題数 ボーナス
#print(xxx)
yyy=[(score,score*num+bonus//100,num)for score,num,bonus in xxx]
ans=[]
l=[]
for i in range(d+1):
for j in combinations(yyy,i):
... | (d,g),*l=[list(map(int,i.split()))for i in open(0)]
def f(i,g):
if i==0:return 1e9
n,m=l[i-1];c=min(g//(100*i),n);s=100*i*c+m*(c==n);c+=f(i-1,g-s)*(s<g);return min(c,f(i-1,g))
print((int(f(d,g)))) | p03290 |
import itertools
from collections import Counter
D, G = list(map(int, input().split()))
P = [list(map(int, input().split())) for i in range(D)]
min_num = 10**8
judge_list = list(itertools.product([0, 1, 2], repeat=D)) #0:中途半端に解く 1:一問も解かない 2: 全部解く
for judge in judge_list:
score = 0
num = 0
d =... | d,g=list(map(int,input().split()))
ls=[list(map(int,input().split())) for i in range(d)]
P=list([x[0] for x in ls])
C=list([x[1] for x in ls])
tmp=10**9
for i in range(1<<d):
total=0
num=0
for j in range(d):
if (i>>j)&1:
total+=C[j]+P[j]*100*(j+1)
num+=P[j]
if total>=g:
tmp=mi... | p03290 |
d, g = list(map(int, input().split()))
q_list = [list(map(int, input().split())) for x in range(d)]
count_list = []
for j in range(2**d):
total = 0
count = 0
for i in range(d):
if (j >> i) & 1:
total += 100*(i+1)*q_list[i][0] + q_list[i][1]
count += q_list[i][0]
... | d, g = list(map(int, input().split()))
dic = {}
ans = 9999999
for i in range(1, d+1):
dic[i] = list(map(int, input().split()))
for i in range(2**d):
total = 0
count = 0
select_list = list(range(1, d+1))
for j in range(d):
if (i >> j) & 1:
num = dic[j+1][0]
... | p03290 |
d, g = list(map(int, input().split()))
dic = {}
ans = 9999999
for i in range(1, d+1):
dic[i] = list(map(int, input().split()))
for i in range(2**d):
total = 0
count = 0
select_list = list(range(1, d+1))
for j in range(d):
if (i >> j) & 1:
num = dic[j+1][0]
... | d, goal = list(map(int, input().split()))
problems = []
for i in range(1, d+1):
num, bonus = list(map(int, input().split()))
point = i * 100
problems.append([point, num, bonus])
ans = []
for mask in range(2**d):
score = 0
count = 0
target = 0
for bit in range(d):
if... | p03290 |
#3
d,g = list(map(int,input().split()))
lista = []
for i in range(d):
lista.append([])
p,c = list(map(int,input().split()))
lista[i] = [p,c]
def search(allcomp,notouch,touch,rem,toachiev,ps):
#allcomp 全部解く
#notouch 触らない
#touch 触る
#残りの選択肢
#達成までに必要な得点
#ここまで解いてる問題数
... | d,g = list(map(int,input().split()))
p = []
c = []
for i in range(d):
tp,tc = list(map(int,input().split()))
p.append(tp)
c.append(tc)
ans = 1<<50
for i in range(1<<d):#どのコンプリートボーナスを狙うかを決める
score = 0
count = 0
zero_list = []
for j in range(d):
if ((i >> j) & 1):
... | p03290 |
#!/usr/bin/env python3
import sys
def solve(D: int, G: int, p: "List[int]", c: "List[int]"):
# bit全探索
mc = sum(p)
for i in range(1 << D):
s = 0
cc = 0
for j in range(D):
if((i >> j) & 1):
s += (j+1)*p[j]*100+c[j]
cc += p[j]... | #!/usr/bin/env python3
import sys
def solve(D: int, G: int, p: "List[int]", c: "List[int]"):
cm = sum(p)
for i in range(1<<D):
s = 0
ct = 0
for j in range(D):
if((i>>j)&1):
s += (j+1)*100*p[j]+c[j]
# print(s)
ct +... | p03290 |
D, G = list(map(int, input().split()))
G = G // 100
P = []
C = []
for i in range(1, D+1):
p, c = list(map(int, input().split()))
P.append(p)
C.append(c//100)
minnum = 1e9
for i in range(0, 2**D):
total = 0
num = 0
serach0 = [0] * D
for j in range(D):
if (i >> j) & 1:
... | D, G = list(map(int, input().split()))
G //= 100
P = []
C = []
for i in range(1, D+1):
p, c = list(map(int, input().split()))
P.append(p)
C.append(c//100)
scores = []
nums = []
for i in range(0, 2**D):
score = 0
num = 0
remain = []
for j in range(D):
if (i>>j)&1:
... | p03290 |
import itertools as it
D, G = list(map(int, input().split()))
P, C = [], []
for _ in range(D):
p, c = list(map(int, input().split()))
P.append(p)
C.append(c)
A = list(it.permutations([i for i in range(D)]))
ans = 10**9
for a in A:
S, i, sub_ans = 0, 0, 0
while 1:
if S + (a[i] + 1... | import itertools as it
D, G = list(map(int, input().split()))
P, C = [], []
for _ in range(D):
p, c = list(map(int, input().split()))
P.append(p)
C.append(c)
A = it.permutations([i for i in range(D)])
ans = 10**9
for a in A:
S, i, sub_ans = 0, 0, 0
while 1:
if S + (a[i] + 1) * 10... | p03290 |
import sys
from collections import defaultdict
input = sys.stdin.readline
D, G = [int(x) for x in input().strip().split()]
P = [''] * D
for d in range(D):
p, c = [int(x) for x in input().strip().split()]
P[d] = [0] + [(d + 1) * 100 * (i + 1) for i in range(p)]
P[d][-1] += c
d = defaultdict(int)... | import sys
from collections import defaultdict
input = sys.stdin.readline
D, G = [int(x) for x in input().strip().split()]
P = [''] * D
for d in range(D):
p, c = [int(x) for x in input().strip().split()]
P[d] = [0] + [(d + 1) * 100 * (i + 1) for i in range(p)]
P[d][-1] += c
d = defaultdict(int)... | p03290 |
import itertools
from collections import Counter
D, G = list(map(int, input().split()))
P = [list(map(int, input().split())) for i in range(D)]
min_num = 10**8
judge_list = list(itertools.product([0, 1, 2], repeat=D)) #0:中途半端に解く 1:一問も解かない 2: 全部解く
for judge in judge_list:
score = 0
num = 0
d =... | import itertools
D, G = list(map(int, input().split()))
L = [list(map(int, input().split())) for _ in range(D)]
num = D #生成するビット数
bit_list = list(itertools.product([0, 1], repeat=num))
tmp = 10 ** 6
for bit in bit_list:
count = 0
num = 0
for i in range(D):
if bit[i] == 1:
... | p03290 |
import itertools
D, G = list(map(int, input().split()))
L = [list(map(int, input().split())) for _ in range(D)]
num = D #生成するビット数
bit_list = list(itertools.product([0, 1], repeat=num))
tmp = 10 ** 6
for bit in bit_list:
count = 0
num = 0
for i in range(D):
if bit[i] == 1:
... | import itertools
def solve(D, G, problems):
bit_list = list(itertools.product([0, 1], repeat=D))
result_count = 10 ** 8
for pattern in bit_list:
score = 0 # スコアの合計
count = 0 # 解いた問題数
for i in range(D):
if pattern[i] == 1: # ビット値が１の難易度の問題は全て解く
... | p03290 |
D, G= list(map(int, input().split()))
P = [[int(x) for x in input().split()] for d in range(D)]
Score = [[] for d in range(D)]
for d in range(D):
for i in range(P[d][0] + 1):
Score[d].append(100 * (d + 1) * i)
Score[d][-1] += P[d][1]
DP = [[] for d in range(D)]
DP[0] = [x for x in Score[0]]
p_all = P[0... | D, G = list(map(int, input().split()))
S = [[0] for i in range(D + 1)]
B = [[0] for i in range(D + 1)]
sumP = 0
for i in range(D):
p, c = list(map(int, input().split()))
S[i + 1] += [0] * (len(S[i]) + p - 1)
B[i + 1] += [100 * (i + 1) * (x + 1) for x in range(p)]
B[i + 1][-1] += c
for i in range(1, D +... | p03290 |
import sys
sys.setrecursionlimit(100000)
inf = float('inf')
def dfs(h, s):
# 停止条件
if h == D:
tmp = 0
p = 0
ans = 0
for i, c in enumerate(s):
if c == '0':
tmp = i
else:
ans += pc[i][0]
p += (i+... | D, G=list(map(int, input().split()))
PC=[0]+[list(map(int, input().split())) for _ in range(D)]
def function(G, i):
if i==0:
return 1e9
n=min(G//(i*100), PC[i][0])
s=n*i*100
if n==PC[i][0]:
s+=PC[i][1]
if s<G:
n+=function(G-s, i-1)
return min(n, function(G,i-1))
print((function(G, D)))
| p03290 |
D, G = list(map(int, input().split()))
pc = [[i + 1] + [int(x) for x in input().split()] for i in range(D)]
import math
m = {}
def f(cur, n, left):
if left <= 0:
return n
def g(cur, n, left):
if cur in m: return m[cur]
r = m[cur] = f(cur, n, left)
return r
ret = ... | D, G = list(map(int, input().split()))
pc = [[i + 1] + [int(x) for x in input().split()] for i in range(D)]
import math
m = {}
def f(cur, n, left):
if left <= 0:
return n
def g(cur, n, left):
if cur in m: return m[cur]
r = m[cur] = f(cur, n, left)
return r
ret = ... | p03290 |
def solve():
inf = 1 << 60
D, G = list(map(int, input().split()))
p = [0]
c = [0]
for i in range(D):
pi, ci = list(map(int, input().split()))
p.append(pi)
c.append(ci)
sump = sum(p)
# dp[i][j] = 100i点の問題までで、j問解いて得られる最大の点数
dp = [[-inf for j in range(sump... | def solve():
inf = 1 << 60
D, G = list(map(int, input().split()))
p = []
c = []
for i in range(D):
pi, ci = list(map(int, input().split()))
p.append(pi)
c.append(ci)
bitD = 1 << D
min_cnt = inf
for b in range(bitD):
sc = 0
cnt = 0
... | p03290 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
D, G = list(map(int, input().split()))
P = [] * D
C = [] * D
for i in range(D):
p, c = list(map(int, input().split()))
P.append(p)
C.append(c)
ans = float('inf')
for i in range(1<<D):
tot... |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
D, G = list(map(int, input().split()))
P = [] * D
C = [] * D
for i in range(D):
p, c = list(map(int, input().split()))
P.append(p)
C.append(c)
ans = float('inf')
for i in range(1<<D):
tot... | p03290 |
from itertools import product
D, G = list(map(int, input().split()))
score = []
for i in range(D):
p, c = list(map(int, input().split()))
s = (i + 1) * 100
score.append([s, p, c, s * p + c])
ans = float('inf')
for ptn in product([0, 1], repeat=D):
total = 0
cnt = 0
for i in range(... | from itertools import product
D, G = list(map(int, input().split()))
pc = [[int(x) for x in input().split()] for _ in range(D)]
C = [0] * D
for i in range(D):
p, c = pc[i]
C[i] = 100 * (i + 1) * p + c
ans = float('inf')
for ptn in product([0, 1], repeat=D):
point, cnt = 0, 0
for i in ran... | p03290 |
D, G = list(map(int, input().split()))
dic = [0]*(D+1)
for i in range(D):
p, c = list(map(int, input().split()))
dic[i+1] = (p,c)
ans = 10**9
for i in range(2**D):
ls = []
x = i
v = 0
count = 0
for j in range(D):
if x%2==1:
ls += [j+1]
x = x>>1
for h in ls:
p, c = dic[h... | D, G, *L = list(map(int, open(0).read().split()))
inf = []
for m in zip(*[iter(L)]*2):
inf.append(m)
ans = float('inf')
for i in range(2**D):
m = 0
cnt = 0
log = []
for j in range(D):
if i%2==0:
m += 100*(j+1)*inf[j][0]+inf[j][1]
cnt += inf[j][0]
else:
log.append(j)
... | p03290 |
D,G = list(map(int,input().split()))
pc = [list(map(int,input().split())) for i in range(D)]
#print(pc)
ans = float("inf")
for i in range(2**D):
sum = 0
count = 0
rem = set(range(1,D+1))
for j in range(D):
if (i >> j) & 1:
sum += pc[j][0]*100*(j+1)+pc[j][1]
... | def dfs (i,sum,count,rem):
global ans
if i == D:
if sum < G:
k = max(rem)
n = min(pc[k-1][0],-(-(G-sum)//(k*100)))
count += n
sum += n*100*k
if sum >= G:
ans = min(ans,count)
else:
dfs(i+1,sum,count,rem)
... | p03290 |
from copy import copy
D,G=list(map(int,input().split()))
p=[]
c=[]
for i in range(D):
a,b=list(map(int,input().split()))
p.append(a)
c.append(b)
lst1=[]
lst2=[]
lst3=[]
def func1(l1,l2,l3,p,c,G):
S=0
n=0
ind=0
for i in range(len(l1)):
S+=c[i]*l1[i]
n+=p[i]*l1... | from math import ceil
D,G=list(map(int,input().split()))
P=[]
C=[]
R=[]
for i in range(D):
p,c=list(map(int,input().split()))
P.append(p)
C.append(c)
R.append((i+1)*100*p+c)
bit=2**D
ans=10**19
for i in range(bit):
i=bin(i)[2:].zfill(D)
su=0
num=0
k=-1
for j in range... | p03290 |
#### import ####
import sys
import math
from collections import defaultdict
#### 設定 ####
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
#### 定数 ####
mod = 10**9 + 7
#### 読み込み ####
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def I... | #### import ####
import sys
import math
from collections import defaultdict
#### 設定 ####
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
#### 定数 ####
mod = 10**9 + 7
#### 読み込み ####
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def I... | p03290 |
d,g = list(map(int,input().split()))
P,C = [],[]
for i in range(1, d+1):
p,c = list(map(int,input().split()))
P.append(p)
C.append(c)
ans = 10**9
for bin in range(1, 1<<d):
cnt = tot = 0
for j in range(d):
if bin & 1<<j:
cnt += P[j]
tot += P[j]*(j+1)*100 +... | d,g = list(map(int,input().split()))
g //= 100
P,C = [],[]
for i in range(1, d+1):
p,c = list(map(int,input().split()))
P.append(p)
C.append(c//100)
ans = 10**9
# print(P)
# print(C)
for bin in range(1, 1<<d):
cnt = tot = 0
for j in range(d):
if bin & 1<<j:
cnt += P... | p03290 |
d,g = list(map(int,input().split()))
P,C = [0]*d,[0]*d
for i in range(d): P[i],C[i] = list(map(int,input().split()))
ans = 10**9
for bin in range(1, 1<<d):
cnt = tot = 0
for i in range(d):
if bin & 1<<i:
cnt += P[i]
tot += P[i]*(i+1)*100 + C[i]
if tot < g: continue
... | d,g = list(map(int,input().split()))
g //= 100
P,C = [0]*d,[0]*d
for i in range(d):
P[i],C[i] = list(map(int,input().split()))
C[i] //= 100
ans = 10**9
for bin in range(1, 1<<d):
cnt = tot = 0
for i in range(d):
if bin & 1<<i:
cnt += P[i]
tot += P[i]*(i+1) + C... | p03290 |
d,g = list(map(int,input().split()))
P,C = [0]*d,[0]*d
for i in range(d): P[i],C[i] = list(map(int,input().split()))
ans = 10**9
for bin in range(1, 1<<d):
cnt = tot = 0
for i in range(d):
if bin & 1<<i:
cnt += P[i]
tot += P[i]*(i+1)*100 + C[i]
if tot < g: continue
... | d,g = list(map(int,input().split()))
P,C = [0]*d,[0]*d
for i in range(d): P[i],C[i] = list(map(int,input().split()))
ans = 10**9
for bin in range(0, 1<<d):
cnt = tot = 0
rest_max_bit = -1
for i in range(d):
if bin & 1<<i:
t = (i+1)*100
tot += P[i]*t + C[i]
... | p03290 |
d,g = list(map(int,input().split()))
P,C = [0]*d,[0]*d
for i in range(d): P[i],C[i] = list(map(int,input().split()))
ans = 10**9
for bin in range(1<<d):
cnt = tot = rest_max_bit = 0
for i in range(d):
if bin & 1<<i:
t = (i + 1)*100
tot += P[i]*t + C[i]
cnt +... | d, g = list(map(int,input().split()))
data = [list(map(int,input().split())) for _ in range(d)]
def dfs(d, rest): # difficulty, rest score
if d <= 0: return 10**9
num, bonus = data[d-1] # num of problems, bonus
# now, use or don't use difficulty d?
use = min(rest//(d*100), num) # num when use
... | p03290 |
D, G = list(map(int, input().split()))
pc = []
for n in range(D):
p, c = list(map(int, input().split()))
pc.append([p, c, p * (n + 1)*100 + c])
ans = sum(pc[:][0])
for i in range(2 ** D):
temp = 0
numberProb = 0
box = ["-"] * D
for j in range(D):
if ((i >> j) & 1):
... | D, G = list(map(int, input().split()))
pc = [list(map(int, input().split())) for _ in range(D)]
# 大問D問中のn問といてG点以上をとる最低の問題数n
ans = int(1e10)
for i in range(2 ** D):
zen = []
atemp = 0
ktemp = 0
for j in range(D):
if (i >> j) & 1:
zen.append(True)
else:
... | p03290 |
#ABC 104 C - All Green
#順列総当たりでやる
import itertools
d, g = list(map(int, input().split()))
#print(d)
p=[]
c=[]
ld = []
for i in range(d):
pk, ck = list(map(int, input().split()))
p.append(pk)
c.append(ck)
ld.append(i)
jun = list(itertools.permutations(ld))
ans=10000
for j in jun:
#順列の数だ... | #ABC 104 C - All Green
#ビット総当たりでやる
d, g = list(map(int, input().split()))
#print(d)
p=[]
c=[]
for i in range(d):
pk, ck = list(map(int, input().split()))
p.append(pk)
c.append(ck)
#print(p)
#print(c)
ans = 10000#仮の答え
#2^d通り試す
for i in range(2 ** d):
#右からn番目の桁が1→n+1の配点の問題を完全に解く
te... | p03290 |
d,g = list(map(int,input().split()))
p_input = [0]*d
c_input = [0]*d
for i in range(d):
p_input[i],c_input[i] = list(map(int,input().split()))
ans=float('inf')
for i in range(2**d):
problem=0
point=0
for j in range(d):
if ((i>>j)&1):
problem+=p_input[j]
po... | d,g = list(map(int,input().split()))
P = [0]*d
C = [0]*d
for i in range(d):
P[i],C[i] = list(map(int,input().split()))
ans = float('inf')
for i in range(2**d):
tmp = 0
res = 0
for j in range(d):
if ((i>>j)&1):
tmp+=C[j]+(j+1)*100*P[j]
res+=P[j]
if tmp<g... | p03290 |
import functools
D, G = list(map(int, input().split()))
G = G // 100
sumn = 0
ns = [0] * (D + 1)
cs = [0] * (D + 1)
for i in range(1, D + 1):
n, c = list(map(int, input().split()))
ns[i] = n
cs[i] = c // 100
sumn += n
minn = [0] * (D + 1)
for i in range(1, D + 1):
minn[i] = min(ns[1:i... | from itertools import combinations
D, G = list(map(int, input().split()))
G = G // 100
ns = [0] * (D + 1)
cs = [0] * (D + 1)
for i in range(1, D + 1):
n, c = list(map(int, input().split()))
ns[i] = n
cs[i] = c // 100
ans = sum(ns)
for partialsn in range(1, D + 1):
for partials in combinatio... | p03290 |
inf = float('inf')
def rec(cur, partially_solved, solve_num, score):
if cur == d:
return solve_num if score >= g else inf
res = rec(cur + 1, partially_solved, solve_num, score)
res = min(res,
rec(cur + 1, partially_solved, solve_num + p[cur], score + p[cur] * (cur + 1) * 10... | def main():
from itertools import product
D, G = list(map(int, input().split()))
prob = []
for j in range(1, D + 1):
p, c = list(map(int, input().split()))
prob.append((j * 100, p, c)) # score,amount,bonus
ans = -1
for prd in product([0, 1], repeat=D):
cnt... | p03290 |
#!/mnt/c/Users/moiki/bash/env/bin/python
D,G = list(map(int, input().split()))
points = [ [int(j) for j in input().split()] for _ in range(D)]
points = [ [x[0], x[1], 100*e*x[0]] for e,x in enumerate(points, 1)]
ans = float("inf")
for i in range(1<<D): # for complete bonus bit set
lg = G
cnt = 0
... | #!/mnt/c/Users/moiki/bash/env/bin/python
D,G = list(map(int, input().split()))
points = [ [int(j) for j in input().split()] for _ in range(D)]
points = [ [x[0], x[1], 100*e*x[0]] for e,x in enumerate(points, 1)]
ans = float("inf")
for i in range(1<<D): # for complete bonus bit set
lg = G
cnt = 0
... | p03290 |
D, G = list(map(int, input().split()))
pc = [tuple(map(int, input().split())) for _ in range(D)]
memo = dict()
def rec(crp, crscore, crans):
global D, G, pc, memo
if (crp, crscore) in memo:
return memo[(crp, crscore)] + crans
if crscore >= G:
return crans
elif crp > ... | from itertools import product
D, G = list(map(int, input().split()))
pc = [tuple(map(int, input().split())) for _ in range(D)]
ans = 1e9
for selected in product((True, False), repeat=D):
tmp_score = 0
tmp_count = 0
rest_max = 0
for i, is_select in enumerate(selected):
if is_se... | p03290 |
d,g=list(map(int,input().split()))
spc=[]
c=[]
for i in range(d):
pi,ci=list(map(int,input().split()))
si=pi*100*(i+1)+ci
av=si//pi
spc.append([av,si,pi,ci,100*(i+1)])
#print(spc)
spc.sort(reverse=True)
#print(spc)
#r=g
#icnt=0
#for i in range(d):
# r=r-spc[i][1]
# icnt=icnt+spc... |
import itertools
d,g=list(map(int,input().split()))
pc=[[0]*2 for i in range(d)]
for i in range(d):
pc[i]=list(map(int,input().split()))
icntmin=10*100+1
for j in itertools.product([0,1], repeat=d):
icnt=0
gcnt=0
for i in range(d):
if j[i]==1:
icnt+=pc[i][0]
... | p03290 |
# coding: utf-8
# Your code here!
ans = 10**9
def calc(point,num, i):
global ans
global G, D
if num > ans:
return
if point >= G:
if num < ans:
ans = num
return
if i >= D:
return
for j in range(problem[i][0]):
tmp = point
... | # coding: utf-8
# Your code here!
from itertools import product
ans = 10**9
D, G=list(map(int, input().split()))
problem=[list(map(int,list(input().split()))) for i in range(D)]
for p in product([True, False], repeat=D):
point = 0
num = 0
for i in range(D):
if p[i]:
... | p03290 |
# -*- coding: utf-8 -*-
from itertools import product
D, G = list(map(int, input().split()))
pc_table = [tuple(map(int, input().split())) for _ in range(D)]
bit_table = list(product([0, 1], repeat=D))
cnts = []
for bits in bit_table:
g = sum([
pc_table[i][1] + 100 * (i + 1) * pc_table[i][0]
... | # -*- coding: utf-8 -*-
from itertools import product
D, G = list(map(int, input().split()))
pc_table = [tuple(map(int, input().split())) for _ in range(D)]
bit_table = list(product([0, 1], repeat=D))
cnts = []
for bits in bit_table:
g = sum([
pc_table[i][1] + 100 * (i + 1) * pc_table[i][0]
... | p03290 |
D, G = [int(item) for item in input().split()]
comp_bounas_list = [[int(item) for item in input().split()] for _ in range(D)]
comp_all = []
for i in range(2**D):
temp = []
for j in range(D):
if ((i >> j) & 1) == 1:
temp.append(1)
else:
temp.append(0)
c... | # 以下ペースト可
D, G = [int(item) for item in input().split()]
comp_bounas_list = [[int(item) for item in input().split()] for _ in range(D)]
comp_all = []
for i in range(2**D):
temp = []
for j in range(D):
if ((i >> j) & 1) == 1:
temp.append(1)
else:
temp.appen... | p03290 |
def calcScore(d, g, scoreMap, index, score, solved):
minSolved = 0
for i in range(scoreMap[index][0] + 1):
scoreNow = score + 100 * (index + 1) * i
if i == scoreMap[index][0]:
scoreNow += scoreMap[index][1]
solvedNow = solved + i
if scoreNow >= g:
... | d, g = list(map(int, input().split()))
scoreMap = [list(map(int, input().split())) for i in range(d)]
minimum = 0
for i in range(2**d):
score = 0
solved = 0
for j in range(d):
if (i >> j) & 1 == 1:
score += scoreMap[j][0] * 100 * (j + 1) + scoreMap[j][1]
solved +... | p03290 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.