Given A,B,C, You should quickly calculate the result of A^B mod C. (1<=A,C<=1000000000,1<=B<=10^1000000).
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
欧拉降幂的裸题。
看下图
对于这个题目因为B非常大,所以用数组存,同时降一层幂即可。
代码如下:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
const int MAX = 1000010;
char str[MAX];
map<int,int> mp;
ll Quick_pow(ll x,ll n,ll Mod){
ll res = 1;
while(n > 0){
if(n&1)
res = res*x%Mod;
x = x*x%Mod;
n >>= 1;
}
return res;
}
int euler_phi(int n){
int res = n;
for(int i=2;i*i<=n;++i){
if(n%i == 0){
res = res/i*(i-1);
while(n%i == 0)
n/=i;
}
}
if(n != 1) res = res/n*(n-1);
return res;
}
int main(void){
ll A,C;
while(scanf("%I64d%s%I64d",&A,str,&C) != EOF){
ll v = 0;
bool isok = false;
int len = strlen(str);
for(int i=0;i<len;++i){
v = v*10+str[i]-'0';
if(v >= C){//先判断是否比C大
isok = true;
break;
}
}
ll res;
if(isok){
v = 0;
int phC = euler_phi((int)C);
for(int i=0;i<len;++i){
v = v*10+str[i]-'0';
v %= phC;
}
res = Quick_pow(A,v+phC,C);
}
else{
res = Quick_pow(A,v,C);
}
printf("%I64d\n",res);
}
return 0;
}