Binary 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

0 vote312 views7 answers
C++ to c converter tool
C++
0 vote379 views1 answer
Run c++ program mac
C++
2 votes284 views2 answers
Check if array is sorted cpp stl
C++
0 vote338 views1 answer
Qt background color
C++
0 vote377 views1 answer
How to use custom array in c++
C++
0 vote326 views7 answers
C code to mips assembly converter online
C++
0 vote363 views1 answer
Stl reverse sort a array
C++
0 vote328 views1 answer
Recherche recursive le max dans une liste
C++
39 votes396 views6 answers
C++ print hello world
C++
20 votes337 views5 answers
Cin.getline
C++