HDU Rightmost Digit (快速幂)

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<iostream>
#include<cstdio>
using namespace std;
const int m=10;

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

int main()
{
	int n,t;
	while(scanf("%d",&t)!=EOF){
		while(t--){
			scanf("%d",&n);
		   	cout<<pow_mod(n,n)<<endl;
	    }
	}
	return 0;
}