hdu-Rightmost Digit（快速幂取模经典题）

 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.

代码分析：快速幂原理 同余定理 这道题求个位数，直接mod10就OK。

	//hdu-Rightmost Digit 
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll fmod(ll a,ll b,int mod){
	//a^b(大数)%c
	ll r=1;
	a=a%mod;//保证不会直接溢出，如果b很大 
	while(b>0){
		if(b%2==1)
			r=(r*a)%mod;
		b/=2;
		a=(a*a)%mod;	
	}
	return r;
}

int main(){
	int t;ll n;
	cin>>t;
	while(t--){
		cin>>n;
		cout<<fmod(n,n,10)<<"\n"; //求个位数直接模10 
	}
	return 0;
}