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

0 vote55 views1 answer
Scss variable is not defined
C++
0 vote107 views1 answer
C++ declare binary number
C++
11 votes123 views3 answers
Get ascii value of string in C++
C++
13 votes105 views4 answers
Stl sort in c++
C++
1 vote170 views1 answer
C++ uniform_real_distribution get same result
C++
1 vote94 views3 answers
Auto in cpp
C++
-1 vote100 views1 answer
React cookie
C++
0 vote104 views1 answer
Prime template c++
C++
0 vote105 views2 answers
Lcm in c++
C++
0 vote103 views2 answers
What do you mean by smallest anagram of a string
C++