You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).
By using all numbers, i.e. 123456789 and subtraction/addition, operators number 100 can be formed in many ways.
Example: 98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
But if we add a condition use of the number 32 is a must. Then there are limited solutions.
One of such solution is: 9 - 8 + 76 + 54 - 32 + 1 = 100
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?