Submission #991913

---

Source Code Expand

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#include <valarray>
#include <stdio.h>
#include <algorithm>
#include <set>
#include <complex>
#include <list>

using namespace std;
typedef long long int LL;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;

#define SORT(c) sort((c).begin(),(c).end())
#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)





int main()
{
	int N;
	cin >> N;
	
	int sum = 0;
	vector<int> a;
	int i = 0;
	while (true)
	{
		i++;
		sum += i;
		a.push_back(i);
		if (sum >= N) {
			a[sum - N - 1] = -1;
			break;
		}
	}
	REP(j, a.size()) {
		if (a[j] != -1) {
			cout << a[j] << endl;
		}
	}
}

Submission Info

Judge Result