HDU 1061 Rightmost Digit

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

using namespace std;

int mod(int n,int m,int a)
{
    if(m == 0)
    {
        return 1;
    }
    int x = mod(n,m/2,a);
    long long ans = (long long)x * x %a;
    if(m%2 == 1)
    {
        ans = ans * n % a;
    }
    return (int)ans;
}

int main()
{
    int n,i,j;
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        int pp;
        pp = mod(n,n,10);
        pp = pp % 10;
        printf("%d\n",pp);
    }
    return 0;
}