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 vote170 views1 answer
How to run a msi file raspbrain
C++
0 vote157 views3 answers
Tower of hanoi
C++
0 vote147 views1 answer
How to check if vector is ordered c++
C++
0 vote137 views1 answer
Map::begin
C++
-1 vote140 views2 answers
Convert c++ to mips
C++
27 votes159 views6 answers
Bootstrap grid
C++
6 votes157 views2 answers
Precision c++
C++
4 votes144 views3 answers
C++ vector combine two vectors
C++
0 vote132 views1 answer
The iostream is the head er file which contains all the functions of program like cout, cin and etc.
C++
1 vote148 views1 answer
String c++ if letter or number
C++