HDU 1097 A hard puzzle(快速幂取模)
来源:互联网 发布:淘宝修改评价链接 编辑:程序博客网 时间:2024/06/07 02:45
A hard puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38370 Accepted Submission(s): 13705
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
Author
eddy
题解:输入a,b,求a^b的最后一位。
快速幂取模。
AC代码:
#include<iostream>#include<cstdio>typedef long long LL;int qmod(LL a,LL b,int c){int ans=1;a=a%c;while(b>0){if(b&1)ans=(ans*a)%c;b=b>>1;a=(a*a)%c;}return ans;}int main(){LL a,b;while(~scanf("%lld%lld",&a,&b)){printf("%d\n",qmod(a,b,10));}return 0;}
1 0
- HDU 1097 A hard puzzle【快速幂取模】
- hdu 1097 A hard puzzle (快速幂取模)
- HDU-1097-A hard puzzle( 快速幂取模 )
- hdu 1097 A hard puzzle(快速幂取模)
- HDU - 1097 - A hard puzzle (快速幂取模)
- HDU 1097 A hard puzzle(快速幂取模)
- HDU 1097 A hard puzzle(快速幂取模)
- HDU 1097 A hard puzzle && 快速幂
- HDU 1097 A hard puzzle(快速幂)
- HDU 1097 A hard puzzle【快速幂取模运算】
- hdu 1097 A hard puzzle(快速幂入门)
- HDU 1097 A hard puzzle(简单快速幂)
- HDU 1097 A hard puzzle(快速幂)
- HDU 1097 A hard puzzle(找规律,快速幂)
- HDU 1097 A hard puzzle (规律&&快速幂)
- HDU-1097-A hard puzzle(快速幂)
- hdu 1097 A hard puzzle (快速幂)
- HDU--1097A hard puzzle(快速幂)
- 【DP_背包专辑】
- 大数据面试题
- 快速实现ARM和DSP的通信和协同工作(一)
- 利用RHSocketKit构建自定义协议通信
- perl学习记录
- HDU 1097 A hard puzzle(快速幂取模)
- HDU4260
- SSH框架整合
- linux窗口管理器学习
- 设计模式----适配器模式
- swift 属性的几个写法
- TableView 小技巧 (一)
- 0038关于父类与子类中的一道题(牛客)
- JAVA递归全排列