algorithms-week-3-greedy-algorithm

Use the "Run" button to execute the code.

%%capture
!pip install jovian --upgrade --quiet

import jovian

# Execute this to save new versions of the notebook
jovian.commit(project="algorithms-greedy-algorithm")

1.Problem Description

Task. The goal in this problem is to find the minimum number of coins needed to change the input value
(an integer) into coins with denominations 1, 5, and 10.

Input Format. The input consists of a single integer 𝑚.
Constraints. 1 ≤ 𝑚 ≤ 103.

Output Format. Output the minimum number of coins with denominations 1, 5, 10 that changes 𝑚