|No such thing as a small change|
Re: Re: Re: Re: Re: Re: amount permutationsby the_0ne (Pilgrim)
|on Mar 05, 2004 at 16:36 UTC||Need Help??|
Limbic~Region, I work with gr0k and he has to leave for the day, so I'll reply back. I think our example of what we want was fine, but maybe our code confused some people (as you state in your replies). What we are trying to get it is basicly this...
to be checked. We want to only add up the combinations that are unique. So, what we were ultimately trying to do was generate a list that would give us a way to calculate the unique combinations. Something like this...
A B C
So we'd then run through that list applying our values...
A - 10
A+B - 11
A+B+C - 17
A + C - 16 * matches 16 no need to check C+A, etc..
B - 1
B+C - 7
C - 6
So A+C matches what we want. No need to check C+A. Same with if A+B+C matched what we want. No need to check A+C+B, B+C+A, etc... That was our ultimate goal. Of course A B C could easily be 100 long or even more, but left it small for this post. Hopefully that'll clear some things up. Thanks for all help.