This Challenge Makes Cents I know, the title cracks you up



Given an amount of money, output the fewest number of coins that make up that amount.

Examples

0.1
1 dime

0.01
1 penny

0.28
1 quarter 3 penny

0.56
2 quarter 1 nickel 1 penny

1.43
5 quarter 1 dime 1 nickel 3 penny


Spec


100 cents in a dollar.
The values of each type of coin is:


penny 1 cent
nickel 5 cents
dime 10 cents
quarter 25 cents



Built-ins which trivialize this task are not allowed.

I/O

Input is a decimal representing the dollar value of the total


No need to pluralize
Order: quarter -> penny
Output should be &lt;#_of_coins&gt; &lt;coin type&gt;
Separators: , or , (comma and a space) or 


The only trailing whitespace allowed is a single trailing newline/space.



If there is zero of a coin type, that coin type should not be shown. E.g. 0.25 -> 1 quarter not 1 quarter 0 dime 0 nickel 0 penny
JavaScript ES6, 107 bytes

n=&gt;((n*=100)/25|0)+` quarter ${(n%=25)/10|0} dime ${n%10/5|0} nickel ${n%5|0} penny`.replace(/ ?0 \S+/g,&quot;&quot;)

Simple maths.