Calculate
R := B ^ P mod M
for large values of B, P, and M using an efficient algorithm. (That’s right, this problem has a time dependency !!!.)
Input
The input will contain several test cases, each of them as described below. Consecutive test cases are separated by a single blank line.
Three integer values (in the order B, P, M) will be read one number per line. B and P are integers in the range 0 to 2147483647 inclusive. M is an integer in the range 1 to 46340 inclusive.
Output
For each test, the result of the computation. A single integer on a line by itself.
Sample Input
3
18132
17
17
1765
3
2374859
3029382
36123
Sample Output
13
2
13195
/* UVALive5346 UVA374 Big Mod */
#include <stdio.h>
typedef unsigned long long ULL; //unsigned long long类型是目前C语言中精度最高的数据类型,可以用来表示20以内的阶乘数据,20以外的自测。
// 快速模幂计算函数
ULL powermod(ULL a, ULL n, ULL m) //ULL变成了一种数据类型
{
ULL res = 1;
while(n) { //n != 0进行循环
if(n & 1) { // n % 2 == 1(奇数)
res *= a;
res %= m;
}
a *= a;
a %= m;
n >>= 1;//就是 n / 2 的意思
}
return res;
}
int main(void)
{
ULL b, p, m;
while(~scanf("%lld%lld%lld", &b, &p, &m)) {
printf("%lld\n", powermod(b, p, m));
}
return 0;
}
//快速幂取模:积的取余等于取余的积的取余
//快速幂就是快速算底数的n次幂。其时间复杂度为 O(log2 N), 与朴素的O(N)相比效率有了极大的提高。
//11 = 1011(二进制)
//11 = 2^3×1 + 2^2×0 + 2^1×1 + 2^0×1
//a^11转化为算 a^(2^3) * a^(2^1) * a^(2^0)