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

1 vote360 views1 answer
Pyramid shape in c++
C++
5 votes313 views1 answer
C++ - include all libraries
C++
2 votes364 views1 answer
Cout was not declared in this scope
C++
0 vote329 views1 answer
Ifstream file (“code2.txt”); dev C++
C++
0 vote350 views1 answer
What does npl mean?
C++
0 vote327 views1 answer
How the theam are store in database
C++
20 votes376 views3 answers
How to append to a vector c++
C++
22 votes330 views4 answers
Height of the tree
C++
0 vote324 views1 answer
C++ method name
C++
0 vote307 views1 answer
Define type c++
C++