Knapsack Problem Without Value

[Steven D'Aprano]

On Fri, 13 Dec 2013 01:38:47 -0800, geezle86 wrote:

> On Friday, December 13, 2013 9:08:56 AM UTC+7, geez... at gmail.com wrote:
>> Hi,
>>
>> I wanna ask about Knapsack. I do understand what Knapsack is about. But
>> this one i faced is a different problem. There is no value. I mean,
>> it's like this, for example.
>> 
>> I have 4 beams [X0, X1, X2, X3]. Each 1, 2, 2, 3 cm long. I want to
>> make a new 6 cm long connected-beam from these 4 beams. I can make it
>> from some of these. The output will print:
>> 
>> 1, 2, 3 #(X0, X1, X3)
>> 
>> You understand what my problem is? Can you help me?
>
> No, this isnt homework. There is a website called Jollybee (Its
> available only in Bahasa) Here is the link if you dont believe me
> http://jollybee.binus.ac.id/oj/site/problemset/problem/code/HS10F/
> 
> Im just got bored and trying to have fun.
> 
> Not values like that, i mean, everywhere, I found the pseudocode only
> teach me with 2 variable. Mostly weight and its values ($). For short,
> this problem I faced is only the weight, no values($).

With only one value, I think it counts as a variation of the Change-
Making Problem:

http://en.wikipedia.org/wiki/Change-making_problem


-- 
Steven