HPUOJ---2017寒假作业--专题-1/N-Rightmost Digit

N - Rightmost Digit

 

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<stdio.h>
int Quick_MI(int n,int m,int c)
{
	int s=1;
	n=n%c;
	while(m)
	{	
		if(m&1)
		{
			s=(s*n)%c;
		
		}
		n=(n*n)%c;
		m=m/2;
	}                     //快速幂 
	return s;
}
int main()
{
	int T,N,k,c=10;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&N);
		k=Quick_MI(N,N,c);
		printf("%d\n",k);
	}
	return 0;
}