蓝桥杯算法训练VIP-连续正整数的和 （C++代码） 纯暴力思路！ 求改进，求优化，求大佬！

前缀和+二分
#include <iostream>
using namespace std;
long long s[2000010], m; 

int main() {
	cin >> m;
	for (int i = 1; i < m; ++i) 
		s[i] = s[i - 1] + i;
	for (int i = 1; 2 * i < m; ++i) {
		int l = i + 1, r = m, mid;
		while (l <= r) {
			mid = (l + r) >> 1;
			if (s[mid] - s[i - 1] < m) l = mid + 1;
			else if (s[mid] - s[i - 1] > m) r = mid - 1;
			else {
				cout << i << " " << mid << endl;
				break;
			}
		}
	}
	cout << endl;
	return 0;
}

非暴力解，py版 具体分析见我的题解

n=int(input())
re=[]
for i in range(2,n):
    if i%2==0 and n/i==n//i+0.5 and n//i+1-(i//2)>0:  #偶数
        re.append([str(n//i+1-(i//2)),str(n//i+(i//2))])
    elif i%2==1 and n%i==0 and int(n/i)-i//2>0:       #奇数
        re.append([str(n//i-(i//2)),str(n//i+(i//2))])
    elif n//i+1-(i//2)<0 or int(n/i)-i//2<0:          #超界
        break
for i in re[::-1]:
    print(' '.join(i))

#include<stdio.h>
int main()
{
	int i,j,o,k,m,sun=0;
	scanf("%d",&m);
for(i=1;i<10000;i++)
{sun=0;for(j=i;j<10000;j++)
{k=i;sun+=j;o=j;
if(sun<m)continue;if(sun==m&&o!=m)
{printf("%d %d \n",k,o);break;}if(sun>m)
break;}}
return 0;
}