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.

Vincoli

0 ≤ cents ≤ 1,000,000

Esempi

Input:
cents = 41

Output atteso:
expected = 4

Input:
long long cents = 41;

Output atteso:
long long expected = 4;

Input:
long cents = 41;

Output atteso:
long expected = 4;

Input:
cents = 0

Output atteso:
expected = 0

Input:
long long cents = 0;

Output atteso:
long long expected = 0;

Input:
long cents = 0;

Output atteso:
long expected = 0;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• CS50x Problem Set 1