Rightmost Digit

Rightmost Digit
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 152 Accepted Submission(s) : 35
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>
int sum(int n,long long m ){
	long long int s=1;
	int b=n;
	while(b){
		if(b&1){
			s=(s%m*n%m)%m;
		}
		b=b>>1;
		n=(n%m*n%m)%m;
	}
	return s;
}
int main()
{
    int a,n;
    long long int s;
    scanf("%d",&n);
    while(n--){
    	scanf("%d",&a);
    	s=sum(a,10);
    	printf("%lld\n",s%10);
	}
    return 0;
}

这里我用了快速幂的方法，这个题的难点在于越界问题
，所以在计算的过程中要不停的取模。而sum函数中的主要作用就是求乘积。