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

A network of 20 x 10 squares is given to you.

Can you calculate how many unique squares and rectangles can be formed combining two or more individual squares ?

Asked by Neha on 24 Jan 2021


I know a country, If you remove the last alphabet of its name, it will become a part of your body. Do you name it?

Asked by Neha on 26 Jan 2021

What is wrong in the below Picture?

Find the wrong in Picture

Asked by Neha on 12 Feb 2023


When you say goodbye, I am what you need to tie.
I come as a couple and go wherever you run.
Who am I?

Asked by Neha on 12 Oct 2025

What is so fragile that saying its name breaks it?

Asked by Neha on 19 Oct 2021

What 4-letter word can be written forward, backward or upside down, and can still be read from left to right?

Asked by Neha on 14 May 2021


When my father was 31 I was 8. Now he is twice as old as me. How old am I?

Asked by Neha on 01 Oct 2021

Your last good ping-pong ball fell into a narrow metal pipe embedded one foot deep in concrete.
How can you get it out undamaged, if all the tools you have are your tennis paddle, shoe laces, and plastic water bottle, which does not fit into the pipe?

Asked by Neha on 10 Nov 2024

John: "Hi Teacher, What is your favourite movie ?".
Chemistry Teacher: "Indium Cerium Platinum Iodine Oxygen Nitrogen".
Ten seconds later... John replied I got it.

Do you?

Asked by Neha on 19 Feb 2026


Can you identify the hidden rebus in the image below?

Name the Coded Animal

Asked by Neha on 01 Feb 2021

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki