We rotate the inner disk at 200 different positions. Now we count the total number of color-matching events. For each inner section,no matter white or black ,there is 100 color- matching events. So total number of color-matching events is 100*200 The summation of color-matching events of 200 different positions are 200*100, so there must be a inner position which have >=100 color-matching events.
On Mar 18, 11:17 pm, "Santhosh Suresh" <[EMAIL PROTECTED]> wrote: > This problem has been troubling me from quite a long time. > > The circumference of two concentric disks is divided into 200 sections > each. For the outer disk, 100 of the sections are painted red and 100 of > the sections are painted white. For the inner disk the sections are painted > red or white in an arbitrary manner. Show that it is possible to align the > two disks so that 100 or more of the sections on the inner disk have their > colors matched with the corresponding sections on the outer disk. > > Please send in solutions. It seems to be trivial application of PHP. > > Thanks, --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
