HDU - 1097 - A hard puzzle （快速幂取模）

最新推荐文章于 2024-08-11 22:11:16 发布

原创最新推荐文章于 2024-08-11 22:11:16 发布 · 728 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#ACM #HDU #algorithm #快速幂 #模

收录于

HDU 同时被 2 个专栏收录

88 篇文章

订阅专栏

~~~~~~~~~~数学

58 篇文章

订阅专栏

本文介绍了一种通过快速幂取模算法解决特定数学问题的方法，即计算 a^b 的最后一位数字。针对输入的两个整数 a 和 b，利用 C++ 实现了一个高效的算法来输出 a^b 的尾数。

A hard puzzle

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32633 Accepted Submission(s): 11672

Problem Description

lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.
this puzzle describes that: gave a and b,how to know the a^b's the last digit number.But everybody is too lazy to slove this problem,so they remit to you who is wise.

Input

There are mutiple test cases. Each test cases consists of two numbers a and b(0<a,b<=2^30)

Output

For each test case, you should output the a^b's last digit number.

Sample Input

7 66
8 800

Sample Output

9
6

Author

eddy

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int k_mi(int a, int b) {		//快速幂取模 
	int t = a % 10, ans = 1;
	while(b) {
		if(b&1) ans = (ans * t) % 10;
		t = (t * t) % 10;
		b >>= 1;
	}
	return ans % 10;
}

int main() {
	int a, b;
	while(scanf("%d %d", &a, &b) != EOF) {
		printf("%d\n", k_mi(a, b));
	}
	return 0;
}