HDU 1061 rightmost Digit

Modulo exponentiation, and for bits, always ask for 10 modulo # include <stdio.h># include <algorithm># include <math.h>using namespace std;__ Int64 Pow (__int64 m,__int64 N) {    __int64 p=1;    while (n)    {        if (n%2)            p=p*m%10;        n/=2;        m=m*m%10;    }    return p%10;} int main () {    int t;    __int64 n,m;    while (~SCANF ("%d", &t))    {while        (t--)        {            scanf ("%i64d", &n);            M=n;            m%=10;//to find the N-times modulo            if (m==0)                printf ("0\n");            else                printf ("%i64d\n", Pow (M,n));        }    }    return 0;}