Submission #3596236

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define INF 1<<30
#define LINF 1LL<<62
#define all(x) (x).begin(), (x).end()
#define mp make_pair
const int MOD = 1000000007;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

int main(){
   int n;
   cin >> n;
   int s = 0;
   while(s*(s+1)<2* n){
       s++;
   }
   if(s*(s+1)!=2*n){
       cout << "No" << endl;
       return 0;
   }
   vector<int> v[s+1];
   int count = 1;
   REP(i, s){
       FOR(j, 1, s-i+1){
           v[i].push_back(count);
           v[i+j].push_back(count);
           count++;
       }
   }
   cout << "YES" << endl;
   cout << s+1 << endl;
   REP(i,s+1){
       REP(j,v[i].size()){
           cout << v[i][j];
           if(j!=v[i].size()-1){
               cout << " ";
           }else{
               cout << "\n";
           }
       }
   }
   

    


}

Submission Info

Judge Result