Hi, I'm doing an exercise on mods for large numbers, i don't know if there is a more efficient solution than using binary exponentiation? Hope to help you, thanks. (Sorry about my bad english :()
№ | Пользователь | Рейтинг |
---|---|---|
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 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Can I use Binary Exponentiation with this problem? 2^2^n mod k
Hi, I'm doing an exercise on mods for large numbers, i don't know if there is a more efficient solution than using binary exponentiation? Hope to help you, thanks. (Sorry about my bad english :()
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en4 |
![]() |
baowilliam | 2022-09-26 19:02:58 | 70 | Tiny change: 'with (0\leq n\l' -> 'with $(0\leq n\l' | |
en3 |
![]() |
baowilliam | 2022-09-26 18:48:01 | 10 | Tiny change: 'caculate: 2^2^n mod k (1 ' -> 'caculate: (2^2^n + 1) mod k (1 ' | |
en2 |
![]() |
baowilliam | 2022-09-26 18:47:06 | 69 | ||
en1 |
![]() |
baowilliam | 2022-09-26 18:44:00 | 257 | Initial revision (published) |
Название |
---|