Can any one solve this
C++ code N^(f(X)) mod M
f(X) is defined as product of primes upto X
1<=N,M<=10^9
1<=X<=10^6
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
7 | nor | 155 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Can any one solve this
C++ code N^(f(X)) mod M
f(X) is defined as product of primes upto X
1<=N,M<=10^9
1<=X<=10^6
Name |
---|
For any $$$a, b$$$ and $$$c$$$, $$$(a^b)^c = a^{bc}$$$. So,
where
pow
is implemented using fast exponentiation.Thank you. Sir