F - Rightmost Digit （输出最右边的数字）

F - Rightmost Digit

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1061

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 
     
     

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. 

这个题用到了快速幂的计算。

2（10），10是偶数，2（10）=2（5）*2（5）；

2（5），5是奇数，2（5）=2*2（4）；

2（4），4是偶数，2（4）=2(2)*2(2);

以此类推，2（0）=1；

#include<stdio.h>
long long f(long  long a,long long b,long  long m)
{
	if(b==0)
	return 1;
	if(b%2==1)
	{
		return a*f(a,b-1,m)%m;
	}
	else
	{
		long long mul=f(a,b/2,m);
		return mul*mul%m;
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	while(n--)
	{
		long long a;
		scanf("%lld",&a);
		printf("%lld\n",f(a,a,10));
	}
}