题意
找到一个非空的非负整数序列
S
,满足S的所有元素之和为
分析
看到数据范围,我们可以围绕
m
下手。分析发现,我们可以把序列中的每个数表示成
#include <cstdio>
#include <cstring>
typedef long long LL;
const int N = 103;
const LL P = 905229641;
LL fac[N],f[N * N / 2][N],inv[N];
int m;
LL n,ans;
LL fast(LL ds,LL zs) {
if (zs == 1) return ds;
LL re = fast(ds,zs / 2);
re = re * re % P;
if (zs & 1) re = re * ds % P;
return re;
}
LL c(LL N,LL M) {
if (M == 0) return 1;
LL re = 1;
for (LL i = N - M + 1;i <= N;i ++) re = re * (i % P) % P;
return re * inv[M] % P;
}
int main() {
f[0][0] = f[0][1] = 1;
scanf("%lld%d",&n,&m);
for (int k = 0;k < m - 1;k ++) {
int r = k * (k + 1) / 2;
for (int i = r;i >= 0;i --) {
for (int j = k + 1;j >= 0;j --) if (f[i][j]) {
f[i + k + 1][j + 1] = (f[i + k + 1][j + 1] + f[i][j]) % P;
}
}
}
fac[0] = 1;
for (int i = 1;i <= m;i ++) fac[i] = fac[i - 1] * i % P;
inv[m] = fast(fac[m],P - 2);
for (int i = m - 1;i >= 0;i --) inv[i] = inv[i + 1] * (i + 1) % P;
int r = m * (m - 1) / 2;
for (LL i = 0;i <= r;i ++) if ((n - i) % m == 0) {
LL cnt = (n - i) / m;
for (LL j = 1;j <= m;j ++) if (f[i][j]) {
ans = (ans + f[i][j] * c(cnt + j - 1,j - 1) % P * fac[j] % P) % P;
}
}
printf("%lld",ans);
}