nuxiangdang.txt

VC++geidajia VC++geidajia

/*#include <iostream.h>
int ji(int n)
{  	int ji=1;
    if(n<0)
	{cout<<"请输入正整数";}
   if(n==0)    {ji=1;}
    if(n>0)
	{
	  for(int i=1;i<n+1;i++)
	   {ji=ji*i;}	  
        }
	return ji;
}
void main()
{	int n=10;
    int array[10][10]={1};
	cout<<array[0][0]<<endl;
	for(int i=1;i<n;i++)
	{   		
		for(int j=0;j<i+1;j++)
		{
		  array[i][j]=ji(i)/(ji(j)*ji(i-j));
		  cout<<array[i][j]<<"     ";
	}
	    cout<<endl;
	}
}


#include <iostream.h>
#include <math.h>
double zsz(double x0,double e)
{ 	double f,f1;
	while (fabs(f/f1)>e)
	{	while (fabs(f)>e)
		{	x0=x0-f/f1;
            f=2*x0*x0*x0-4*x0*x0+3*x0-6;
	        f1=6*x0*x0-8*x0+3;
		}
	}
	return x0;
}
void main()
{	double x0,x,e;
	cout<<"请输入所求根的大体位置x0"<<endl;
	cin>>x0;
	cout<<"请输入精度ε"<<endl;
	cin>>e;
	x=zsz(x0,e);
	cout<<x0<<"附近的根为"<<x<<endl;
}
*/



#include <iostream.h>
void main()
{	int n=8,sum=1;
	int array[8]={0,1};
	for (int i=2;i<n;i++)
	{   	array[i]=array[i-1]+array[i-2];
		sum+=array[i];
	}
	cout<<"第"<<n<<"项："<<array[n-1]<<endl;
	cout<<"sum="<<sum<<endl;
}