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.

Restrições

0 ≤ cents ≤ 1,000,000

Exemplos

Entrada:
cents = 41

Saída esperada:
expected = 4

Entrada:
long long cents = 41;

Saída esperada:
long long expected = 4;

Entrada:
long cents = 41;

Saída esperada:
long expected = 4;

Entrada:
cents = 0

Saída esperada:
expected = 0

Entrada:
long long cents = 0;

Saída esperada:
long long expected = 0;

Entrada:
long cents = 0;

Saída esperada:
long expected = 0;

Referências

Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.

• CS50x Problem Set 1