Brain question: Who dares to come

Backwards: Pirate 5 knows that he won't wait until 5 is left alone to get the 100 gems, because he knows that Pirate 4 is not stupid.

If you wait until the 4th to divide, there will be 2 people left on the 4th and 5th. In order to save his life, No. 4 will give all 100 gems to No. 5, so the distribution result of No. 4 is 0:100 (but No. 4 is still at risk of losing his life).

If you wait until the 3rd to score, there will be 3 people left, 3, 4, 5, 3, 3 and 4 to give 4 a gem to fight for support, and if 4 does not agree to the next round of points, you may lose your life, or 1 will not be able to get it, compared to getting a gem is already very cost-effective, so you will agree. So there will be none on the 5th. So the assignment of number 3 is 99:

1:0 If you wait until No. 2 to divide, there will be 4 people left, No. 2, No. 3, No. 4, No. 5, No. 2 considers that unless No. 3 is given 100, No. 3 will agree, and this will lose too many benefits, so I would rather not give No. 3 a support vote to No. 3. Here give No. 4 2 No. 4 will gladly support, because if No. 4 does not agree, No. 4 can only get 1 when the next round is divided, so it is very cost-effective to get 1 more; In the same way, you can only give No. 5 a gem (it is impossible to wait for the next round of No. 3 to score, and I don't have one), so 1 is enough; So the result of the assignment of No. 2.

So if No. 1 wants to score now, unless No. 2 is given 98, No. 2 will agree, and this will also lose too many benefits, so it is better not to give No. 2 a single vote and give up No. 2's support votes. Of course, No. 3 will give him 1 is enough, because if No. 3 does not agree, No. 3 can only get 1 when the next round is divided, so it is very cost-effective to get 1 more. Similarly, if you want to get support from number 4, number 1 has to give him 3 gems (plus 1 more than the next round of 2).

Again, to get the support of 5, 1 has to give him 2 gems (1 more than 1 in the next round). Of course, it is not possible to give No. 4 and No. 5 gems at the same time, that would be very cost-effective, just give one of them and get a total of 3 votes, of course, to No. 5, because he only needs 2 gems. So the allocation scheme for the number one is 97:

2。So far, No. 1 has the most gems and the least risk.

Distribution scheme (pieces): No. 1, No. 2, No. 3, No. 4, No. 5.

Pirate No. 1 97 Dead Dead Dead Dead Dead.

Pirate No. 2 0 97 Dead Dead Dead.

Pirate No. 3 1 0 99 Dead Dead.

Pirate 4 0 2 1 0 is dead.

Pirate No. 5 2 1 0 100 100

Use some political means to privately promise to win over

Then cross the river and tear down the bridge, unload the mill and kill the donkey

"If and only if more than half of the people agree"

What do you mean? There is no chance for 2 people to share the gems.

I don't think about it in detail, I think that everyone has the most profit on average scores, because there is an uncertain determining factor, which is the lottery to determine the order of gems. If all five people are smart, the end result is an equal distribution.

98 pieces for No. 1, one each for No. 3 and No. 5, are completed

Let everyone take it first, and give the last one to yourself.

I don't know. Anyway, the one who divides will take the gem last.

The first one only needs one gem, and the others are divided among the four of them.

Han Shui Mingze, the answer is beautiful.

Question 1: The manager has twin daughters, their ages are: 2 years old, 2 years old, 9 years old; The age of the manager is 32 years old.

It is closely related to biology.

The relationship between hair color and age.

The subordinate knows the age of the manager, as long as 13 is divided into three numbers, the product of the three numbers equals the age of the manager There are many possibilities.

So, the reason why subordinates can't guess the answer is:

In the absence of additional conditions, there is no definite solution to the ternary equation, which must be converted into a binary equation.

Assuming that there are no twins among the three daughters, then the age difference between the three should be greater than one value (biological common sense) Black hair is the dominant gene, and if the manager and his wife are not black hair, then the black hair girl is.

There is only one truth:

There are no twins among the girls, but there are two girls who are the same age!

Then, solve the binary equation.

Obviously, the age of the 3 daughters is not 0, or the father is 0 years old, so the age of the daughters is greater than or equal to 1 year. In this way, the following situation can be obtained: 1*1*11=11,1*2**10=20,1*3*9=27,1*4*8=32,1*5*7=35,,,2*3*8=48,2*4*7=56,2*5*6=60,3*3*7=63,3*4*6=72,3*5*5=75,4*4*5=80 Because the subordinate already knows the age of the manager, but still cannot determine the age of the manager's three daughters, it means that the manager is 36 years old (becauseSo there are only 2 cases of the age of the 3 daughters, and the manager said that only one daughter has black hair, which means that only one daughter is relatively large, and the others are relatively small, and the hair has not grown black, so the age of the 3 daughters is 2, 2, 9!

Question 2: The landlord said the question very clearly, so that people could think directly to the answer, hehe, tear the logo of each pair of socks, and then each person takes one of each pair, OK

There were two blind people, and they each bought two pairs of black socks and two pairs of white socks, and the eight pairs of socks were of exactly the same fabric and size, and each pair of socks was connected by a piece of trademark paper. Two blind men accidentally mixed eight pairs of socks together. How can each of them retrieve two pairs of black socks and two pairs of white socks?

Answer: Each pair of socks is disassembled, each person takes one sock, the socks are left and right, and finally two pairs of black socks and two pairs of white socks are retrieved.

You can make a table and add the rest of each number to each number, and none of the numbers will add up to 30

2 out of 2% can be used.

If it can't be used, the sum of three odd numbers is still an odd number, then there is no solution.

Or use a possible number that doesn't need to be filled up, just 15+15.

Hello, for this brain problem, all I can think of is to move the second match arranged vertically on the left side of 6 to the upper right corner, turn 6 into 9, and then move the match arranged vertically on the left side of the first 0 to the middle, and place it horizontally, which also becomes 9, and the number that comes up is 9908, I don't know if it is the largest.

Move two matches with two penultimate digits, one for each of them, and look upside down to see 9989