Given A coins of value N and B coins of value M, the task is to check if given coins can be used to pay a value of S.
Input: A = 1, B = 2, N = 3, S = 4, M = 1
In this case if 1 coin of value 3 is chosen and 2 coins of value 1, then it is possible to pay a value of S.
Input: A = 1, B = 2, N = 3, S = 6, M = 1
In this case, It is not possible to pay a value of S
The idea is to use greedy approach.
- Keep subtracting coins with value N from the required sum S.
- At each step, while subtracting coins of value N, check if the remaining sum is a multiple of coins with value M and we have sufficient coins of value M to get this remaining sum.
- If at any step, the above two conditions are satisfied, return YES.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find out the minimum number of coins required to pay total amount
- Minimum cost for acquiring all coins with k extra coins allowed with every coin
- Check if characters of a given string can be used to form any N equal strings
- Minimum number of cuts required to pay salary from N length Gold Bar
- Maximum items that can be bought with the given type of coins
- Find minimum number of coins that make a given value
- Generate a combination of minimum coins that sums to a given value
- Find optimal weights which can be used to weigh all the weights in the range [1, X]
- Maximum number of distinct positive integers that can be used to represent N
- Program to find the count of coins of each type from the given ratio
- Buy minimum items without change and given coins
- Probability of getting at least K heads in N tosses of Coins
- Greedy Algorithm to find Minimum number of Coins
- Probability of getting two consecutive heads after choosing a random coin among two different types of coins
- Path traversed using exactly M coins in K jumps
- Bin Packing Problem (Minimize number of used Bins)
- Program for Least Recently Used (LRU) Page Replacement algorithm
- Implementation of Least Recently Used (LRU) page replacement algorithm using Counters
- Check if all elements of the given array can be made 0 by decrementing value in pairs
- Check if the given array can be reduced to zeros with the given operation performed given number of times
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.