Submission #5430022

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll,ll> > Q;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const ll inf=1e9+7;

int main(){
  int n;
  cin>>n;

  int cnt;
  for(int i=1;i<=cnt;i++){
    if(n>i*(i-1)/2 && n<=i*(i+1)/2){
      cnt=i;
      break;
    }
  }

  int tmp=cnt*(cnt+1)/2-n;

  for(int i=1;i<=cnt;i++){
    if(tmp!=i) cout<<i<<endl;
  }
}

Submission Info

Judge Result