Minimum number of equal amount bags to collect at least M money - GeeksforGeeks
Given unlimited number of coins of two denomination X and Y. Also given bags with capacity of N rupees, independent of number of coins. The task is to find the minimum number of bags such that each bag contains the same amount of rupees and sum of all the bags amount is at least M.
Read full article from Minimum number of equal amount bags to collect at least M money - GeeksforGeeks
No comments:
Post a Comment