HDU - 1061

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>
using namespace std;
int main()
{
	long long t;
	cin>>t;
	long long sum=1;
	while(t--)
	{
		long long n,m;
		sum=1;
		cin>>n;
		m=(n-1)%4;
		n=n%10;
		for(int i=0;i<=m;i++)
		{
		    sum=sum*n;
		}
		sum=sum%10;
		cout<<sum<<endl;
		}
}