7-4 求一元二次方程的根 (20分)
本题目要求一元二次方程的根,结果保留2位小数。
输入格式:
输入在一行中给出3个浮点系数a、b、c
,中间用空格分开。
输出格式:
根据系数情况,输出不同结果:
1)如果方程有两个不相等的实数根,则每行输出一个根,先大后小;
2)如果方程有两个不相等复数根,则每行按照格式“实部+虚部i”输出一个根,先输出虚部为正的,后输出虚部为负的;
3)如果方程只有一个根,则直接输出此根;
4)如果系数都为0,则输出"Zero Equation"
;
5)如果a和b为0,c不为0,则输出"Not An Equation"
。
输入样例1:
2.1 8.9 3.5
输出样例1:
-0.44
-3.80
输入样例2:
1 2 3
输出样例2:
-1.00+1.41i
-1.00-1.41i
输入样例3:
0 2 4
输出样例3:
-2.00
输入样例4:
0 0 0
输出样例4:
Zero Equation
输入样例5:
0 0 1
输出样例5:
Not An Equation
方程 :
a x 2 + b x + c = 0 ax^2+bx+c=0 ax2+bx+c=0
-
Δ = b 2 − 4 a c \Delta=b^2-4ac Δ=b2−4ac
-
如果 Δ > 0 \Delta>0 Δ>0则有
2
个不同的实数根- x = − b + b 2 − 4 a c 2 a x=\frac{-b+\sqrt{b^2-4ac}}{2a} x=2a−b+b2−4ac
- x = − b + b 2 − 4 a c 2 a x=\frac{-b+\sqrt{b^2-4ac}}{2a} x=2a−b+b2−4ac
-
如果 Δ = = 0 \Delta==0 Δ==0则有两个
相等
的实数根- x 1 = x 2 = − b 2 a x1=x2=-\frac{b}{2a} x1=x2=−2ab
-
如果 Δ < 0 \Delta<0 Δ<0则有两个共轭复根
- x = − b 2 a + i 4 a c − b 2 2 a x=-\frac{b}{2a}+i\frac{\sqrt{4ac-b^2}}{2a} x=−2ab+i2a4ac−b2
- x = − b 2 a − i 4 a c − b 2 2 a x=-\frac{b}{2a}-i\frac{\sqrt{4ac-b^2}}{2a} x=−2ab−i2a4ac−b2
只得了18
分的代码,留着以后看看
#define debug
#ifdef debug
#include <time.h>
#include "/home/majiao/mb.h"
#endif
#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
#define MAXN ((int)1e5+7)
#define ll long long
#define int double
#define INF (0x7f7f7f7f)
#define fori(lef, rig) for(int i=lef; i<=rig; i++)
#define forj(lef, rig) for(int j=lef; j<=rig; j++)
#define fork(lef, rig) for(int k=lef; k<=rig; k++)
#define QAQ (0)
using namespace std;
#define show(x...) \
do { \
cout << "\033[31;1m " << #x << " -> "; \
err(x); \
} while (0)
void err() { cout << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cout << a << ' '; err(x...); }
namespace FastIO {
char print_f[105];
void read() { }
void print() { putchar('\n'); }
template <typename T, typename... T2>
inline void read(T &x, T2 &... oth) {
x = 0;
char ch = getchar();
ll f = 1;
while (!isdigit(ch)) {
if (ch == '-') f *= -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - 48;
ch = getchar();
}
x *= f;
read(oth...);
}
template <typename T, typename... T2>
inline void print(T x, T2... oth) {
ll p3=-1;
if(x<0) putchar('-'), x=-x;
do{
print_f[++p3] = x%10 + 48;
} while(x/=10);
while(p3>=0) putchar(print_f[p3--]);
putchar(' ');
print(oth...);
}
} // namespace FastIO
using FastIO::print;
using FastIO::read;
int eps = 0.0000000;
signed main() {
#ifdef debug
freopen("test", "r", stdin);
// freopen("out_main", "w", stdout);
clock_t stime = clock();
#endif
int a, b, c, delta;
cin >> a >> b >> c;
if(a==eps && b==eps && c==eps) {
printf("Zero Equation\n");
return 0;
} else if(a==eps && b==eps && c!=eps) {
printf("Not An Equation\n");
return 0;
} else if(a==eps) {
printf("%.2lf\n", (-c)/b);
return 0;
}
delta = b*b - 4*a*c;
if(delta > eps) { //两个实根
int x1 = ((-b)+sqrt((b*b-4*a*c))) / (2*a);
int x2 = ((-b)-sqrt((b*b-4*a*c))) / (2*a);
printf("%.2lf\n%.2lf\n", max(x1, x2), min(x1, x2));
} else if(delta == eps) { //相等的实根
int x1 = -(b/(2*a));
if(x1 == -eps)
printf("0.00\n");
else
printf("%.2lf\n", x1);
} else { //共轭复根
int lef = -(b/(2*a)), rig = (sqrt((4*a*c-b*b))) / (2*a);
rig = fabs(rig);
printf("%.2lf+%.2lfi\n", lef, rig);
printf("%.2lf-%.2lfi\n", lef, rig);
}
#ifdef debug
clock_t etime = clock();
printf("rum time: %lf 秒\n",(double) (etime-stime)/CLOCKS_PER_SEC);
#endif
return 0;
}