hdu 1028 Ignatius and the Princess III(整数划分)

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 #include <string>
 5 #include <algorithm>
 6 using namespace std;
 7 #define maxn 130
 8 int dp[130][130];
 9 void init(){
10     memset(dp, 0, sizeof(dp));
11     for(int i = 0; i <= 125; i++){
12         dp[0][i] = 1;  //0
13         dp[i][1] = 1;  //都拆分为1 
14         dp[1][i] = 1; 
15     }
16     for(int i = 2; i <= 125; i++){
17         for(int j = 2; j <= 125; j++){
18             if(j<=i)dp[i][j] = dp[i][j-1] + dp[i-j][j];
19             else dp[i][j] = dp[i][i];
20         }
21     }
22 }
23 int main(){
24     int N;
25     init();
26     while(scanf("%d", &N) != EOF){
27         cout<<dp[N][N]<<endl;
28     }
29     return 0;
30 }