poj 1995

代码如下

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
long long pow4(long long a,long long b,long long M)
{
    long long res=1;
    while(b>0){
        if(b&1) res=res*a%M;
        a=a*a%M;
        b>>=1;
    }
    return res;
}
int main()
{
   int t,h;
   long long m,a,b;
   scanf("%d",&t);
   while(t--){
        scanf("%lld%d",&m,&h);
        long long ans=0;
        for(int i=0;i<h;i++){
            scanf("%lld%lld",&a,&b);
            ans=(ans+pow4(a,b,m))%m;
        }
        printf("%d\n",ans);
   }


}