poj 1995 Raising Modulo Numbers 题解

Raising Modulo Numbers

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 6347		Accepted: 3740

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 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

(A₁^B₁+A₂^B₂+ ... +A_H^B_H)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

Source

CTU Open 1999

—————————————我是分割线————————————————————

快速幂裸题

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<cstdlib>
 #include<iomanip>
 #include<cassert>
 #include<climits>
 #define maxn 50001
 #define F(i,j,k) for(int i=j;i<=k;i++)
 #define M(a,b) memset(a,b,sizeof(a))
 #define FF(i,j,k) for(int i=j;i>=k;i--)
 #define inf 0x7fffffff
 #define p 23333333333333333
 using namespace std;
 int read(){
     int x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 int m,h;
 long long ans;
 long long kuaisumi(long long a,long long n)
 {
     long long ans=;
     while(n) {
         if(n&) ans=(ans*a)%m;
         a=(a*a)%m;
         n>>=;
     }
     return ans;
 }
 int main()
 {
     int t;
     cin>>t;
     while(t--){
         ans=;
         cin>>m>>h;
         for(int i=;i<h;i++)
         {
             long long a,b;
             cin>>a>>b;
             ans=(ans+kuaisumi(a,b))%m;
         }
         cout<<ans<<endl;
     }
     return ;
 }