题解 | #整数拆分#
整数拆分
https://www.nowcoder.com/practice/376537f4609a49d296901db5139639ec
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1000010,MOD = 1e9;
int n;
int f[N];
int main(void)
{
cin >> n;
f[0] = 1;
for(int i = 1;i <= n;i *= 2)
for(int j = i;j <= n;j++)
f[j] = (f[j] + f[j - i]) % MOD;
cout << f[n] << endl;
return 0;
}
