POJ1995Raising Modulo Numbers
来源:互联网 发布:拍一部网络剧要多少钱 编辑:程序博客网 时间:2024/05/22 07:42
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
题意就是题目中最后给的公式,此题用到同余定理,快速幂。
同于定理:(a*b)%c=(a%c*b%c)%c;
(a+b)%c=(a%c+b%c)%c;
代码如下;#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#define LL long long using namespace std;LL mod_pow(LL x,LL n,LL mod){if(n==0) return 1;LL res=mod_pow(x*x%mod,n/2,mod);if(n%2==1) res=res*x%mod;return res;} int main() { int n,t; scanf("%d",&n); LL m; while(n--) { LL x,y,m; LL sum=0; scanf("%lld",&m); scanf("%d",&t); while(t--) { scanf("%lld%lld",&x,&y); sum=(sum+mod_pow(x,y,m))%m; } printf("%lld\n",sum); } return 0; }
0 0
- POJ1995Raising Modulo Numbers
- poj1995Raising Modulo Numbers
- Poj1995Raising Modulo Numbers(快速幂)
- poj1995Raising Modulo Numbers(快速幂+同余定理)
- POJ1995 Raising Modulo Numbers
- Raising Modulo Numbers
- poj1995_Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers(数论)
- poj1995 Raising Modulo Numbers
- E - Raising Modulo Numbers
- 二分法-Raising Modulo Numbers
- POJ1995-Raising Modulo Numbers
- 【poj1995】Raising Modulo Numbers
- Raising Modulo Numbers
- HDOJ-1061 Rightmost Digit
- 信息安全方面优秀论文
- windows 画图工具 —— mspaint 的使用
- sql之top用法
- 各进制转换
- POJ1995Raising Modulo Numbers
- 织梦DEDECMS栏目列表页翻页URL链接优化
- Hibernate的二级缓存的用法
- 类似网易评论UI
- PAT乙级1004. 成绩排名 C++
- Initramfs的制作和移植
- mysql 删除表中某一列的数据及删除某一列的方法
- Mysql批量操作整理
- 骨牌铺方格 hd 2046