hduj 1097 A hard puzzle
来源:互联网 发布:62数据脚本官方下载 编辑:程序博客网 时间:2024/06/15 18:54
A hard puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28814 Accepted Submission(s): 10315
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>#include<cstring>using namespace std;int q_mod(int a,int b,int c){int s=1;while(b){if(b&1) s=(s%10)*(a%c)%c;b=b>>1;a=(a%c)*(a%c)%c;}return s;}int main(){int n,m;while(cin>>n>>m){cout<<q_mod(n,m,10)<<endl;}return 0;}
0 0
- hduj 1097 A hard puzzle
- 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
- 梵蒂冈合肥和规范化规范和规范化规范化个复合肥
- How To Install A Downloaded Magento Theme
- ubuntu下PATH路径的设置——工作笔记
- uva10026 - Shoemaker's Problem(贪心)
- dfgfhfgfghgfh
- hduj 1097 A hard puzzle
- 2m527 g8p2107
- Hibernate 数据库连接配置整理
- 7r871 w5w5653
- 1k643 w6r0120
- CentOS下ftp安装步骤
- H.265硬件编码产品统计
- TOj 3711. Cow Pals 简单
- 入门级Oracle查询语句