Raising Modulo Numbers(数论)
来源:互联网 发布:守望先锋显卡优化 编辑:程序博客网 时间:2024/05/22 03:03
D - Raising Modulo Numbers
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u
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#include <iostream>#include <cstdio>using namespace std;long long quick_mod(long long a, long long b, long long m){ long long ans = 1; while( b ) { if( b&1 ) { ans = (ans*a)%m; b--; } b /= 2; a = a*a%m; } return ans;}int main(){ long long z, sum, a, b, h, m; cin >> z; while( z-- ) { sum = 0; cin >> m >> h; while( h-- ) { cin >> a >> b; sum += quick_mod(a, b, m); } sum %= m; cout << sum << endl; } return 0;}快速幂模板题。。。
0 0
- Raising Modulo Numbers(数论)
- [数论]HOJ 1842 Raising Modulo Numbers 快速幂
- POJ 1995 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
- Raising Modulo Numbers
- POJ1995 Raising Modulo Numbers
- Raising Modulo Numbers
- ahu-730-幸运抽奖
- 关于RunLoop的几点个人看法
- 回文素数的Java实现代码
- android对字段的验证
- 网络流题集
- Raising Modulo Numbers(数论)
- 【Western Digital】固件区学习之缺陷表(30、31、32、33、34、35、36模块)
- 随笔知识2
- Linux 下wifi 驱动开发(二)—— WiFi模块浅析
- 【LeetCode】75. Sort Colors解法及注释
- jQuery validate 插件详解 转载
- dapper 的学习
- Qt5.2.0配置sdk
- c++ tuple类型