Last active
June 5, 2020 07:46
-
-
Save nyunerrr/9b22613f40febdc66305df5f0d2c32e5 to your computer and use it in GitHub Desktop.
ナップザック問題 全探索
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#引数の受け取り | |
n,w = map(int,input().split()) | |
vw = [0]*n | |
#ビット全探索を行うために、ありうる組み合わせを全て作る | |
for i in range(0,n): | |
vw[i] = input().split() | |
p = [] | |
for i in range(2**n): | |
tmp = [0]*n | |
for j in range(n): | |
if i >> j & 1: | |
tmp[j] = 1 | |
p.append(tmp) | |
print(p) | |
#変数pに格納した全ての組み合わせを試す | |
x = [] | |
for i in range(len(p)): | |
temp = [0]*2 | |
for j in range(len(p[i])): | |
if p[i][j] == 1: | |
temp[0] += int(vw[j][0]) | |
temp[1] += int(vw[j][1]) | |
if(temp[1] <= w): | |
x.append(temp[0]) | |
print(max(x)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment