Rightmost Digit

Given a positive integer N, you should output the most right digit of N^N. 

InputThe 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). 
OutputFor 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.

by talk：最近刚刚学的快速幂，此题和快速幂差不多，快速幂是求a^b,这道题是求n^n的最右边的一位数字，那么取个模就ok啦。

#include<stdio.h> 
long long digital(long long a,long long b) 
{     
        long long ans=1;     
        while(b)    
       {         
           if(b&1)             
          ans=(ans*a)%10;         
          a=(a*a)%10;         
          b>>=1;     
      }     
   return ans; 
} 
int main() 
{     
     long long n,m;     
     scanf("%I64d",&n);     
     while(n--)     
    {         
          scanf("%I64d",&m);         
          printf("%I64d\n",digital(m,m));     
    }     
  return 0; 
}