noi7219 复杂的整数划分问题

noi7219 复杂的整数划分问题

 #include <bits/stdc++.h>

 using namespace std;

 const int maxn = ;

 int dp1[maxn][maxn], dp2[maxn][maxn], dp3[maxn][maxn], dp4[maxn][maxn];

 void init() {

     for (int n = ; n <= ; n++) {

         for (int k = ; k <= ; k++) {

             if (n == k) dp1[n][k] = ;

             else if (n < k) dp1[n][k] = ;

             else dp1[n][k] = dp1[n-k][k]+dp1[n-][k-];

         }

     }

     for (int n = ; n <= ; n++) {

         dp2[n][] = n== ?  : ;

         for (int m = ; m <= ; m++) {

             if (n < m) dp2[n][m] = dp2[n][n];

             else if (n == m) dp2[n][m] = dp2[n][m-]+;

             else dp2[n][m] = dp2[n][m-]+dp2[n-m][m-];

         }

     }

     for (int n = ; n <= ; n++) {

         dp3[n][] = (n%), dp4[n][] = (n%==);

         dp3[n][] = dp3[n][];

         for (int m = ; m <= ; m++) {

             if (n < m) dp3[n][m] = dp4[n][m] = ;

             else if (n == m) dp3[n][m] = , dp4[n][m] = ;

             else {

                 dp3[n][m] = dp3[n-][m-]+dp4[n-m][m];

                 dp4[n][m] = dp3[n-m][m];

             }

             dp3[n][] += dp3[n][m];

         }

     }

 }

 int main() {

     init();

     int n, k;

     while (cin >> n >> k) {

         cout << dp1[n][k] << endl;

         cout << dp2[n][n] << endl;

         cout << dp3[n][] << endl;

     }

     return ;

 }