E - E

E - E

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit

Status
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.

---

1. 题意：求n^n%10.
2. 思路：快速幂取模模型 ；还可以用数论。
3. 失误：
4. 代码如下：

#include<cstdio>
#include<cmath>

__int64 quickpow(__int64 base ,__int64 m,__int64 mod)
{
    __int64 ans=1;

    while(m>0)
    {
        if(m&1)
        {
            ans=(ans*base)%mod;
            --m;
        }

        base=(base*base)%mod;
        m/=2; 
    }

    return ans;
}

int main()
{
    __int64 t,n;
    scanf("%I64d",&t);

    while(t--)
    {
        scanf("%I64d",&n);

        printf("%I64d\n",quickpow(n,n,10));

    }
    return 0;
 }