Cash: Fewest Coins

A cashier gives change using quarters (25¢), dimes (10¢), nickels (5¢) and pennies (1¢). Always using the largest coin that still fits gives the fewest coins for these values. Return how many coins are needed for cents.

Implement fewest_coins(cents).

Input

cents: The change owed in cents.

Output

Return the minimum number of coins.

Restricciones

0 ≤ cents ≤ 1,000,000

Ejemplos

Entrada:
cents = 41

Salida esperada:
expected = 4

Entrada:
long long cents = 41;

Salida esperada:
long long expected = 4;

Entrada:
long cents = 41;

Salida esperada:
long expected = 4;

Entrada:
cents = 0

Salida esperada:
expected = 0

Entrada:
long long cents = 0;

Salida esperada:
long long expected = 0;

Entrada:
long cents = 0;

Salida esperada:
long expected = 0;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• CS50x Problem Set 1