fzu 1752 快速幂取模+防溢出

Given A,B,C, You should quickly calculate the result of A^B mod C. (1<=A,B,C<2^63).

Input

There are multiply testcases. Each testcase, there is one line contains three integers A, B and C, separated by a single space.

Output

For each testcase, output an integer, denotes the result of A^B mod C.

Sample Input

3 2 4
2 10 1000

Sample Output

1
24

 

#include <iostream>  
using namespace std;  
#define ULL unsigned __int64  
  
ULL mul_mod (ULL a, ULL b, ULL c) //利用快速取幂模的思想求a*a%c和res*a%c，为了防止溢出  
{  
    ULL res = 0;  
    for ( ; b; b >>= 1)  
    {  
        if (b & 1)  
        {  
            res += a;    //这两句换成 res = (res + a) % c 会很慢  
            if (res >= c) res -= c;  
        }  
        a <<= 1;    //这两句换成 a = (a + a) % c 也很慢  
        if (a >= c) a -= c;  
    }  
    return res;  
}  
  
ULL qmod (ULL a, ULL b, ULL c)  
{  
    ULL res = 1;  
    for ( ; b; b >>= 1)  
    {  
        if (b & 1)  
            res = mul_mod (a, res, c);  
        a = mul_mod (a, a, c);  
    }  
    return res;  
}  
  
int main()  
{  
    ULL a, b, c;  
    while (~scanf ("%I64u%I64u%I64u", &a, &b, &c))  
        printf ("%I64u\n", qmod (a%c, b, c));  
    return 0;  
}