快速幂

最新推荐文章于 2024-05-21 23:34:41 发布

gexiaoranran

最新推荐文章于 2024-05-21 23:34:41 发布

阅读量107

点赞数

本文链接：https://blog.csdn.net/gexiaoranran/article/details/83047438

版权

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

#Hint

In the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7.
In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.

#include <stdio.h>
int main()
{
	long long int N,i,j;
	scanf("%d",&i);
	for(j=1;j<=i;j++)
		{
			long long int n,ans=1;
			scanf("%d",&N);
			n=N;
			while(n)
			{
				if(n%2==1)
					ans=ans*N%10;
				n/=2;
				N=N*N%10;
			}
			printf("%d\n",ans);
		}
	return 0;
}