快速幂取模

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. 

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<map>
using namespace std;
int a[1000001]={0};
int fun(int a, int b, int c){//求a的b次方对c的模 
    int res, t;
    res = 1; 
    t = a % c;
    while (b){
        if (b & 1){
            res = res * t % c;
        }
        t = t * t % c;
        b >>= 1;
    }
    return res;
} 
int main()
{
	int n,k;
	while(~scanf("%d",&n))
	{
		while(n--)
		{
			scanf("%d",&k);
			printf("%d\n",fun(k,k,10));
		}
	}
}