Rightmost Digit hdu

Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 74332 Accepted Submission(s): 27415

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.

Author
Ignatius.L

Recommend
We have carefully selected several similar problems for you: 1021 1019 1071 1108 1170

取个位数

#include<bits/stdc++.h>
using namespace std;
int  qpow(int n,int k)
{
	int ans=1,rec=n%10;
	while(k)
	{
		if(k&1) ans=ans*rec;
		ans%=10;
		k>>=1;
		rec=rec*rec%10;
	}
	return ans;
}
int main(){
	int tt;
	scanf("%d",&tt);
	for(int i=0;i<tt;i++)
	{
		int k;
		scanf("%d",&k);
		int q=qpow(k,k);
		printf("%d\n",q);
	}
}