I have Rs.50 and I spend it in the way as below.

Vin Diesel is pulling a theft and has planned to run away with all the cash kept in the safe. But the only way to open the safe is the 13 character password. He has a set of five clues given to him by a trustworthy source.

Exactly two of the below statements are false.
The password is contained within this sentence.
The password is not in this hint.
The password is within only one of these statements.
At least one of the above statements is a lie.

Joseph buys three kinds of chocolates for 100 rupees. The first one is priced at 5 rupees, second one at 3 rupees and third one at 0.5 rupees.

If he bought 100 chocolates in total, how many pieces do you think he bought each chocolate?

I am a three digit number.
My tens digit is five more than my ones digit.
My hundreds digit is eight less than my tens digit.
What number am I?

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.

I can turn polar bears white.
I can make anyone dance.
I can make everyone cry
I can make your hands clap
I can make you thin.
I can make you smile.
I can make you smile

Can you guess the riddle?

The more of this there is, the less you see. What is it?

What mathematical symbol can be put between 5 and 9, to get a number bigger than 5 and smaller than 9?

The Puzzle: A girl, a boy, and a dog start walking down a road.

They start at the same time, from the same point, in the same direction.

The boy walks at 5 km/h, the girl at 6 km/h.

The dog runs from boy to girl and back again with a constant speed of 10 km/h. The dog does not slow down on the turn.
How far does the dog travel in 1 hour?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?