hdu 1061

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21027    Accepted Submission(s): 8068

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.
 

 

Author

Ignatius.L

 

#include <iostream>
using namespace std;
int main()
{
	int j, k, l, n;
	cin>>k;
	while (k--) 
	{
		cin>>n;
		j = n%4;
		n = n%10;
		l = 1;
		switch(j) {
		case 1: l = n%10;
			break;
		case 2: l = n*n%10;
			break;
		case 3: l = n*n*n%10;
			break;
		case 0: l = n*n*n*n%10;
			break;
		default:
			break;
		}
		cout<<l<<endl;
	}
	return 0;
}