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 votes191 views1 answer
Uses of c++
C++
0 vote214 views1 answer
C++ bind port
C++
0 vote215 views1 answer
Prevent getting data from data-tooltip-content tippyjs
C++
0 vote212 views1 answer
C++ multiple if conditions
C++
91 votes338 views2 answers
Time function c++
C++
174 votes188 views15 answers
Int to string c++
C++
4 votes205 views4 answers
Get list of files in directory c++
C++
11 votes198 views2 answers
C++ get ascii value of char
C++
0 vote188 views1 answer
C++ print unsigned long
C++
7 votes138 views1 answer
Remove from the front of a vector
C++