3456. Huge Numbers (Large) ECNU
来源:互联网 发布:怎么创建数据库实例 编辑:程序博客网 时间:2024/06/05 21:48
给出n,m,mod; 求解n^(m!)%mod的结果
#include<cstdio>using namespace std;typedef long long LL;LL n,m,mod;/**因在进行快速幂的时候它的平方会超过int的范围;*/LL P(LL n,LL m){ LL ans=1; while(m) { if(m&1) ans=ans*n%mod; n=n*n%mod; m>>=1; } return ans;}int main (){ int t; scanf("%d",&t); for(int cas=1;cas<=t;cas++) { scanf("%lld %lld %lld",&n,&m,&mod); for(int i=1;i<=m;i++) n=P(n,i)%mod; n%=mod; printf("Case #%d: %lld\n",cas,n); } return 0;}
阅读全文
0 0
- 3456. Huge Numbers (Large) ECNU
- ecnu
- Factoring Large Numbers
- Factoring Large Numbers
- 10392 - Factoring Large Numbers
- 10392 - Factoring Large Numbers
- 10392 - Factoring Large Numbers
- Factoring Large Numbers
- UVa10392 Factoring Large Numbers
- Factoring Large Numbers
- Factoring Large Numbers UVA10392
- 10392 - Factoring Large Numbers
- UVA10392 Factoring Large Numbers
- Factoring Large Numbers
- UVA10392 Factoring Large Numbers
- Windows下打开big (giant, huge, large) text files
- UVa 10392 Factoring Large Numbers
- uva 10392 Factoring Large Numbers
- Shell实战之一键搭建ActiveMq集群-yellowcong
- 728. Self Dividing Numbers
- 文章标题
- cocos js 截屏 (原生 + H5)
- centos7修改网关和配置ip
- 3456. Huge Numbers (Large) ECNU
- poj3481 Double Queue
- FlowLayoutDemo
- Spinner android:entries属性/ xml 中 @array 写法
- POJ 3984 迷宫问题(BFS+路径记录)
- uva 1584
- java(循环,分支)语句总结
- JavaEE之反射
- mysql 查看及修改表结构