A hard puzzle
Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 23766????Accepted Submission(s): 8390
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<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
?
?
Recommend
JGShining
?
#include<stdio.h>
int
pow(
int
a,
int
b)
{
if
(b==
0
)
return
1
;
if
(b==
1
)
return
a;
int
x=pow(a,b/
2
);
if
(b%
2
==
0
)
return
(x*x)%
10
;
else
return
(x*x*a)%
10
;
}
int
main()
{
int
a,b;
while
(scanf(
"
%d%d
"
,&a,&b)!=
EOF)
{
a
%=
10
;
printf(
"
%d\n
"
,pow(a,b));
}
return
0
;
}
?
更多文章、技術(shù)交流、商務(wù)合作、聯(lián)系博主
微信掃碼或搜索：z360901061
微信掃一掃加我為好友
QQ號聯(lián)系： 360901061
您的支持是博主寫作最大的動力，如果您喜歡我的文章，感覺我的文章對您有幫助，請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧，狠狠點擊下面給點支持吧，站長非常感激您！手機微信長按不能支付解決辦法：請將微信支付二維碼保存到相冊，切換到微信，然后點擊微信右上角掃一掃功能，選擇支付二維碼完成支付。
【本文對您有幫助就好】元
