Rightmost Digit

Rightmost Digit

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

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.

问题链接：Rightmost Digit.

问题简述：

第一行，输入要计算的案例数t。
接下来t行分别输入一个n。
对于每一个案例，求n^n，并输出结果的个位数。
N(1<=N<=1,000,000,000)

问题分析：

由于只需要输出个位数，每次计算后只需把个位留下就好。

程序说明：

AC通过的C语言程序如下：

#include<iostream>
using namespace std;

int main ()
{
 	int n;
 	cin>>n;
 	int a[n],b[n];
 	int k;
 	for(int i = 0;i<n;i++)
 	{
 		cin>>a[i];
 		k = a[i]%4;
 		if(k == 0)k = 4;//计算发现个位是4个数一轮回
 		a[i]=a[i]%10;
 		b[i] = 1;
 		for(int j = 0;j<k;j++)
 		{
 			b[i] = b[i]*a[i];
 			b[i] = b[i]%10;
		 }
	 }
	 for(int i = 0;i<n;i++)
	 {
	 	cout <<b[i]<<endl;
	 }
	return 0;
}