poj1995 Raising Modulo Numbers(快速幂模板)
#include <iostream>
#include <cstdio>
using namespace std;
int t,M,n,sum;
int quickpow(int x,int k){
x%=M;
int ans=1;
while(k){
if(k&1) ans*=x,ans%=M;
x*=x;
x%=M;
k>>=1;
}
return ans;
}
int main()
{
// freopen("1.txt","r",stdin);
scanf("%d",&t);
while(t--){
scanf("%d %d",&M,&n);
sum=0;
while(n--){
int x,k;
scanf("%d %d",&x,&k);
sum+=quickpow(x,k);
sum%=M;
}
printf("%d\n",sum);
}
return 0;
}