| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3977 |
| 2 | tourist | 3815 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3614 |
| 5 | orzdevinwang | 3526 |
| 6 | ecnerwala | 3514 |
| 7 | Benq | 3483 |
| 8 | hos.lyric | 3381 |
| 9 | gamegame | 3374 |
| 10 | heuristica | 3358 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 170 |
| 2 | -is-this-fft- | 162 |
| 3 | Um_nik | 161 |
| 4 | atcoder_official | 159 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 8 | awoo | 152 |
| 10 | TheScrasse | 147 |
Fastest way of finding a Factorial modulo p (where p is prime number) ?
The fastest implementation which i can find is $$$O(p + log_p n)$$$ from here
But from what I have heard there is a faster way of calculating it which might lead to the solution of this problem
Does anyone have a code implementation of it? (Since I can't find it anywhere on the internet)
