杭电oj1061:Rightmost Digit（快速幂）

Rightmost Digit

题目链接

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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>
using namespace std;

typedef long long LL;

//递归写法 
LL binary_Pow(LL a, LL b, LL m)
{
	if(b == 0) return 1;
	if(b & 1)//如果b为奇数
		return a *  binary_Pow(a, b-1, m) % m;
	else{
		LL mul = binary_Pow(a, b / 2, m);
		return mul * mul % m;
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int T;
	cin>>T;
	LL a, b, m=10;
	while(T--)
	{
		cin>>a;
		b = a;
		a %= m;
		cout<<binary_Pow(a, b, m)<<endl;
	}
	return 0;	
}