Submission #991845

---

Source Code Expand

#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())


using namespace std;



int main(){
	int n;
	cin>>n;
	vector<int> v;
	int s=0, ma;
	for (int i=1;;i++){
		s+=i;
		if (s >= n){
			ma = i;
			break;
		}
	}
	int er = -1;
	if (s>n){
		er=s-n;
	}
	for (int i=1;i<=ma;i++){
		if (er!=i)cout<<i<<endl;
	}



	return 0;
}

Submission Info

Judge Result