poj 1995 Raising Modulo Numbers 【快速幂 裸题】
来源:互联网 发布:上州屋渔具淘宝店 编辑:程序博客网 时间:2024/05/24 05:13
Raising Modulo Numbers
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5415 Accepted: 3157
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
题意:给你一个数M和H对(Ai,Bi)(1<=i<=H),让你求(A1B1+A2B2+ ... +AHBH)mod M.
快速幂 裸题吧
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>#define LL long longusing namespace std;LL pow_mod(LL a, LL p, LL M){ if(p == 0) return 1; LL ans = pow_mod(a, p/2, M); ans = ans * ans % M; if(p % 2 == 1) ans = ans * a % M; return ans;}int main(){ int t, H; LL M; scanf("%d", &t); while(t--) { scanf("%lld", &M); scanf("%d", &H); LL a, b; LL ans = 0; while(H--) { scanf("%lld%lld", &a, &b); ans = (ans + pow_mod(a, b, M)) % M; } printf("%lld\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 快速幂取模
- 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 快速模幂
- WPF学习之数据绑
- redis集群部署sentinel--两台实现
- 什么叫资源整合?
- uva 11732 "strcmp()" Anyone? (trie+左儿子右兄弟表示法)
- 网易内推电话面试(一面)
- poj 1995 Raising Modulo Numbers 【快速幂 裸题】
- noip2000税收与补贴问题 (模拟,排序)
- iOS appStore中的应用 实现版本升级功能
- codeforce 558B Amr and The Large Array 思维题
- maven 手动加入jar到本地资源库
- 阿里巴巴2015实习生笔试真题
- hdu2602 Bone Collector
- 【洛谷】P1085 不高兴的津津
- 智慧旅游项目技术文档