-
Get easy, one-click access to your favorites. Make Yahoo! your homepage.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
I think its a problem similar to finding out one good chip and one bad
chip in the given set.
If you get a good chip then you can find out the bad chip.
I think its a problem similar to finding a soilder which has a
infected blood or so... there is some problem based I dont remember.
I this
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
