Binary exponentiation modulo m

long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

Source: cp-algorithms.com

Similar codes

0 vote303 views1 answer
What is the format specifier for dword c++
C++
0 vote328 views1 answer
Fast input and output c++
C++
2 votes301 views2 answers
Qt qstring to float
C++
3 votes289 views1 answer
Repeat character n times c++
C++
0 vote297 views1 answer
For loop f#
C++
14 votes258 views6 answers
How to get size of array c++
C++
1 vote309 views1 answer
Operator precedence in cpp
C++
66 votes372 views8 answers
Dogecoin price
C++
0 vote348 views1 answer
Warning: base will be initialized after
C++
0 vote289 views1 answer
Kmp c++
C++