1 Brain Teasers

最新推荐文章于 2024-08-12 11:55:07 发布

echo in silence

最新推荐文章于 2024-08-12 11:55:07 发布

阅读量201

点赞数

分类专栏： Guide to quantitative 文章标签：概率论

本文链接：https://blog.csdn.net/HUSTIS1804/article/details/127182937

版权

Guide to quantitative 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

introduction

What we talk about is some real brain teasers which are opposed to mathematical problems in disguise. They are no less difficult than other quantitative interview problems.What u need is:analytical and general problem-sloving skills,think out of box

Problem Simplification

learn to try to slove the simplest cases and analyse your reasoning when facing a complex problems.More often than not,u will find a pattern that will guide u through the whole problem.So let’s begin with some problems.

Screwy pirates

Five pirates looted a treasure chest containing 100 gold coins. They decided to adopt the following rules to divide the loot:
The oldest pirate has the right to propose a gold coin distribution plan, and everyone should vote on this plan together. Only if half or more people support this plan can it be implemented. If most people object, the oldest pirate will be thrown into the sea to feed fish, and the remaining four people will start again, but it is time for the second elder to propose a new gold coin distribution scheme. By analogy, until a proposal is voted.Being blood -thristy pirates,they want to own more coins and less partners on the boat if given a choice between otherwise equal outcomes

Solution
If the problem with 5 pirates is too complex,we can start with a simplest version by reducing the number of pirates.
case 1: only one pirates -there is no doubt that he will get all coins.
case 2: P1 ,P2(P2 is elder than P1)
P2 can proposal that p1 get nothing and he get all,what he should do is to vote himself(2/2=1)
case 3 p1,p2,p3 (p3>p2>p1)
p3 clearly knows that if his proposal were voted down ,the situtation will come to case 2 and p1 will get nothing. So he must give p1 sth for getting p1’s support.
proposal: p1 :1 coin p2: 0 p3 99
case 4
By analogy ,4/2=2 as long as getting one pirate’s help is enough.
if he gives p3 50,p3 must choose to reject. situtaion->case 3 ,p3 win 99
so we must avoid this ,and get p2’s help.
proposal: p2 1 coin ,p4 99 coins,p1: 0,p3:0
case 5
p1: 1 coin
p3: 1 coin
p5: 98 coin