C语言实现整数无序拆分方案计数 - 最大数限制
#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint split(int n, int k){\n int dp[101][101];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n \n for(int i=1; i<=n; i++){\n for(int j=1; j<=k; j++){\n for(int m=1; m<=i && m<=j; m++){\n dp[i][j] += dp[i-m][m];\n }\n }\n }\n \n return dp[n][k];\n}\n\nint main() {\n int n, k;\n while(scanf("%d,%d", &n, &k) != EOF){\n printf("%d\n", split(n, k));\n }\n return 0;\n}
原文地址: https://www.cveoy.top/t/topic/pzLa 著作权归作者所有。请勿转载和采集!