计算机科学Computer Science
▌How do pirates divide their treasure?
海盗如何分财宝?
A group of 7 pirates has 100 gold coins. They have to decide amongst themselves how to divide the treasure, but must abide by pirate rules:
7个海盗共有100枚金币,他们必须自行决定如何分财宝,分财宝必须按照如下规则:
The most senior pirate proposes the division.
最年长的海盗提出一个分赃方案。
All of the pirates (including the most senior) vote on the division. If half or more vote for the division, it stands. If less than half vote for it, they throw the most senior pirate overboard and start again.
所有海盗(包括最年长者)进行投票,如果一半或以上的海盗赞同,那结果成立。如果少于一半,他们将最年长者投入大海并重新来过。
The pirates are perfectly logical, and entirely ruthless (only caring about maximizing their own share of the gold).
海盗逻辑性强,而且非常无情(只关注个人所得最大化)。
So, what division should the most senior pirate suggest to the other six?
所以,最年长的海盗应如何建议把金币分给其他6个海盗?
解答提示:这是道标准的逻辑考题,同时教授们还将注重你解决问题和沟通能力。
I like to see how students can take directions, and if they can break problems into smaller subsets, and work through a complex concept applying a solution in an algorithmic way. If students have any questions, I want them to ask – not to sit in silence feeling stuck!
这道题关注学生如何跟着引导走,是否能将大问题切分成小问题,用算法方式化解复杂的概念。如有问题,学生应该立即提出,而非闷声冥思苦想。