快速幂-poj1995
来源:互联网 发布:单片机温度控制系统 编辑:程序博客网 时间:2024/06/05 06:50
Language:
Raising Modulo Numbers
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4103 Accepted: 2335
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比较水的题,不多说。下面是代码:#include<iostream>#include<set>#include<map>#include<vector>#include<queue>#include<cmath>#include<climits>#include<cstdio>#include<string>#include<cstring>#include<algorithm>typedef long long LL;using namespace std;LL mod_pow(LL x,LL n,LL M){ LL res=1; while(n>0) { if(n&1) res=res*x%M; x=x*x%M; n>>=1; } return res;}int main(){ //freopen("in.txt","r",stdin); int t; LL M,a,b,ans=0; int num; cin>>t; while(t--) { ans=0; cin>>M; cin>>num; for(int i=0;i<num;i++) { cin>>a>>b; ans+=mod_pow(a,b,M); } cout<<ans%M<<endl; } return 0;}
- 快速幂-poj1995
- poj1995- 整数快速幂
- POJ1995 快速幂模版
- poj1995简单快速幂
- 快速幂——poj1995
- 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 (整数快速幂)
- POJ1995 ZOJ2150 Raising Modulo Numbers【快速模幂】
- 动态规划入门——Super Jumping! Jumping! Jumping!
- 介绍MATLAB 的基本绘图功能:二维平面图形
- AWK 简明教程
- 初学者学Java(十八)
- 类成员函数的重载、覆盖和隐藏的区别
- 快速幂-poj1995
- 2014年Baidu的Interview Question(01)【转载】
- spring中commons-logging.jar的作用
- POJ 3067 —— 树状数组求逆序对
- java对象的创建过程
- jquery checkbox全选与全不选
- 设计模式之工厂模式
- POJ 1379 Run Away(模拟退火)
- 在Linux下使用vim配合xxd查看并编辑二进制文件