Submission #991897

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
 
using namespace std;
int solve(int n)
{
  if(n==0) return 0;
  REP(i,5000)
  if(i*(i+1)/2>n){
    cout << i+1 << endl;
    return solve(n-i+1);
  }
  return 1;
}
int main(void)
{
  int n;
  cin >> n;
  solve(n); 
  return 0;
}

Submission Info

Judge Result