int modpow(int x, int n, int m) { if (n == 0) return 1%m; int u = modpow(x,n/2,m); u = (u*u)%m; if (n%2 == 1) u = (u*x)%m; return u; }
Please explain modpow(x, n/2, m) call again and again when below its code execute.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
int modpow(int x, int n, int m) { if (n == 0) return 1%m; int u = modpow(x,n/2,m); u = (u*u)%m; if (n%2 == 1) u = (u*x)%m; return u; }
Please explain modpow(x, n/2, m) call again and again when below its code execute.
Name |
---|
To understand how this works you need to know this following formula:
(A^n) % M = [ { (A^(n/2)) % M } * { (A^(n/2)) % M } ] % M [when n is even]
if n is odd then we can always write that
(A^n) % M = [ (A % M) * {(A^(n-1)) % M} ] % M [and now n-1 is even so we can apply the first formula]
This is the fundamental of binomial exponentiation. If you are required to calculate (A^N) % M in O(log N) time then this is the approach you should follow. If you still can't understand how that code works by calling itself in itself then I would suggest that you learn about recursions.
For more info: https://e-maxx-eng.appspot.com/algebra/binary-exp.html