人见人爱a的b次方 P100
//人见人爱a的b次方 P100
#include <cstdio>
using namespace std;
int Fastponentiation(int a,int b,int mod){
int answer = 1;
while(b!=0){
if(b%2 == 1){
answer *= a;
answer %= mod;
}
b/=2;
a*=a;
a%=mod;
}
return answer;
}
int main(){
int a,b;
while(scanf("%d%d",&a,&b) != EOF){
if(a==0 && b==0) break;
printf("%d\n",Fastponentiation(a,b,1000));
}
return 0;
}
查看12道真题和解析