杭电-1061 Rightmost Digit

Rightmost Digit

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

Total Submission(s): 47575    Accepted Submission(s): 17974

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:   1021  1008  1019  1071  1170 

AC代码：

#include<stdio.h>
int quictpow(__int64 n)
{
    int ans=1;
    __int64 base=n;
    while(n>0)
    {
        if(n%2==1)
        {
            ans=(base*ans)%10;
        }
        base=(base*base)%10;
        n=n/2;
    }
    return ans;
}
int main()
{
    __int64 n;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d",&n);
        printf("%d\n",quictpow(n));
    }
    
    
    return 0;
}