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 vote136 views1 answer
C++ get index of map element
C++
0 vote141 views1 answer
C++ first index 0 or 1
C++
0 vote136 views1 answer
How to extract a folder using python
C++
2 votes140 views3 answers
Digit sum c++
C++
0 vote128 views1 answer
C++ thread wait fro 1 sec
C++
1 vote158 views1 answer
C++ vs c#
C++
0 vote133 views1 answer
Are arrays faster than vectors c++
C++
0 vote149 views1 answer
Find first of a grammar
C++
2 votes131 views2 answers
C++ sum the digits of an integer
C++
2 votes123 views1 answer
Conditional cout in c++
C++