Raising Modulo Numbers POJ - 1995

titi2018815

于 2019-10-19 15:59:54 发布

阅读量133

点赞数

分类专栏：快速幂算法

本文链接：https://blog.csdn.net/titi2018815/article/details/102639373

版权

快速幂算法专栏收录该内容

1 篇文章 0 订阅

订阅专栏

题目：

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代表有T组测试数据，每一个测试数据给你两个数字MOD和N，N代表有N对数据，每一对数据是两个数字A和B，然后就是让你求出来所有对A^B 对MOD取余的结果的和；

思路：

因为数据范围比较大，那么可以直接使用快速幂算法，那么就可以出来结果。

需要注意的是数据范围，需要用long long范围，否则结果不对；

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

typedef long long ll;

ll n,mod,t;
ll a,b;
ll sum;

ll mod_pow(ll x,ll y,ll z)
{
    ll res=1;
    while(y)
    {
        if(y&1)
            res=res*x%z;
        x=x*x%z;
        y>>=1;
    }
    return res;
}

int main()
{
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld%lld",&mod,&n);
        sum=0;
        for(int i=0; i<n; i++)
        {
            scanf("%lld%lld",&a,&b);
            sum=(sum+mod_pow(a,b,mod))%mod;
        }
        printf("%lld\n",sum);
    }
    return 0;
}