Submission #992443

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;

int N;
set<int> S;

int main(){
  cin >> N;
  S.insert( N );
  while( 1 ){
    auto it = S.end();
    it--;
    int n = *it;
    // cout << "n=" << n << endl;
    int p, q;
    if( n % 2 == 0 ){
      p = n/2 - 1;
      q = n/2 + 1;
    }else{
      p = n/2;
      q = n/2 + 1;
    }
    if( S.find( p ) == S.end() && S.find( q ) == S.end() ){
      // cout << "ins " << n << " -> "  << p << " " << q << endl;
      S.erase( n );
      S.insert( p );
      S.insert( q );
    }else{
      break;
    }
  }
  for( auto a : S ){
    cout << a << endl;
  }
}

Submission Info

Judge Result