Submission #992717

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define pb         push_back

typedef long long ll;
const ll INF = 1000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;

int main(void) {
	//ios_base::sync_with_stdio(false);
	//cin.tie(0);
	
	int n;
	cin >> n;

	int mi = INF;
	int a1, a2;
	for(int i=1; i<=n; i++){
		if(n-i > 0 && n-i != i && max(i, n-i) < mi){
			mi = max(i, n-i);
			a1 = i;
			a2 = n-i;
		}
	}

	int sum = 0;
	vector<int> v;
	for(int i=1; i<n/2; i++){
		sum += i;	
		v.push_back(i);
		if(sum == n){
			for(int j=0; j<v.size(); j++){
				cout << v[j] << endl;
			}
			return 0;
		}
	}

	int c1, c2, c3;
	if((n/2) * 2 == n ){
		c1 =  n / 2;
		c2 =  1;
		c3 =  n / 2 - 1;
		if(c1 != c2 && c2 != c3 && c1 != c3){
			cout << c1 << endl;
			cout << c2 << endl;
			cout << c3 << endl;
			return 0;
		}
	}
	if(mi == INF){
		cout << n << endl;
	}else{
		cout << a1 << endl;
		cout << a2 << endl;
	}

	return 0;
}

Submission Info

Judge Result