POJ 1995 Raising Modulo Numbers(快速幂)
来源:互联网 发布:智尚网络 培训 编辑:程序博客网 时间:2024/05/21 01:57
Raising Modulo Numbers
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,一个数m,求(a1 ^ b1 + a2 ^ b2 + …… + an ^ bn) % m的值。
解题思路:利用快速幂以及模运算的性质(a + b) % m = (a % m + b % m) % m
代码如下:
#include <cstdio>typedef long long ll;const int maxn = 45005;typedef struct{int a;int b;}num;num h[maxn];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 & 1)res = res * x % mod;return res;}int main(){int z,m,n;ll ans;scanf("%d",&z);while(z--){scanf("%d",&m);scanf("%d",&n);ans = 0;for(int i = 0;i < n;i++){scanf("%d %d",&h[i].a,&h[i].b);}for(int i = 0;i < n;i++){ans += mod_pow(h[i].a,h[i].b,m) % m;}printf("%lld\n",ans % m);}return 0;}
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 快速幂
- Raising Modulo Numbers 【poj-1995】【快速幂】
- 【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 【(64位)快速幂】
- Raising Modulo Numbers(poj 1995 快速幂)
- POJ 1995 Raising Modulo Numbers(快速幂)
- [iOS]Size Class不同尺寸适配的是什么样的机型(实验向)
- hdu 1175 连连看dfs(记录转弯次数)
- php页面分页类通用
- EL表达式及${对象}
- QT学习之QScript
- POJ 1995 Raising Modulo Numbers(快速幂)
- 编译PC版vlc
- 用Messenger实现Activity与Service的信息交互
- MySQL详解--锁
- 西蒙iphone-OpenGL ES 教程-07 : 对物体进行独立的转换
- opencv contours 遇到边界
- 在Windows环境下学习Linux命令行的几种方法
- StringUtil
- JavaScript应该被放在什么位置