find_seq

来源:互联网 发布:树状笔记软件ubuntu 编辑:程序博客网 时间:2024/06/03 20:37
int cnt(0);int howmany(0);void find_seq(int A1, int n, int sum){    howmany++;    int tmp=(A1+(n-1)/2.0)*n;    if(tmp > sum)        return;    else if(tmp==sum)    {        cout<<"the sequence of "<<n<<" numbers: ";        for(int i = 0; i<n; i++)            cout<<A1+i<<" ";        cout<<endl;        cnt++;    }    else    {        find_seq(++A1, n, sum);    }    return;}int main(){    int m;    cin>>m;    int tmp=(int)sqrt(m*2);    for (int i=2; i<=tmp; i++)        find_seq(1, i, m);    cout<<"cnt: "<<cnt<<endl;    cout<<"howmany: "<<howmany<<endl;    return 0;}

原创粉丝点击