Rightmost Digit（快速幂）

点击打开链接

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 56988    Accepted Submission(s): 21536

Problem 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<iostream>
#include<cmath>
using namespace std;

//int mi(int n){
//	int m=n;
//	if(n==0)
//	return 1;
//	if(n==1)
//	return m;
//	if(n%2==0)
//	return m*m*mi(n/2);
//	if(n%2==1)
//	return m*m*mi(n/2)*m;
//}

int mod_exp(int a, int b, int c)      
{
    int res, t;
    res = 1 % c; 
    t = a % c;
    while (b)
    {
        if (b & 1)
        {
            res = res * t % c;
        }
        t = t * t % c;
        b >>= 1;
    }
    return res;
}

int main(){
	int T;
	cin>>T;
	while(T--){
		int n;
		cin>>n;
		cout<<mod_exp(n,n,10)<<endl;
	}
	return 0;
}