Rightmost Digit ---关于hdu-1061

Rightmost Digit ---关于hdu-1061

某QQ空间是我的QQ,我搬家搬过来了.
当然此问题不难,不排除有人和我有同样的想法.
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.

网上的一些代码虽然能AC。。但是采用了穷举的方式，把所有的结果全部输出，代码冗余。。
只好自己动手了。。
#include<iostream>
using namespace std;

int main()
{
    long long a,n,b,i,c;
    cin>>n;
    while (n--)
    {
        cin>>a;
        b=a%10;
        c=1;
        for ( i=0 ; i<a%4+4 ; i++ )
        {
            c=c*b;
        }
        cout<<c%10<<endl;
    }
    return 0;
}