Submission #11630359

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(){
  int n = 0;
  cin >> n;
  int memo = 0;
  memo = sqrt(n * 2);
  int maxscore = 0;
  maxscore = n + 1;
  for(int i = memo - 1;i <= memo + 1;i++){
    if((1 + i) * i / 2 >= n){
      maxscore = min(i,maxscore);
    }
  }
  ll goukei = 0;
  goukei = (1 + maxscore) * maxscore / 2;
  //cout << goukei << endl;
  for(int i = 1;i <= maxscore;i++){
    if(i != goukei - n)cout << i << endl;
  }
  return 0;
}

Submission Info

Judge Result