完全背包
C++ 代码
#include <iostream>
using namespace std;
const int N = 40010, mod = 2147483648;
long f[N] ;
int main()
{
int n;
cin >> n;
f[0] = 1;
for (int i = 1; i < n; i ++ )
for (int j = i; j <= n; j ++ )
f[j] = (f[j] + f[j - i]) % mod;
cout << f[n] << endl;
return 0;
}