HDU 1061 Rightmost Digit【快速幂取模】

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 43014 Accepted Submission(s): 16169

[align=left]Problem Description[/align]
Given a positive integer N, you should output the most right digit of N^N.

[align=left]Input[/align]
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).

[align=left]Output[/align]
For each test case, you should output the rightmost digit of N^N.

[align=left]Sample Input[/align]

2
3
4

[align=left]Sample Output[/align]

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<stdio.h>
int qm(int n,int m)
{
int s=1;
while(m)
{
if(m&1)
{
s=(s*n)%10;
}
n=(n*n)%10;
m>>=1;
}
return s;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
printf("%d\n",qm(n%10,n));
}
return 0;
}