Raising Modulo Numbers poj 1995
来源:互联网 发布:中信期货交易软件 编辑:程序博客网 时间:2024/05/22 08:20
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
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<cstdio>__int64 q(__int64 n,__int64 m,__int64 k){__int64 ans = 1;n %= k;while (m){if (m & 1)ans = (ans * n) % k;n = (n * n) % k;m >>= 1;}return ans;}int main(){int n,m,k,i,a[50000],b[50000];__int64 sum;scanf("%d",&n);while(n--){scanf("%d",&m);scanf("%d",&k);for(i=0;i<k;i++)scanf("%d%d",&a[i],&b[i]);sum=0;for(i=0;i<k;i++)sum+=q(a[i],b[i],m);sum=sum%m;printf("%I64d\n",sum);}}
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 1995Raising 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
- 高并发数据结构Disruptor解析(2)
- Java - 数据库(mysql -> oracle - 1)
- storm的数据流组
- HDU 1671 phone list 数据结构+Trie树(字典树、前缀树)
- java参数传递(值传递还是引用传递)
- Raising Modulo Numbers poj 1995
- JavaScript document.cookie使用
- 约瑟夫环问题【数学递推】【优化版】
- 学习汇总
- package的用法
- 在64位的环境下利用Jet来操作Access,Excel和TXT
- 数据库---设计原则
- 341. Flatten Nested List Iterator
- Linux内核之进程调度