Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51729 Accepted Submission(s): 19570
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<cstdio> typedef long long LL; LL quick_pow(LL a,LL n) { LL ans=1; while(n) { if(n&1) { ans=ans*a%10; } a=a*a%10; n>>=1; } return ans; } int main() { LL t; scanf("%lld",&t); while(t--) { LL n; scanf("%lld",&n); LL ans=quick_pow(n,n); printf("%lld\n",ans); } return 0; }