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.
[/hint]
用普通的循环乘超时，无法通过
只能用快速幂
虽然我可能自己还写不出来快速幂
位运算，相同为一，不同为0
例如：
5 二进制 101&001->001
代码如下
#include<stdio.h>
#include
using namespace std;
int rightD(int n); //定义函数
int main()
{
int number = 0;
int n=0;
scanf("%d",&number);
while(number–){ //输入
scanf("%d",&n);
printf("%d\n",rightD(n));
}
return 0;
}
int rightD(int n)
{
int a=1;
int t=n%10;
while(n!=0){
if(n&1==1){ //判断最后一位是否为1 是则等于 不是则不等于
a = (at)%10;
}
t = (tt)%10;
n = n>>1; //右移一位等于除以2
}
return a;
}