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

-2 votes288 views1 answer
English to french typing online
C++
0 vote296 views1 answer
Ampersand in cpp
C++
0 vote297 views1 answer
C function as paramter
C++
0 vote296 views1 answer
Push_back a pair c++
C++
11 votes266 views1 answer
Strcmp different length
C++
2 votes337 views2 answers
Palindrome checker in c++
C++
46 votes369 views3 answers
Data types in c++
C++
0 vote299 views1 answer
Summation of Natural Number Sequence with c and c++.
C++
2 votes298 views1 answer
C++ print current time
C++
0 vote314 views1 answer
Cpp concatenate methods
C++