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;
}java binary exponentiation
/**
* Calculate a^n in O(logn) time, instead of O(n) time with naive approach.
**/
public static long powerRecursive(int base, int exponent){
if(exponent == 0) return 1;
return (exponent % 2 == 0) ?
powerRecursive(base, exponent / 2) * powerRecursive(base, exponent / 2)
: base * powerRecursive(base, (exponent - 1) / 2) *
powerRecursive(base, (exponent - 1) / 2);
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
