HDOJ--1061--Rightmost Digit

题目描述：
Given a positive integer N, you should output the most right digit of N^N.
输入描述:
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).
输出描述:
For each test case, you should output the rightmost digit of N^N.
输入：
2
3
4
输出：
7
6
题意：
N个N相乘的最后一位数字是多少？
题解：
找数字最后一位数的规律
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;

int main(){
    int t,n,m,x;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        m = n;
        while(1){
            n %= 10;
            if(n < 10)
                break;
        }
        if(n == 0){
            printf("0\n");
        }
        else if(n == 1){
            printf("1\n");
        }
        else if(n == 2){
            x = m / 10;
            if(x % 2 == 0)
                printf("4\n");
            else printf("6\n");
        }
        else if(n == 3){
            x = m / 10;
            if(x % 2 == 0)
                printf("7\n");
            else printf("3\n");
        }
        else if(n == 4){
            printf("6\n");
        }
        else if(n == 5){
            printf("5\n");
        }
        else if(n == 6){
            printf("6\n");
        }
        else if(n == 7){
            x = m / 10;
            if(x % 2 == 0)
                printf("3\n");
            else printf("7\n");
        }
        else if(n == 8){
            x = m / 10;
            if(x % 2 == 0)
                printf("6\n");
            else printf("4\n");
        }
        else if(n == 9){
            printf("9\n");
        }

    }
    return 0;
}