C++编程练习——2014/3/11

对应21-25题

1

#include
class NODE
{
public:
	int data;
	NODE *next;
};
void fun(NODE *list,int x)
{
	NODE *u,*v,*p;
	u=list;
	v=u->next;
	while(v!=NULL&&xdata)
	{
		u=v;
		v=v->next;
	}
	if(v==NULL||x>v->data)
	{
		p=new NODE;
		p->data=x;
		p->next=v;
		u->next=p;
	}

}
void main()
{
	int x;
	NODE *head,*p;
	head =new NODE;
	head->next=NULL;
	std::cout<<"Enter integers,end with 0"<>x;
		if(x==0)
			break;
		fun(head,x);
	}
	for(p=head->next;p!=NULL;p=p->next)
		std::cout<data<<' ';
	std::cout<next;
		delete head;
		head=p;
	}while(p);
	
}

2.

#include 
#define N 100
int a[N][N];
int fun(int n)
{
	int max[N];

	for(int i=0;ia[i][j]?max[i]:a[i][j];
		}
	}
	int min=max[0];
	for(int k=1;k>n;
	for(int i=0;i>a[i][j];
		}
		cout<<"The min of max numbers is "<

3.

#include
void fun(int N[4])
{
	for(int i=0;i<4;i++)
		for(int j=0;j<4;j++)
			for(int k=0;k<4;k++)
			{
				if(j!=k&&k!=i&&N[i]!=0)
					cout<

4.

#include
#include
void fun()
{
	long n=0,x,y;
	while(n<100000)
	{
		x=sqrt(n+100);
		y=sqrt(n+268);
		if(x*x==(n+100)&&y*y==(n+268))
			cout<

5.

#include 
#include 
int fun(int n)
{
	int x,y,i,j,k;
  	x=((n%10)+3)%9;//the forth
    y=(((n/10)%10)+3)%9;//the third
    i=((n/100)%10+3)%9;//the second
	j=((n/1000)+3)%9;//the first
	k=1000*x+100*y+10*i+j;
	return k;

}
int main()
{
	int i=1234;
	cout<

21题没懂。。