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

14 votes56 views5 answers
C++ Type Casting
C++
0 vote83 views1 answer
Use of undeclared identifier '_O_U16TEXT'
C++
0 vote102 views1 answer
C++ insertion in astack
C++
2 votes94 views2 answers
Selection sort c++ algorithm
C++
0 vote103 views1 answer
Dynamic memory allocation for string in c++
C++
-2 votes94 views6 answers
Array in c++
C++
0 vote88 views7 answers
C++ convert to assembly language
C++
0 vote98 views1 answer
Binary search c++
C++
0 vote92 views1 answer
C++ iterate through constant list
C++
13 votes97 views3 answers
C++ remove last element from vector
C++