Chocolates for you

John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.

The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.

How many chocolates should he buy from each shop?




Similar Riddles

That attorney is my brother, testified the accountant.

But the attorney testified he didn't have a brother.

Who is lying?

Asked by Neha on 14 Dec 2020


There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?

Asked by Neha on 03 Aug 2023

A spy was in Canada trying to steal insider information on how to set up new Maple Syrup factories in their country. He was introduced to the operations manager of the biggest factory in Canada. However, the manager was suspicious and decided to test him with a question before he trusted him. So he asked, “What would you be sure to find in the middle of Toronto?” The spy thought fast and came up with an answer for the manager. What was his answer?

Asked by Neha on 04 Jun 2025


Can it be possible to build a house that has all its four walls facing towards the South?

Asked by Neha on 20 May 2024

You have $100 with you and you have to buy 100 balls with it. 100 is the exact figure and you can't go below or above the numbers and you have to use the entire $100. If there is no kind of tax applied how many of each of the following balls will you be able to buy:

Green Balls costing $6
Yellow Balls costing $3
Black Balls costing $0.10

Now, how many of each must you buy to fulfil the condition given?

Asked by Neha on 30 Jul 2023

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

Asked by Neha on 18 Aug 2021


A river should be crossed by a father, a mother and their two sons and two daughters.
There are some rules that should be followed while crossing the river. There can be only two people in the raft while crossing. The daughters cannot be with their father unless there is the presence of the mother. The sons cannot be with their mothers unless the father is present. Unless the guard is on the board, the criminals cannot be with any of the family members. Only the adults like the father, the guard, and the mother knows to use the raft.

How will they cross the river?

Asked by Neha on 28 Jun 2021

Bay of Bengal is in which state?

Bay of Bengal

Asked by Neha on 12 Mar 2021

Replace all '*' with digits 1, 2, 3, 4, 5 and 6 to make below statement true.

* *
x *
=====
* * *

Asked by Neha on 29 Jul 2021


What will be the best approach to finding all the prime numbers less than 75 that leave an odd reminder when we divide them with 5?

Asked by Neha on 12 Jul 2021

Hot Articles

Amazing Facts

Artificial Intelligence

Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.