NOJ：二分查根

#include <stdio.h>
#include <stdlib.h>
int main()
{
    int m=1;
    double left,right;
    scanf("%lf %lf",&left,&right);
    double x;
    x=(left+right)/2;
        for(m=1;;m++)
    {
        if((2*x*x*x-4*x*x+3*x-6)*(2*left*left*left-4*left*left+3*left-6)>0)
        {
            left=x;
            right=right;
            x=0.5*(left+right);

        }
        else if((2*x*x*x-4*x*x+3*x-6)*(2*left*left*left-4*left*left+3*left-6)<0)
        {
            left=left;
            right=x;
            x=0.5*(left+right);

        }
        else if((2*x*x*x-4*x*x+3*x-6)*(2*left*left*left-4*left*left+3*left-6)==0)
        {

            break;
        }
    }
    printf("%.2lf\n",x);
    return 0;
}