Rightmost Digit

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. 
         

 

---

快速幂的求法把要乘的这个数遍成(（n）^2……）^2减少时间浪费

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

#include<cstdio>
int slove(int n,int m,int mod){//快速幂时间log2 N。
	int ans=1;
	int beas=n%mod;
	while(m){
		if(m%2==1){
			ans=(ans*beas)%mod;
		}
		beas=(beas*beas)%mod;
		m>>=1;
	}
	return ans;
}
int main(){
	int n,m,mod,T;
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		m=n;
		mod=10;
		printf("%d\n",slove(n,m,mod));
	}
	return 0;
}