Stadium and Games

用數學求出公式，再用二分法找答案

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#define ll "%I64d"
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 2000000000
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
Int n;
inline Int sqr(Int x){
    return x*x;
}
vector<Int> ans;
void solve(){
    ans.clear();
    for(int i=0;i<62;i++){
        Int l=1,r=min((Int)M,1LL<<(62-i));
        Int b=(1LL<<(i+1))-3;
        Int m;
        bool fg=false;
        while(r>=l){
            m=(l+r)>>1LL;
            Int t=sqr(m)+b*m;
            if(t<2*n){
                l=m+1;
            }else if(t>2*n){
                r=m-1;
            }else{
                fg=true;
                break;
            }
        }
        if(!fg)continue;
        if(!(m&1))continue;
        ans.PB((1LL<<i)*m);
    }
    sort(ans.begin(),ans.end());
    if(ans.size()==0)puts("-1");
    FOR(it,ans){
        printf("%I64d\n",(*it));

    }
}
int main() {
    ios_base::sync_with_stdio(0);
    while(~scanf(ll,&n)){
        solve();
    }

















}