Ultra-classic questions

I. Question of bean touch
five prisoners should be arrested on the 1-5 basis in a sack containing 100 green beans. Each person must have at least one, the people who have caught the most
and the least will be killed. Moreover, they cannot communicate with each other, but they can find the remaining number of beans. Q:
who has the highest chance of survival?
Note:
1. they are all very smart people
2. their principle is to save your life first, and then kill more.
3.100 do not have to be completely divided
4. if there are duplicates, they are also the largest or least, and all are executed together.
3. Dog problems
A large courtyard has 50 families and each family has a dog. The people in this courtyard have strong reasoning capabilities.
one day they were notified that a dog was ill in the yard and asked all the masters to kill the dog on the day when they found that the dog was ill.
.
however, neither the master nor the dog can leave their house, nor can the master and the dog communicate with each other in any way.
, all they can do is to use a window to check if another dog is ill and determine whether the dog is ill.
. (That is to say, each owner can only see whether the other 49 dogs are ill or not, but can't see their own dogs
)
no gunshots were shot on the first day, there was still no gunshots the next day, and there was a gunshot on the third day. How many dogs were killed?
?

4. Monkey bananas
A monkey has 100 bananas on the side. It takes 50 meters to get home,
Each time it moves up to 50 bananas, it is crushed to death.
One rice is about to eat. Could you tell me how many bananas it can take to move to the house.
Tip: he can put the banana down for a round trip, but he must ensure that every walk
One rice can have bananas. You can also drop some bananas when you reach N meters,
Take n bananas and move back to 50
.
V. Pouring Water
There are threeCubeNo body cover box, excluding the container thickness, the volume is 1*1*1*2*2, 3*3*3. Requirements: 1. Use these three boxes to hold 13 of water
2. Each Cup can only be filled with water once.
3. No waste of water.
How can this problem be solved.

Vi. Wine sharing Question 1
There is one 8-litre wine-filled cup and two small cups. The two A and B should share the eight-litre wine equally, making both people feel fair.
By the way, a first splits the wine into two small cups until he thinks that he will not suffer any loss. Then let B
Select a cup that you think is the most cost-effective. The remaining cup is for. Now there are two 8-litre wine-filled cups and four small cups.
How can we make everyone feel fair by dividing the four members of sub-and ABCD?

7. Wine sharding Question 2
There are three wine glasses, two of which can be 8 wine glasses and one can be 3 wine glasses. Now the two wine glasses are full of wine.
How can we evenly distribute the three cups to four people?

8. Ball Problems
(1) A total of 12 balls of the same weight, only one of which is different from the others (unknown weight), give you a balance, only
Name it three times and find the ball with different weights.
(2) A total of 13 balls of the same weight, only one of which is different from the others (unknown weight), give you a balance, only
Name it three times and find the ball with different weights.

9. Nominal drug problems
There are 10 cans of medicine, one of which has deteriorated ...... It is known that the normal medicine is 10 Gb per grain, and the deterioration is 9 GB per grain. How can this problem be called once?
Which tank has deteriorated?

10. Typical hats
1. There is a cell and three prisoners are in it. Because the glass is thick, three people can only see each other and cannot hear each other.
Voice ."
One day, the king thought of a way to give each of them a head wearing a hat, only to let them know the color of the hat
It's either white or black, so they don't know the color of their hats. In this case, the King announces two
As follows:
(1) who can see the other two prisoners wearing white hats can release them;
(2) Whoever knows that he is wearing a black hat will release it.
In fact, the king gave them black hats. Because they were bound, they could not see themselves. So the three of them interact with each other.
Staring and not talking. However, in the near future, mind a determined that he was wearing a black hat by means of reasoning. How is he pushing?
Disconnected?
2. Ten people stand in one column,
Each head has a hat, either red or blue.
Each person can only see the color of the hats of all people standing in front of him.
Now let everyone report a color,
Please try to make as many people as possible report the color of his hat.
For example, if a person in an even position reports the color of his hat, the person in front of him starts to report the color from the tenth position,
The odd digit can know the color of his hat,
In this way, five people reported the color of their hats.
How can we make the color of a nine-person report the color of his hat?