Rightmost Digit

HDOJ1061:

        

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.

   
   
   
    
  
  

 

#include <iostream>

using namespace std;

int main()
{
    int T,n,a[10],b[10][5];
    for(int i=0;i<10;i++)
    {
        b[i][0]=i;
        int k=0;
        while(!k||b[i][k]!=b[i][0])
        {
            k++;
            b[i][k]=b[i][k-1]*i%10;
        }
        a[i]=k;
    }
    cin>>T;
    while(T--)
    {
        cin>>n;
        int tmp=n%10;
        cout<<b[tmp][(n-1)%a[tmp]]<<endl;
    }
    return 0;
}