A hard puzzle(1097)
来源:互联网 发布:微软办公软件免费版 编辑:程序博客网 时间:2024/04/29 12:28
A hard puzzle
TimeLimit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 14539 Accepted Submission(s):5135
Problem Description
lcy gives a hard puzzle to feng5166,lwg,JGShining andIgnatius: gave a and b,how to know the a^b.everybody objects tothis 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 thelast digit number.But everybody is too lazy to slove thisproblem,so they remit to you who is wise.
this puzzle describes that: gave a and b,how to know the a^b's thelast digit number.But everybody is too lazy to slove thisproblem,so they remit to you who is wise.
Input
There are mutiple test cases. Each test cases consists of twonumbers a andb(0<a,b<=2^30)
Output
For each test case, you should output the a^b's last digitnumber.
Sample Input
7 66 8800
Sample Output
96
AC代码
- #include<iostream>
- #include<cstdio>
- using namespacestd;
- intmain()
- {
- long long a,b;
- intans[5];
- while(cin>> a >>b)
- {
- ans[1] = a % 10;
- ans[2] = (ans[1] * a ) % 10;
- ans[3] = (ans[2] * a ) % 10;
- ans[4] = (ans[3] * a ) % 10;
- int tmp = b %4;
- if( tmp == 0 ) tmp =4;
- cout << ans[tmp]<< endl;
- }
- return0;
- }
0 0
- 1097 A hard puzzle
- 1097A hard puzzle
- 1097 A hard puzzle
- A hard puzzle(1097)
- 1097 A hard puzzle
- 1097 A hard puzzle
- 1097A hard puzzle
- 1097 A hard puzzle
- hdu 1097 A hard puzzle
- hdu-1097 A hard puzzle
- HDU 1097 A Hard Puzzle
- HDU 1097 A hard puzzle
- HDOJ 1097 A hard puzzle
- HDU-1097A hard puzzle
- hdu 1097 A hard puzzle
- HDOJ 1097 A hard puzzle
- HDU 1097 A hard puzzle
- 【HDOJ】1097 -> A hard puzzle
- Daydream(2668)
- ubuntu 下安装vim
- 偶数求和(2015)
- 数据的交换输出(2016)
- 字符串统计(2017)
- A hard puzzle(1097)
- Self Numbers(1128)
- Factorial(1124)
- 变形课(1181)
- 无题(1871)
- sort(1425)
- 11月6日总结
- 数列有序!(2019)
- 绝对值排序(2020)