/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 vote184 views1 answer
Templates of templates c++
C++
1 vote210 views1 answer
Qt label set text color
C++
35 votes180 views3 answers
Hello c++
C++
5 votes172 views1 answer
Cpp all in one header
C++
4 votes207 views2 answers
Finding the length of an array
C++
7 votes210 views2 answers
Round c++
C++
9 votes168 views5 answers
C++ cin cout
C++
0 vote198 views1 answer
Decising how many numbers after comma c++
C++
25 votes212 views10 answers
Netflix
C++
24 votes202 views5 answers
Size of array
C++