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

54 votes184 views2 answers
C# toint
C++
0 vote144 views1 answer
Labs c++
C++
2 votes146 views1 answer
Final in c++
C++
84 votes228 views4 answers
Php string
C++
1 vote137 views1 answer
Summary a long walk to water
C++
3 votes149 views2 answers
Access last element of set c++
C++
0 vote161 views1 answer
Make an x using asterisk c++
C++
0 vote142 views1 answer
Making content editable
C++
-1 vote129 views1 answer
Cast c++
C++
0 vote131 views1 answer
Linux x11 copy paste event
C++