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 vote185 views1 answer
Add for input output file in c/c++
C++
0 vote174 views1 answer
Elements of set c++
C++
2 votes176 views1 answer
Insert element in array c++
C++
7 votes135 views1 answer
Remove from the front of a vector
C++
1 vote241 views1 answer
Cpp map iterate over keys
C++
4 votes176 views2 answers
Vector.find()
C++
0 vote201 views1 answer
C++ foreach vector
C++
0 vote196 views1 answer
Get map values c++
C++
0 vote176 views1 answer
Sort vector of pair c++
C++
2 votes202 views2 answers
How to get cursor position c++
C++