A hard puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 48066 Accepted Submission(s): 17644
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<stdio.h>
long long pow_mod(long long a, long long i,long long n )
{
if(i==0)
return 1%n;
int temp=pow_mod(a,i>>1,n);
temp=temp*temp%n; //为了防止溢出,通常写成 temp/n*temp
if(i&1)
temp=(long long)temp*a%n;
return temp;
}
int main()
{
long long num,n;
while(scanf("%lld%lld",&num,&n)!=EOF)
printf("%lld\n",pow_mod(num,n,10));
return 0;
}