运用求和公式拆分连续正整数之和

#include <cmath> #include <iostream> using namespace std; int main(int argc, char **argv) { long c, k, m, n, t; scanf("%ld", &n); t = (long)sqrt(2 * n); c = 0; for (k = 2; k <= t; k++) {

>>阅读原文<<