#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e4 + 5, mod = 1e9 + 7;
int f[maxn];//用了前i个数[1, sqn),和为j的方案数
int g[2][maxn];//用了i个数,和为j的方案数。放一个sqn或者全部都加1
int h[maxn];//只用大于等于sqn的数,和为i的方案数
int main()
{
int n;
cin >> n;
int sqn = sqrt(n) + 1;
f[0] = 1;
for (int i = 1; i < sqn; ++i){
for (int j = i; j <= n; ++j){
f[j] += f[j - i];
f[j] %= mod;
}
}
g[0][0] = 1;//这玩意会影响滚动,所以单独转移一遍然后置零
int now = 1;
for (int j = sqn; j <= n; ++j){
g[now][j] = (g[now][j - 1] + g[now ^ 1][j - sqn]) % mod;
h[j] = (h[j] + g[now][j]) % mod;
}
g[0][0] = 0;
for (int i = 2; i < sqn; ++i){
now ^= 1;
for (int j = sqn; j <= n; ++j){
g[now][j] = 0;
g[now][j] = (g[now][j - i] + g[now ^ 1][j - sqn]) % mod;
h[j] = (h[j] + g[now][j]) % mod;
}
}
h[0] = 1;
int ans = 0;
for (int i = 0; i <= n; ++i){
ans += (ll)f[i] * h[n - i] % mod;
ans %= mod;
}
cout << ans << endl;
return 0;
}
51nod 1259 整数划分 V2(dp)
最新推荐文章于 2020-10-02 11:08:52 发布