Submission #991626

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <utility>

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

const int INF = 1001001001;

signed main()
{
    int n;
    cin >> n;
    
    int a = 0;
    rep(i, n){
        a += i+1;
        
        if(a >= n){
            rep(j, i+1){
                if(j+1 != a-n){
                    cout << j+1 << endl;
                }
            }
            break;
        }
    }
}

Submission Info

Judge Result