题目链接
只要前两个尽量大,后面小就好
#include<bits/stdc++.h>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define LL long long
#define gcd __gcd
const int maxn = 1e4+200;
const int inf = 1 << 23;
LL a[maxn];
int main(){
int T;scanf("%d",&T);
while(T--){
int n,m;scanf("%d%d",&n,&m);
LL sum = 0;
cl(a,-1);
for(int i=0;i<m;i++){
LL x,y;
scanf("%lld%lld",&x,&y);
a[x]=y;
}
LL last=0;
for(int i=n;i>=3;i--){
if(a[i]!=-1){
last = a[i];
}
else a[i]=last;
sum+=a[i];
}
last = 100;
for(int i=1;i<=2;i++){
if(a[i]!=-1){
last = a[i];
}
else a[i]=last;
sum+=a[i];
}
LL ans = a[1]+a[2];
LL t = gcd(sum,ans);
printf("%lld/%lld\n",ans/t,sum/t);
}
return 0;
}