输出N^N的个位数字

#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

#include <bits/stdc++.h>

using namespace std;
int main()
{
int n,x,b;
int a[10][4]={{0},{1},{6,2,4,8},{1,3,9,7},{6,4},{5},{6},{1,7,9,3},{6,8,4,2},{1,9}};/数字的N次方个位数字有周期性；/
cin>>n;
while(n–)
{
cin>>x;
b=x%10;//求取个位数字；
if(b0||b1||b5||b6)
cout<<a[b][x%1]<<endl;
if(b2||b3||b7||b8)
cout<<a[b][x%4]<<endl;
if(b4||b9)
cout<<a[b][x%2]<<endl;
}
return 0;
}