POJ 1995 Raising Modulo Numbers (快速幂模板)
来源:互联网 发布:淘宝聚划算报名要求 编辑:程序博客网 时间:2024/05/16 12:50
Raising Modulo Numbers
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4938 Accepted: 2864
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
Source
CTU Open 1999
题目链接:http://poj.org/problem?id=1995
题目大意:输入M和H组Ai,Bi,按公式求解
题目分析:快速幂模板
题目链接:http://poj.org/problem?id=1995
题目大意:输入M和H组Ai,Bi,按公式求解
题目分析:快速幂模板
#include <cstdio>#define ll long longint modexp(ll a, ll b, ll m){ ll ret = 1, tmp = a; while(b) { if(b & 1) ret = ret * tmp % m; tmp = tmp * tmp % m; b >>= 1; } return ret;}int main(){ int T, m, h; ll a, b; scanf("%d", &T); while(T--) { ll ans = 0; scanf("%d %d", &m, &h); while(h--) { scanf("%I64d %I64d", &a, &b); ans = (ans + modexp(a, b, m)) % m; } printf("%I64d\n",ans); }}
0 0
- POJ 1995 Raising Modulo Numbers (快速幂模板)
- poj 1995 Raising Modulo Numbers(快速幂模板)
- POJ 1995 Raising Modulo Numbers【快速幂】
- poj 1995 Raising Modulo Numbers 【快速幂】
- POJ 1995:Raising Modulo Numbers 快速幂
- poj 1995 Raising Modulo Numbers【快速幂】
- POJ - 1995 Raising Modulo Numbers 【快速幂】
- |poj 1995|快速幂|Raising Modulo Numbers
- POJ.1995 Raising Modulo Numbers (快速幂)
- POJ 1995 Raising Modulo Numbers 快速幂
- Raising Modulo Numbers 【poj-1995】【快速幂】
- 【POJ 1995】Raising Modulo Numbers(快速幂)
- POJ 1995 Raising Modulo Numbers 快速幂取模
- poj 1995 Raising Modulo Numbers 快速幂取模
- Raising Modulo Numbers (poj 1995 快速幂水题)
- POJ 1995 Raising Modulo Numbers(快速幂取模)
- poj Raising Modulo Numbers 【快速幂 + 模取余】
- poj 1995 Raising Modulo Numbers(快速幂)
- DES 加密解密
- 【转自loveifa】PHP 获取邮箱未读邮件的方法 根据receivemail改编而来,已解决乱码,编码问题
- 1592 - Database
- c++检测windows服务程序状态
- Android ImageView实现圆角,圆形图片
- POJ 1995 Raising Modulo Numbers (快速幂模板)
- ssh上传下载 自己整理的。
- 我对Laravel ThinkPHP Yii symfony2 CI cakephp 的看法
- 学习笔记----伸展树
- 冬令营第十三天
- PHP Extension的开发基础
- AfxSocketInit
- PHP 循环检测并生成目录 chkDir($dirname,$split='/')
- 关于PHP你可能不知道的-PHP的事件驱动化设计