Coin Problems with list of values have to be made

Revision en2, by Milad, 2020-08-24 00:42:38

Hi,

I got stuck in this problem and I will welcome your solutions.

We have $$$N$$$ coins with different values $$$v_1$$$,$$$v_2$$$,...,$$$v_N$$$. We want to find out whether it is possible to put them into $$$M$$$ groups in which:

1- Every coin has to be assigned to exactly one group.

2- The sum of coin values in each group has to be at most $$$K$$$.

Is this problem have any solution better than checking all assignments?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Milad 2020-08-24 00:42:38 2 Tiny change: 'e group.\n2- The s' -> 'e group.\n\n2- The s'
en1 English Milad 2020-08-24 00:42:18 465 Initial revision (published)