Rightmost Digit

Rightmost Digit
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 181 Accepted Submission(s) : 40
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.
[/hint]

Author
Ignatius.L

#include<stdio.h>
int main()
{
    int t,x,n,a;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&x);
        n=x,a=1;
        x=x%10;
        while(n!=0){
            if(n%2!=0)
                a=(a*x)%10;
            x=(x*x)%10;
            n/=2;
        }
        printf("%d\n",a);
    }
    return 0;
}