HDU 1061 Rightmost Digit

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. 

N的N次方，只需要求N的个位数的N的方的个位数，同时有一个规律，
1 1 1 1 1 1 1 1
2 4 8 6 2 4 8 6
3 9 7 1 3 9 7 1
4 6 4 6 4 6 4 6
5 5 5 5 5 5 5 5
6 6 6 6 6 6 6 6
7 9 3 1 7 9 3 1
8 4 2 6 8 4 2 6
1 9 1 9 1 9 1 9
所以应该很简单把  

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int t;
    int n;
    int i,j;
    while(cin>>t)
    {
        while(t--)
        {
            cin>>n;
            i=n%10;
            j=n%4;
            if(j==0)
                cout<<i*i*i*i%10<<endl;
            else
            {
                int ans=1;
                while(j--)
                {
                    ans*=i;
                    ans=ans%10;
                }
                cout<<ans<<endl;
            }
        }
    }
    return 0;
}