Submission #3609311

---

Source Code Expand

	#include <bits/stdc++.h>
	using namespace std;
	#define IOS ios::sync_with_stdio(false), cin.tie(0)
	#define REP(i, n) for (int i = 0; i < n; i++)
	#define FOR(i, a, b) for (int i = a; i < b; i++)
	#define ALL(x) (x).begin(), (x).end()
	#define dump(x) cout << (x) << endl
	#define LMAX 9223372036854775807LL
	#define LMIN -9223372036854775807LL

	using ll = long long;
	template<typename T>
	using vec = vector<T>;
	using P = pair<ll, ll>;

	template <typename A, size_t N, typename T>
	void Fill(A (&array)[N], const T &val){
		fill((T *)array, (T *)(array + N), val);
	}
	
	const ll INF = 1e16;
	const ll MOD = 1e9 + 7;

	//int dx[4] = {1,0,-1,0};
	//int dy[4] = {0,1,0,-1};
	//ll pas[51][52];
	
	signed main(){
		IOS;
		int n;
		cin >> n;
		ll unko;
		ll homo;
		for(int i = 1;i <= n;i++){
			int j = i * (i + 1) / 2;
			if(j >= n){
				unko = i;
				homo = j; 
				break;
			}
		}
		ll chokudai = homo - n;
		for(int i = 1;i <= unko;i++){
			if(i != chokudai)dump(i);
		}
	}

Submission Info

Judge Result