hdu1061 快速幂取模

                                              **

Rightmost Digit

**
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 82115 Accepted Submission(s): 30168

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.
快速幂取模

#include <bits/stdc++.h>

using namespace std;

int fastpow(__int64 a,__int64 b,__int64 c)
{
    int base=(a%10);
    int res=1;
    while(b>0)
    {
        if(b&1)
        res=(res*a)%10;
        b=b>>1;
        a=(a*a)%10;

    }
    return res;
}
int main()
{
    int q;
    cin>>q;
    __int64 n;
    while(q--)
    {
        cin>>n;
        int sum=fastpow(n,n,10);
        cout<<sum<<endl;

    }
	return 0;

}