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

5 votes135 views1 answer
C++ is string a number
C++
4 votes166 views4 answers
How to pass an array by reference in C++
C++
1 vote123 views1 answer
C++ remove n characters from string
C++
0 vote132 views2 answers
C++ programming code to remove all characters from string except alphabets
C++
1 vote120 views1 answer
How to add colored text in c++
C++
0 vote109 views1 answer
Reference variablesr in c++
C++
-2 votes132 views1 answer
Double pointers C++
C++
19 votes162 views5 answers
When kotlin
C++
0 vote119 views1 answer
C function as paramter
C++
1 vote123 views1 answer
Make cin cout faster
C++