HDU Rightmost Digit

最新推荐文章于 2019-08-17 17:28:42 发布

章鱼鱼的ACM

最新推荐文章于 2019-08-17 17:28:42 发布

阅读量352

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/u010643814/article/details/38038691

本文探讨了在处理大数幂次运算时如何避免超时问题，并提供了优化算法来快速找到结果的最右位数字。通过实例分析和代码实现，详细解释了关键步骤和技巧。

如果按照原先写法，一直都是超时，在网上查找了这种方法，以后一定记住！

Problem Description

Given a positive integer N, you should output the most right digit of N^N.

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single positive integer N(1<=N<=1,000,000,000).

Output

For each test case, you should output the rightmost digit of N^N.

Sample Input

2
3
4

Sample Output

7
6

#include<iostream>
using namespace std;
int main(){
	int T,n,t,s,m;
	cin>>T;
	while(T--){
		cin>>n;
		if(n==1){
			cout<<"1"<<endl;
			continue;
		}
		else{
			m=n%10;
			if(m==0){
				cout<<"0"<<endl;
				continue;
			}
			//cout<<m<<endl;
			s=1;
			t=m;
			while(n){
				if(n%2==1){
					s=s*m;
					s=s%10;
				}
					m=m*m;
					m=m%10;
					n=n/2;
			}
			cout<<s<<endl;
		}
	}
	return 0;
}