@[zhangmingsheng3521](/user/765461) $i \le 202？$
by zheng_zx @ 2023-11-19 10:57:14
```
#include<bits/stdc++.h>
using namespace std;
int n,k,f[201][7];
int main(){
cin >> n >> k;
for (int i=1;i<=n;i++){
f[i[1]=1;
f[i][0]=1;
}
for (int i=2;i<=k;i++){
f[1][i]=0;
f[0][i]=0;
}
for (int i=2;i<=n;i++)
for (int j=2;j<=k;x++)
if (i>j) f[i][j]=f[i-1][j-1]+f[i-j][j];
else f[i][j]=f[i-1][j-1];
cout<<f[n][k];
return 0;
}
```
by zheng_zx @ 2023-11-19 10:59:47
@[zhangmingsheng3521](/user/765461)
by zheng_zx @ 2023-11-19 11:00:18
也可以不用dp的 @[zhangmingsheng3521](/user/765461)
我这是用dfs的
```
#include <bits/stdc++.h>
using namespace std;
int n,k;
int dfs(int index,int now,int left){
int s=0;
if(index==k-1)return left/2-now+1;
else{
int mx=left/(k-index+1);
for(int i=now;i<=mx;i++)
s+=dfs(index+1,i,left-i);
}
return s;
}
int main(){
scanf("%d%d",&n,&k);
printf("%d",dfs(1,1,n));
return 0;
}
```
by tony18457197574 @ 2023-11-19 11:06:22
@[zheng_zx](/user/1121230) 谢谢!2关已给
by zhangmingsheng3521 @ 2023-11-19 11:10:40
@[zhangmingsheng3521](/user/765461) 不用谢
by zheng_zx @ 2023-11-19 11:13:08