/C++/Modulo Exponentiaon,Iteratve Modulo Exponentiation

Modulo Exponentiaon,Iteratve Modulo 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

7 votes332 views2 answers
Qt int to string
C++
0 vote295 views1 answer
Idnefier cout in undefined
C++
0 vote320 views1 answer
Adddynamic ue4 c++
C++
0 vote303 views1 answer
Unknown number of threads cpp
C++
-3 votes323 views1 answer
Array c plus plus
C++
2 votes346 views2 answers
Check if directory exists cpp
C++
0 vote316 views1 answer
Advanced c++ topics
C++
4 votes332 views2 answers
How to hide the console c++
C++
1 vote291 views1 answer
Naive pattern matching algorithm
C++
0 vote354 views1 answer
How to downgrade numpy
C++