HDU 1061 Rightmost Digit

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25661    Accepted Submission(s): 9843

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

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.

 

Author

Ignatius.L

#include<stdio.h>
int main()
{
    int n,t,i,N[22]={0,1,4,7,6,5,6,3,6,9,0,1,6,3,6,5,6,7,4,9};
    
    while(scanf("%d",&n)!=EOF)
    {  
        while(n--)
        {
            scanf("%d",&t);
            t=t%20;
          printf("%d\n",N[t]);
        }

    }
    return 0;
}