#include<iostream>
#include<cmath>
#include<vector>
using namespace std;


double der(double f, double fn, double n, double r, double s, double v, vector <int> coef, vector <int> deri, int p, int q){
if (p<5){
    double fd=0;
    fn=0;
    for (int i=0; i<n; i++){
        fd = fd + deri[i]*pow(v,(deri.size()-1-i));
    }
    for (int i=0; i<n+1; i++){
        fn = fn + coef[i]*pow(v,(coef.size()-1-i));
    }
    v = v - (fn/fd);
    p++;
    return der(f, fn, n, r, s, v, coef, deri, p, q);
}
else{
    return v;
}
}

double bolz(double f, double fn, double n, double r, double s, double v, vector <int> coef, vector <int> deri, int p, int q){
s=0.01;
    if (f<0){
        while(fn<0){
            fn=0;
            for (int i=0; i<n+1; i++){
                fn = fn + coef[i]*pow(r+s,(coef.size()-1-i));
        }
        s = s+0.01;
        }
    v = r+s-0.01;
    fn = 0;
        for (int i=0; i<n+1; i++){
                fn = fn + coef[i]*pow(v,(coef.size()-1-i));
        }
    return der(f, fn, n, r, s, v, coef, deri, p, q);
}
    if (f>0){
        while(fn>0){
            fn=0;
            for (int i=0; i<n+1; i++){
                fn = fn + coef[i]*pow(r+s,(coef.size()-1-i));
        }
        s = s+0.01;
        }
    v = r+s-0.01;
    fn = 0;
        for (int i=0; i<n+1; i++){
                fn = fn + coef[i]*pow(v,(coef.size()-1-i));
        }
    return der(f, fn, n, r, s, v, coef, deri, p, q);
}
}

float sii(double f, double fn, double n, double r, double s, double v, vector <int> coef, vector <int> deri, int p, int q){
f=0;
fn=0;
v = v+0.1;
    for (int i=0; i<n+1; i++){
        f = f + coef[i]*pow(v,(coef.size()-1-i));
    }
    for (int i=0; i<n+1; i++){
        fn = fn + coef[i]*pow(v+0.01,(coef.size()-1-i));
        }
    r = v;
    return bolz(f, fn, n, r, s, v, coef, deri, p, q);
    }


int main(){
    double n, a, r=0, f=0, fn=0, s=0.01, p=0, v=0, q=0, t=0; //n el grau, a els coeficients, r el rang, f la imatge de -r, fn la imatge de una mica més de -r, s el que es va incrementant, p quants cops itera, v el valor de l'arrel, q quantes arrels busca
    vector <int> coef;
    vector <int> deri;
    cout<<"Introduce the degree of the polynomial: ";
    cin>>n;
    q=n;
    cout<<"Introduce the coefficients in order: "<<endl;
    for (int i=0; i<n+1; i++){
        cin>>a;
        coef.push_back(a);
    }
    cout<<"---"<<endl;
    for (int i=0; i<n+1; i++){
        deri.push_back((coef.size()-1-i)*coef[i]);
        r = r + abs(coef[i]);
    }
    deri.pop_back();

    for (int i=0; i<n+1; i++){
        f = f + coef[i]*pow(-r,(coef.size()-1-i));
    }
    for (int i=0; i<n+1; i++){
        fn = fn + coef[i]*pow(-r+s,(coef.size()-1-i));
    }

    v = bolz(f, fn, n, -r, s, v, coef, deri, p, q);
    cout<<v<<endl;
    q = q-1;

    while(q!=0){
        if(v<r){
            v = sii(f, fn, n, r, s, v, coef, deri, p, q);
            cout<<v<<endl;
            q=q-1;
    }

    }
}