【POJ - 1995】Raising Modulo Numbers（裸的快速幂）

题干：

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

题目大意：

第一行测试样例个数t，第二行mod，第三行读入个数m，然后读m行(a,b)，求a^b的和%mod即可。

AC代码：（改成scanf读入反而更慢了是什么鬼125ms）

#include<cstdio>
#include<algorithm>
#include<iostream>
#define ll long long
using namespace std;
ll m;
ll qpow(ll a,ll k) {ll ans = 1;while(k) {if(k&1) ans=(ans*a)%m;k>>=1;a=(a*a)%m;}return ans%m;
}int main()
{int t;ll sum = 0,a,b;cin>>t;while(t--) {ll n;scanf("%lld%lld",&m,&n);sum = 0;while(n--) {scanf("%lld%lld",&a,&b);sum += qpow(a,b);sum%=m;}printf("%lld\n",sum);}return 0 ;
}

【POJ - 1995】Raising Modulo Numbers（裸的快速幂）相关推荐

poj 1995 Raising Modulo Numbers 二分快速幂
题意:给定n对Ai,Bi,求所有Ai的Bi次方之和对M取模的结果: 思路:二分法求快速幂: #include<cstdio> #include<cstring> #includ ...
Raising Modulo Numbers
http://poj.org/problem?id=1995 题解:快速幂 /* *@Author: STZG *@Language: C++ */ //#include <bits/stdc+ ...
【poj1995】Raising Modulo Numbers
problem T组数据,每组包含n对ai,bi和一个p. 每组输出一个答案,∑ni=1aibi%p∑i=1naibi%p \sum_{i=1}^n ai^{bi} \%p. solution 快速幂 ...
POJ 2778 DNA Sequence [AC自动机 + 矩阵快速幂]
http://poj.org/problem?id=2778 题意:给一些只由ACGT组成的模式串,问有多少种长度为n且不含有给出的模式串的DNA序列. 自动机的状态转换可以看成一个有向图(有重边的) ...
POJ 3233 Matrix Power Serie （矩阵快速幂）
Description Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + - + Ak. ...
POJ - 2778 DNA Sequence(AC自动机+矩阵快速幂)
题目链接:点击查看题目大意:给出 n 个长度不大于 10 的字符串表示病毒串,再给出一个长度 len ,问长度为 len 的字符串中,有多少个字符串不含有病毒串作为子串题目分析:因为病毒串的长度和 ...
POJ - 3613 Cow Relays(Floyd思想+矩阵快速幂+动态规划)
题目链接:点击查看题目大意:给定一张由T(T<=100)条边构成的无向图,点的编号为1~1000,之间的整数,求从起点S到终点E恰好经过N(N<=1e6)条边(可重复经过)的最短路题目 ...
Poj1995--Raising Modulo Numbers（快速幂）
题目: http://poj.org/problem?id=1995 Input The input consists of Z assignments. The number of them is ...
c语言的幂乘积表达式,POJ 1845 Sumdiv [素数分解快速幂取模二分求和等比数列]
大致题意: 求A^B的所有约数(即因子)之和,并对其取模 9901再输出. 解题基础: 1) 整数的唯一分解定理: 任意正整数都有且只有一种方式写出其素因子的乘积表达式. ,其中为素数 2) 约数和 ...

【POJ - 1995】Raising Modulo Numbers（裸的快速幂）

【POJ - 1995】Raising Modulo Numbers（裸的快速幂）相关推荐

最新文章

热门文章