POJ_1995_RaisingModuloNumbers
2015-07-23 09:18
543 查看
没什么特别的,简单的快速幂,照着output中公式写即可
#include <iostream> #include<stdio.h> using namespace std; int qp(int nn,int n,int m) //nn的n次幂模m { int r=1; while(n>0) { if(n&1) r=(r*nn)%m; n>>=1; nn=(nn*nn)%m; } return r; } int main() { int t; int n,nn,m; int nt; int tot; scanf("%d",&t); while(t--) { tot=0; scanf("%d%d",&m,&nt); for(int i=0;i<nt;i++) { scanf("%d%d",&nn,&n); nn%=m; tot=(tot+qp(nn,n,m))%m; } printf("%d\n",tot); } return 0; }
相关文章推荐
- poj1995_Raising Modulo Numbers
- UVA-11029 Leading and Trailing
- 《Batch Normalization Accelerating Deep Network Training by Reducing Internal Covariate Shift》阅读笔记与实现
- Win 10人工智能战略转型必胜!
- 017.retain 属性特性
- TurboMail邮件系统助力振华物流近十年
- 2015 Multi-University Training Contest 1 题解 BY ME
- [LeetCode]Climbing Stairs
- com.opensymphony.xwork2.inject.DependencyException: com.opensymphony.xwork2.inject.ContainerImpl$Mis
- NSSearchPathForDirectoriesInDomains方法使用
- Publishing failed with multiple errors.问题解决
- HDU杭电 1039 Easier Done Than Said?(字符串问题)
- U盘启动显示Starting cmain()...
- 杭电1082Matrix Chain Multiplication
- http://blog.csdn.net/forever_forest/article/details/7756156
- 1.3.2 Barn Repair【贪心】
- 2015 Multi-University Training Contest HDU5297
- 217 Contains Duplicate
- 219 Contains Duplicate II
- Swing之paint与paintComponent的区别