hd 1061 Rightmost Digit 规律21 一循环 对20取余

 

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 31611    Accepted Submission(s): 12095

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.

   
   
   
    
  
  

 

 

Author

Ignatius.L

 

 

Recommend

We have carefully selected several similar problems for you:   1019  1071  1108  1170  1425 

 

 

#include<stdio.h>
int main()
{
    int t,n;
    int a[21]={0,1,4,7,6,5,6,3,6,9,0,1,6,3,6,5,6,7,4,9,0};
    while(scanf("%d",&t)!=EOF)
    {
     while(t--)
     {
       int p=1;
       scanf("%d",&n);
       printf("%d\n",a[n%20]);
               }
                              }
return 0;
    }

1注意数组定义用{}