[Coursera]算法基础_Week9_考试_Q3

#include<iostream>
#include <cstring>
#include<vector>
#include <cstdio>
using namespace std;
#define N 55+1
int dp

;

int main()
{
int n, k;
int out;
while (cin >> n)
{
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (j <= i)
dp[i][j] = dp[i - j][j] + dp[i][j - 1];
else
dp[i][j] = dp[i][i];
}
}
out = dp

;
cout << out << endl;
}
return 0;
}