hdoj-1097-A hard puzzle

最新推荐文章于 2019-04-23 20:04:52 发布

hpu刘

最新推荐文章于 2019-04-23 20:04:52 发布

阅读量194

点赞数

分类专栏：数学基础

本文链接：https://blog.csdn.net/u011514451/article/details/86699483

版权

基础同时被 2 个专栏收录

36 篇文章 0 订阅

订阅专栏

数学

23 篇文章 0 订阅

订阅专栏

A hard puzzle

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

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

解题的思路主要是找规律，发现所有数的n次幂的个位数都是有一定规律的：个位上的数是以4为周期交替出现的。

AC代码：

#include<stdio.h>
int main()
{
	int a,b,m;
	while(scanf("%d%d",&a,&b) != EOF)
	{
		a %= 10;
		b %= 4;
		b = b?b:4;
		m = 1;
		for(int i=0;i<b;i++)
			m = m*a;
		printf("%d\n",m%10);
	}
	return 0;
}