回复：挑战：如果帽子的颜色有10种，什么样的算法，可以让被砍头的人最少？

来源: 于 2010-02-18 06:32:23 [博客] [旧帖] [给我悄悄话] 本文已被阅读：次

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%.