A boy was locked in a room by some robbers. All that is in the room is a piano, a calendar, and a bed. The room is locked from the outside. What does he eat, drink, and how does he escape and get out?
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
In the figure that has been attached to this question, each digit represents a digit. The similar letters carry the same integer value. Can you expose the original digits?