Horje
binary exponentiation modulo m Code Example
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;
}




Cpp

Related
get line C++ Code Example get line C++ Code Example
max of a vector c++ Code Example max of a vector c++ Code Example
get thread id c++ Code Example get thread id c++ Code Example
change integer to string c++ Code Example change integer to string c++ Code Example
convert decimal to binary c++ Code Example convert decimal to binary c++ Code Example

Type:
Code Example
Category:
Coding
Sub Category:
Code Example
Uploaded by:
Admin
Views:
8