| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 164 |
| 2 | Um_nik | 163 |
| 3 | atcoder_official | 158 |
| 3 | cry | 158 |
| 3 | -is-this-fft- | 158 |
| 6 | awoo | 156 |
| 7 | adamant | 154 |
| 7 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
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
thanks a lot!
Do you know what inverse here in the code means?
I tried compiling it and it gives me an error
this is how to find the inverse of a number: https://cp-algorithms.com/algebra/module-inverse.html
right, gotcha
int N_Choose_K(int n, int k, int mod) {
if(k == 1) return n; if(n-k == 1) return n; if(n == k) return 1; return (N_Choose_K(n-1,k,mod) + N_Choose_K(n-1,k-1,mod)) % mod; }https://github.com/sreedhar3210/CP-snippets/blob/main/Combinatorics%20and%20fast%20power
you can refer this code snippet
Thanks a lot, this really helps!
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