CodeGuru, Gateways 2014

PG Courses @ Christ University
I  : Vora Parth Deepak  (winner for a second time)

II : Akashdeep Bhattacharya
III: Jophin P
Position 4th to 8th are as follows
Tenzin Chemi, Jonathan F P, Diganta Das, Amlanjyoti Saikia, Virapaxgouda C K

Questions were as follows
Currency Change is in denomination of
    1,2,5,10,20,50,100,500,1000

1. Store denomination in an array and display it.

2. Give a certain amount, convert it into denominations, (total number of sub denomination should be as less as possible)
    So 83 is 50+20+10+2+1

3. If this money has to be shared with two people then divide the change is such a way that it is as equal as possible
    So 83 for two people will be 41(20,20,1) and 42 (20,20,2)

4. Money shared with three people

5. Give change such that there are distinct number of pieces
  Say 86 return in  6 if possible : 50,20,10,2,2,2 or 50,10,10,10,5,1

6. If breaking up is not possible should say so
  10 in 3 is not possible 5,2,2,or 5,2,1

7. If there is a change in currency and denomination are now 1,3,5,10,50. Which number from 1 to 100 cannot be generated.