对于一元二次方程 $$ax^2 + bx + c = 0,解可以分为很多情况。若该方程有两个不相等实根,首先输出1,换行,然后从小到大输出两个实根,换行;若该方程有两个相等实根,首先输出2,换行,然后输出这个这个实根,换行;若该方程有一对共轭复根,输出3,换行;若该方程无解,输出4,换行;若该方程有无穷个解,输出5,换行;若该方程只有一个根,首先输出6,换行,然后输出这个跟,换行;要求使用 c++ class 编写程序。可以创建如下 class #include <iostream> #include <cmath> using namespace std; class Equation{ private: int _a, _b, _c; public: Equation(int a, int b, int c){ } void solve(){ } }; int main(){ int a, b, c; cin >> a >> b >> c; Equation tmp(a, b, c); tmp.solve()


```cpp #include <iostream> #include <cmath> using namespace std; class Equation { private: int _a, _b, _c; public: Equation(int a, int b, int c) : _a(a), _b(b), _c(c) {} void solve() { double discriminant = _b * _b - 4 * _a * _c; if (_a == 0) { if (_b == 0) { if (_c == 0) { cout << "5" << endl; } else { cout << "4" << endl; } } else { double root = -_c / _b; cout << "6" << endl << fixed << setprecision(2) << root << endl; } } else { if (discriminant > 0) { double root1 = (-_b + sqrt(discriminant)) / (2 * _a); double root2 = (-_b - sqrt(discriminant)) / (2 * _a); cout << "1" << endl << fixed << setprecision(2) << min(root1, root2) << endl << fixed << setprecision(2) << max(root1, root2) << endl; } else if (discriminant == 0) { double root = -_b / (2 * _a); cout << "2" << endl << fixed << setprecision(2) << root << endl; } else { cout << "3" << endl; } } } }; int main() { int a, b, c; cin >> a >> b >> c; Equation tmp(a, b, c); tmp.solve(); } ``` 额外需要注意的逻辑点: 1. 对于浮点数的输出格式控制,确保精度符合要求。 2. 处理特殊情况,如系数为 0 时的各种可能性。 3. 对输入的系数范围进行有效的校验。 [2025-03-07 12:49:26 | AI写代码神器 | 481点数解答]
- 对于一元二次方程 $$ax^2 + bx + c = 0,解可以分为很多情况。若该方程有两个不相等实根,首先输出1,换行,然后从小到大输出两个实根,换行;若该方程有两个相等实根,首先输出2,换行,然后输出这个这个实根,换行;若该方程有一对共轭复根,输出3,换行;若该方程无解,输出4,换行;若该方程有无穷个解,输出5,换行;若该方程只有一个根,首先输出6,换行,然后输出这个跟,换行;要求使用 c++ class 编写程序。可以创建如下 class #include <iostream> #include <cmath> using namespace std; class Equation{ private: int _a, _b, _c; public: Equation(int a, int b, int c){ } void solve(){ } }; int main(){ int a, b, c; cin >> a >> b >> c; Equation tmp(a, b, c); tmp.solve()(481点数解答 | 2025-03-07 12:49:26)102
- using communication_protocols; using FTS_F02391A; using NLog; using ScottPlot.Plottable; using Sunny.UI; using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading; using System.Threading.Tasks; using System.Windows.Forms; namespace 窗体界面设计 { public partial class FormHome : UIPage { private readonly DataLogger Log1;//波形图数据记录器 bool bViewSlide = false(562点数解答 | 2025-07-09 16:57:56)68
- 快速排序:# include< iostream>using namespace std;# include< stdlib. h># include< time. h>const int n =10;const int min= 10;const int max=99;int getrand( int min, int max){return ( rand()%( max-min+1)+ min);}void set( int r[], int n){int i;for(i=0;i<n;i++)r[i]=getrand(min, max);}void show( int r[], int n){int i;for(i=0;i<n;i++)cout << r[i]<<" ";cout << endl;}int partition( int r[], int i, int j){//由你完成}void quicksort( int r[], int i, int j){//由你完成}int main(){srand( time(0));int a[n];set(a, n);cout<<"(710点数解答 | 2024-11-14 10:44:25)207
- 快速排序:# include< iostream>using namespace std;# include< stdlib. h># include< time. h>const int n =10;const int min= 10;const int max=99;int getrand( int min, int max){return ( rand()%( max-min+1)+ min);}void set( int r[], int n){int i;for(i=0;i<n;i++)r[i]=getrand(min, max);}void show( int r[], int n){int i;for(i=0;i<n;i++)cout << r[i]<<" ";cout << endl;}int partition( int r[], int i, int j){//由你完成}void quicksort( int r[], int i, int j){//由你完成}int main(){srand( time(0));int a[n];set(a, n);cout<<"(951点数解答 | 2024-11-14 10:46:29)201
- 快速排序:# include< iostream>using namespace std;# include< stdlib. h># include< time. h>const int n =10;const int min= 10;const int max=99;int getrand( int min, int max){return ( rand()%( max-min+1)+ min);}void set( int r[], int n){int i;for(i=0;i<n;i++)r[i]=getrand(min, max);}void show( int r[], int n){int i;for(i=0;i<n;i++)cout << r[i]<<" ";cout << endl;}int partition( int r[], int i, int j){//由你完成}void quicksort( int r[], int i, int j){//由你完成}int main(){srand( time(0));int a[n];set(a, n);cout<<"(472点数解答 | 2024-11-14 10:51:44)182
- #include<iostream> using namespace std;#include<stdlib.h>#include<time.h> const int n =10; const int min =10; const int max =99; int getrand(int min, int max) { return (rand() % (max - min +1) + min); void set(int r[], int n){ int i; for(i = 0; i< n; i++) r[i] = getrand(min,max); void show(int r[], int n) { int i; for (i = 0; i<n;i++) cout << r[i] << ""; cout << endl;}void sift(int r[],int m,int k){ } void heapsort(intr[], int n){ //由你完成 int main(){ srand(time(0)); int a[n]; set(a,n); cout <<"原序(417点数解答 | 2024-11-28 11:20:23)253
- #include <iostream> #include <vector> #include <algorithm> #include <qcoreapplication> int main(int argc, char *argv[]) { qcoreapplication a(argc, argv); int minsize, maxsize, n; std::cin >> minsize >> maxsize; std::cin >> n; std::vector<int> fishsize(n); for (int i = 0; i < n; ++i) { std::cin >> fishsize[i]; } std::sort(fishsize.begin(), fishsize.end()); int safecount = 0; for (int size = minsize; size <= maxsize; ++size) { bool issaf(123点数解答 | 2024-12-01 23:56:16)139
- #include<iostream> using namespace std;#include<stdlib.h>#include<time.h> const int n =10; const int min =10; const int max =99; int getrand(int min, int max) { return (rand() % (max - min +1) + min); void set(int r[], int n){ int i; for(i = 0; i< n; i++) r[i] = getrand(min,max); void show(int r[], int n) { int i; for (i = 0; i<n;i++) cout << r[i] << ""; cout << endl; void heapsort(intr[], int n){ //由你完成 int main(){ srand(time(0)); int a[n]; set(a,n); cout <<"原序列:"; show(a,n); cout <<"新序列:\n"; h(684点数解答 | 2024-11-28 11:21:15)201
- #include<iostream> using namespace std; class shizheng { private: int speed; static int shitime; public: shizheng() { speed = 0; shitime = 0; } shizheng(int newspeed, int newshitime) { speed = newspeed; shitime = newshitime; } void shizhengmove() { cout << "shizheng moved" << endl; } void setshizheng() { speed = 0; shitime = 0; } int showshitime() { return shitime+speed; } }; class fenzheng { private: int speed; int fentime; public: fenzheng() { speed = 0; fentime = 0; } fenzheng(int(493点数解答 | 2024-11-11 23:52:44)120
- #include<iostream> using namespace std;#include<stdlib.h>#include<time.h> const int n=10; const int min=10; const int max=99; int getrand(inmin,int max) { return (rand()%(max-min+1)+min); void set(int r[],int n) { int i; for(i=0; i<n; i++) r[i]=getrand(min,max); void show(intr[],int n){ int i; for(i=0; i<n; i++) cout<<r[i]<<""; cout<<endl; void insertsort(int r[],int n){//由你完成} int main() { srand(time(0)); int a[n]; set(a,n); cout<<"原序列:"; show(a,n); cout<<"新序列: \n; insertsort(a,n);//show(a,n);(690点数解答 | 2024-10-31 10:11:20)199
- #include<iostream> using namespace std;#include<stdlib.h>#include<time.h> const int n=10; const int min=10; const int max=99; int getrand(inmin,int max) { return (rand()%(max-min+1)+min); void set(int r[],int n) { int i; for(i=0; i<n; i++) r[i]=getrand(min,max); void show(intr[],int n){ int i; for(i=0; i<n; i++) cout<<r[i]<<""; cout<<endl; void insertsort(int r[],int n){//由你完成} int main() { srand(time(0)); int a[n]; set(a,n); cout<<"原序列:"; show(a,n); cout<<"新序列: \n; insertsort(a,n);//show(a,n);(147点数解答 | 2024-10-31 10:29:38)210
- #include<iostream> using namespace std;#include<stdlib.h>#include<time.h> const int n=10; const int min=10; const int max=99; int getrand(inmin,int max) { return (rand()%(max-min+1)+min); void set(int r[],int n) { int i; for(i=0; i<n; i++) r[i]=getrand(min,max); void show(intr[],int n){ int i; for(i=0; i<n; i++) cout<<r[i]<<""; cout<<endl; void insertsort(int r[],int n){//由你完成} int main() { srand(time(0)); int a[n]; set(a,n); cout<<"原序列:"; show(a,n); cout<<"新序列: \n; insertsort(a,n);//show(a,n);(703点数解答 | 2024-10-31 10:35:24)199