AOJ 569 快速幂

AOJ 569

code:

/*
adrui's submission 
Language : C++
Result : Accepted
Love : ll
Favorite : Dragon Balls

Standing in the Hall of Fame
*/



#include
#include
#include
using namespace std;

#define debug 0
#define LL long long
#define mod 99991
#define M(a, b) memset(a, b, sizeof(a))

LL n, res, m;

LL fast_mod(LL a, LL b) {
	LL ans = 0;
	while (b) {
		if (b & 1) ans = (a + ans) % mod;						//快速乘法
		a = (a + a) % mod;
		b >>= 1;
	}

	return ans;
}

LL fast_muti_mod() {
	res = 1;
	LL tmp = n;
	while (m) {
		if (m & 1) res = fast_mod(res, tmp);					//用快速乘法模拟快速幂
		tmp = fast_mod(tmp, tmp);
		m >>= 1;
	}

	return res;
}

int main() {
#if debug
	freopen("in.txt", "r", stdin);
#endif //debug
	
	int t;
	scanf("%d", &t);
	while (t--) {

		scanf("%I64d%I64d", &n, &m);
		printf("%I64d\n", fast_muti_mod());
	}
	return 0;
}