Thank you very much! I think the most hard part of this problem is problem b.
For problem b, if I devide n chips into two parts: n-n/2, and n/2, it is easy to prove that at least one of the two parts will satisfy the condition that more than half of the chips are good, so if I can find out this part, this problem is reduced to one of nearly half the size. But I can find a way to determine which part of the two satisfies the condition. I will dig more on this problem based on you suggestions. Thanks! Yangyan --~--~---------~--~----~------------~-------~--~----~ 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 group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
