A hard puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45464 Accepted Submission(s): 16675
Problem Description
lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.
this puzzle describes that: gave a and b,how to know the a^b's the last digit number.But everybody is too lazy to slove this problem,so they remit to you who is wise.
this puzzle describes that: gave a and b,how to know the a^b's the last digit number.But everybody is too lazy to slove this problem,so they remit to you who is wise.
Input
There are mutiple test cases. Each test cases consists of two numbers a and b(0<a,b<=2^30)
Output
For each test case, you should output the a^b's last digit number.
Sample Input
7 66 8 800
Sample Output
9 6
Author
eddy
一个普通的快速幂取模算法~
#include<iostream>
using namespace std;
typedef long long ll;
ll q_mod(ll a,ll b){
ll ans=1;
ll base=a%10;
while(b){
if(b&1) ans=ans*base%10;
base=base*base%10;
b>>=1;
}
return ans;
}
int main(){
ll a,b;
while(cin>>a>>b){
cout<<q_mod(a,b)<<endl;
}
}