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

0 vote215 views1 answer
Fstring from float c++ ue4
C++
0 vote189 views1 answer
Sleep system function linux c++
C++
0 vote187 views1 answer
(1 & 1) in cpp
C++
0 vote183 views1 answer
Qt asynchronous HTTP request
C++
3 votes148 views1 answer
Rapidjson parse
C++
-1 vote182 views2 answers
Balanced parentheses
C++
0 vote178 views1 answer
How to store pair in min heap in c++
C++
15 votes192 views10 answers
Hello world
C++
0 vote177 views1 answer
Prefix using stack
C++
0 vote194 views1 answer
Tutti i tipi di equazioni trigonometriche
C++