//本程序基于.NET平台,编译环境是Microsoft Visual C++ .NET
//对于VC++6.0平台的修改,只须把stdafx.h换成iostream.h,然后去掉主函数里的“using namespace std”
//详情见blog.csdn.net/chinley。
//#include "stdafx.h"
#include "iostream.h"
#include "math.h"
//using namespace std;
double du,dv;
//求解一元二次方程
void solu_w(double b,double c)
{
double tem,tem1;
tem1=b*b-4*c;
double m,n;
m=(-1)*b/2;
//判断是实数解还是复数解。
if (tem1>=0)
{
tem=sqrt(tem1);
n=tem/2;
cout<<"/n方程根为:"<<'/n'<<"/t X1 = "<<m+n<<'/n'<<"/t X2 = "<<m-n<<endl;
}
else
{
tem=sqrt((-1)*tem1);
n=tem/2;
cout<<"/n方程根为:"<<'/n'<<"/t X1 = "<<m<<" + "<<n<<" i"<<'/n'<<"/t X2 = "<<m<<" - "<<n<<" i"<<'/n'<<endl;
}
}
//求解二元一次方程组,其中(a、b、c)、(d、e、f)是方程组两个的系数,一次是常数项、x系数、y系数。
void get_du_dv(double a,double b,double c,double d,double e,double f)
{
dv=(b*d-a*e)/(c*e-b*f);
du=(c*d-a*f)/(b*f-c*e);
}
void main()
{
cout<<"详情见blog.csdn.net/chinley。/n";
int t1,t2,t3;
double * a;
cout<<"输入阶数:";//具体原因待查
cin>>t1;
a=new double [t1];
t3=t2=t1;
cout<<"输入各次项的系数:/n";
for (t1;t1>=0;t1--)
{
cout<<"/ta["<<t1<<"]=";
cin>>a[t1];
}
cout<<"方程为:/n/t";
for (t2;t2>=1;t2--)
{
cout<<a[t2]<<" X^"<<t2<<" + ";
}
cout<<a[0]<<" = 0"<<endl;
double u,v;
cout<<"输入因子的常数项和一次项系数:"<<endl;
cout<<"/t u = ";
cin>>u;
cout<<"/t v = ";
cin>>v;
cout<<"/n因子式为:/n/t w(X) = "<<"X^2 + "<<u<<" (X) + "<<v<<endl;
double p[98],r0,r1;
cout<<"/n输入修正次数: ";
int count1;
cin>>count1;
for (count1;count1>=0;count1--)
{
p[t3]=p[t3-1]=0;
int t4=t3-2;
for (t4;t4>=0;t4--)
{
p[t4]=a[t4+2]-p[t4+2]*v-p[t4+1]*u;
r0=a[1]-v*p[1]-u*p[0];
r1=a[0]-v*p[0];
//下面一行加在程序中,将导致的问题是:如果修正次数太大,程序运行时间大大延长,主要时间消耗在屏幕显示上。
//cout<<"/t p(X) = "<<p[2]<<" (X*X) + "<<p[1]<<" (X) + "<<p[0]<<" = 0"<<endl;
double r0v,r1v,r0u,r1u;
r0v=u*p[2]-p[1];
r1v=v*p[2]-p[0];
r0u=r1v-u*r0v;
r1u=(-1)*v*r0v;
get_du_dv(r0,r0u,r0v,r1,r1u,r1v);
}
u=u+du;
v=v+dv;
}
solu_w(u,v);
}