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 vote164 views1 answer
C++ void to avoid functions
C++
0 vote175 views1 answer
Udo apt install dotnet-sdk-5
C++
1 vote276 views1 answer
Class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) meaning
C++
0 vote164 views1 answer
Why constructor can't be static in c++
C++
0 vote165 views1 answer
QT form doesn't take changes
C++
2 votes125 views1 answer
First missing integer leetcode
C++
0 vote197 views1 answer
Heroatx77
C++
0 vote237 views1 answer
Curl upload folder and subfolders
C++
1 vote163 views1 answer
How to read a comma delimited file into an array c++
C++
0 vote171 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++