Rightmost Digit

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 35128 Accepted Submission(s): 13337

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.  
    
    
    
    
    
 
       
    
    
    
    
    
 
     解题思路：找规律，通过程序找出规律，即周期=20；循环节为{0,1,4,7,6,5,6,3,6,9,0,1,6,3,6,5,6,7,4,9,0} 
    
    
    
    
    
 
     源代码： 
    
    
    
    
    
 
     #include <stdio.h> #include <stdlib.h> int main() {   int a[21]={0,1,4,7,6,5,6,3,6,9,0,1,6,3,6,5,6,7,4,9,0};   int t,n;   scanf("%d",&t);   while(t--)   {     scanf("%d",&n);     printf("%d\n",a[n%20]);             }   system("pause");   return 0;     }