Пример #1
0
void main()
{   
	freopen("11036.txt","r",stdin);
	struct stud_node *L,*tail1,*tail2,*p1,*p2,*pre,*NEW;
	int num;
	int size=sizeof(struct stud_node);

	L=tail1=NULL;
	scanf("%d",&num);
	while(num!=-1){
		p1=(struct stud_node *)malloc(size);
		p1->num=num;
		p1->next=NULL;
		if(L==NULL)
		    L=p1;
		else
			tail1->next=p1;
		tail1=p1;
		scanf("%d",&num);
	}

    
    if(L == NULL)
    {
        Ptrint_Stu_Doc(L);
        return;
    }

	if(L != NULL)
        p2 = L;
    dummy=NULL;
	while(p2!= NULL)
    {
        if((p2->num % 2)==0)
        {
        	// current is point to even number
            if(NEW==NULL)
            {
                NEW = p2;
                tail2 = NEW;
            }
            else
            {
                tail2->next = p2;
                tail2 = tail2->next;
            }
            temp=p2->next;
            tail2->next=NULL;
            p2=temp;
            continue;
        }
        p2 = p2->next;
    }

	Ptrint_Stu_Doc(NEW);

	return;

}
Пример #2
0
int main()
{
	struct stud_node *head;
	int min_score;

	head=Creat_Stu_Doc();
	scanf("%d",&min_score);
	head=DeleteDoc(head,min_score);
	Ptrint_Stu_Doc(head);
	return 0;
}
Пример #3
0
int main()
{
	struct stud_node *L,*tail1,*tail2,*p1,*p2,*NEW,*t;
	int num;
	int size=sizeof(struct stud_node);

	L=tail1=NULL;
	scanf("%d",&num);
	while(num!=-1){
		p1=(struct stud_node *)malloc(size);
		p1->num=num;
		p1->next=NULL;
		if(L==NULL)
		    L=p1;
		else
			tail1->next=p1;
		tail1=p1;
		scanf("%d",&num);
	}
	/*---------*/
	
	Ptrint_Stu_Doc(L);
}