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 vote185 views1 answer
How to use tostring method in c++
C++
14 votes220 views5 answers
Find length of array c++
C++
0 vote193 views1 answer
Powershell get uptime remote computer
C++
2 votes212 views1 answer
Size of stack in c++
C++
0 vote188 views1 answer
What c++ library is arccos in
C++
0 vote240 views1 answer
Adddynamic ue4 c++
C++
0 vote239 views1 answer
Which version c++ single file in sublime is
C++
0 vote198 views1 answer
Composition namespaces c++
C++
1 vote159 views1 answer
Slice array cpp
C++
12 votes195 views2 answers
Underline in latex
C++