POJ 1995 Raising Modulo Numbers
2016-07-23 16:51
429 查看
Raising Modulo Numbers
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %llu
Submit
Status
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 Ai Bi 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
3
16
4
2 3
3 4
4 5
5 6
36123
1
2374859 3029382
17
1
3 18132
Sample Output
2
13195
13
题解:快速幂的模板题
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %llu
Submit
Status
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 Ai Bi 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
3
16
4
2 3
3 4
4 5
5 6
36123
1
2374859 3029382
17
1
3 18132
Sample Output
2
13195
13
题解:快速幂的模板题
#include <stdio.h> int quickpow(int n, int m, int k) { int res = 1; while(m > 0) { if(m & 1) { res = ((res % k) * (n % k)) % k; } n = ((n % k) * (n % k)) % k; m >>= 1; } return res; } int main() { int z, k, h; scanf("%d", &z); while(z--) { scanf("%d%d", &k, &h); int ans = 0, n, m; for(int i=0; i<h; i++) { scanf("%d%d", &n, &m); ans += quickpow(n, m, k); } ans %= k; printf("%d\n", ans); } return 0; }
相关文章推荐
- HDU Problem - 1789 Doing Homework again【贪心】
- poj 1995 Raising Modulo Numbers
- Doing Homework again(贪心)
- IDR_MAINFRAME中各个字段的含义
- HDU1789 Doing Homework again(贪心+sort)
- Trailing Zeroes (III)<二分>
- HDU 2124Repair the Wall(贪心)
- POJ1995Raising Modulo Numbers
- windows 画图工具 —— mspaint 的使用
- poj1995Raising Modulo Numbers(快速幂+同余定理)
- Raising Modulo Numbers
- POJ-1995 Raising Modulo Numbers
- HDU 5319 Painter
- hdu 5732 subway(2016 Multi-University Training Contest 1 1010)
- 【杭电1789】Doing Homework again贪心(还不太懂)
- Raising Modulo Numbers
- Raising Modulo Numbers poj 1995
- 【poj1995】Raising Modulo Numbers
- Trailing Zeroes (III)(n!后有多少零+二分)
- POJ -1995 Raising Modulo Numbers