【快速幂取模】HDU 1061---Rightmost Digit

Rightmost Digit

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

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<stdio.h>
#include<stdlib.h>
int main()
{
    int n,i,num,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        num=1;
        for(i=1;i<=(n%4+4);i++)//最多每乘四次个位数一个循环，而且n可能是四的倍数，所以要加上4
        {
            num*=n%10;
            num=num%10;
        }
        printf("%d\n",num);
    }
    return 0;
}