题解 | #跳台阶扩展问题#

using namespace std;
int main()
{
    const int N=50;
    int dp[N] = {0};
    int n;
    cin>>n;
    dp[0] = 1;
    //dp[1] = 1;
    for(int i = 1;i<=n;i++)
        for(int j=1;j<=i;j++)
        {
            dp[i]+=dp[i-j];
        }
    cout<<dp[n];
    return 0;
}