【整数递增加法拆分】2022-4-11

缘由整数拆分问题，但是怎么输出这个数位最多。-编程语言-CSDN问答

void 整数递增加法拆分()
{//缘由https://ask.csdn.net/questions/7687667?spm=1005.2025.3001.5141int n = 0, c = 1, f = c, t = n;string sc = "";cin >> n; t = n;while (t){if (t > 0)(sc == "" ? "" : sc += "+"), sc += std::to_string(f), t -= f++;elsef = ++c, t = n, sc = "";}std::cout << sc << endl;
}

挺有意思的2的次方规律是无法分解的。类似可以扩展用C++解决整数拆分问题-编程语言-CSDN问答