题意:
n个人分组,每组不少于k个人,求方案数。
先O(n^2)预处理,然后O(1)回答就好。
#include <cstdio>
const int maxn = 1001, p = 1000000007;
int dp[maxn][maxn];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
int main() {
for(int i = 1; i < maxn; i++) dp[i][i] = 1;
for(int i = 2; i < maxn; i++) for(int j = i - 1; j >= 1; j--)
dp[i][j] = (dp[i][j + 1] + dp[i - j][j]) % p;
int T = iread();
while(T--) {
int n = iread(), k = iread();
printf("%d\n", dp[n][k]);
}
return 0;
}