/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

4 votes89 views2 answers
Escape sequence in c++
C++
12 votes132 views1 answer
How to sort in descending order c++
C++
0 vote127 views3 answers
Bool function in c++
C++
0 vote131 views1 answer
The smallest element from three
C++
-1 vote156 views1 answer
Intersection between vector c++
C++
0 vote131 views1 answer
Elements of set c++
C++
7 votes157 views4 answers
C++ hide console
C++
0 vote136 views2 answers
Check prime cpp gfg
C++
9 votes343 views3 answers
C++ find element in vector
C++
2 votes135 views1 answer
How to hide ui elements unity
C++