Rightmost Digit

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>
long long quickPow(long long a,long long b,long long m);
int main()
{
    int t;
    long long n,ans;
    scanf("%d",&t);
    while(t--)
    {
        ans=0;
        scanf("%lld",&n);
        ans=quickPow(n,n,10);
        ans%=10;
        printf("%lld\n",ans);
    }
}

long long quickPow(long long a,long long b,long long m)
{
    long long ans=1;
    while(b!=0)
    {
        if(b&1)
        {
            ans=ans*a%m;
        }
        b=b>>1;
        a=a*a%10;
    }
    return ans;
}

快速幂的写法，以及ans*=a%m；和ans=ans*a%m；结果是不同的，在用简写时一定要注意情况是否可用！