Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43604 Accepted Submission(s): 16394
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.
Author
Ignatius.L
思路:简单的题目,快速幂模板题目。
AC代码如下:
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define LL long long
#define MOD 10
void powerMod(LL n){
LL cnt=n,ans=1;
n%=MOD;
while(cnt){
if(cnt%2)
ans=(ans*n)%MOD;
cnt/=2;
n=(n*n)%MOD;
}
printf("%I64d\n",ans%10);
}
int main(){
int t;
scanf("%d",&t);
while(t--){
LL n;
scanf("%I64d",&n);
powerMod(n);
}
return 0;
}