Rightmost Digit 数论

Rightmost Digit

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 23   Accepted Submission(s) : 8

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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.

最低位连成  发现有规律  0 1 5 6 还是0 1 5 6

4 9 为两个循环

2 3 7 8四个

可以打表

#include<iostream>
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		long long n;
		int m,i,j,k,sum;
		cin>>n;
		m=n%10;
		if(m==1||m==5||m==6||m==0)
			cout<<m<<endl;
		else
		{
		int a[10][10];
		for(i=2;i<10;++i)
		{
			k=1;
			for(j=1;j<10;++j)
			{
				k=k*i;
				sum=k%10;
				a[i][j]=sum;
			}
		}
		if(m==4||m==9)
			cout<<a[m][n%2+2]<<endl;
		else
			cout<<a[m][(n%4)+4]<<endl;
		}
	}
}