一元三次方程求解
Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)
Total Submission(s) : 43 Accepted Submission(s) : 9
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
有形如:ax^3+bx^2+cx+d=0这样的一个一元三次方程。给出该方程中各项的系数(a,b,c,d均为实数),并约定该方程存在三个不同实根(根的范围在-100至100之间),且根与根之差的绝对值>=1。
要求由小到大依次在同一行输出这三个实根(根与根之间留有空格),并精确到小数点后2位。
提示:记方程f(x)=0,若存在2个数x1和x2,且x1<x2,f(x1)*f(x2)<0,则在(x1,x2)之间一定有一个根。
要求由小到大依次在同一行输出这三个实根(根与根之间留有空格),并精确到小数点后2位。
提示:记方程f(x)=0,若存在2个数x1和x2,且x1<x2,f(x1)*f(x2)<0,则在(x1,x2)之间一定有一个根。
Input
输入有多行测试数据,每行为四个系数a,b,c,d,输入以0 0 0 0结束。
Output
对于每组测试数据,输出一个三个实根(根与根之间留有空格),并精确到小数点后2位。
Sample Input
1 -5 -4 20 0 0 0 0
Sample Output
-2.00 2.00 5.00
/*暴力二分,求出极值点 然后从-100到第一个极值点,两个极值点,第二个极值点到100分别2分搜索答案*/
#include<iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
double a,b,c,d;
double ans1,ans2,ans3;
double aa,bb;
double hanshu(double x)
{
return a*x*x*x+b*x*x+c*x+d;
}
double fun1(double left,double right)
{
double mid;
while(right-left>1e-6)
{
mid=(left+right)/2.0;
if(hanshu(mid)==0.0) break;
if(hanshu(left)*hanshu(mid)<0) right=mid;
else
left=mid;
}
return (left+right)/2.0;
}
double fun2(double left,double right)
{
double mid;
while(right-left>1e-6)
{
mid=(left+right)/2.0;
if(hanshu(mid)==0.0) break;
if(hanshu(left)*hanshu(mid)<0) right=mid;
else
left=mid;
}
return (left+right)/2.0;
}
double fun3(double left,double right)
{
double mid;
while(right-left>1e-6)
{
mid=(left+right)/2.0;
if(hanshu(mid)==0.0) break;
if(hanshu(left)*hanshu(mid)<0) right=mid;
else
left=mid;
}
return (left+right)/2.0;
}
int main ()
{ while (scanf("%lf%lf%lf%lf",&a,&b,&c,&d))
{
if(a==0&&b==0&&c==0&&d==0)
break;
aa=(-b-sqrt(b*b-3*a*c))/(a*3.0);
bb=(-b+sqrt(b*b-3*a*c))/(a*3.0);
ans1=fun1(-100.00,aa);
ans2=fun2(aa,bb);
ans3=fun3(bb,100.00);
printf("%.2f %.2f %.2f\n",ans1,ans2,ans3);
}
return 0;
}
/*暴力二分,求出极值点 然后从-100到第一个极值点,两个极值点,第二个极值点到100分别2分搜索答案*/
#include<iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
double a,b,c,d;
double ans1,ans2,ans3;
double aa,bb;
double hanshu(double x)
{
return a*x*x*x+b*x*x+c*x+d;
}
double fun1(double left,double right)
{
double mid;
while(right-left>1e-6)
{
mid=(left+right)/2.0;
if(hanshu(mid)==0.0) break;
if(hanshu(left)*hanshu(mid)<0) right=mid;
else
left=mid;
}
return (left+right)/2.0;
}
double fun2(double left,double right)
{
double mid;
while(right-left>1e-6)
{
mid=(left+right)/2.0;
if(hanshu(mid)==0.0) break;
if(hanshu(left)*hanshu(mid)<0) right=mid;
else
left=mid;
}
return (left+right)/2.0;
}
double fun3(double left,double right)
{
double mid;
while(right-left>1e-6)
{
mid=(left+right)/2.0;
if(hanshu(mid)==0.0) break;
if(hanshu(left)*hanshu(mid)<0) right=mid;
else
left=mid;
}
return (left+right)/2.0;
}
int main ()
{ while (scanf("%lf%lf%lf%lf",&a,&b,&c,&d))
{
if(a==0&&b==0&&c==0&&d==0)
break;
aa=(-b-sqrt(b*b-3*a*c))/(a*3.0);
bb=(-b+sqrt(b*b-3*a*c))/(a*3.0);
ans1=fun1(-100.00,aa);
ans2=fun2(aa,bb);
ans3=fun3(bb,100.00);
printf("%.2f %.2f %.2f\n",ans1,ans2,ans3);
}
return 0;
}