第二次周赛黄金组G题

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
Analysis：首先0-9每个数的n次方（n大概为10左右）就可以看出规律，然后得到循环，接下来，输入随便什么数，记录个位数，然后那个输入的数对那个数的个位数的循环规律求余，比如
4的一次方 二次 三次 四次 五次
4 6 4 6 4
那么对4的循环规律就是2
如果是0就输出6，否则简化对那个个位数求求余结果的次方，然后得到的个位数就是输出结果
ac代码

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
	int T;
	cin >> T;
	for (int i = 1;i <= T;i++)
	{
		int a;
		cin >> a;
		int b=a%10;
		int c;
		if (b == 1)
			b = 1;
		else if (b == 2)
		{
			c = a % 4;
			if (c == 0)
				b = 6;
			else b = pow(2, c),b=b%10;
		}
		else if (b == 3)
		{
			c = a % 4;
			if (c == 0)
				b = 1;
			else b = pow(3, c), b = b % 10;
		}
		else if (b == 4)
		{
			b = 6;
		}
		else if (b == 5)
		{
			b = 5;
		}
		else if (b == 6)
		{
			b = 6;
		}
		else if (b == 7)
		{
			c = a % 4;
			if (c == 0)
				b = 1;
			else b = pow(7, c), b = b % 10;
		}
		else if (b == 8)
		{
			c = a % 4;
			if (c == 0)
				b = 6;
			else b = pow(8, c), b = b % 10;
		}
		else if (b == 9)
		{
			b = 9;
		}
		else if (b == 0)
			b = 0;
		cout << b << endl;
	}
}