思路:
代码:
# include<iostream>
using namespace std;
const int N = 2010,mod = 1e9 + 7;
int a[N][N];
void init()
{
for(int i = 0;i < N;i++)
for(int j = 0;j <= i;j++)
{
if(!j) a[i][j] = 1;
else a[i][j] = (a[i - 1][j] + a[i - 1][j - 1]) % mod;
}
}
int main()
{
init();
int n;
scanf("%d",&n);
while(n--)
{
int c,b;
scanf("%d %d",&c,&b);
printf("%d\n",a[c][b]);
}
return 0;
}