1 pirate gave 3 1 gem, and two pirates No.4 or No.5 won 97. The allocation scheme is: 97,0, 1, 2,0 or 97,0, 1, 0,2.
Reasoning process: push forward from behind. If No.65438 Pirate +0-3 feeds all sharks, only No.4 and No.5 are left, and No.5 will definitely vote against No.4 feeding sharks, thus taking all the gems for himself. Therefore, No.4 can only save his life if he supports No.3. Knowing this, No.3 will put forward a distribution plan (100,0,0), take all the gems for himself, and don't give No.4 and No.5 a penny ... Because he knows that No.4 has nothing, he will still vote for it, and with his own vote, his plan will be passed. However, if No.2 infers the scheme of No.3, it will propose a scheme of (98,0, 1, 1), that is, give up No.3 and give No.4 and No.5 a gem each.
Because the plan is more beneficial to No.4 and No.5 than No.3, they will support him and don't want him out, but be assigned by No.3. ..
So number two took 98 gems. However, the scheme of No.2 will be understood by 1, and 1, 2,0 will put forward the scheme of (97,0, 1, 2) or (97,0, 1, 0,2), that is, give up No.2 and give No.3 a gem. 1 No.3 and No.4 (or No.5) are better than No.2, and they will vote No. 1，plusNo。 1 own vote, No solution. 1 Pass, 97 gems can be easily dropped into the bag. This is undoubtedly the scheme that 1 can get the greatest benefit.