POJ-1995-Raising Modulo Numbers
来源:互联网 发布:钢铁侠中的人工智能 编辑:程序博客网 时间:2024/06/06 03:50
Language:
Raising Modulo Numbers
Time Limit: 1000MS Memory Limit: 30000K
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.
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
简单来说就是求(A1B1+A2B2+ … +AHBH)mod M.的值(PS:注意精度问题)
#include <cstdio>typedef long long ll;int m;int quick(ll a,ll b){ ll ans=1; while(b) { if(b&1) ans=ans*a%m; a=a*a%m; b>>=1; } return ans%m;}int main(){ int z,h; int sum=0; int x,y; scanf("%d",&z); while(z --) { sum=0; scanf("%d%d",&m,&h); for(int a = 0; a < h; a ++) { scanf("%d%d",&x,&y); sum=(sum+quick(x,y))%m; } printf("%d\n",sum); } return 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
- 八、十、十六进制转换
- 最小二乘法介绍
- SQLite编译
- day12(Scanner)
- go学习(二)——基本数据类型和基本语法
- POJ-1995-Raising Modulo Numbers
- 用C语言实现 C到C++的注释转换
- 免费软件真的免费吗?
- go学习(三)——gdb调试
- [bfs树 分层图][DP] hihocoder Pro.1147 时空阵
- 利用BFS和DFS解决 LeetCode 130: Surrounded Regions
- 设置按钮和菜单快捷键
- helloworld
- 算法面试题之字符串子串