Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60847 Accepted Submission(s): 22845
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).
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 6HintIn 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.
解答:
#include<iostream>
using namespace std;
long long handle(long long n)
{
long long total=1;
long long base=n;
while(n)
{
if(n&1)
{
total=(total*base)%10;
}
base=(base*base)%10;
n>>=1;
}
return total;
}
int main()
{
int times;
cin>>times;
long long n;
while(times--){
cin>>n;
cout<<handle(n)<<endl;
}
}