Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31180 Accepted Submission(s): 11879
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>
#include<stdio.h>
#include <string>
using namespace std;
long long quick_mod(long long a,long b,int m)
{
long long ans=1;
while (b)
{
if(b&1)
{
ans=ans*a%m;
b--;
}
b/=2;
a=a*a%m;
}
return ans;
}
int main()
{
int N;
long long x;
long long ans;
cin>>N;
while (N--)
{
cin>>x;
ans=1;
ans=quick_mod(x, x, 10);
cout<<ans<<endl;
}
return 0;
}