You have an unlimited number of 10-rupee coins and exactly one coin of r rupee and you need to buy minimum items each of cost k such that you do not ask for change.
Input: k = 15, r = 2
You should buy two cables and pay 2*15=30 rupees. It is obvious that you can pay this sum without any change.
Input: k = 237, r = 7
It is enough for you to buy one cable.
It is obvious that we can pay for 10 items without any change (by paying the required amount of 10-rupee coins and not using the coin of r rupee). But perhaps you can buy fewer hammers and pay without any change. Note that you should buy at least one item.
- Minimum cost for acquiring all coins with k extra coins allowed with every coin
- Greedy Algorithm to find Minimum number of Coins
- Get maximum items when other items of total cost of an item are free
- Burst Balloon to maximize coins
- Find the top K items with the highest value
- Probability of getting two consecutive heads after choosing a random coin among two different types of coins
- Find K items with the lowest values
- Ways to place 4 items in n^2 positions such that no row/column contains more than one
- Coin Change | DP-7
- Number of ways to change the XOR of two numbers by swapping the bits
- Understanding The Coin Change Problem With Dynamic Programming
- Minimum adjacent swaps to move maximum and minimum to corners
- Minimum sum by choosing minimum of pairs from array
- Minimum value possible of a given function from the given set
- Minimum LCM and GCD possible among all possible sub-arrays
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.