Submission #991884

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

std::vector<int> v;

ll N;

bool can(ll x){
    v.clear();

    int rest = N;
    for(int i=x;i>0;--i){
        if(rest >= i){
            v.emplace_back(i);
            rest -= i;
        }
    }

    // std::cout << x << ": " << rest << std::endl;
    return rest == 0;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;

    // if minimizing, lb satisfies lb > ub
    // if maximizing, lb satisfies lb < ub
    ll lb = N, ub = 0;
    
    while(std::abs(ub - lb) > 1){
        ll mid = (lb + ub) / 2;
        
        if(can(mid)){
            // std::cout << "ok: " << mid << std::endl;
            lb = mid;
        }else{
            // std::cout << "ng: " << mid << std::endl;
            ub = mid;
        }
    }

    // std::cout << lb << std::endl;
    
    can(lb);

    for(int x : v){
        std::cout << x << std::endl;
    }
}

Submission Info

Judge Result