HDU-P1061: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.
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.
思路
这个题目和C语言基础100题里的人见人爱A^B的意思几乎完全一样,但是解法照搬的话会超时,我也没有想到这个题的解法,所以在网上找了找思路,发现这个题目是一个找规律的题目:
先列出几个简单数据的看一看
数字 | 答案 |
---|---|
1 | 1 |
2 | 4 |
3 | 9 |
4 | 6 |
5 | 5 |
6 | 6 |
7 | 3 |
8 | 6 |
9 | 9 |
可以发现(当然不是我发现的)答案是当前数字的n次方模10得到的,其中n从1开始,每四个一循环。
代码
问题想明白之后答案就简单多了。
#include<iostream>
using namespace std;
int main()
{
long long t;
cin>>t;
long long sum=1;
while(t--)
{
long long n,m;
sum=1;
cin>>n;
m=(n-1)%4;
n=n%10;
for(int i=0;i<=m;i++)
{
sum=sum*n;
}
sum=sum%10;
cout<<sum<<endl;
}
}