快速幂——poj1995
来源:互联网 发布:ubuntu防火墙 编辑:程序博客网 时间:2024/06/05 08:39
Raising Modulo Numbers
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit
Description
People are different. Some secretly read magazines full of interesting girls' pictures, others create an A-bomb in their cellar, others like using Windows, and some like difficult mathematical games. Latest marketing research shows, that this market segment was so far underestimated and that there is lack of such games. This kind of game was thus included into the KOKODáKH. The rules follow:
Each player chooses two numbers Ai and Bi and writes them on a slip of paper. Others cannot see the numbers. In a given moment all players show their numbers to the others. The goal is to determine the sum of all expressions AiBi from all players including oneself and determine the remainder after division by a given number M. The winner is the one who first determines the correct result. According to the players' experience it is possible to increase the difficulty by choosing higher numbers.
You should write a program that calculates the result and is able to find out who won the game.
Each player chooses two numbers Ai and Bi and writes them on a slip of paper. Others cannot see the numbers. In a given moment all players show their numbers to the others. The goal is to determine the sum of all expressions AiBi from all players including oneself and determine the remainder after division by a given number M. The winner is the one who first determines the correct result. According to the players' experience it is possible to increase the difficulty by choosing higher numbers.
You should write a program that calculates the result and is able to find out who won the game.
Input
The input consists of Z assignments. The number of them is given by the single positive integer Z appearing on the first line of input. Then the assignements follow. Each assignement begins with line containing an integer M (1 <= M <= 45000). The sum will be divided by this number. Next line contains number of players H (1 <= H <= 45000). Next exactly H lines follow. On each line, there are exactly two numbers Ai and Bi separated by space. Both numbers cannot be equal zero at the same time.
Output
For each assingnement there is the only one line of output. On this line, there is a number, the result of expression
(A1B1+A2B2+ ... +AHBH)mod M.
Sample Input
31642 33 44 55 63612312374859 30293821713 18132
Sample Output
21319513
因为如果先把全部加起来再取余的话会爆,long long也爆,所以在快速幂里每一步都求一下余
#include <iostream>#include <cstring>#include <algorithm>#define LL long longusing namespace std;LL m;LL pow_Fast(LL x,LL y){ return y?(y&1?x*pow_Fast(x,y-1)%m:pow_Fast(x*x%m,y>>1)):1;}int main(){ int t,h; cin>>t; while(t--) { cin>>m; cin>>h; LL a,b; LL ans=0; while(h--) { cin>>a>>b; ans=(ans+pow_Fast(a,b)); ans%=m; } cout<<ans<<endl; } return 0;}
0 0
- 快速幂——poj1995
- 快速幂-poj1995
- poj1995- 整数快速幂
- POJ1995 快速幂模版
- poj1995简单快速幂
- poj1995——Raising Modulo Numbers(快速幂取余)
- POJ1995 Raising Modulo Numbers 快速幂
- POJ1995 Raising Modulo Numbers【整数快速幂】
- poj1995-Raising Modulo (快速幂)
- poj1995 Raising Modulo Numbers【快速幂】
- poj1995 简单数论 快速幂 取模
- poj1995(裸快速幂模板题)
- poj1995~快速幂水题
- POJ1995 快速幂取模
- POJ1995快速幂取模
- poj1995(a^b=mod m 快速幂)
- 快速幂(整数+矩阵):hdu 2817+poj3233+poj1995+poj3070
- poj1995 Raising Modulo Numbers (整数快速幂)
- IntelliJ IDEA 12创建Maven管理的Java Web项目(图解)
- 【原创】k8s源码分析-----kubelet(5)diskSpaceManager
- SayHello界面的编辑
- 【e2label】查看或定义卷标
- @Transactional spring 配置事务 注意事项
- 快速幂——poj1995
- 数学老师必备工具,你的最爱!
- DDMenu中添加手势是否有用的方法,为了在视图中添加手势起作用
- 使用jar命令搜索jar中的class文件(shell)
- android 去掉反斜杠
- 将对象存储到SharedPreferences里
- 搭建个人网站
- 大端法、小端法、网络字节序 转
- 课件动画做的牛不牛,看你有它没它!