Logically sorting integers data

Question

I have following patterns of list available to play with.

Values : 
20,
25,
30,
35,
40,
45,
50,
55,
60,
70,
75,
80,
90,
100,
120

Next I have another set of values like these:

200,225,300,50,45,75, 15, 72

Now for the value 200, I want the algorithm that to fetch possible values that might result it's sum in to a

LIST [100+100], [100+50+50], [50+50+50+50], [120+80]..

Similarly for 225:

[25+120+80], [25+100+100], [100+45+80]..

and put it on another list.

exceptionally for 15,

it can fetch [20]

for 72 it can fetch [70], [75]

Can any body help me to derive this logic?

I am trying to iterate n x n times for the value such that the sum will be equal to 225 or the given value. — user936597, Jun 18 '12 at 10:45
there is only one exception that belongs to same class.. [20] shows the minimum value that exist in the list while 72 shows possibility of any middle value; — user936597, Jun 18 '12 at 10:46
Check [This](http://stackoverflow.com/questions/83547/algorithm-to-find-which-numbers-from-a-list-of-size-n-sum-to-another-number) — Damith, Jun 18 '12 at 10:54
Sometime it's very difficult to ask what I want! in fact everytime! — user936597, Jun 18 '12 at 11:18

score 1 · Accepted Answer · answered Jun 18 '12 at 10:50

1

Here's something to get you started:

var zs = ys.Select(y => Tuple.Create(y, xs.Subsets().Where(s => s.Sum() == y)));

answered Jun 18 '12 at 10:50

dtb

1 Answers1