Raising Modulo Numbers

题目

时间限制: 1 Sec 内存限制: 128 MB
[提交] [状态]
题目描述
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.
输入
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.
输出
For each assingnement there is the only one line of output. On this line, there is a number, the result of expression

样例输入 Copy
3
16
4
2 3
3 4
4 5
5 6
36123
1
2374859 3029382
17
1
3 18132
样例输出 Copy
2
13195
13

大意：

给出Z组a，b的值，求a1^b1+a2^b2+…+an^bn之和mod M的值

思路：

每一组a,b进行快速幂。将快速幂加起来，每次加的时候%m，加完最后一个并%m后就是答案了。
类似的对每一个大组都是这样，所以循环就ok了。

#include <iostream>

using namespace std;
int a[45010];
int b[45010];

int main()
{
    int z;
    cin>>z;
    while(z--){
        int m,h;
        long long int ans = 0;
        cin>>m;
        cin>>h;
        for(int i=0; i<h; i++)
            cin>>a[i]>>b[i];
        for(int i=0; i<h; i++){
            int res = 1%m;
            while(b[i]){
                if(b[i] & 1){
                    res = res*1ll*a[i]%m;
                }
                a[i] = a[i]*1ll*a[i]%m;
                b[i]>>=1;
            }
            ans = (ans+res)%m;
        }
        cout<<ans<<endl;
    }
    return 0;
}