#include <cstdio>
#include <iostream>
using namespace std;
int FastExponentiation(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", FastExponentiation(a, b, 1000));
}
return 0;
}
人见人爱A^B(快速幂)
最新推荐文章于 2021-09-14 23:53:47 发布