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

3 votes122 views2 answers
Find maximum sum in array of contiguous subarrays
C++
3 votes124 views1 answer
C++ program to reverse an array
C++
3 votes145 views1 answer
What language was c+ written in
C++
-1 vote124 views4 answers
Time complexity analysis of algorithms calculator
C++
0 vote112 views1 answer
C++ rename function
C++
0 vote152 views1 answer
Pop back innstring
C++
0 vote88 views1 answer
How to get euler constant in c++
C++
1 vote132 views1 answer
Avrational compare
C++
1 vote126 views1 answer
C++ ::
C++
0 vote118 views1 answer
Day 21 generics hackerrank solution in c++
C++