/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 vote212 views1 answer
What is "\0" character in c++
C++
-1 vote194 views1 answer
Un aliment traduction espagnol
C++
0 vote199 views1 answer
How to store array of string with spaces in c++ stl
C++
0 vote145 views1 answer
Why can you add a bool to an int in python
C++
0 vote193 views1 answer
Left margin c++
C++
1 vote217 views1 answer
Optimized Bubble Sort
C++
14 votes194 views1 answer
C++ optimization dynamic 2d array
C++
0 vote179 views1 answer
Traverse string in cpp
C++
0 vote221 views1 answer
How to implement binders and decorators on c++ lik python?
C++
0 vote228 views1 answer
Quicksort taking random pivot
C++