hdu 1097 A hard puzzle (快速幂)
来源:互联网 发布:晋中市网络平台登录 编辑:程序博客网 时间:2024/05/20 14:23
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1097
A hard puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 43225 Accepted Submission(s): 15662
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
Recommend
JGShining
题意:求a^b的最后一位
解析:由于a, b比较大,需要用到快速幂
代码:
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<vector>#include<queue>#include<map>#include<cmath>#define N 10009using namespace std;const int INF = 0x3f3f3f3f;int q_mod(long long a, long long b){ long long ans = 1ll; while(b) { if(b&1) ans = ans * a % 10; a = (a % 10) * (a % 10) % 10; b >>= 1; } return ans % 10;}int main(){ int a, b; while(~scanf("%d%d", &a, &b)) { cout << q_mod(a, b) << endl; } return 0;}
0 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--1097A hard puzzle(快速幂)
- HDU 1097 A hard puzzle【快速幂取模】
- hdu 1097 A hard puzzle (快速幂取模)
- HDU-1097-A hard puzzle( 快速幂取模 )
- hdu 1097 A hard puzzle 快速幂 找规律 H
- hdu 1097 A hard puzzle(快速幂取模)
- HDU - 1097 - A hard puzzle (快速幂取模)
- HDU 1097 A hard puzzle(快速幂取模)
- HDU 1097 A hard puzzle(快速幂取模)
- 【网易游戏——数据分析/数据挖掘/BI】暑期实习生笔试(中大专场)——2017/04/13
- 展开功能的实现
- 自己写 bootloader
- Linux(九) 之 shell编程
- JavaScript动态规划实现最长公共子序列
- hdu 1097 A hard puzzle (快速幂)
- 别人家的技术leader是如何建设团队、管理人员、沟通工作的?
- java 集合精华一页纸
- 图解字符串的朴素模式匹配算法
- JSOUP 解析XML文件
- MFC单文档之利用全局变量一次设置多个对话框的串口通讯
- Visual Studio Code Extension 推荐
- 字符串和字符串的常见存储结构
- springmvc 拦截器