HDU - 1061 Rightmost Digit

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.

   
   
   
   


   
   
   
   

    
    刚开始只是简单的计算后取余，结果提交后有问题，发现给定的数是有范围的，int型肯定不行。就参考了网上的程序，用数组还是可以的，因为每个数的最后一位相乘的结果是由规律的，有一定周期，且不大于10.
   
   
   
   

    
    // ----------------------------------------------------------------------------------------------------------------------------------------------------------------- //
   
   
   
   

    
    #include <stdio.h>
#include <stdio.h>


int main(void)
{
    int n, a, b, i;
    int cnt;
    char flag[10];
    int r[10];


    scanf("%d", &cnt);
    while(cnt--)
    {
        for(i = 0; i < 10; i++)
        {
            flag[i] = 0;
            r[i] = 0;
        }
        scanf("%d", &n);
        a = n % 10;
        b = a;
        i = 1;
        flag[b] = 1;
        r[0] = b;
        b = (a*b) % 10;
        while(!flag[b])
        {
            flag[b] = 1;
            r[i++] = b;
            b = (a*b) % 10;
        }
        printf("%d\n", r[(n-1)%i]);


    }


    return 0;
}