【HDU 杭电 1061】 Rightmost Digit

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.

#include<stdio.h>#include<algorithm>using namespace std;int node(__int64 m){    int t=1,b;    b=m%10;    if(b==0)    return 0;    while(m)    {        if(m%2==1)        {        t*=b;        t%=10;            }        b*=b;        b%=10;        m/=2;    }    return t;}int main(){    int t;    __int64 n;    scanf("%d",&t);    while(t--)    {        scanf("%I64d",&n);        printf("%d\n",node(n));    }    return 0;}