/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

1 vote165 views1 answer
G++ optimization flags
C++
9 votes203 views3 answers
Max function in c++
C++
0 vote187 views2 answers
Number triangle c++
C++
0 vote170 views1 answer
User inptu in cpp
C++
0 vote189 views1 answer
C++ ss
C++
0 vote209 views1 answer
How to convert n space separated integers in c++
C++
-1 vote186 views4 answers
Time complexity analysis of algorithms calculator
C++
-1 vote213 views1 answer
How to append two vectors in c++
C++
2 votes178 views1 answer
Cannot find -lsqlite3 C++ compiler error
C++
-5 votes185 views3 answers
Array syntax in c++
C++