百炼 2697:迭代法解方程

#include <iostream>
using namespace std;
double a,b;
double fun(double x)
{
	return x*x*x+x+a;
}
int main()
{
	int T;
	cin>>T;
	for(int o=0;o<T;o++)
	{
		cin>>a>>b;//其中a大于0
		//cout<<-2.726196<<" "<<fun(-2.726196)<<endl;
		double x1=0-a;
		double x2=0;
		double x;
		int i=0;
		while(1)
		{
			i++;
			if(i==40)
			{
				break;
			}
			x=(x2+x1)/2;//题目中有笔误 
			//cout<<x1<<"     "<<fun(x1)<<endl;
			//cout<<x2<<"     "<<fun(x2)<<endl;
			//cout<<x<<"     "<<fun(x)<<endl<<endl;
			if((x2-x1)<b)
			{
				break;
			}
			if(fun(x)>0)
			{
				x2=x;
			}else if(fun(x)<0)
			{
				x1=x;
			}else if(fun(x)==0)
			{
				break;
			} 
		}
		printf("%0.6f %0.6f\n",x,fun(x)); 
		//cout<<x<<" "<<fun(x)<<endl;
	}
	return 0;
}