HDU——1061 Rightmost Digit

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

#include <iostream>

using namespace std;

long long fun(long long a)
{
    long long sum=1;
    long long b;
    int s=1;
    b=a%20;
    if(b==0)
    {
        b=10;
    }
    for(int i=0;i<b;i++)
    {
        sum=s*b;
        s=sum%10;
    }

    return s;
}

int main()
{
    int n;
    long x;
    cin>>n;
    while(n)
    {
        n--;
        cin>>x;
        cout<<fun(x)<<endl;
    }

    return 0;
}