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

-1 vote153 views2 answers
C++ split string by sstream
C++
1 vote162 views1 answer
Shared_ptr header file
C++
0 vote163 views1 answer
Rectangle Area hackerrank in c++
C++
4 votes189 views3 answers
Pi in c++
C++
2 votes153 views1 answer
Multiline comment in C++
C++
2 votes163 views2 answers
Back() in c++
C++
0 vote183 views1 answer
Colors on c++
C++
0 vote183 views1 answer
Rotation 2d d'un point
C++
0 vote163 views2 answers
Format c++ discord
C++
0 vote156 views1 answer
Tree to array c++
C++