Submission #991905

---

Source Code Expand

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

//#define int long long
#define DEBUG 0
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) if(DEBUG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DEBUG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
using pii = pair<int, int>; using vi = vector<int>;
static const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
static const int MOD = (int)(1e9 + 7);
#define MAX 20000010
signed main() {
	int N; cin >> N;
	int dp[MAX] = {1};
	
	rep(i, 0, N) {
		rep(j, 0, i) {
			if (dp[j] == 0)continue;
			dp[j + i] = max(dp[j], i);
			if (dp[N] > 0)break;
		}
	}
	cout << dp[N] << endl;
	return 0;
}

Submission Info

Judge Result