nyoj473 A^B Problem （快速幂）

nyoj473 A^B Problem （快速幂）

题目473​​题目信息​​​​运行结果​​​​本题排行​​​​讨论区​​

A^B Problem

1000 ms  |  内存限制： 65535

2

Give you two numbers a and b,how to know the a^b's the last digit number.It looks so easy,but everybody is too lazy to slove this problem,so they remit to you who is wise.

There are mutiple test cases. Each test cases consists of two numbers a and b(0<=a,b<2^30) 输出 For each test case, you should output the a^b's last digit number. 样例输入

7 66 8 800

样例输出

9 6

提示 There is no such case in which a = 0 && b = 0。

#include int main(){ int a,b,_a,s; while(scanf("%d %d",&a,&b)!=EOF) { if(a==0&&b==0) break; s=1; while(b) { if(s>=10) s=s%10; if(a>=10) a=a%10; if(b%2==1) s=s*a; a=a*a; b=b/2; } if(s>=10) s=s%10; printf("%d\n",s); } return 0;}

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