| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
https://tlx.toki.id/problems/bnpchs-2023-final/B
This question requires you to calculate the combination of two numbers where one ranges from 1 to 100 and the other from 1 to k.
They have also asked to mod the final answer by 1e9+7. How to write code in cases like these?
here ya go: https://cp-algorithms.com/combinatorics/binomial-coefficients.html
https://github.com/sreedhar3210/CP-snippets/blob/main/Combinatorics%20and%20fast%20power
you can refer this code snippet
File not found. Can u please provide the link again
https://github.com/sreedhar3210/CP-snippets
This is the link to that repository, you can find combinatorics related snippet in factorial_ops.cpp file.
Thanks