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.
[/hint]

代码：

#include <stdio.h>
typedef long long ll;
ll quickpow(ll a)
{
	ll ans=1;
	ll b=a;
	while(b)
	{
		if(b&1)
			ans=(ans*a)%10;
		a=(a*a)%10;
		b=b>>1;
	}
	return ans;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		ll a;
		scanf("%lld",&a);
		printf("%lld\n",quickpow(a));
	}
	return 0;
}

需要注意的是输入的数字可能会很大，可能在乘的过程中会超限，所以这里采用在乘的时候取模。