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.

Contraintes

0 ≤ cents ≤ 1,000,000

Exemples

Entrée :
cents = 41

Sortie attendue :
expected = 4

Entrée :
long long cents = 41;

Sortie attendue :
long long expected = 4;

Entrée :
long cents = 41;

Sortie attendue :
long expected = 4;

Entrée :
cents = 0

Sortie attendue :
expected = 0

Entrée :
long long cents = 0;

Sortie attendue :
long long expected = 0;

Entrée :
long cents = 0;

Sortie attendue :
long expected = 0;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• CS50x Problem Set 1