Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 57524 Accepted Submission(s): 21774
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.
代码如下：
#include<cstdio>
typedef long long ll;
int main()
{
int t;
scanf("%d",&t);
while(t--){
ll n,m;
scanf("%lld",&n);
m=n;
ll res=1;
while(n>0){
if(n&1) res=res*m;
m=m*m;
n>>=1;
}
printf("%lld\n",res);
}
return 0;
}
