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

19 votes119 views1 answer
How to load from files C++
C++
-1 vote121 views1 answer
How to write hello world c++
C++
0 vote116 views1 answer
C++ stoi binary negative number string to decimal
C++
0 vote112 views1 answer
Summation of Natural Number Sequence with c and c++.
C++
0 vote106 views3 answers
JAJA
C++
0 vote106 views1 answer
How to get characters through their ascii value in c++
C++
0 vote104 views1 answer
Turbo c++ easy programs
C++
0 vote104 views1 answer
C++ looping through a vector
C++
0 vote108 views3 answers
Libevent parse multipart formdata site:stackoverflow.com
C++
2 votes109 views1 answer
Capitalize first letter c++
C++