/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

0 vote136 views1 answer
Pow without math.h
C++
14 votes157 views4 answers
C++ create vector of size
C++
0 vote139 views1 answer
C++ qt QFuture
C++
0 vote154 views1 answer
C++ optimize big int array
C++
0 vote152 views1 answer
How to adjust and delete memory in c, c++
C++
4 votes149 views1 answer
Passing array to function c++ pointer
C++
13 votes139 views3 answers
Python remove repeated characters from string
C++
2 votes156 views1 answer
C++ time nanoseconds
C++
18 votes146 views3 answers
Sort(arr arr+n) in c++
C++
1 vote171 views1 answer
Std means in programming
C++