一元三次方程求解

http://codevs.cn/problem/1038/
二分法初体验。要求精确度为0.01，当相差0.009就可以。
两个值之间大于等于1，循环间隔1.

#include<iostream>
#include<stdio.h>
#include<cmath>
#include<string.h>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
double a,b,c,d;
double daan(double x)
{
    return a*x*x*x+b*x*x+c*x+d;
}
void erfenfa(double low,double hight)
{
    double mid=(low+hight)/2.0;
    if (low+0.009>hight||daan(mid)==0)
    {
        printf("%.2lf ",mid);
    }else if (daan(low)*daan(mid)<0)
    {
        erfenfa(low,mid);
    }else if (daan(mid)*daan(hight)<0)
    {
        erfenfa(mid,hight);
    }
}
int main()
{
    cin>>a>>b>>c>>d;
    for (int i = -100; i <100; ++i)
    {
        /* code */
        if (daan(i)*daan(i+1)<0)
        {
            /* code */
            erfenfa(i,i+1);
        }else if(daan(i)==0)
        {
            cout<<i<<".00 ";
        }
    }
    cout<<endl;
    return 0;
}