Re: [algogeeks] Re: Candy_splitting in GCJ

2011-05-09 Thread Kunal Patil
OMG !!! Was it so easy I feel lyk crying that i didnt think of this...Really bad of mine.. [?][?] -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this

[algogeeks] Re: Candy_splitting in GCJ

2011-05-08 Thread Koduri Nataraj
kumar anurag anurag.it.jolly@... writes: find xor of all elements - if its equal to zeo then Case has solution otherwise NOfor finding the soltuion just sort all the elements and find the (sum of all -sum of smallest).. On Sun, May 8, 2011 at 9:50 PM, Kunal Patil kp101090-