label the 10 colors 0 to 9. The first guy says the color that is the modulo-10 sum of all the rest. The surviving prob. is 99.1%.
回复:挑战:如果帽子的颜色有10种,什么样的算法,可以让被砍头的人最少?
所有跟帖:
•
you beat us!
-guest007-
♀
(53 bytes)
()
02/18/2010 postreply
08:46:30
•
这才是正解。10种颜色的帽子的问题比2种颜色更能体现问题的实质。
-cma-
♂
(0 bytes)
()
02/18/2010 postreply
12:41:17
•
Nice answer.
-wxczcbm-
♂
(0 bytes)
()
02/18/2010 postreply
19:36:50