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.
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1021 1008 1071 1108 1170
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long pow(long long a)//快速幂思想
{
long long result=1,flag=a,n=a;
while(n!=0)
{
if(n&1)
result=result*flag%10;//为了得到最后一位
flag=flag*flag%10;
n=n>>1;
}
return result;
}
int main()
{
long long n,m;
cin>>n;
while(n--)
{
cin>>m;
cout<<pow(m)<<endl;
}
}