I Need Change For 100 Rs It Should Not Be 10 Rs Notes But
It Should Contain 10 Notes, Any Ideas?
Answer Posted / titu chandra sahu
50 rupees notes = 1
20 rupees notes = 1
5 rupees notes = 5
2 rupees notes = 2
1 rupees notes = 1
--------------------
100 = 10
--------------------
| Is This Answer Correct ? | 21 Yes | 10 No |
Post New Answer View All Answers
What is the angle between the two hands of the clock when it shows 10:10?
pick the odd one out bend shave chop whittle shear
Yadi a or b kisi kam ko 12 din me pura krte h tatha b or c usi kam ko 16 din me pura kr sakte h , pahle a is kam ko 5 dino tak karta h fir b 7 dino tk kam ko karta h sesh kam c 13 dino me samapt kr deta h to c akele kam ko kitne dino me pura krega?
tickets numbered 1 to 20 are mixed up and then a ticket is drawn at random. What is the probability that the ticket drawn has a number which is a multiple of 3 or 5?
a cube has colors blue,red ,yellow each on two opposite sides.cube is divided into "32 small cubes and 4 large cubes". how many cubes (on 36 cubes) have blue at least one side. how many cubes have colors on two sides.
How many ways can one arrange the word EDUCATION such that relative positions of vowels and consonants remains same?
a father is 30 times more than his son however he will be only thrice as old as the son what is father's present age ?
Find the next series: AD DP PL LV ?
If P=Total number of components, Q = number of defective components .What is the % of non defective components?
9/10 or 10/11 which is greater.
how can i improve myself in solving apptitude questions, guide and help me with some kind of tips.suggest me books too.so that i can get betterment in solving apps
Find the next number in the series 12,21,,112,121,122---
Ajay can build a house in 16 days and Barry can do the same job in 12 days. With help of Chintu, they did the job in 4 days only. How many days Chintu can do the job?
a number of subsets of a set s is 128, then s has
In a cycle race there are 5 persons named as J, K, L, M, N participated for 5 positions so that in how many number of ways can M make always before N?