POJ1995 Raising Modulo Numbers

 1 //快速幂 
 2 #include<algorithm>
 3 #include<iostream>
 4 #include<cstdio>
 5 #include<cstring>
 6 #include<cmath>
 7 using namespace std;
 8 int Z,M;
 9 int n;
10 int sum;
11 int a,b;
12 int ksm(int a,int b){
13     int now=a%M;
14     int res=1;
15     while(b){
16         if(b&1)res=res*now%M;
17         now=now*now%M;
18         b>>=1;
19     }
20     return res;
21 }
22 int main(){
23     scanf("%d",&Z);
24     while(Z--){
25         sum=0;
26         scanf("%d",&M);
27         scanf("%d",&n);
28         int i,j;
29         for(i=1;i<=n;i++){
30             scanf("%d%d",&a,&b);
31             sum=(sum+ksm(a,b))%M;//累加 
32         }
33         printf("%d\n",sum);
34     }
35     return 0;
36 }