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 vote120 views1 answer
Haxelib install cpp
C++
0 vote113 views1 answer
C++ set value to inf
C++
0 vote116 views1 answer
C++ fast
C++
1 vote107 views1 answer
C++ initialize array 1 to n
C++
5 votes102 views1 answer
Master library in c++
C++
2 votes62 views1 answer
Read int from file c++
C++
2 votes108 views1 answer
Fatal error: opencv2/opencv.hpp: No such file or directory
C++
0 vote111 views2 answers
Find prime number c++
C++
0 vote110 views1 answer
How to check size of file in c++
C++
0 vote108 views2 answers
C++ function for checking if a sting is a number
C++