来自非萌新的求助

#include<cstdio>
#include<iostream>
#define ll long long
using namespace std;
struct node{ll n,m;}q[1010];
ll t,k,ans,maxn=-1,c[2020][2020],f[2020][2020];
inline ll read(){
	char ch=getchar();ll j=0,k=1;
	while(ch<'0'||ch>'9'){if(ch=='-')k=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')j=j*10+ch-'0',ch=getchar();
	return j*k;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
	return;
}
int main(){
	t=read(),k=read();
	for(ll i=1;i<=t;i++){
		q[i].n=read(),q[i].m=read();
		maxn=max(maxn,q[i].n);
	}
	for(ll i=0;i<=maxn;i++)c[i][0]=c[i][i]=1;
	for(ll i=2;i<=maxn;i++)
		for(ll j=1;j<=i;j++)c[i][j]=(c[i-1][j-1]+c[i-1][j])%k; 
	for(ll i=2;i<=maxn;i++){
		for(ll j=1;j<=i;j++){
			f[i][j]=f[i-1][j]+f[i][j-1]-f[i-1][j-1];
			if(!c[i][j])f[i][j]++;
		}
		f[i][i+1]=f[i][i];
	}
	for(ll i=1;i<=t;i++)
		write(f[q[i].n][min(q[i].n,q[i].m)]),putchar('\n');
	return 0;
}