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 vote173 views1 answer
Printing in column c++
C++
0 vote259 views1 answer
How to set a variable to infinity in c++
C++
2 votes153 views1 answer
Endl in c++ means
C++
0 vote179 views1 answer
C++ asio read full socket data into buffer
C++
2 votes109 views1 answer
How to fill all of the array in c++
C++
0 vote188 views1 answer
Find maximum sum of circular subarray
C++
0 vote164 views1 answer
Mac emoji shortcut
C++
1 vote201 views1 answer
How to read a line from the console in c++
C++
1 vote177 views3 answers
Right shift in c++
C++
1 vote207 views1 answer
Tarray ue4 c++
C++