1 solutions

  • 1
    @ 2026-3-18 18:49:42
    #include<bits/stdc++.h>
    using namespace std;
    
    int main()
    {
        int n,k;
        cin>>n>>k;
        
        int dp[205][10]={0};
        
        for(int i=1;i<=n;i++) dp[i][1]=1;
        
        for(int i=2;i<=n;i++)
            for(int j=2;j<=k;j++)
                if(i>=j) dp[i][j]=dp[i-1][j-1]+dp[i-j][j];
        
        cout<<dp[n][k];
        return 0;
    }
    
    • 1

    Information

    ID
    19
    Time
    1000ms
    Memory
    512MiB
    Difficulty
    4
    Tags
    # Submissions
    30
    Accepted
    16
    Uploaded By