adaptive algo

#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
int main()
{
    int n;
    cin >> n;
    cout << setprecision(10) << fixed;
    vector<double> vc(n+1), counts(n+1, 1);
    double allcnt = n;
    vc[0] = 0;
    for(int i = 0; i < n; i++)
      vc[i+1] = 1.0/n;
    double a = 0, b = 1;
    string str;
    cin >> str;
    for(int k = 0; k <= str.size(); k++) {
        vector<double> res(n+1);
        cout << k+1 << ". (" << str[k] << ") " << " a: " << a << " b: " << b << endl;
        double sm = 0, dif = b-a;
        res[0] = a;
        for(int i = 1; k != str.size() && i <= n; i++) {
            sm += vc[i];
            cout << a + dif*sm << " _ ";
            res[i] = a+dif*sm;
        }
        cout << endl;
        for(int i = 1; i<vc.size(); i++)
            cout << vc[i] << ", ";
        //res.push_back(b);

        if(k != str.size()) {
          int ind = str[k]-'0';
          a = res[ind-1];
          b = res[ind];
          counts[ind]++;
          allcnt++;
          for(int i = 1; i < vc.size(); i++)
            vc[i] = counts[i]/allcnt;
          cout << endl << endl;
        } else
          cout << "<-- result";
        //cout << endl << endl;
    }

    return 0;
}




#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<double> vc(n+1);
    vc[0] = 0;
    for(int i = 0; i < n; i++)
      cin >> vc[i+1];
    double a, b;
    cin >> a >> b;
    string str;
    cin >> str;
    for(int k = 0; k <= str.size(); k++) {
    vector<double> res(n+1);
    cout << k+1 << ". a: " << a << " b: " << b << endl;
    double sm = 0, dif = b-a;
    res[0] = a;
    for(int i = 1; k != str.size() && i <= n; i++) {
        sm += vc[i];
        cout << a + dif*sm << " _ ";
        res[i] = a+dif*sm;
    }
    //res.push_back(b);

    if(k != str.size()) {
      int ind = str[k]-'0';
      a = res[ind-1];
      b = res[ind];
      cout << endl << endl;
    } else
      cout << "<-- result";
    //cout << endl << endl;
    }

    return 0;
}f