杭電ACM 二 N^N的個位數

杭電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 
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運行結果：



知識點總結：
找循環節
學習心得：
好好學習 天天向上