和為n的連續子序列

輸入一個正整數n，和一個正整數NUM

求出1-n中所有連續子序列使得，子序列的和等於NUM

#include<iostream>using namespace std;int main(){    int n,NUM;    cout<<"input n = ";    cin>>n;    cout<<"SUM = ";    cin>>NUM;    int *a = new int[n];    for(int i=0;i<n;i++)            a[i] = i+1;    int start = 0;    int end = 1;    int sum = a[start] + a[end];    while(end<n)    {            while(sum < NUM)                      sum += a[++end];            if(sum == NUM)            {                   int i = start;                   while(i <= end)                   {                               cout<<a[i]<<" ";                               i++;                   }                   cout<<endl;                   sum += a[++end];            }            while(sum > NUM)            {                      sum -= a[start++];            }    }    getchar();    getchar();    return 0;}