HDU-1061-Rightmost Digit (快速幂模板）

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.

---

题意：求N^N。

思路：快速幂裸题。注意一下变量类型。

---

#include<iostream>
using namespace std;
int qm(long long a){
    int  ans=1;
    long long b=a;
    a=a%10;
    while(b){      
        if(b&1) ans=(ans*a)%10;
        b=b>>1;
        a=(a*a)%10;
    }    
    return ans;
}

int main(){
    int T,N;
    cin>>T;
    while(T--){
        cin>>N;
        cout<<qm(N)<<endl;
    }
    return 0;
}