Binary exponentiation modulo m

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 vote109 views1 answer
Delete heap array c
C++
0 vote110 views1 answer
How to get the time in c++ as string
C++
0 vote105 views1 answer
C++ erase last element of set
C++
0 vote113 views10 answers
Loop
C++
0 vote97 views1 answer
Comment installer boost c++ sur windows
C++
2 votes96 views1 answer
Insert element in array c++
C++
8 votes101 views2 answers
‘setprecision’ was not declared in this scope
C++
0 vote195 views1 answer
Esp8266 wifi.localip() to string
C++
1 vote89 views1 answer
64 bit unsigned integer c++
C++
-2 votes104 views1 answer
How to iterate through array in c++
C++