[Game] pirate sharing

There were n (n <= 1000) Greedy pirates who got 100,000 gold coins and decided to divide the stolen goods. They are both savvy and want to maximize their own interests, and adopt the following strategies: 1. First, N people are arranged in order. 2. the hacker number will give the sharing scheme. 3. All people vote. If 50% or more people agree to the vote, the job will be successful. Otherwise, the job will be transferred to 4. 4. Kill the Defender (1 fewer in the total number) and convert it to 2. Your task: determine the maximum number of gold coins that a pirate gets.

 

Question: This question requires a small bend. First, the first person who receives the most money must be the first person. Second, he only needs to give one gold coin to all the odd-numbered people. It can be yy. odd numbers are always limited by even numbers. They are very likely to be unable to get anything, so they will be satisfied as long as they have them. The answer is 100000-(n-1)/2. So easy!