回复：可接受的分配方案

This is a well-known solution.

Let the first person partition the cake into two equal parts and let the second person pick she thinks the largest.

In general, let one person gradually increase the size of one slice of the cake and whoever claims she wants that slice first will get that slice. Keep doing this for N-1 times.

所有跟帖： 

• For two persons, your solution is OK -15少- ♂ (172 bytes) () 09/23/2007 postreply 17:59:04

• 回复：For two persons, your solution is OK -AiSanGuo- ♀ (148 bytes) () 09/23/2007 postreply 18:43:51

• 乱弹‘s solution is better. -15少- ♂ (173 bytes) () 09/24/2007 postreply 10:57:55