Hduoj1061 【数学】【快速幂取模】

/*Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32980    Accepted Submission(s): 12637


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<stdio.h>
int main()
{
	int i, j, k, m, n;
	scanf("%d", &n);
	while(n--)
	{
		scanf("%d", &m);
		k = m;
		j = 1;
		while(k)
		{
			if(k & 1)
			{
				j = j * m % 10;
			}
			m = (m % 10)* (m % 10);// 注意这里两个都要取余后运算，不然有可能超范围
			k >>= 1;
		} 
		printf("%d\n", j);
	}
	return 0;
}