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 简单题目。打表不解释。直接做会TLE。 代码：

#include 
using namespace std;

int main(){
    int n,m;
    int a[10][4] = {{0,0,0,0},{1,1,1,1},{2,4,8,6},{3,9,7,1},{4,6,4,6},{5,5,5,5},{6,6,6,6},{7,9,3,1},{8,4,2,6},{9,1,9,1}};
    cin>>m;
    while(m–)
        cin>>n,cout<=0?n%4-1:3]<
原文标题：HDOJ1061:Rightmost Digit——简单数学题|落絮飞雁的个人网站
原文链接：https://www.luoxufeiyan.com/2015/03/19/hdoj1061/
授权协议：创作共用 署名-非商业性使用 2.5 中国大陆
除注明外，本站文章均为原创；转载时请保留上述链接。