51nod 1138 连续整数的和 【栈操作】

#include<iostream>
#include<cstring>
#include<math.h>
#include<algorithm>
#include<stack>
using namespace std;
typedef long long ll;
const int Max=1e5+5;
int n, cnt;
ll arr[Max];
ll f(int x){
    return (x-1)*x/2;
}
void init( ){
    cnt = 2;
    ll t = f(cnt);
    while(t <= 1e9){
        arr[cnt] = t;
        cnt++;
        t = f(cnt);
    }
}
int main( ){
    //freopen("input.txt", "r", stdin);
    init( );//N = (n-1)*n/2 + na;所以可以提前将n(n-1)/2枚举出来是O(sqrt(N))复杂度
    while(cin>>n){
        int i= 2;
        stack<int> st;
        while(arr[i] < n){
            int a = (n-arr[i])/i;
            if(a*i == n-arr[i])
                st.push(a);
            i++;
        }
        if(st.empty( )){
            cout<<"No Solution"<<endl;
            continue;
        }
        while(!st.empty( )){
            printf("%d\n", st.top());
            st.pop( );
        }
    }
    return 0;
}