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 vote182 views1 answer
Sento freddo a un dente
C++
1 vote181 views3 answers
How to use cout function in c++
C++
1 vote192 views1 answer
Turn github into vscode
C++
1 vote193 views1 answer
What are various sections of process
C++
44 votes293 views10 answers
Youtube
C++
0 vote189 views2 answers
If else in C++
C++
1 vote211 views1 answer
How to hide the c++ console
C++
3 votes214 views2 answers
Precision of fixed in c++
C++
0 vote190 views1 answer
C++ typeid get type name
C++
0 vote241 views1 answer
C++ uint32_t
C++