杭电 hdu 1097 找规律
来源:互联网 发布:mac桌面不显示文件 编辑:程序博客网 时间:2024/05/16 06:42
A hard puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39712 Accepted Submission(s): 14292
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 <iostream>using namespace std;int main(){int a,b,j;int c[10][4]={{0},{1},{6,2,4,8},{1,3,9,7},{6,4},{5},{6},{1,7,9,3},{6,8,4,2},{1,9}};while(cin>>a>>b){a %= 10;if(a == 0 || a == 1 || a == 5 || a == 6)cout<<c[a][0]<<endl;if(a == 4 || a == 9)cout<<c[a][b%2]<<endl;if(a == 2 || a == 3 || a == 7 || a == 8)cout<<c[a][b%4]<<endl;}return 0;}
0 0
- 杭电 hdu 1097 找规律
- 杭电 1021 找规律
- 杭电hdu1021 Fibonacci Again 找规律
- 杭电1005 数学找规律
- 杭电1005.找规律就好
- HDU 5500+HDU 1097 (找规律)
- hdu 1097 a^b 找规律
- HDU 1097 1098 数学题 找规律
- hdu 1597 找规律
- HDU-1597(找规律)
- hdu 4475 找规律
- hdu 1020 找规律
- hdu 1868 找规律
- hdu 1041 找规律
- hdu 4602 找规律
- hdu 4662 找规律
- HDU-4704 找规律
- hdu (找规律)
- 一个不需要CDO和IIS发送邮件的例子
- java基础--10.面向对象
- Yarn的架构图
- 在谈保护版权信息
- JavaScript基础练习题
- 杭电 hdu 1097 找规律
- Spring Data Redis 使用
- MySQL按照汉字的拼音排序
- 前端工作面试问题(上)
- Hadoop2.x之HDFS HA Federation
- 轮播图的实现
- PyGobject(四十四)布局容器之Stack&StackSwitcher
- 好天气
- 2016夏季练习——dp