input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
x = int(eval(input()))
nums = [i for i in range(2, 100004)]
while nums:
primal = nums.pop(0)
if primal >= x:
print(primal)
break
nums = [num for num in nums if num % primal != 0]
| import sys
x = int(eval(input()))
nums = [i for i in range(1, 100004, 2)]
del nums[0]
if x == 2:
print((2))
sys.exit()
while nums:
primal = nums.pop(0)
if primal >= x:
print(primal)
break
nums = [num for num in nums if num % primal != 0]
| p02819 |
import sys
x = int(eval(input()))
nums = [i for i in range(1, 100004, 2)]
del nums[0]
if x == 2:
print((2))
sys.exit()
while nums:
primal = nums.pop(0)
if primal >= x:
print(primal)
break
nums = [num for num in nums if num % primal != 0]
| def check_primal(num):
'''素数だったら0を、違ったら1を返す'''
for mod in range(2, int(num**0.5+1)):
if num % mod == 0:
return 1
return 0
x = int(eval(input()))
for i in range(x, 100004):
if check_primal(i) == 0:
print(i)
break
| p02819 |
X = int(eval(input()))
sosu = [2]
for i in range(3, 10**5+100, 2):
if(all(i % num != 0 for num in sosu)):
sosu.append(i)
if(i >= X):
print((i if X > 2 else 2))
break | import math
X = int(eval(input()))
def isprime(num):
if(num==2):
return True
elif(num%2 == 0):
return False
for i in range(3, int(math.sqrt(num)+1), 2):
if(num%i == 0):
return False
return True
def prime(n):
ans = 2
for i in ... | p02819 |
nn=int(eval(input()))
n=10**5+100
ar=[0]*(n)
ar[1]=0
ans=0
pre=1
for i in range(2,n):
if ar[i]==0:
for j in range(2*i,n,i):
ar[j]=1
ans=1
if ar[nn]==0:
print(nn)
else:
for i in range(nn,n):
if ar[i]==0:
print(i)
break
... | nn=int(eval(input()))
n=10**5+100
ar=[0]*(n)
ar[1]=0
ans=0
pre=1
for i in range(2,int((n**0.5))+1):
if ar[i]==0:
for j in range(2*i,n,i):
ar[j]=1
ans=1
if ar[nn]==0:
print(nn)
else:
for i in range(nn,n):
if ar[i]==0:
print(i)
b... | p02819 |
n, w = list(map(int, input().split()))
V, W = [], []
for i in range(n):
wi, vi = list(map(int, input().split()))
W.append(wi)
V.append(vi)
max_sumv = sum(V)
# dp[i][sum_v] := i-1 番目までの品物から価値がsum_v以上を達成するように選んだときの、重さの総和の最小値
dp = [[10 ** 9] * (max_sumv + 1) for _ in range(n+1)]
dp[0][0] =... | n, w = list(map(int, input().split()))
W, V = [], []
sum_v = 0
for i in range(n):
wi, vi = list(map(int ,input().split()))
W.append(wi)
V.append(vi)
sum_v += vi
memo = [[10**9] * (sum_v + 1) for _ in range(n+1)]
memo[0][0] = 0
for i in range(n):
for v_i in range(sum_v + 1):
memo[i+1][v_i] ... | p03164 |
n,wmax=list(map(int,input().split()))
v=[0]*n
w=[0]*n
for i in range(n):
w[i],v[i]=list(map(int,input().split()))
sv=sum(v)+1
dp=[[float('inf')]*sv for _ in range(n)]
dp[0][v[0]-1]=w[0]
for i in range(n):
dp[i][0]=0
for i in range(n):
for j in range(sv):
dp[i][j]=min(dp[i-1][j],dp[i-1][j... | n,wmax=list(map(int,input().split()))
v=[0]*n
w=[0]*n
for i in range(n):
w[i],v[i]=list(map(int,input().split()))
sv=sum(v)+1
dp=[[float('inf')]*sv for _ in range(n)]
dp[0][v[0]-1]=w[0]
for i in range(n):
dp[i][0]=0
for i in range(n):
for j in range(sv):
dp[i][j]=min(dp[i-1][j],dp[i-1][j... | p03164 |
N,W =list(map(int,input().split()))
weight,value=[],[]
for i in range(N):
w,v = list(map(int,input().split()))
weight.append(w)
value.append(v)
inf = float('inf')
dp = [[inf for _ in range(10**3*N+10)] for _ in range(N+10)]
maxv = sum(value)
#初期化
dp[0][0] =0
for i in range(N):
for sum_v in r... | N,maxW = list(map(int,input().split()))
w,v = [],[]
for i in range(N):
weight,value = list(map(int,input().split()))
w.append(weight)
v.append(value)
maxV=sum(v)
inf = float('inf')
dp = [[inf for _ in range(maxV+1)] for _ in range(N+1)]
dp[0][0] =0
for i in range(N):
for sum_v in range(maxV+1... | p03164 |
n,w = list(map(int,input().split()))
item = [list(map(int,input().split())) for i in range(n)]
dp = [[float('inf')]*(10**5+1) for i in range(n+1)]
dp[0][0] = 0
for i in range(1,n+1):
for j in range(10**5+1):
if j >= item[i-1][1]:
dp[i][j] = min(dp[i-1][j],dp[i-1][j-item[i-1][1]]+item[... | INF = 10**18
N, W = list(map(int, input().split()))
dp = [[INF for i in range(10**5 + 1)] for j in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(10**5 + 1):
if j - v >= 0:
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - v] +... | p03164 |
import sys
input=sys.stdin.readline
import collections
def main():
N,W = list(map(int, input().split()))
I = collections.deque()
for _ in range(N):
I.append(tuple(map(int, input().split())))
MV = N*(10**3) + 1
dp = [[0]*MV for _ in range(N+1)]
inf = 2*10**9
for j in ra... | import sys
input=sys.stdin.readline
import collections
def main():
N,W = list(map(int, input().split()))
I = collections.deque()
for _ in range(N):
I.append(tuple(map(int, input().split())))
MV = 1 + N*(10**3)
dp = [[0]*MV for _ in range(N+1)]
inf = 2*10**9
for j in ra... | p03164 |
# temp
n,w = list(map(int,input().split()))
wv = [tuple(map(int,input().split())) for i in range(n)]
dp = [0] + [float("inf")]*(10**5)
for i in range(n):
for j in range(10**5,wv[i][1]-1,-1):
dp[j] = min(dp[j],dp[j-wv[i][1]]+wv[i][0])
res = 0
for v,e in enumerate(dp):
if e <= w:
res... | # dpE - Knapsack 2
import sys
input = sys.stdin.readline
def main():
n, W = tuple(map(int, input().rstrip().split()))
A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(n))
_, v = list(zip(*A))
lim = sum(v)
dp = [0] + [float("inf")] * lim
for i in range(n):
fo... | p03164 |
# dpE
import sys
input = sys.stdin.readline
def main():
N, W = tuple(map(int, input().rstrip().split()))
A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(N))
lim = 10 ** 5
dp = [0] + [float("inf")] * lim
for i in range(N):
for j in range(lim, A[i][1] - 1, -1):
... | # dpE - Knapsack 2
import sys
input = sys.stdin.readline
def heavy_knapsack(W: int, weight: "Array[int]", value: "Array[int]") -> int:
lim = sum(value)
dp = [0] + [float("inf")] * lim # dp[i] := minimum weight of value i
for w, v in zip(weight, value):
for cur_v in range(lim, v - 1, -1):
... | p03164 |
# E - Knapsack 2
from collections import defaultdict
def main():
INF = 1 << 30
N, W, *WV = list(map(int, open(0).read().split()))
dp = defaultdict(lambda: INF) # dp[i] := minimum weight at value i
dp[0] = 0
for w, v in zip(*[iter(WV)] * 2):
for cur_v, cur_w in tuple(dp.items()):... | # E - Knapsack 2
def knapsack_heavy(limit: int, weight: list, value: list) -> int:
lim = sum(value)
dp = [0] + [1 << 30] * lim # dp[i] := minimum weight at value i
for w, v in zip(weight, value):
for cur_v in range(lim, v - 1, -1):
dp[cur_v] = min(dp[cur_v], dp[cur_v - v] + w)
... | p03164 |
# E - Knapsack 2
from collections import defaultdict
def knapsack_heavy(limit: int, weight: list, value: list) -> int:
dp = defaultdict(lambda: 1 << 30) # dp[i] := minimum weight at value i
dp[0] = 0
for w, v in zip(weight, value):
for cur_v, cur_w in tuple(dp.items()):
if w ... | # E - Knapsack 2
def knapsack_heavy(weight_limit: int, weights: list, values: list) -> int:
max_value = sum(values)
dp = [0] + [1 << 30] * max_value # dp[i] := minimum weight at value i
for w, v in zip(weights, values):
for cur_v in range(max_value, v - 1, -1):
if dp[cur_v - v] + ... | p03164 |
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
N, W = list(map(int, input().split()))
V = N * 10**3
INF = 10**12
dp = [INF] * (V+1)# dp[i]: 価値の総和をiにするための重さの最小値
dp[0] = 0
for _ in range(N)... | #!/usr/bin/env python3
def main():
N, W = list(map(int, input().split()))
V = N * 10**3
INF = 10**12
dp = [INF] * (V+1)# dp[i]: 価値の総和をiにするための重さの最小値
dp[0] = 0
for _ in range(N):
w, v = list(map(int, input().split()))
for j in range(V,-1,-1):
if j-v >= 0:
... | p03164 |
n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
lim=n*10**3+1
dp=[[float('inf') for i in range(lim)] for i in range(n+1)]
for i in range(n+1):
dp[i][0]=0
for i in range(n):
for sum_v in range(lim):
if sum_v-l[i][1]>=0:
dp[i+1][sum_v] = min(dp[i+1][sum_v],d... | n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
lim=n*10**3+1
#dp=[[float('inf') for i in range(lim)] for i in range(n+1)]
dp=[[10**15 for i in range(lim)] for i in range(n+1)]
'''
for i in range(n+1):
dp[i][0]=0
'''
dp[0][0]=0
for i in range(n):
for sum_v in r... | p03164 |
n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
lim=n*10**3+1
#dp=[[float('inf') for i in range(lim)] for i in range(n+1)]
dp=[[10**15 for i in range(lim)] for i in range(n+1)]
'''
for i in range(n+1):
dp[i][0]=0
'''
dp[0][0]=0
for i in range(n):
for sum_v in r... | n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
lim=n*10**3+1
#dp=[[float('inf') for i in range(lim)] for i in range(n+1)]
dp=[[10**15 for i in range(lim)] for i in range(n+1)]
for i in range(n+1):
dp[i][0]=0
#dp[0][0]=0
for i in range(n):
for sum_v in range(li... | p03164 |
import sys
input = sys.stdin.readline
def main():
N, W = [int(x) for x in input().split()]
WV = [[int(x) for x in input().split()] for _ in range(N)]
sumv = 0
for w, v in WV:
sumv += v
dp = [[float("inf")] * (sumv + 1) for j in range(N + 1)]
for i in range(1, N + 1):... | import sys
input = sys.stdin.readline
def main():
N, W = [int(x) for x in input().split()]
WV = [[int(x) for x in input().split()] for _ in range(N)]
sumv = 0
for w, v in WV:
sumv += v
dp = [[10 ** 9 + 1] * (sumv + 1) for j in range(N + 1)]
for i in range(1, N + 1):
... | p03164 |
import sys
# input処理を高速化する
input = sys.stdin.readline
# 入力
N, W = list(map(int, input().split()))
# sum_vの取りうる上限値
MAX_V = (10**3+1) * N
# 最小値を求めるので無限大の値
f_inf = float('inf')
def chmin(a, b):
if a <= b:
return a
else:
return b
def knapsack(n, w):
# dpの初期化 dp[i][sum_v]... | import sys
# input処理を高速化する
input = sys.stdin.readline
# 入力
N, W = list(map(int, input().split()))
# sum_vの取りうる上限値
MAX_V = (10**3) * N +1
# 最小値を求めるので無限大の値
f_inf = float('inf')
def knapsack(n, w):
# dpの初期化 dp[sum_v]は重さの総和の最小値
dp = [f_inf] * MAX_V
# 初期条件
dp[0] = 0
sum_v = 0
# f... | p03164 |
# -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 18:19:39 2020
@author: matsui
"""
N,W=list(map(int,input().split()))
vi,wi=[],[]
for i in range(N):
w,v=list(map(int,input().split()))
wi.append(w)
vi.append(v)
#L = sorted([list(map(int,input().split())) for i in range(N)])
M=int... | # -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 18:19:39 2020
@author: matsui
"""
N,W=list(map(int,input().split()))
vi,wi=[],[]
for i in range(N):
w,v=list(map(int,input().split()))
wi.append(w)
vi.append(v)
#L = sorted([list(map(int,input().split())) for i in range(N)])
M=int... | p03164 |
N,W = list(map(int,input().split()))
c = [tuple(map(int,input().split())) for i in range(N)]
DP = [[float('inf') for i in range(10**3*N+1)] for i in range(N+1)]
DP[0][0] = 0
for i in range(N):
for v in range(10**3*N+1):
if v-c[i][1] < 0:
DP[i+1][v] = DP[i][v]
else:
D... | INF = float('inf')
N,W = list(map(int,input().split()))
wv = [list(map(int,input().split())) for _ in range(N)]
V = 1000*N
dp = [[INF]*(V+1) for _ in range(N+1)]
dp[0][0]=0
for i in range(N):
for j in range(V+1):
if j-wv[i][1] >= 0:
dp[i+1][j] = min(dp[i][j-wv[i][1]]+wv[i][0],dp[i][j])
... | p03164 |
import sys
input = sys.stdin.readline
def main():
# input
N,W = list(map(int,input().split()))
w,v = [0]*N,[0]*N
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
# init dp
v_max = sum(v)
dp = [[float("inf") for i in range(v_max+1)] for _ in range(N)]
... | import sys
input = sys.stdin.readline
def main():
# input
N,W = list(map(int,input().split()))
w,v = [0]*N,[0]*N
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
# init dp
v_max = sum(v)
dp = [[float("inf") for i in range(v_max+1)] for _ in range(N)]
... | p03164 |
import sys
from _operator import itemgetter
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
N, W = na()
maxV = 10 ** 5
dp = [[10**9+7] * (maxV+1) for i in range(N+1)] # dp[i][v] i番目までで価値がvの時の重さの合計の最小値
dp[0][0] = 0
tp ... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
N, W = na()
maxV = 10 ** 5
dp = [[10**9+7] * (maxV+1) for i in range(N+1)] # dp[i][v] i番目までで価値がvの時の重さの合計の最小値
dp[0][0] = 0
tp = [na() for i in range(N)]
list.s... | p03164 |
N,W=list(map(int,input().split()))
w=[]
v=[]
for _ in range(N):
ww,vv=list(map(int,input().split()))
w.append(ww)
v.append(vv)
INF=float("inf")
max_v=10**5+1
dp=[[INF for i in range(max_v)] for j in range(N+1)]
dp[0][0]=0
for i in range(N):
for j in range(max_v):
if j - v[i]>=0:
... | N,W=list(map(int,input().split()))
w=[]
v=[]
for _ in range(N):
ww,vv=list(map(int,input().split()))
w.append(ww)
v.append(vv)
INF=float("inf")
max_v=max(v)*N +1
dp=[[INF for i in range(max_v)] for j in range(N+1)]
dp[0][0]=0
for i in range(N):
for j in range(max_v):
if j - v[i]>=0:... | p03164 |
n, m = list(map(int, input().split()))
inf = 10**11
dp = [inf] * (1000 * n + 1)
dp[0] = 0
for i in range(n):
w, v = list(map(int, input().split()))
for j in range(1000 * n - v, -1, -1):
if dp[j] != inf:
dp[j + v] = min(dp[j + v], dp[j] + w)
ans = 0
for a, b in enumerate(dp):
... | import sys
readline = sys.stdin.buffer.readline
def main():
n, m = list(map(int, readline().split()))
inf = 10**11
dp = [inf] * (1000 * n + 1)
dp[0] = 0
for i in range(n):
w, v = list(map(int, input().split()))
for j in range(1000 * n - v, -1, -1):
if dp[j] ... | p03164 |
def args():
N, W = tuple(map(int, input().split()))
Wi, Vi = [], []
for _ in range(N):
w, v = tuple(map(int, input().split()))
Wi.append(w)
Vi.append(v)
# print(N, W)
# print(Wi, Vi)
return N, W, Wi, Vi
def solve(N, W, Wi, Vi):
if N == 1:
... | def args():
N, W = tuple(map(int, input().split()))
Wi, Vi = [], []
for _ in range(N):
w, v = tuple(map(int, input().split()))
Wi.append(w)
Vi.append(v)
# print(N, W)
# print(Wi, Vi)
return N, W, Wi, Vi
def solve(N, W, Wi, Vi):
DP = [[float("inf")... | p03164 |
#!/usr/bin/env python3
#dp5 #Knapsack 2
#個数制限ありナップサック
#1≤W≤10**9
def e():
n,W = list(map(int,input().split()))
wv = [list(map(int,input().split())) for _ in range(n)]
#横:価値 縦:品物
dp = [[float("inf") for _ in range(10**5+1)] for _ in range(n+1)]
dp[0][0] = 0
for i in range(1,n+1):
... | #!/usr/bin/env python3
#dp5 #Knapsack 2
#個数制限ありナップサック
#1≤W≤10**9
import sys
def LI(): return list(map(int, sys.stdin.readline().split()))
def LIR(n): return [LI() for _ in range(n)]
def e():
n,W = LI()
wv = LIR(n)
#横:価値 縦:品物
dp = [[float("inf") for _ in range(10**5+1)] for _ in range(n+1)]
... | p03164 |
#!/usr/bin/env python3
#dp5 #Knapsack 2
#個数制限ありナップサック
#1≤W≤10**9
import sys
def LI(): return list(map(int, sys.stdin.readline().split()))
def LIR(n): return [LI() for _ in range(n)]
def e():
n,W = LI()
wv = LIR(n)
#横:価値 縦:品物
dp = [[float("inf") for _ in range(10**5+1)] for _ in range(n+1)]
... | #!/usr/bin/env python3
#EDPC E
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | p03164 |
n,w = list(map(int,input().split()))
w_ls, v_ls = [0] * n, [0] * n
for i in range(n):
w_ls[i], v_ls[i] = list(map(int,input().split()))
V = sum(v_ls)
dp = [[float("inf")] * (V+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(V+1):
if j - v_ls[i] >= 0:
dp[i+1][... | n,w_limit = list(map(int,input().split()))
item_ls = [[0,0]]
total_value = 0
for i in range(n):
cost, value = list(map(int,input().split()))
item_ls.append([cost, value])
total_value += value
dp = [[float('inf')] * (total_value+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(1,n+1):
... | p03164 |
from pprint import pprint
n, w = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(n)]
lim = 1
for i in range(n):
lim += wv[i][1]
dp = [[float('inf')] * lim for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(lim):
if j - wv[i][1] >= 0... | from pprint import pprint
n, w = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(n)]
lim = 1
for i in range(n):
lim += wv[i][1]
dp = [[float('inf')] * lim for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(lim):
if j - wv[i][1] >= 0... | p03164 |
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(N: int, W: int, w: "List[int]... | #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(N: int, W: int, w: "List[int]", v: "List[int]"):
dp = [[float(... | p03164 |
N, W = list(map(int, input().split()))
w_v = [list(map(int, input().split())) for _ in range(N)]
V = max(w_v, key=lambda x: x[1])[1] * N
# 1~i-1番目の品物から価値の総和がj以下になるように選んだときの重さ
dp = [[float('inf') for _ in range(V+1)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
w, v = w_v[i]
for j in range(V+... | n, W = list(map(int, input().split()))
data = []
for _ in range(n):
w, v = list(map(int, input().split()))
data.append((w, v))
V = sum([v for _, v in data])
dp = [[float("inf")] * (V + 1) for i in range(n + 1)]
dp[0][0]= 0
for i in range(1, n+1):
w, v = data[i-1]
for j in range(V + 1): ... | p03164 |
N, M = list(map(int, input().split()))
L = 1000000
dp = [[10000000010 for _ in range(L+1)] for _ in range(N+1)]
W, V = [], []
for _ in range(N):
w, v = list(map(int, input().split()))
W.append(w)
V.append(v)
dp[0][0] = 0
for i in range(N):
for j in range(L):
if j + V[i] <= L:
... | N, M = list(map(int, input().split()))
L = 100000
dp = [[1000000001 for _ in range(L+1)] for _ in range(N+1)]
W, V = [], []
for _ in range(N):
w, v = list(map(int, input().split()))
W.append(w)
V.append(v)
dp[0][0] = 0
for i in range(N):
for j in range(L+1):
if j - V[i] >= 0:
... | p03164 |
"""
重さと価値がそれぞれw_i,v_iであるようなn個の品物がある.
これらの品物の中から, 重さの総和がWを超えないように選んだ時の,
価値の総和の最大値を求めよ.
1<=n<=100, 1<=w_i<=10^7, 1<=v_i<=100, 1<=W<=10^9
"""
#-------------------------------------------------------------------------------
#入力
INF = 2000000000
n, W = list(map(int, input().split()))
w = [0]*n
v = [0]*n
for i ... | """
重さと価値がそれぞれw_i,v_iであるようなn個の品物がある.
これらの品物の中から, 重さの総和がWを超えないように選んだ時の,
価値の総和の最大値を求めよ.
1<=n<=100, 1<=w_i<=10^7, 1<=v_i<=100, 1<=limit_w<=10^9
"""
#-------------------------------------------------------------------------------
#入力
INF = 2000000000
"""
メモ : Pythonでは無限大を表す float('inf') があるが, 処理がかなり重たいので
... | p03164 |
"""
重さと価値がそれぞれw_i,v_iであるようなn個の品物がある.
これらの品物の中から, 重さの総和がWを超えないように選んだ時の,
価値の総和の最大値を求めよ.
1<=n<=100, 1<=w_i<=10^7, 1<=v_i<=100, 1<=limit_w<=10^9
"""
#-------------------------------------------------------------------------------
#入力
INF = 2000000000
"""
メモ : Pythonでは無限大を表す float('inf') があるが, 処理がかなり重たいので
... | """
重さと価値がそれぞれw_i,v_iであるようなn個の品物がある.
これらの品物の中から, 重さの総和がWを超えないように選んだ時の,
価値の総和の最大値を求めよ.
1<=n<=100, 1<=w_i<=10^7, 1<=v_i<=100, 1<=limit_w<=10^9
"""
#-------------------------------------------------------------------------------
#入力
INF = 2000000000
"""
メモ : Pythonでは無限大を表す float('inf') があるが, 処理がかなり重たいので
... | p03164 |
n, w = list(map(int, input().split()))
item = [list(map(int, input().split())) for i in range(n)]
max_v = 100005
dp = [[float('inf') for i in range(max_v)] for j in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for sum_v in range(max_v):
if sum_v - item[i][1] >= 0:
dp[i + 1][sum_v]... | n, w = list(map(int, input().split()))
item = [list(map(int, input().split())) for i in range(n)]
max_v = 100005
dp = [[float('inf')] * max_v for j in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for sum_v in range(max_v):
if sum_v - item[i][1] >= 0:
dp[i + 1][sum_v] = min(dp[i + ... | p03164 |
N, W = list(map(int, input().split()))
table = []
for i in range(N):
w,v = list(map(int, input().split()))
table.append((w,v))
INF = W+1
dp = [[INF]*(10**3*N+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
for k in range(10**3*N+1):
w,v = table[i-1]
dp[i][k] = dp[i-1][k]
if v<=... | import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
table = []
for i in range(N):
w,v = list(map(int, input().split()))
table.append((w,v))
INF = W+1
dp = [[INF]*(10**3*N+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
for k in range(10**3*N+1):
w,v = table[i... | p03164 |
import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
table = []
for i in range(N):
w,v = list(map(int, input().split()))
table.append((w,v))
INF = W+1
dp = [[INF]*(10**3*N+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
for k in range(10**3*N+1):
w,v = table[i... | import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
table = []
for i in range(N):
w,v = list(map(int, input().split()))
table.append((w,v))
dp = [[W+1]*(10**3*N+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
w,v = table[i-1]
for j in range(10**3*N+1):
dp... | p03164 |
n=0
W=0
n,W=list(map(int,input().split()))
dp=[W+1]*(101010)
dp[0]=0
for i in range(n):
w,v=list(map(int,input().split()))
j=100000
while j>=0:
if dp[j+v]>dp[j]+w:
dp[j+v]=dp[j]+w
j-=1
ans=0
for v in range(len(dp)):
if dp[v]<=W:
ans=v
print(ans) | n=0
W=0
n,W=list(map(int,input().split()))
dp=[W+1]*101010
dp[0]=0
for i in range(n):
w,v=list(map(int,input().split()))
j=100000
while j>=0:
if dp[j+v]>dp[j]+w:
dp[j+v]=dp[j]+w
j-=1
ans=0
for v in range(len(dp)):
if dp[v]<=W:
ans=v
print(ans) | p03164 |
def recur(n,w):
if n==0 or w==0:
return 0
elif (n,w) in dp:
return dp[(n,w)]
elif l[n-1][0]<=w:
k=max(recur(n-1,w-l[n-1][0])+l[n-1][1],recur(n-1,w))
dp[(n,w)]=k
return k
else:
k=recur(n-1,w)
dp[(n,w)]=k
return k
n,w=list(map(in... | n,w=list(map(int,input().split()))
l=[]
weight=[0]
value=[0]
for _ in range(n):
a,b=list(map(int,input().split()))
value.append(b)
weight.append(a)
maxvalue=sum(value)
dp=[[10**10 for i in range(maxvalue+1)]for i in range(n+1)]
for i in range(n+1):
dp[i][0]=0
for i in range(1,n+1):
fo... | p03164 |
def main():
n, m = list(map(int, input().split()))
w = [0] * n
v = [0] * n
for i in range(n):
w[i], v[i] = list(map(int, input().split()))
t = sum(v) + 1
l = [m + 1] * (t + 1)
for i in range(n):
for j in range(t, v[i] - 1, -1):
k = l[j - v[i]] + w[i]
... | def main():
n, m = list(map(int, input().split()))
w = [0] * n
v = [0] * n
for i in range(n):
w[i], v[i] = list(map(int, input().split()))
t = sum(v)
l = [m + 1] * (t + 1)
l[0] = 0
for i in range(n):
for j in range(t, v[i] - 1, -1):
k = l[j - v[i]] ... | p03164 |
# -*- coding: utf-8 -*-
v_max = 100010
INF = 1000000100
n, w = list(map(int, input().split()))
weight = [0]*n
value = [0]*n
dp = [[INF for i in range(v_max+1)] for i in range(n+1)]
dp[0][0] = 0
for i in range(n):
weight[i], value[i] = list(map(int, input().split()))
for i in range(n):
for j in ra... | # -*- coding: utf-8 -*-
v_max = 100010
INF = 1000000100
n, w = list(map(int, input().split()))
weight = [0]*n
value = [0]*n
dp = [[INF for i in range(v_max+1)] for i in range(n+1)]
dp[0][0] = 0
for i in range(n):
weight[i], value[i] = list(map(int, input().split()))
for i in range(n):
for j in ra... | p03164 |
def main():
n, w = [int(e) for e in input().split()]
maxv = 10 ** 3 * n + 1
t = [-1 for i in range(maxv)]
t[0] = w
for _ in range(n):
nw, nv = [int(e) for e in input().split()]
for i in range(maxv - 1, -1, -1):
if t[i] == -1:
continue
if t[i + nv] < t[i] - nw:
t[... | def main():
n, w = [int(e) for e in input().split()]
maxv = 10 ** 3 * n + 1
t = [-1 for i in range(maxv)]
t[0] = w
cmaxv = 0
for _ in range(n):
nw, nv = [int(e) for e in input().split()]
for i in range(cmaxv, -1, -1):
if t[i] == -1:
continue
if t[i + nv] < t[i] - nw:
... | p03164 |
def main():
n, w = [int(e) for e in input().split()]
maxv = 10 ** 3 * n + 1
t = [-1 for i in range(maxv)]
t[0] = w
cmaxv = 0
for _ in range(n):
nw, nv = [int(e) for e in input().split()]
for i in range(cmaxv, -1, -1):
if t[i] == -1:
continue
if t[i + nv] < t[i] - nw:
... | from sys import stdin
def main():
from builtins import int, range
readline = stdin.readline
n, w = list(map(int, readline().split()))
maxv = 10 ** 3 * n + 1
t = [-1] * maxv
t[0] = w
cmaxv = 0
for _ in range(n):
nw, nv = list(map(int, readline().split()))
for i in range(cmaxv, -1, -1):... | p03164 |
def dp_fn():
N, W = list(map(int, input().split()))
WV = (list(map(int, input().split())) for _ in range(N))
DP = {0:0}
for w, v in WV:
keys = sorted(list(DP.keys()), reverse=True)
for i in keys:
if i + w <= W:
if i+w in DP:
DP[i+w] = max(DP[i] + v, DP[i+w])
... | import sys
input = sys.stdin.readline
def dp_fn():
N, W = list(map(int, input().split()))
WV = (list(map(int, input().split())) for _ in range(N))
DP = {0:0}
for w, v in WV:
keys = sorted(list(DP.keys()), reverse=True)
for i in keys:
j = DP[i]
if j+w <= W:
if i+v... | p03164 |
n,w = list(map(int, input().split()))
wv = []
vsum=0
for _ in range(n):
tmp = list(map(int,input().split()))
wv.append(tmp)
vsum += tmp[1]
dp = [[float("inf") for i in range(vsum+1)] for j in range(n+1)]
dp[0][0]=0
for i in range(1,n+1):
now_w,now_v =wv[i-1]
for v in range(vsum+1):
... | n,w = list(map(int, input().split()))
wv = []
vsum=0
for _ in range(n):
tmp = list(map(int,input().split()))
wv.append(tmp)
vsum += tmp[1]
INF = 1 << 30
dp = [[INF for i in range(vsum+1)] for j in range(n+1)]
dp[0][0]=0
for i in range(1,n+1):
now_w,now_v =wv[i-1]
for v in range(vsu... | p03164 |
#####################################################################################################
##### ナップサック問題 （価値が小さい場合）
#####################################################################################################
"""
経路を状態の添え字に取るような事は無い
経路の末端の情報のみを横軸の添え字に取ることが多い
例：一年生 ⇒ k項目までの総和
パスタ ⇒ k日目に食... | def knapsack_price(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[price <= V] = 価値を固定した時の最小重量 """
V = sum(price_list)
dp_max = W+1
dp = [dp_max] * (V + 1)
dp[0] = 0 # 境界条件： 価値0 の時は重さは0
for item in range(N):
if single:
... | p03164 |
n,mw=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(n)]
dp=[[float('inf') for _ in range(10**5+10)]for _ in range(n+1)]
#dp[i][j]=i個目までの品物を選んだとき、価値をjにする最小の重さ
dp[0][0]=0
for i in range(n):
w,v=l[i]
for j in range(10**5+10):
dp[i+1][j]=min(dp[i+1][j],dp[i][j])
... | n,W=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
m=sum([a[i][1] for i in range(n)])
dp=[[float('inf') for _ in range(m+1)] for _ in range(n+1)]
dp[0][0]=0
for i in range(n):
weight,value=a[i]
for j in range(m+1):
dp[i+1][j]=min(dp[i][j],dp[i+1][j])
... | p03164 |
import sys
import math
from collections import deque
import copy
INF = float("inf")
N, W = list(map(int, input().split()))
weight = []
value = []
for i in range(N):
tempW, tempV = list(map(int, input().split()))
weight.append(tempW)
value.append(tempV)
dp = [[INF for _ in range(N * 1000 + 1)] ... | import sys
import math
from collections import deque
import copy
input = sys.stdin.readline
INF = 10**9+7
N, W = list(map(int, input().split()))
weight = []
value = []
for i in range(N):
tempW, tempV = list(map(int, input().split()))
weight.append(tempW)
value.append(tempV)
dp = [[INF for _ i... | p03164 |
N,W = list(map(int,input().split()))
INF = 10**12
V = 1000 * N
Data = []
Data.append([0,0])
for _ in range(N):
Data.append(list(map(int,input().split())))
#DP[n][v]: n番目までの品物で 価値vの品物を選んだ場合の重さの最小
DP = [[INF]*(V+1) for _ in range(N+1)]
for n in range(N+1):
DP[n][0] = 0
for n in range(1,N+1):
f... | N,W = list(map(int,input().split()))
INF = 10**12
V = 1000 * N
Data = []
Data.append([0,0])
for _ in range(N):
Data.append(list(map(int,input().split())))
DP = [[INF]*(V+1) for _ in range(N+1)]
for n in range(N+1):
DP[n][0] = 0
for n in range(1,N+1):
for v in range(1,V+1):
wi,vi = Da... | p03164 |
import sys
sys.setrecursionlimit(10000000)
def input():
return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
from math import *
from itertools import *
from copy import *
N, W = list(map(int, input().split()))
MV = N * 10**3 + 1
INF = float('inf')
dp1 = ... | import sys
sys.setrecursionlimit(10000000)
def input():
return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
from math import *
from itertools import *
from copy import *
N, W = list(map(int, input().split()))
MV = N * 10**3 + 1
INF = float('inf')
dp = [... | p03164 |
import sys
#from collections import defaultdict
n, limit= list(map(int, sys.stdin.readline().split()))
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
#各重さとi番目の荷物を入れ終わった状態のテーブルをつくる
d = {}
dp = [d.copy() for _ in range(n)]
#初期状態
for w in range(L[0][0], limit+1):
dp[0][w] = L[0][1]
... | import sys
n, limit = list(map(int, sys.stdin.readline().split()))
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
dp = [dict() for i in range(n)]
#print(dp)
dp[0][L[0][1]] = L[0][0]
for i in range(1, n):
dp[i][L[i][1]] = min(L[i][0], dp[i-1].get(L[i][1], float('inf')))
for v, ... | p03164 |
import sys
n, limit = list(map(int, sys.stdin.readline().split()))
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
#print(L)
dp = [{} for i in range(n+1)]
for i in range(n):
Lw, Lv =L[i][0], L[i][1] #①i番目の価値を重さテーブルに代入
dp[i+1][Lw] = Lv
for w, v in list(dp[i].items()):
... | import sys
n, limit = list(map(int, sys.stdin.readline().split()))
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
#print(L)
dp = [{} for i in range(n+1)]
for i in range(n):
Lw, Lv = L[i][0], L[i][1]
dp[i+1][Lv] = min(Lw, dp[i].get(Lv, Lw)) #価値テーブルに重量を入れる
for v, w in... | p03164 |
import sys
import bisect
def input():
return sys.stdin.readline().rstrip()
def main():
N, W = list(map(int, input().split()))
vsup = 10 ** 3 * N + 2
dp = [10 ** 12 + 1] * (vsup) # 価値の総和を i (以上にするための重さの最小値
dp[0] = 0
for i in range(N):
w, v = list(map(int, input().spli... | import sys
import bisect
def input():
return sys.stdin.readline().rstrip()
def main():
N, W = list(map(int, input().split()))
vsup = 10 ** 3 * N + 2
dp = [10 ** 12 + 1] * (vsup) # 価値の総和を i (以上にするための重さの最小値
dp[0] = 0
for i in range(N):
w, v = list(map(int, input().spli... | p03164 |
from copy import deepcopy
n,W = list(map(int,input().split()))
dp = [10**12] * (10**5+1)
dp[0] = 0
for i in range(n):
w,v = list(map(int,input().split()))
pdp = deepcopy(dp)
for j in range(v,10**5+1):
dp[j] = min(pdp[j-v]+w,dp[j])
m = 0
for i in range(10**5+1):
if dp[i] <= W:
m = i
print(m) | n,W = list(map(int,input().split()))
dp = [[10**12] * (10**5+1) for i in range(n+1)]
dp[0][0] = 0
ma = 0
for i in range(1,n+1):
w,v = list(map(int,input().split()))
ma += v
for j in range(v):
dp[i][j] = dp[i-1][j]
for j in range(v,ma+1):
dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])
m = 0
for i ... | p03164 |
N, W = list(map(int, input().split()))
goods = [list(map(int, input().split())) for i in range(N)]
v_sum = sum([i[1] for i in goods])
dp = [float("inf") for i in range(v_sum + 1)]
dp[0] = 0
for i in range(N):
for j in range(v_sum, -1, -1):
dp[j] = min(dp[j - goods[i][1]] + goods[i][0], dp[j])
for ... | N, W = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(N)]
v_sum = sum([item[1] for item in items])
inf = float("inf")
dp = [inf for _ in range(v_sum + 1)]
dp[0] = 0
for i in range(N):
for j in range(v_sum, -1, -1):
if dp[j] > dp[j - items[i][1]] + items... | p03164 |
N, W = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(N)]
sum_v = sum([item[1] for item in items])
inf = float("inf")
dp = [[inf for _ in range(sum_v+1)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(sum_v+1):
if j - items[i][1] >= 0... | N, W = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(N)]
sum_v = sum([item[1] for item in items])
inf = float("inf")
dp = [inf for _ in range(sum_v+1)]
dp[0] = 0
for i in range(N):
for j in range(sum_v, -1, -1):
if j - items[i][1] >= 0:
dp[j] ... | p03164 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
# https://qiita.com/drken/items/dc53c683d6de8aeacf5a#e-問題---knapsack-2
# N個の荷物、ナップザックの容量はW
N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
a, b = list(map(int, in... |
# N個の荷物、ナップザックの容量はW
N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
a, b = list(map(int, input().split()))
w[i] = a
v[i] = b
# 1 <= W <= 10^9なので横軸をWにするとテーブルがでかすぎる
# そのかわりにVの方を横軸にする
# 価値の総合計はまだ不明なので、適当にでかい値にしとく
# 最上部と最左部に0が入るので、その分を+1
V = N*1000+1
dp =... | p03164 |
# N個の荷物、ナップザックの容量はW
N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
a, b = list(map(int, input().split()))
w[i] = a
v[i] = b
# 1 <= W <= 10^9なので横軸をWにするとテーブルがでかすぎる
# そのかわりにVの方を横軸にする
# 価値の総合計はまだ不明なので、適当にでかい値にしとく
# 最上部と最左部に0が入るので、その分を+1
V = N*1000+1
dp =... |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# A = [ int(input()) for _ in range(N) ]
##############################
N, W = list(map(int, input().split()))
w = []
v = []
for i in range(N):
a, b = list(map(int, input().split()))
w.append(a... | p03164 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,W=list(map(int,input().split()))
WV=[tuple(map(int,input().split())) for _ in range(n)]
V=100000
dp=[INF]*(V+1)
dp[0]=0
for w,v in WV:
fo... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, W = list(map(int, input().split()))
dp = [INF] * (n * 1001 + 1)
dp[0] = 0
for _ in range(n):
w, v = list(map(int, input().split()))
... | p03164 |
N,W = list(map(int,input().split(" ")))
INF = 1e11
v = [INF]*100010
v[0] = 0
for i in range(N):
weight,value = list(map(int,input().split(" ")))
for j in range(100001,0,-1):
if j < value:
break
v[j] = min(v[j],v[j-value]+weight)
for i in range(100001,0,-1):
if v[i] <= W:
print(i)
... | N,W = list(map(int,input().split(" ")))
INF = 1e11
v = [INF]*100010
v[0] = 0
for i in range(N):
weight,value = list(map(int,input().split(" ")))
for j in range(100001,0,-1):
if j < value:
break
v[j] = min(v[j],v[j-value]+weight)
ans = 0
for i in range(100001,0,-1):
if v[i] <= W:
... | p03164 |
N, W = list(map(int, input().split()))
DP = dict()
DP[W] = 0
def maxv(i, v):
if not DP.get(i):
DP[i] = v
else:
if v > DP[i]:
DP[i] = v
for w, v in (list(map(int, input().split())) for _ in range(N)):
DPpre = DP.copy()
for i in DPpre:
if i - w >= 0:
... | N, W = list(map(int, input().split()))
IN = list(list(map(int, input().split())) for _ in range(N))
sumw = 0
sumv = 0
for w, v in IN:
sumw += w
sumv += v
DP = dict()
DP[sumv] = sumw
def minv(i, v):
if not DP.get(i):
DP[i] = v
else:
if v < DP[i]:
DP[i] = v
... | p03164 |
N, W = list(map(int, input().split()))
IN = list(list(map(int, input().split())) for _ in range(N))
sumw = 0
sumv = 0
for w, v in IN:
sumw += w
sumv += v
DP = dict()
DP[sumv] = sumw
def minv(i, v):
if not DP.get(i):
DP[i] = v
else:
if v < DP[i]:
DP[i] = v
... | N, W = list(map(int, input().split()))
IN = list(list(map(int, input().split())) for _ in range(N))
sumw = 0
sumv = 0
for w, v in IN:
sumw += w
sumv += v
DP = dict()
DP[sumv] = sumw
def minv(i, v):
if not DP.get(i):
DP[i] = v
else:
if v < DP[i]:
DP[i] = v
... | p03164 |
N,W=list(map(int,input().split()))
lwv=[]
for i in range(N):
lwv.append(list(map(int,input().split())))
ldp=[[float("inf") for j in range(10**5)] for i in range(N)]
for j in range(10**5):
if lwv[0][1]>=j+1:
ldp[0][j]=lwv[0][0]
for i in range(1,N):
for j in range(10**5):
comp=ldp[i-... | N,W=list(map(int,input().split()))
lw=[]
lv=[]
for i in range(N):
w,v=list(map(int,input().split()))
lw.append(w)
lv.append(v)
ldp=[[float("inf") for j in range(10**5)] for i in range(N)]
for j in range(10**5):
if lv[0]>=j+1:
ldp[0][j]=lw[0]
for i in range(1,N):
for j in range(10... | p03164 |
n,w=list(map(int, input().split()))
m=10**5+1
x=[list(map(int, input().split())) for i in range(n)]
dp=[[float('inf')]*m for i in range(n+1)]
dp[0][0]=0
for i in range(n):
for j in range(m):
if j>=x[i][1]:
dp[i+1][j]=min(dp[i][j],dp[i][j-x[i][1]]+x[i][0])
else:
dp[i... | N, W = list(map(int, input().split()))
L = [list(map(int, input().split())) for i in range(N)]
V = 0
for i in range(N):
V += L[i][1]
dp = [[float('inf')] * (V + 1) for i in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(V+1):
if j - L[i][1] >= 0:
dp[i+1][j] = min(dp[i][j]... | p03164 |
N, W = list(map(int, input().split()))
L = [list(map(int, input().split())) for i in range(N)]
V = 0
for i in range(N):
V += L[i][1]
dp = [[float('inf')] * (V + 1) for i in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(V+1):
if j - L[i][1] >= 0:
dp[i+1][j] = min(dp[i][j]... | N, W = list(map(int, input().split()))
L = [list(map(int, input().split())) for i in range(N)]
V = 0
for i in range(N):
V += L[i][1]
dp = [[10**9+1] * (V + 1) for i in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(V+1):
if j - L[i][1] >= 0:
dp[i+1][j] = min(dp[i][j], dp[... | p03164 |
N, W = list(map(int, input().split()))
L = [list(map(int, input().split())) for i in range(N)]
V = 0
for i in range(N):
V += L[i][1]
dp = [[10**9+1] * (V + 1) for i in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(V+1):
if j - L[i][1] >= 0:
dp[i+1][j] = min(dp[i][j], dp[... | N, W = list(map(int, input().split()))
L = [list(map(int, input().split())) for i in range(N)]
V = 0
for i in range(N):
V += L[i][1]
dp = [10**9+1] * (V + 1)
dp[0] = 0
for i in range(N):
for j in range(V, -1, -1):
dp[j] = min(dp[j], dp[j-L[i][1]] + L[i][0])
ans = 0
for j in range(V+1):
i... | p03164 |
N,W=list(map(int,input().split()))
w=[]
v=[]
for i in range(N):
a,b=list(map(int,input().split()))
w.append(a)
v.append(b)
V=sum(v)
dp=[[float("inf") for i in range(V+1)] for _ in range(110)]
dp[0][0]=0
for i in range(0,N):
for j in range(V+1):
if j-v[i]>=0:
dp[i+1][... | N,W=list(map(int,input().split()))
w=[0]*N
v=[0]*N
for i in range(N):
w[i],v[i]=list(map(int,input().split()))
V=sum(v)
dp=[[float("inf") ]*(V+1) for _ in range(110)]
dp[0][0]=0
for i in range(0,N):
for j in range(V+1):
if j-v[i]>=0:
dp[i+1][j]=min(dp[i+1][j],dp[i][j-v[i]]+w[i... | p03164 |
import sys
input = sys.stdin.readline
n, w = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for _ in range(n)]
V_MAX = 10**5
dp = [[w + 1] * (V_MAX + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i, (wi, vi) in enumerate(items):
for j in range(V_MAX + 1):
if j >= vi:
... | import sys
input = sys.stdin.readline
n, w = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for _ in range(n)]
V_MAX = 10**5
dp = [[w + 1] * (V_MAX + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i, (wi, vi) in enumerate(items):
for j in range(V_MAX + 1):
if j >= vi:
... | p03164 |
N,W = list(map(int, input().split()))
m = []
v = []
for i in range(N):
a,b = list(map(int, input().split()))
m.append(a)
v.append(b)
sum_v = sum(v)
dp = [[float('inf') for i in range(sum_v+1001)]for j in range(N+1)]
for i in range(N):
for j in range(sum_v+1):
if j == 0:
d... | N,W = list(map(int, input().split()))
m = []
v = []
for i in range(N):
a,b = list(map(int, input().split()))
m.append(a)
v.append(b)
sum_v = sum(v)
dp = [[10**15 for i in range(sum_v+1001)]for j in range(N+1)]
for i in range(N):
dp[i][0] = 0
for j in range(sum_v+1):
if j != 10*... | p03164 |
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
# i+1番目... | N,W=list(map(int,input().split()))
w,v=[0]*N,[0]*N
for i in range(N):
w[i],v[i]=list(map(int,input().split()))
dp=[[float('inf')]*(sum(v)+1) for i in range(N+1)]
dp[0][0]=0
for i in range(1,N+1):
for j in range(len(dp[0])):
if j>=v[i-1]:
dp[i][j]=w[i-1]+dp[i-1][j-v[i-1]]
... | p03164 |
n, w = list(map(int, input().split()))
wv = [tuple(map(int, input().split())) for _ in range(n)]
INF = 10**9 + 100
MAX_V = 10**5 + 100
dp = [INF] * (MAX_V + 1)
dp[0] = 0
for wi, vi in wv:
for sum_v in reversed(list(range(vi, MAX_V+1))):
dp[sum_v] = min(dp[sum_v - vi] + wi, dp[sum_v])
#print(dp)
... | n, w = list(map(int, input().split()))
wv = [tuple(map(int, input().split())) for _ in range(n)]
INF = 10**9 + 100
MAX_V = 10**5 + 100
dp = [INF] * (MAX_V + 1)
dp[0] = 0
for wi, vi in wv:
for sum_v in reversed(list(range(vi, MAX_V+1))):
dp[sum_v] = min(dp[sum_v - vi] + wi, dp[sum_v])
#print(dp)
... | p03164 |
inf = float('inf')
n, w = list(map(int, input().split()))
wv = tuple(tuple(map(int, input().split())) for _ in range(n))
dp = tuple([inf] * (pow(10, 3) * n + 1) for _ in range(n + 1))
dp[0][0] = 0
for ind, (wi, vi) in enumerate(wv, 1):
for v in range(pow(10, 3) * n + 1):
if vi <= v:
... | inf = float('inf')
n, w = list(map(int, input().split()))
e = tuple(list(map(int, input().split())) for _ in range(n))
wt, vt = list(zip(*e))
sv = sum(vt)
dp = tuple([inf] * (sv + 1) for _ in range(n + 1))
dp[0][0] = 0
for i in range(n):
dp[i + 1][:vt[i]] = dp[i][:vt[i]]
for j in range(vt[i], sv ... | p03164 |
n,w=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(n)]
dp=[float("inf")]*(10**5+1)
dp[0]=0
for i in range(n):
for j in range(10**5,A[i][1]-1,-1):
dp[j]=min(dp[j],dp[j-A[i][1]]+A[i][0])
ans=0
for v,e in enumerate(dp):
if e<=w:
ans=v
print(ans) | import sys
input=sys.stdin.readline
n,w=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(n)]
dp=[float("inf")]*(10**5+1)
dp[0]=0
for i in range(n):
for j in range(10**5,A[i][1]-1,-1):
dp[j]=min(dp[j],dp[j-A[i][1]]+A[i][0])
ans=0
for v,e in enumerate(dp):
if e<=w:
... | p03164 |
import sys
input=sys.stdin.readline
from collections import defaultdict as dd
n,w=list(map(int,input().split()))
we=[0]*n
val=[0]*n
for i in range(n):
ww,v=list(map(int,input().split()))
we[i]=ww
val[i]=v
dp=dd(lambda:-1)
def solve(i,w,we,val):
if(i==0 or w==0):
return 0
if(dp[(i,w)]!=-1):
... | import sys
input=sys.stdin.readline
from collections import defaultdict as dd
n,w=list(map(int,input().split()))
maxn=10000000000000000
we=[0]*n
val=[0]*n
su=0
for i in range(n):
ww,v=list(map(int,input().split()))
we[i]=ww
val[i]=v
su+=v
dp=[maxn]*(su+1)
dp[0]=0
for i in range(n):
f... | p03164 |
import itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,W = LI()
wv = [LI() for _ in range(N)]
V = N*10**3
dp = [[float('INF')]*(V+1) for _ in range(N+1)]
dp[0][0] = 0
for i,j in itertools.product(list(range(1,N+1)),list(range(V+1))):
w,v = wv[i-1]
if j-v>=0:
... | import itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,W = LI()
wv = [LI() for _ in range(N)]
V = N*10**3
dp = [[float('INF')]*(V+1) for _ in range(N+1)]
dp[0][0] = 0
for i,j in itertools.product(list(range(1,N+1)),list(range(V+1))):
w,v = wv[i-1]
if j-v>=0 and dp[... | p03164 |
import itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,W = LI()
wv = [LI() for _ in range(N)]
V = 10**5
dp = [[float('INF')]*(V+1) for _ in range(N+1)]
dp[0][0] = 0
for i,j in itertools.product(list(range(1,N+1)),list(range(V+1))):
w,v = wv[i-1]
if j-v>=0 and dp[i-... | import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,W = LI()
wv = [LI() for _ in range(N)]
V = N*10**3
dp = [[float('INF')]*(V+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
w,v = wv[i-1]
for j in range(V+1):
if j-v>=0 and dp[i-1][j-v]+w<=W:
... | p03164 |
n,w=list(map(int,input().split()))
dp=[999999999999999]*(100001)
dp[0]=0
for i in range(n):
wt,val=list(map(int,input().split()))
for j in range(100000,val-1,-1):
dp[j]=min(dp[j],dp[j-val]+wt)
for i in range(100000,-1,-1):
if dp[i]<=w:
print(i)
exit() | n,w=list(map(int,input().split()))
l=(n*1000)+1
dp=[9999999999]*(l)
dp[0]=0
for i in range(n):
wt,val=list(map(int,input().split()))
for j in range(l-1,val-1,-1):
dp[j]=min(dp[j],dp[j-val]+wt)
for i in range(l-1,-1,-1):
if dp[i]<=w:
print(i)
exit() | p03164 |
import sys
from collections import Counter, deque, defaultdict
from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
from functools import reduce
from math import ceil, floor, log10, log2, factorial
from pprint import pprint
sys.setrecursionlimit(1000000)
# MOD = 10 ** 9 + 7
... | import sys
from collections import Counter, deque, defaultdict
from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
from functools import reduce
from math import ceil, floor, log10, log2, factorial
from pprint import pprint
sys.setrecursionlimit(1000000)
# MOD = 10 ** 9 + 7
... | p03164 |
import sys
input = sys.stdin.readline
N, W = [int(x) for x in input().split()]
wv = []
for _ in range(N):
wv.append([int(x) for x in input().split()])
V = 10 ** 5
inf = float("inf")
dp = [[inf] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
ans = -1
for i in range(N):
for j in range(V + 1):
... | import sys
input = sys.stdin.readline
n, W = [int(x) for x in input().split()]
wv = [[int(x) for x in input().split()] for _ in range(n)]
dp = [[float('inf')] * (10**5 + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(1, n + 1):
w, v = wv[i - 1]
for j in range(10**5 + 1):
if j - v >... | p03164 |
N, W = list(map(int, input().split()))
WV = [list(map(int, input().split())) for _ in range(N)]
#import math
INF = 10 ** 12 # math.inf
V = 10 ** 5 + 10
dp = [[INF] * V for _ in range(N + 1)]
dp[0][0] = 0
for i, (w, v) in enumerate(WV):
for n in range(V):
if v <= n:
dp[i + 1][n] = min(dp[i + 1][n],... | N, W = list(map(int, input().split()))
WV = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 12
V = 10 ** 3 * 100 + 10
dp = [0] + [INF] * V
for w, v in WV:
for i in range(V, v - 1, -1):
dp[i] = min(dp[i], dp[i - v] + w)
r = 0
for i in range(V):
if dp[i] <= W:
r = i
print(r)
"""... | p03164 |
N, W = list(map(int, input().split()))
WV = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 12
V = 10 ** 3 * 100 + 10
dp = [0] + [INF] * V
for w, v in WV:
for i in range(V, v - 1, -1):
dp[i] = min(dp[i], dp[i - v] + w)
r = 0
for i in range(V):
if dp[i] <= W:
r = i
print(r)
"""... | N, W = list(map(int, input().split()))
WV = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 12
MAX_V = 10 ** 5 + 10
dp = [INF] * MAX_V
dp[0] = 0
for w, v in WV:
for i in range(MAX_V - 1, v - 1, -1):
dp[i] = min(dp[i], dp[i - v] + w)
#print(dp)
max_v = 0
for v, w in enumerate(dp):
... | p03164 |
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return ... | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return ... | p03164 |
N, W = list(map(int, input().split()))
dp = [[W+1]*(100000+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
w, v = list(map(int, input().split()))
for j in range(100000+1):
if j+v <= 100000:
dp[i+1][j+v] = min(dp[i+1][j+v], dp[i][j] + w)
dp[i+1][j] = min(dp[i+1][j], dp... | INF_V = 1000*100
N, W = list(map(int, input().split()))
dp = [[W+1]*(INF_V+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
w, v = list(map(int, input().split()))
for j in range(INF_V-1000+1):
dp[i+1][j+v] = min(dp[i+1][j+v], dp[i][j] + w)
dp[i+1][j] = min(dp[i+1][j], dp[i][j])
p... | p03164 |
MAX_INT = int(10e10)
N,W = list(map(int,input().split()))
w = [0]
v = [0]
for i in range(N):
a,b = list(map(int,input().split()))
w.append(a)
v.append(b)
V_MAX = max(v)
# dp[i][v] = w
dp = [[MAX_INT]*(N*V_MAX+1) for i in range(N+1)]
for i in range(1,N+1):
dp[i-1][v[i-1]] = w[i-1]
for j in... | MAX_INT = int(10e10)
N,W = list(map(int,input().split()))
w = [0]
v = [0]
for i in range(N):
a,b = list(map(int,input().split()))
w.append(a)
v.append(b)
V_MAX = max(v)
# dp[i][v] = w
dp = [[MAX_INT]*(N*V_MAX+1) for i in range(N+1)]
for i in range(N+1):
dp[i][v[i]] = w[i]
for i in range(1,N... | p03164 |
def solve():
N, W = list(map(int, input().split()))
MAX_V = 100100
MAX_N = 110
w = []
v = []
for i in range(N):
tmpw, tmpv = list(map(int, input().split()))
w.append(tmpw)
v.append(tmpv)
dp = [[float('inf') for i in range(MAX_V+1)] for j in range(MAX_N+1)]... | def solve():
n, w = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(n)]
lim = n * 10 ** 3 + 1
dp = [[10**15 for i in range(lim)] for i in range(n+1)]
for i in range(n+1):
dp[i][0] = 0
for i in range(n):
for sum_v in range(lim):
... | p03164 |
N,W = list(map(int,input().split()))
WV = [[0,0]] + [list(map(int,input().split())) for _ in range(N)]
vrng = (10**3)*N+1
dp = [[float('inf') for _ in range(vrng)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
tmpw, tmpv = WV[i]
for j in range(vrng):
if j-tmpv>=0:
dp[i][j] = min(dp[i-... | N,W = list(map(int,input().split()))
WV = [[0,0]] + [list(map(int,input().split())) for _ in range(N)]
sumV = sum([v for _,v in WV])
dp = [[float('inf') for _ in range(sumV+1)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
tmpw, tmpv = WV[i]
for j in range(sumV+1):
if j-tmpv>=0:
dp[... | p03164 |
n,W = list(map(int,input().split()))
w = [0]*(n+1)
v = [0]*(n+1)
for i in range(1,n+1): w[i],v[i] = list(map(int,input().split()))
mv = n*max(v)
dp = [[float("INF")]*(mv+1) for _ in range(n+1)]
for i in range(n): dp[i][0] = 0
for i in range(1,n+1):
for s in range(1,mv+1):
if s - v[i] < 0: dp[i][s] ... | n,W = list(map(int,input().split()))
w = [0]*n
v = [0]*n
for i in range(n): w[i],v[i] = list(map(int,input().split()))
mv = n*max(v)
dp = [[float("INF")]*(mv+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for s in range(mv+1):
if s - v[i] < 0: dp[i+1][s] = dp[i][s]
else: dp[i+1][s... | p03164 |
n,W = list(map(int,input().split()))
w = [0]*n
v = [0]*n
for i in range(n): w[i],v[i] = list(map(int,input().split()))
mv = n*max(v)
dp = [[float("INF")]*(mv+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for s in range(mv+1):
if s - v[i] < 0: dp[i+1][s] = dp[i][s]
else: dp[i+1][s... | n,W = list(map(int,input().split()))
w = [0]*n
v = [0]*n
for i in range(n): w[i],v[i] = list(map(int,input().split()))
mv = sum(v)
dp = [[float("INF")]*(mv+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for s in range(mv+1):
if s - v[i] < 0: dp[i+1][s] = dp[i][s]
else: dp[i+1][s] ... | p03164 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, W = na()
wv = [na() for _ in range(n)]
dp = [0]+[float("inf")]*(10**5)
for i in range(n):
for j in range(10**5,1,-1):
... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, W = na()
wv = [na() for _ in range(n)]
dp = [0]+[float("inf")]*(10**5)
for i in range(n):
for j in range(10**5,wv[i][1]-1,-1)... | p03164 |
import sys
# input処理を高速化する
input = sys.stdin.readline
# 入力
N, W = list(map(int, input().split()))
array = [list(map(int, input().split())) for _ in range(N)] # [重さ、価値]
# sum_vの取りうる上限値
# MAX_V = (10**3 + 1) * N
MAX_V = 0
for line in array:
MAX_V += line[1]
MAX_V += 1
# 最小値を求めるので無限大の値
f_inf = float('inf... | # N個、重さW
N, W = list(map(int, input().split()))
# 重さ, 価値
array = [list(map(int, input().split())) for _ in range(N)]
# 価値の最大値
sum = 1
for i in range(N):
sum += array[i][1]
weights = [[float('inf')] * (sum + 1) for _ in range(N + 1)]
# 初期値
weights[0][0] = 0
# 価値ごとの重さの最小値を出す
for n in range(N):
... | p03164 |
import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
INF = float("inf")
dp = [0] + [INF] * 10**5
for _ in range(N):
w, v = list(map(int, input().split()))
for j in range(10**5, v-1, -1):
dp[j] = min(dp[j], dp[j-v] + w)
for i, x in enumerate(dp):
if x <= W:
ans = ... | N, W = list(map(int, input().split()))
INF = float("inf")
dp = [0] + [INF] * 10**5
for _ in range(N):
w, v = list(map(int, input().split()))
for j in range(10**5, v-1, -1):
dp[j] = min(dp[j], dp[j-v] + w)
for i, x in enumerate(dp):
if x <= W:
ans = i
print(ans) | p03164 |
def main2():
#1:初期化
N,W = list(map(int,input().split()))
wv = []
for _ in range(N):
wv.append(list(map(int,input().split())))
dp = [[W+1]*(1000*N+1) for i in range(N+1)] #valueの最大値は10**3なので全てが10**3でも入るような配列を用意．
#print(*dp,sep="\n")
#2:初期値(dp[0][0]だけだと結果が合わない)
for i in ... | def main():
#1:初期化
N,W = list(map(int,input().split()))
dp = [W+1]*(N*10**3+1)
#2:初期値
dp[0] = 0
#3:dp実行部(貰うDP)
for i in range(N):
w, v = list(map(int,input().split()))
for i in range(N*10**3, v-1, -1):
tmp = dp[i-v] + w
if dp[i] > tmp:
... | p03164 |
N,W = list(map(int,input().split()))
w,v = [0]*N,[0]*N
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
dp = [[10**9+1]*(sum(v)+1) for i in range(N+1)]
dp[0][0] = 0
#v[i]を使うかどうか
for i in range(N):
#価値がjのときの最小の重さ総量
for j in range(sum(v)+1):
if j >= v[i]:
dp... | N,W = list(map(int,input().split()))
w,v = [0]*N,[0]*N
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
# dp[i][j]:i番目の品物を詰めて価値jのときの重さの最小値
dp = [[10**9+1]*(sum(v)+1) for i in range(N+1)]
dp[0][0] = 0
#v[i-1]を使うかどうか
for i in range(1,N+1):
#価値がjのときの最小の重さ
for j in range(sum(v)+1)... | p03164 |
N,W = list(map(int, input().split()))
v_max = (10**3)*(N+1)
inf = float('inf')
dp = [inf for _ in range(v_max+1)]
dp[0] = 0
for _ in range(N):
w,v = list(map(int, input().split()))
for j in range(v_max,-1,-1):
if j==0:
dp[j] = 0
else:
a = dp[j]
b = w + dp[j-v]
if v>j:
dp[j] = a
... | import sys
input = sys.stdin.buffer.readline
N,W = list(map(int, input().split()))
v_max = (10**3)*N
inf = float('inf')
dp = [inf for _ in range(v_max+1)]
dp[0] = 0
for _ in range(N):
w,v = list(map(int, input().split()))
for j in range(v_max,v-1,-1):
b = w + dp[j-v]
if b<dp[j]:
dp[j] = b
ans ... | p03164 |
N,W=list(map(int,input().split()))
w=[]
v=[]
for _ in range(N):
a,b=list(map(int,input().split()))
w.append(a)
v.append(b)
V=sum(v)
dp=[[V+1 for _ in range(V+1)] for _ in range(N+1)]
dp[0][0]=0
ans=0
for i in range(N): #i番目の荷物を拾うかどうか
for j in range(V+1): #価値jを超える重量の最小値
dp[i+1][j... | N,W=list(map(int,input().split()))
w=[]
v=[]
for _ in range(N):
a,b=list(map(int,input().split()))
w.append(a)
v.append(b)
V=sum(v)
dp=[[10**9 for _ in range(V+1)] for _ in range(N+1)]
dp[0][0]=0
ans=0
for i in range(N): #i番目の荷物を拾うかどうか
for j in range(V+1): #価値jを超える重量の最小値
dp[i+1]... | p03164 |
#E
inf = float("inf")
N,W = list(map(int,input().split()))
WV = [list(map(int,input().split())) for _ in range(N)]
dp = [[inf for j in range(10**5+1)] for i in range(N+1)] #dp[i][v] = W
for i in range(N):
dp[i][0] = 0
for i in range(N):
w,v = WV[i]
for j in range(10**5+1):
if j+v <= ... |
n, w = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(n)]
v_max = 10 ** 5
w_max = 10 ** 18
dp = [[w_max for _ in range(v_max + 1)] for _ in range(n + 1)]
for i in range(n):
dp[i][0] = 0
for i in range(n):
w_, v_ = wv[i]
for j in range(v_max + 1):
... | p03164 |
n,W=list(map(int,input().split()))
w=[]
v=[]
for i in range(n):
a,b=list(map(int,input().split()))
w.append(a)
v.append(b)
V=sum(v)
INF=10**18
dp=[[INF for _ in range(V+1)] for _ in range(n+1)]
dp[0][0]=0
for i in range(n):
for j in range(V+1):
if j<v[i]:dp[i+1][j]=dp[i][j]
else:dp[i+1][j]... | INF=10**18
n,m=list(map(int,input().split()))
w=[0]*n
v=[0]*n
for i in range(n):
w[i],v[i]=list(map(int,input().split()))
k=sum(v)
dp=[INF]*(k+1)
dp[0]=0
for i in range(n):
for j in range(k,-1,-1):
if j>=v[i] and dp[j-v[i]]!=INF:dp[j]=min(dp[j],dp[j-v[i]]+w[i])
for i,x in enumerate(dp):
if x<=m:a... | p03164 |
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import sys
N,W = list(map(int, input().split()))
v = [0] * N
w = [0] * N
for i in range(N):
w[i],v[i] = list(map(int, input().split()))
dp = [float('inf')] * (10**5+1)
dp[0] = 0
MAX_V = 0
for i in range(N):
MAX_V += v[i]
for j in range(MAX_V,-1,-1):
... | # /usr/bin/python
# -*- coding: utf-8 -*-
#
import sys
N,W = list(map(int, input().split()))
v = [0] * N
w = [0] * N
for i in range(N):
w[i],v[i] = list(map(int, input().split()))
dp = [float('inf')] * (sum(v)+1)
dp[0] = 0
MAX_V = 0
ans = 0
for i in range(N):
MAX_V += v[i]
for j in range(MAX_... | p03164 |
N,W = list(map(int,input().split()))
weight = [0]
value = [0]
for i in range(N):
w,v = list(map(int,input().split()))
weight.append(w)
value.append(v)
maxValue = N*1000
dp = [[float("inf") for i in range(maxValue+1)] for j in range(N+1)]
for i in range(N+1):
dp[i][0] = 0
for i in range(1,N+... |
N,W = list(map(int,input().split()))
weight = [0]
value = [0]
for i in range(N):
w,v = list(map(int,input().split()))
weight.append(w)
value.append(v)
maxValue = sum(value)
dp = [[float("inf") for i in range(maxValue+1)] for j in range(N+1)]
for i in range(N+1):
dp[i][0] = 0
for i in ... | p03164 |
N,W = list(map(int,input().split()))
INF = 10**9+7
NV = (10**3)*N
dp = [[0]+[INF for j in range(NV)] for i in range(N+1)]
for i in range(1,N+1):
w,v = list(map(int,input().split()))
for j in range(NV+1):
if j < v:
dp[i][j] = min(dp[i-1][j], w)
else:
dp[i][j] =... | N,W = list(map(int,input().split()))
INF = 10**9+7
NV = (10**3)*N
dp = [[INF for j in range(NV+1)] for i in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
w,v = list(map(int,input().split()))
for j in range(NV+1):
if j < v:
dp[i][j] = min(dp[i-1][j], w)
else:
... | p03164 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.