Can you give me the easy and understandable implementation of Miller Rabin in C++?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
Название |
---|
https://cp-algorithms.com/algebra/primality_tests.html#toc-tgt-2
but it gives wrong output in some cases. Example: 999999999999999989 its a prime number but the output is its a composite number.
Are you sure? I just tried it, and
MillerRabin(999999999999999989LL)
returnstrue
, indicating that it is probably prime.You must made an error calling the function (maybe you forgot to mark it as a long long number?).
Also, if you want to go safe, just use the deterministic Miller-Rabin code, from the next section.