aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

11
Task/Knapsack-problem-Bounded/D/knapsack-problem-bounded.d
View file

@ -18,16 +18,15 @@ immutable Item[] items = [
{"sunglasses", 7, 20, 1}, {"towel", 18, 12, 2},
{"socks", 4, 50, 1}, {"book", 30, 10, 2}];
Tuple!(int,const(int)[]) chooseItem(in int iWeight, in int idx)
nothrow {
alias memoize!chooseItem memoChooseItem;
Tuple!(int, const(int)[]) chooseItem(in int iWeight, in int idx) nothrow @safe {
alias memoChooseItem = memoize!chooseItem;
if (idx < 0)
return typeof(return).init;
return typeof(return)();
int bestV;
const(int)[] bestList;
with (items[idx])
foreach (i; 0 .. quantity + 1) {
foreach (immutable i; 0 .. quantity + 1) {
immutable wlim = iWeight - i * weight;
if (wlim < 0)
break;
@ -48,7 +47,7 @@ void main() {
const v_lst = chooseItem(400, items.length - 1);
int w;
foreach (i, cnt; v_lst[1])
foreach (immutable i, const cnt; v_lst[1])
if (cnt > 0) {
writeln(cnt, " ", items[i].name);
w += items[i].weight * cnt;