Skip to content

paveldat/coins

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 

Repository files navigation

Find minimum number of coins (using Dynamic Programming)

Task

Find and show the minimum number of coins that can make a value of an input value.

Features

  • The value is set by the user
  • The list of available coins is set by the user

Example

Input:

Enter the number: 20
Enter the list of available coins: 1 3 5

Output:

Coin 1 used 0 times
Coin 3 used 0 times
Coin 5 used 4 times
Total numbers of coins: 4

About

Find minimum number of coins (using Dynamic Programming)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages