A hard puzzle
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 668 800
Sample Output
96
/*
做法:快速幂取模入门题
*/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>
using namespace std;
const int mod = 10;
long long mod_pow(long long x,long long n)
{
long long ans=1;
while(n)
{
if(n%2==1) ans=ans*x%mod;
x=x*x%mod;
n/=2;
}
return ans;
}
int main(void)
{
long long a,b;
while(scanf("%lld%lld",&a,&b)!=EOF)
printf("%lld\n",mod_pow(a,b)%mod);
return 0;
}