‘’## Rightmost Digit##
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 60903 Accepted Submission(s): 22866
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 <iostream>
#include <cstdio>
#define m 10
using namespace std;
int f(int a,int b)
{
int ans=1;
a=a%m;
while(b)
{
if(b&1)
ans=ans*a%m;
b>>=1;
a=a*a%m;
}
return ans;
}
int main()
{
int t,n;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
printf("%d\n",f(n,n));
}
return 0;
}