杭电ACM 二 N^N的个位数

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.

/*
*Copyright (c)2014,烟台大学计算机与控制工程学院
*All rights reserved.
*文件名称：test.cpp
*作    者：冷基栋
*完成日期：2015年2月13日
*版 本 号：v1.0
*/
#include <iostream>
using namespace std;
int main()
{
    int n,a,b,c,d;
    cin>>n;
    while (n--)
    {
        cin>>a;
        b=a%10;
        c=a%4;
        if (c==0)
            c=4;
            d=1;
        for(int i=0;i<c;i++)
            d*=b;
        d%=10;
        cout<<d<<endl;
    }
    return 0;
}

运行结果：

知识点总结：

找循环节

学习心得：

好好学习 天天向上