-
Notifications
You must be signed in to change notification settings - Fork 105
Expand file tree
/
Copy path6.10.cpp
More file actions
36 lines (32 loc) · 895 Bytes
/
6.10.cpp
File metadata and controls
36 lines (32 loc) · 895 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/*
* 题目名称：人见人爱A^B
* 题目来源：HDU 2035
* 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2035
* 代码作者：杨泽邦(炉灰)
*/
#include <iostream>
#include <cstdio>
using namespace std;
int FastExponentiation(int a, int b, int mod) {
int answer = 1; //初始化为1
while (b != 0) { //不断将b转换为二进制
if (b % 2 == 1) { //若当前位为1，累乘a的2^k次幂
answer *= a;
answer %= mod; //求后三位
}
b /= 2;
a *= 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;
}