C语言递归程序：求解1*2+2*3+...+(n-1)*n<=m的最大n值

#include <stdio.h>\n\nint calculateSum(int n) {\n if (n == 1) {\n return 1;\n } else {\n return (n-1) * n + calculateSum(n-1);\n } \n}\n\nint findMaxN(int m, int n) {\n if (calculateSum(n) <= m) {\n return n;\n } else {\n return findMaxN(m, n-1);\n } \n}\n\nint main() {\n int m = 15;\n int n = findMaxN(m, 1);\n printf("The maximum n for the given m is: %d\n", n);\n return 0;\n}