思路:相当于一个裸的多重背包
#include<iostream>
#include<cstdio>
using namespace std;
int a[20],num[20],dp[50];
int main()
{
int T;
scanf("%d",&T);
while (T--)
{
int n,m;
scanf("%d%d",&n,&m);
for (int i = 1;i<=m;i++)
scanf("%d%d",&a[i],&num[i]);
for (int i = 1;i<=n;i++)
dp[i]=0;
dp[0]=1;
for (int i = 1;i<=m;i++)
for (int j = n;j>=a[i];j--)
for (int k = 1;k<=num[i]&&(j-a[i]*k)>=0;k++)
dp[j]=dp[j]+dp[j-a[i]*k];
printf("%d\n",dp[n]);
}
}