Submission #992049

---

Source Code Expand

#include <bits/stdc++.h>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef LL ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<pr, ut> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=2*1e+5 + 10;
const ut INF=1<<30;
const ld eps=1e-6;
const LL mod=7+1e+9;

int main() {
	int N;
	cin >> N;
	FOR(i,1,N+1){
		int t = i * (i + 1) / 2;
		if(t >= N){
			FOR(j,1,i+1){
				if(t - N == j)
					continue;
				printf("%d\n", j);
			}
			return 0;
		}
	}
    return 0;	
}

Submission Info

Judge Result