AcWing 900. 整数划分
原题链接
简单
作者:
_如鲸向海
,
2022-06-25 09:42:06
,
所有人可见
,
阅读 131
C++ 代码
//f[i][j] = f[i-1][j] + f[i-1][j-i] + f[i-1][j-2*i]......
//f[i][j-i] = f[i-1][j-i] + f[i-1][j-2*i].....
//f[i][j] = f[i-1][j] + f[i][j-i];
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1010;
int f[N];
int main(){
int number;
cin>>number;
f[0] = 1;
for(int i = 1;i<=number;i++)
for(int j = i;j<=number;j++)
f[j] = (f[j]%mod + f[j-i]%mod)%mod;
cout<<f[number]<<endl;
}