hdu1061_Rightmost Digit

Rightmost Digit

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 <iostream>
#include <stdio.h>


using namespace std;


int mi(long long y)
{
    int yu=y%10;
    int sum=1;
    if(!yu) return yu;
    for(int i=y;i>0;i/=2)
    {
        if(i%2==1)
        {
            sum*=yu;
            sum%=10;
        }
        yu*=yu;
        yu%=10;
    }
    return sum;
}


int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
       long long y;
       cin>>y;
       cout<< mi(y)<<endl;
    }
    return 0;
}