Acm Step Chapter One Section Two—Rightmost Digit

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.

#include <iostream>
using namespace std;
int main()
{
	int arr[10][4]={
		{0,0,0,0},
		{1,1,1,1},
		{2,4,8,6},
		{3,9,7,1},
		{4,6,4,6},
		{5,5,5,5},
		{6,6,6,6},
		{7,9,3,1},
		{8,4,2,6},
		{9,1,9,1}
	};
	int t,n;
	cin>>t;
	while (t--)
	{
		cin>>n;
		int fir=n%10;
		cout<<arr[fir][(n-1)%4]<<endl;
	}
}

本题实际上就是一道找规律的题目，找到规律后，简单打表即可。不过，这么神奇的规律也确实让我大吃一惊呢！

这或者只是一个幼稚的起步，但希望路过的大牛可以指点一二，从各方面都可以，包括编程风格等。