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
Regionals 1990 >> North America - Rocky Mountain
问题链接:UVALive5346 UVA374 Big Mod
问题简述:(略)
问题分析:
这是一个数学计算问题,即计算快速幂。
程序说明:(略)题记:把功能封装到函数是一个好主意。
参考链接:(略)
AC的C语言程序如下:
/* UVALive5346 UVA374 Big Mod */
#include <stdio.h>
typedef unsigned long long ULL;
// 快速模幂计算函数
ULL powermod(ULL a, ULL n, ULL m)
{
ULL res = 1;
while(n) {
if(n & 1) { // n % 2 == 1
res *= a;
res %= m;
}
a *= a;
a %= m;
n >>= 1;
}
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;
}