POJ-1995 Raising Modulo Numbers---快速幂模板

题目链接：

https://vjudge.net/problem/POJ-1995

题目大意：

求一堆a^b的和模上m

思路：

直接上模板

 #include<iostream>
 #include<vector>
 #include<queue>
 #include<algorithm>
 #include<cstring>
 #include<cstdio>
 #include<set>
 #include<cmath>
 using namespace std;
 typedef pair<int, int> Pair;
 typedef long long ll;
 const int INF = 0x3f3f3f3f;
 const int maxn = +;
 int T, n, m;
 ll quick_pow(ll a, ll b, ll m)
 {
     a %= m;
     ll ans = ;
     while(b)
     {
         if(b & )ans = ans * a % m;
         b /= ;
         a *= a;
         a %= m;
     }
     ans %= m;
     return ans;
 }
 int main()
 {
     cin >> T;
     while(T--)
     {
         cin >> m >> n;
         ll sum = , a, b;
         while(n--)
         {
             cin >> a >> b;
             sum += quick_pow(a, b, m);
             sum %= m;
         }
         cout<<sum<<endl;
     }
 }