2D. Rightmost Digit

D. Rightmost Digit

Time Limit: 1000ms

Case Time Limit: 1000ms

Memory Limit: 32768KB

 

64-bit integer IO format: %I64d      Java class name: Main

 

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.

 

 ACM 新人，水题，找规律即可

 

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;
int main(){
    int i,j,temp,n;
    int d[10][10];
    for(i = 0; i < 10; i++){
        temp = i;
        for(j = 0; j < 4; j++){
            d[i][j] = temp%10;
            temp *= i;
        }
    }
    scanf("%d",&n);
    while(n--){
        scanf("%d",&temp);
        printf("%d\n",d[temp%10][(temp-1)%4]);
    }
    return 0;
}