Rightmost Digit 快速幂取模

 Rightmost Digit

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

Submit  Status

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.
     
     
     
     


     
     
     
     


     
     
     
     

      
      这个题目有两个地方需要优化，一是利用快速幂进行求幂运算，二是因为题目让求的只是结果的最后一位数，所以其实每次只进行数的最后一位数的运算就行，因为两个数想乘影响最后最后一位数的只有这两个数的最后一位数
     
     
     
     

      
      AC代码：


     
     
     
     

      
      
#include<iostream>      
#include<cstdio>      
#include<cstdlib>      
#include<cstring>      
#include<string>      
#include<queue>      
#include<algorithm>      
#include<map>      
#include<iomanip>       
#define INF 99999999      
#define maxn 100005     
using namespace std;  

void solve(int a, int b, int c) {
	int temp = a%10, ans = 1;
	while(b) {
		if(b&1)
			ans = ans*temp%c;
		temp = temp*temp%c;
		b = b>>1;
	}
	printf("%d\n",ans);
}    

int main()
{
	int t, n;
	scanf("%d",&t);
	while(t--) {
		scanf("%d",&n);
		solve(n, n, 10);
	}
	return 0;
}