ALGO-23 一元三次方程求解
资源限制
时间限制:1.0s 内存限制:256.0MB
问题描述
有形如:ax3+bx2+cx+d=0 这样的一个一元三次方程。给出该方程中各项的系数(a,b,c,d 均为实数),并约定该方程存在三个不同实根(根的范围在-100至100之间),且根与根之差的绝对值>=1。要求三个实根。。
输入格式
四个实数:a,b,c,d
输出格式
由小到大依次在同一行输出这三个实根(根与根之间留有空格),并精确到小数点后2位
测试样例
输入:
1 -5 -4 20
输出:
-2.00 2.00 5.00
数据规模与约定
|a|,|b|,|c|,|d|<=10
AC code:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double a = sc.nextDouble(), b = sc.nextDouble(), c = sc.nextDouble(), d = sc.nextDouble();
for (double x = -100; x <= 100; x += 0.01)
if (Math.abs(a * x * x * x + b * x * x + c * x + d) < 0.01) System.out.printf("%.2f ", x);
}
}
枚举,省事
区间枚举:
import java.util.Scanner;
public class Main {
static double a, b, c ,d;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
a = sc.nextDouble(); b = sc.nextDouble(); c = sc.nextDouble(); d = sc.nextDouble();
for (double i = -100; i < 100; i++) {
double left = i, right = i + 1;
if (f(i) == 0) System.out.printf("%.2f ", i);
else if (f(i) * f(right) < 0) {
while (right - left >= 0.001) {
double mid = (left + right) / 2;
if (f(left) * f(mid) <= 0) right = mid;
else left = mid;
}
System.out.printf("%.2f ", left);
}
}
}
static double f(double x) { return a * x * x * x + b * x * x + c * x + d; }
}