第五次C——a^b的最后一位数

孑然-520

于 2018-12-03 17:13:22 发布

阅读量418

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/weixin_43927279/article/details/84773905

本文介绍了一种快速计算a^b末位数字的算法，通过取模运算避免大数溢出，适用于多种编程竞赛场景。输入为两正整数a和b，输出为a^b的末位数字。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

question
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

#include<stdio.h>
long long f(long long,long long);
int main()
{
	long long n,m;
	while(~scanf("%lld%lld",&n,&m)&&(n||m))
	{
		if(n%10==0)
			{
				printf("0\n"); 
				continue;
			}
			printf("%lld\n",f(n%10,(m-1)%4+1)%10);
	}	
	return 0;
}
long long f(long long n,long long m)
{
	if(m==1)
		return n;
	return f(n,m-1)*n;
}