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

3 votes187 views1 answer
C++ generate random char
C++
0 vote180 views1 answer
What is the default include path in ubuntu c++
C++
2 votes159 views2 answers
Selection sort c++ algorithm
C++
1 vote190 views1 answer
Qt window bottom bar
C++
0 vote162 views1 answer
Unordered map c++
C++
12 votes242 views4 answers
How to initialized a 2d vector
C++
0 vote164 views1 answer
Restart the computer in c++ after the default time (30) seconds. (Windows)
C++
1 vote172 views1 answer
Print hello world on c++
C++
14 votes169 views6 answers
How to get size of array c++
C++
1 vote189 views3 answers
Reverse string c++
C++