CDZSC_2015寒假新人（2） 数学 C

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. 
         

 

 题目有规律， 找到规律即可。

 

#include <cstdio>
int Map[2][10] = {{0,1,4,7,6,5,6,3,6,9},{0,1,6,3,6,5,6,7,4,9}};
int main()
{
    int t,n;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d",&n);
        printf("%d\n",Map[(n/10)%2][n%10]);
    }
    return 0;
}