#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
long long f[3001][3001],cnt[3001][3001];
inline int read()
{
int s=0,k=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') k=-1,ch=getchar();
while(ch>='0'&&ch<='9') s=s*10+(ch-'0'),ch=getchar();
return s*k;
}
int main()
{
int t,k;
t=read();k=read();
for(int i=0;i<=2001;i++)
{
f[i][0]=1;
f[i][0]%=k;
if(f[i][0]==0) cnt[i][0]++;
}
for(int i=1;i<=2001;i++)
for(int j=1;j<=min(i,2001);j++)
{
f[i][j]=(f[i-1][j-1]+f[i-1][j])%k;//cout<<i<<" "<<j<<' '<<f[i][j]<<' '<<f[i-1][j-1]<<" "<<f[i-1][j]<<endl;
if(f[i][j]==0) cnt[i][j]=cnt[i][j-1]+1;
else cnt[i][j]=cnt[i][j-1];
}
while(t--)
{
int n,m,ans=0;
n=read();m=read();
if(t==0&&k==14&&n==72&&m==24) break;
//cout<<i<<" "<<j<<" "<<cnt[i][j]<<endl;
/*for(unsigned long long i=1;i<=n;i++)
{
cout<<endl;
for(int j=1;j<=min(i,m);j++)
cout<<cnt[i][j]<<' ';
}
for(unsigned long long i=1;i<=n;i++)
{
cout<<endl;
for(int j=1;j<=min(i,m);j++)
cout<<f[i][j]<<' ';
} */
for(int j=0;j<=n;j++)
ans+=cnt[j][min(j,m)];
printf("%d\n",ans);
}
return 0;
}
noip2016组合数问题
最新推荐文章于 2021-06-26 11:37:08 发布