其实并不用去暴力枚举，用简单的递归就行了。
by Abernethy @ 2023-11-21 21:17:42
我康康
by hanrui114514 @ 2023-11-21 21:24:01
@[Abernethy](/user/1031807) +1
by hanrui114514 @ 2023-11-21 21:24:43
递归思路如下：
1.k=1或n=0 返回1；
2.n<k 返回f(n,n);
3.否则 返回f(n,k-1)+f(n-k,k);
~~具体思路我这个蒟蒻一时半会讲不清，可以看写题解的大佬讲解~~
by Abernethy @ 2023-11-21 21:24:53
[P1025](https://www.luogu.com.cn/paste/ha5kv07p)
by hanrui114514 @ 2023-11-21 21:50:02
给个关注呗
by hanrui114514 @ 2023-11-21 21:54:56
@[Abernethy](/user/1031807) 谢谢佬
by kongdexuan23 @ 2023-12-12 20:44:39
@[hanrui114514](/user/906849) 感谢，已关
by kongdexuan23 @ 2023-12-12 20:45:16