Pirates divide the gold (5 pirates robbed 100 gold coins)

Correct answer: No.65438 +0 97, No.2 0, No.3 1, No.4 2, No.5 0 Inverse method: If No.65438 +0-3 is thrown into the sea, only No.4 and No.5 are left, and No.5 must vote against it, so that No.4 can feed the sharks and keep the gold coins for himself. (Because as long as No.5 doesn't agree, No.4' s proposal can't be more than half. Therefore, No.4 can only save his life if he supports No.3' s proposal. Knowing this, No.3 will put forward a plan (100,0,0), and will keep all the gold coins for himself, and will not give any money to No.4 and No.5, because he knows that No.4 can save his life, but he will still vote, and with No.3' s own one-vote plan, it can be passed. However, if No.2 infers the plan of No.3, it will propose a plan of (98,0, 1, 1), give up No.3, and give No.4 and No.5 a gold coin each. Because the plan is more favorable to No.4 and No.5 than No.3, they will support No.2 and don't want him to be allocated by No.3 ... so No.2 wants 98 gold coins. Similarly, 1 will know the plan of No.2, and will put forward the distribution plan of (97,0, 1, 2,0) or (97,0, 1, 0,2), and will give up No.2, give it to No.3 and give it to No.4 (or 5) at the same time. Because the plan of 1 is better for No.3 and No.4 (or No.5) than No.2, they will vote for it. With the vote of 1, the plan of 1 can be passed and 97 gold coins can be obtained.