| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
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?
Happy New Year to all CodeForces Members. Wish You Best in Your Programming Career & also In your Real Life. i hope you improved enough in 2012. ;)
