HDU1061

规律题

/*
n^n 个位
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<math.h>
using namespace std;
const int maxn = 1005;
const int inf = 0x7fffffff;
int main(){
    int T;
    scanf("%d",&T);
    while( T-- ){
        int n;
        scanf("%d",&n);
        int cir;
        if( n%4==0 ) cir=4;
        else cir=n%4;
        n%=10;
        int tmp=1;
        while( cir-- ){
            tmp*=n;
        }
        printf("%d\n",tmp%10);
    }
    return 0;
}