【hdu 1061 Rightmost Digit】

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18122    Accepted Submission(s): 6946

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.

 

Author

Ignatius.L

 

 

 

// Project name : 1061 ( Rightmost Digit ) 
// File name    : main.cpp
// Author       : Izumu
// Date & Time  : Mon Jul  9 09:32:56 2012


#include <iostream>
using namespace std;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int num;
        cin >> num;
        int a = num % 10;
        num = num % 4;
        int sum = a;
        if (num == 0)
        {
            num = 4;
        }
        for (int i = 0; i < num - 1; i++)
        {
            sum *= a;
        }
        cout << sum % 10 << endl;
    }
    return 0;
}

// end 
// ism