Submission #991873

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef long double LD;
typedef pair<LD, int> PLDI;
typedef pair<LD, LD> PLDLD;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define ALL(a) a.begin(),a.end()
const int INF = (1e9);
const LL MOD = 1e9+7;
const double PI=atan2(0,-1);


int main()
{
    int n,x;
    cin>>n;
    x=(int)sqrt(2*n);
    while((x+x*x)/2<n) x++;
    for(int i=x;i>0;i--)
    {
        if(n>=i)
        {
            cout<<i<<endl;
            n-=i;
        }
    }
}

Submission Info

Judge Result