解方程组ax^2+bx+c=0

这段代码展示了如何用C++解决二次方程ax^2 + bx + c = 0的情况,包括实数解、双实数解和复数解。程序首先检查a是否为零,然后计算判别式并根据其值输出相应的解。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >


#include<iostream>
#include<cmath>
using namespace std;

int main(void)
{
	double a,b,c;
	while(cin >> a >> b >> c)
	{
		if(fabs(a)<1e-15) {
			cout << '(' <<a << ')' << "*x^2" << '+' << '(' << b << ')' << "*x"
				<< '+' << '(' << c << ')' << " = 0" 
				<<" is not a quadratic equation." << endl;
			if(fabs(b)<1e-15 && fabs(c)<1e-15) {
				cout << "Sln: x = 0" << endl;
			} else if(fabs(b)<1e-15) {
				cout << "No Sln." << endl;
			} else {	//b != 0.
				cout << "Sln: " << -c/b << endl;
			}
		} else {
			cout << '(' <<a << ')' << "*x^2" << '+' << '(' << b << ')' << "*x"
				<< '+' << '(' << c << ')' << " = 0" 
				<< " is a quadratic equation." << endl;
			double delt = b*b-4*a*c;
			double p = -b/(2*a), q = sqrt(fabs(delt))/(2*a);
			if(fabs(delt)<1e-15) {
				cout << "Sln: x1 = x2 = " << -b/(2*a) << endl;
			} else if(delt > 1e-15) {
				//double p = -b/(2*a), q = sqrt(delt)/(2*a);
				cout << "Sln: x1 = " << p+q <<", x2 = " << p-q << '.' << endl;
			} else {
				cout << "Sln: x1 = " << p << '+' << q << 'i' << ','
						<< " x2 = " << p << '-' << q << "i." << endl;
			}
		}
	}
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值