[algogeeks] Re: dynamic programming ..

2007-03-03 Thread aditi saha
Hi mukesh, Let M(S),S=0 be true if its possible to make money S with the given coins v1,v2,...vk. Then, M(S)=M(S-v1) || M(S-v2) || ...|| M(S-vk). Base Case: M(vi)=true for 1=i=k. M(0)=true Let vl be the smallest of all vi's where 1=i=k. Then M(1...vl-1)=false. On 3/3/07, mukesh tiwari [EMAIL

[algogeeks] Re: puzzle - Weighing marbles

2007-02-02 Thread aditi saha
Do you know if the faulty marble is lighter or heavier? On 2/2/07, Atamurad Hezretkuliyev [EMAIL PROTECTED] wrote: Hi, Can somebody help me with this puzzle? I tried to solve it but couldn't. Puzzle 1 Weighing marbles Given are 12 marbles. One of these marbles is slightly heavier or