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 vote219 views1 answer
How togreper
C++
0 vote238 views1 answer
Bit masking tricks
C++
1 vote233 views1 answer
Abs in c++
C++
0 vote220 views1 answer
Prevent copy c++
C++
1 vote257 views1 answer
Ray sphere intersection equation
C++
0 vote288 views1 answer
C++ generic pointer
C++
1 vote226 views1 answer
GetCurrentThreadId c
C++
0 vote247 views1 answer
C++ freecodecamp course 10 hours youtube
C++
0 vote209 views1 answer
MPI_PUT
C++
0 vote247 views1 answer
Wgat is duble in c++
C++