HDU 1097 A hard puzzle（快速幂取模）

HDU 1097 A hard puzzle（快速幂取模）

A hard puzzle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 38370    Accepted Submission(s): 13705

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.

Input

There are mutiple test cases. Each test cases consists of two numbers a and b(0

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

题解：输入a，b，求a^b的最后一位。

快速幂取模。

AC代码：

#include#includetypedef long long LL;int qmod(LL a,LL b,int c){ int ans=1; a=a%c; while(b>0){ if(b&1) ans=(ans*a)%c; b=b>>1; a=(a*a)%c; } return ans;}int main(){ LL a,b; while(~scanf("%lld%lld",&a,&b)){ printf("%d\n",qmod(a,b,10)); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。