ИТМО 20-21 отбор N2

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}

void cvp(vector <pii> a){
    for (auto p: a){
        cout<<p.first<<' '<<p.second<<"\n";
    }
    cout<<"\n";
}

bool sh=0;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    vector <int> v = {1,1};
    int s = 2,ans=1;
    while (v != vector <int> {5,5}){
        if (s + 1 <= 10){
            v.push_back(1);
            s++;
            ans++;
        }
        else{
            if (v.size() == 3){
                if (sh){
                    cout<<"v\n";
                    cv(v);
                }
                v = {v[0]+1, v[0]+1};
                s = 2*v[0];
                ans++;
                if (sh){
                    cout<<"NOW v\n";
                    cv(v);
                    cout<<"\n";
                }
                continue;
            }
            v[v.size() - 2]++;
            s = s - v[v.size()-1] + 1;
            v.pop_back();
            ans++;
        }
        cv(v);
    }
    cout<<ans;
}