0
I need to read an integer value and calculate the fewest possible banknotes (ballots) in which the value can be decomposed. Banknotes considered are 100, 50, 20, 10, 5, 2 and 1.
And dps print the read value and then the minimum amount of notes of each type required.
EXAMPLE:
- entree
576
- exit
R$ 576
5 banknote(s) of R$ 100,00
1 note(s) of R$ 50,00
1 note(s) of R$ 20,00
0 banknote(s) of R$ 10,00
1 note(s) of R$ 5,00
0 banknote(s) of R$ 2,00
1 banknote(s) of R$ 1,00