题目：输入一个正数n,输出所有和为n的连续正数序列
举例：输入15,由于1+2+3+4+5=4+5+6=7+8=15,所以输出3个连续序列1,2,3,4,5;4,5,6;7,8。
答：
#include "stdafx.h"#include <iostream>using namespace std;//求和为n的连续正数序列void FindSequenceNumber(int n){if (n <= 0){return;}int first = 1;int last = 2;int end = (n + 1) / 2;int sum = 1;while (first <= end) //序列必定有两个及以上 {if (sum == n){for (int i = first; i < last; i++){cout<<i<<" ";}cout<<endl;sum -= first;first++;}else if (sum < n){sum += last;last++;}else if (sum > n){sum -= first;first++;}}}int _tmain(int argc, _TCHAR* argv[]){FindSequenceNumber(15);return 0;}
运行界面如下：
