题目链接: 点我 题目大意:求 题目分析: 快速幂模板
Problem:
1995 User: ChenyangDu
Memory:
152K Time:
110MS
Language: C++ Result: Accepted
Source Code
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,MOD;
long long mi(
long long a,
long long b){
long long ans =
1;
while(b){
if(b &
1){
ans = (ans*a) % MOD;
}
a = (a*a) % MOD;
b >>=
1;
}
return ans;
}
int main(){
int T;
scanf(
"%d",&T);
while(T--){
scanf(
"%d%d",&MOD,&n);
long long ans =
0;
for(
int a,b,i=
1;i<=n;i++){
scanf(
"%d%d",&a,&b);
ans += mi(a,b);
ans %= MOD;
}
printf(
"%d\n",ans);
}
return 0;
}