#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <iostream>
using namespace std;
int f(int a,int n,int m)
{
a = a%m;
int r =1 ;
while(n)
{
if(n & 1)
{
r = (r*a)%m;
}
a = (a*a)%m;
n >>= 1;
}
return r;
}
int main()
{
int n,h,m,a,b,s;
cin >>n;
while( cin >> m )
{
cin >> h;
s=0;
for(int i=0;i < h;i++)
{
cin >> a >> b;
s = (s+f(a,b,m))%m;
}
cout <<s<<endl;
}
}
poj 1995 快速幂
最新推荐文章于 2020-03-28 20:40:35 发布