HDU1061 FLY

HDU1061

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

#include <cstdio>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm> 
typedef long long ll;
ll pow_mod(ll a, ll b, ll mod)
{
	if(b==0) return 1;
	ll res=pow_mod(a*a%mod, b/2, mod);
	if(b%2==1) res=res*a%mod;
	return res;
}
int main()
{
	ll t;
	scanf("%lld", &t);
	while(t--)
	{
		ll a;
		scanf("%lld", &a);	
		printf("%lld\n", pow_mod(a,a, 10)); 
	}
	return 0;
}