POJ - 1995 Raising Modulo Numbers 【快速幂】
来源:互联网 发布:b2b营销软件 编辑:程序博客网 时间:2024/05/10 14:24
Raising Modulo Numbers
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6530 Accepted: 3863
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 AiBifrom 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 AiBifrom 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
Source
CTU Open 1999
#include <stdio.h>__int64 pow(__int64 x, __int64 y, __int64 mod) { __int64 res = 1; __int64 base = x; while (y) { if (y&1) res = base*res%mod; base = base*base%mod; y >>= 1; } return res;}int main() { __int64 n, m, p; int t, s; scanf("%d", &t); while (t--) { scanf("%I64d", &p); scanf("%d", &s); int ans = 0; for (int i = 0; i < s; i++) { scanf("%I64d%I64d", &n, &m); ans += pow(n, m, p); ans %= p; } printf("%d\n", ans); } 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 快速幂取模
- Raising Modulo Numbers (poj 1995 快速幂水题)
- POJ 1995 Raising Modulo Numbers(快速幂取模)
- poj Raising Modulo Numbers 【快速幂 + 模取余】
- poj 1995 Raising Modulo Numbers(快速幂)
- poj 1995 Raising Modulo Numbers 快速模幂
- POJ 1995 Raising Modulo Numbers 整数快速幂
- 读github上的爬虫代码(html_downloader)
- 2016年上半年总结(大二上学期学期总结)
- leetcode_c++:栈:Implement Queue using Stacks(232)
- 125. Valid Palindrome
- 移植、验证AAC解码库FAAD2到android详解必看
- POJ - 1995 Raising Modulo Numbers 【快速幂】
- hdu 1272 小希的迷宫 并查集
- python的Tidy工具安装
- android- 百度地图 多边形的点击事件
- 并查集C++实现
- MySQL5.6.21安装版出现the the service mysql56 failed问题的方法。
- (模板题)sdut 3359 高数Umaru系列(10)——简单题(矩阵快速幂)
- java异常与IO流(基础知识)
- android面试专题(1)