当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1097:A hard puzzle

题目描述
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.
输入解释
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
来自杭电HDUOJ的附加信息
Author eddy
Recommend JGShining

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1097

最后修改于 2020-10-25T22:42:08+00:00 由爬虫自动更新

共提交 2

通过率 50.0%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)