#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; }
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.
Using your ZXOJ universal account