百练 4119

https://blog.csdn.net/curson_/article/details/51998184?utm_medium=distribute.pc_relevant_t0.none-task-blog-2%7Edefault%7EBlogCommendFromMachineLearnPai2%7Edefault-1.control&dist_request_id=1328769.13505.16173638947054547&depth_1-utm_source=distribute.pc_relevant_t0.none-task-blog-2%7Edefault%7EBlogCommendFromMachineLearnPai2%7Edefault-1.control

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=1010;
int n,m;
int dp1(int n,int k){
	vector<vector<int> > dp(n+1,vector<int>(n+1,0));
	dp[0][0]=1;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=i;j++){
			dp[i][j]=dp[i-j][j]+dp[i-1][j-1];
		}
	}
	return dp[n][k];
}
int dp2(int n){
	vector<vector<int> > dp(n+1,vector<int>(n+1,0));
	for(int i=0;i<=n;i++) dp[0][i]=1;
	for(int i=1;i<=n;i++){
		//dp[0][i]=1;
		for(int j=1;j<=n;j++){
            if(i<j) dp[i][j]=dp[i][i];
            else dp[i][j]=dp[i-j][j-1]+dp[i][j-1];
		}
	}
	return dp[n][n];
}
int dp3(int n){
	vector<vector<int> > dp(n+1,vector<int>(n+1,0));
	for(int i=1;i<=n;i++) dp[0][i]=1;
	for(int i=1;i<=n;i++){
		//dp[0][i]=1;
		for(int j=1;j<=n;j++){
			if(j%2){//j为奇数
                if(i<j) dp[i][j]=dp[i][i];
                else dp[i][j]=dp[i-j][j]+dp[i][j-1];
            }
            else dp[i][j]=dp[i][j-1];
		}
	}
	return dp[n][n];
} 
int main(){
	while(~scanf("%d%d",&n,&m)) {
		cout<<dp1(n,m)<<endl;
		cout<<dp2(n)<<endl;
		//cout<<slvD(n)<<endl;
		cout<<dp3(n)<<endl;
	}
}