Solution:

no stairs

Explanation:
Did you think pink? Well you are wrong as the house is only one story=> there will be no stairs.

Solution:

Both 3 and 4th

Explanation:
- The water in tank1 will get filled up to the connectivity of tank1 and the tank2 and then it will start flowing to tank2.
- The water in tank2 will get filled up to the connectivity of tank2 and the -tank3 and then it will start flowing to tank3.
- The water in tank3 will get filled up to the connectivity of tank2 and the tank3 and then it will start flowing to tank3.
- As the outlet of tank3 and inlet of tank4 are not at the same level, water will continue to fill tank3 till the inlet of tank4.
- Now both the tank3 and tank4 fill simultaneously until both fill together.

Solution:

It can be down as shown below.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

A cigar stuck in the wall

Solution:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.

Solution:

Adam and Eve were the only people without navel. As they were not born out of a mother, they never had umbilical cords and thus never had navels.

Solution:

Q = 1
U = 9
I = 6
C = 8
K = 3.

Explanation:
Replace values in( Q + U + I + C + K)^3 = QUICK
(1+9+8+6+3)^3 = 19863
27^3 = 19863
19863 = 19863

Solution:

192 021

If you look at it as two-digit numbers you'll see:10 11 12 13 14 15 16 17 18 19 20 21

Solution:

Just 2

Day One: You make your first cut at the 1/7th mark and give that to the worker.
Day Two: You cut 2/7ths and pay that to the worker and receive the original 1/7th in change.
Day three: You give the worker the 1/7th you received as change on the previous day.
Day four: You give the worker 4/7ths and he returns his 1/7th cut and his 2/7th cut as change.
Day Five: You give the worker back the 1/7th cut of gold.
Day Six: You give the worker the 2/7th cut and receive the 1/7th cut back in change.
Day Seven: You pay the worker his final 1/7th.

Solution:

f the last elf is taking some time to answer the question then it shall mean that the elf's before him are all wearing distinct coloured hats. However sufficient time shall be given to the last elf to give the answer.
If he views the similar coloured hats in front of him , he shall quickly tell the answer