Binary exponentiation

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

1 vote114 views1 answer
Qt popup window
C++
0 vote148 views1 answer
Switch in c++
C++
0 vote139 views1 answer
A variable with 2 independant variables plot
C++
0 vote140 views1 answer
Dynamic memory in c++
C++
4 votes151 views2 answers
Cpp string find all occurence
C++
0 vote217 views1 answer
C++ add to array
C++
0 vote141 views1 answer
C++ start thread later
C++
1 vote150 views1 answer
How to do sets in cpp
C++
1 vote167 views1 answer
Elixir update map
C++
0 vote138 views2 answers
Css window id
C++