Pretty much the title. Source: https://open.kattis.com/problems/classicalcounting
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
given N objects, each one with M copies, how many ways are there to choose exactly K from them?
Pretty much the title. Source: https://open.kattis.com/problems/classicalcounting
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
pabloskimg | 2019-06-07 07:31:41 | 26 | ||
en1 |
![]() |
pabloskimg | 2019-06-07 06:42:06 | 150 | Initial revision (published) |
Name |
---|