Blog # 60 : Thief's Proposal !!
There are 5 thieves. They are all numbered one to five. They have 500 pieces of gold which need to be distributed among themselves. First the number 1 distributes it and after that a voting is done : if he gets majority votes his distribution is carried out else he is killed, if the votes are equal, then also distribution is done his way. If he is killed then next numbered person does the distribution and this goes on till number 5. Each thief values his life more than the gold. So how does the first thief distribute gold to get maximum and to not get killed also ? Click here to see the solution. p.s. - For Remarks please hit the given link once. For Hint, hit it twice and for the solution, hit it thrice. Courtesy: Vibhaj |
Posts
The answer for 5 people should be 498,0,1,0,1 rather than 498,1,0,1,0.
Because if we see the solution for 4 people:
For 4 people : 499,0,1,0
Then in case of 5 people the 1st person needs 2 people and those would be 3rd and 5th, as the 2nd wont agree on this, as he knows if he disagree and 2st is killed, he can have 499 pieces.
So the answer should be:
For 5 people : 498,0,1,0,1
@Anonymous: Thank you for pointing out the mistake. I'll correct the solution.