山东理工ACM 2116 顺序建链表

#include<stdio.h>
struct lian
{
	int num;
	lian *next;
};

int main()
{   
	int n,i;
     lian *p,*head,*pnext;
	 scanf("%d",&n);
	 for(i=1;i<=n;i++)
	 {
		 p=new lian;
		 if(i==1)
			 head=pnext=p;
		 else  
			 pnext->next=p;
          pnext=p;
		  scanf("%d",&p->num);
	 }
	 pnext->next=NULL;
	 p=head;
	 while(p->next)
	 {
		 printf("%d ",p->num);
		 p=p->next;
	 }
      printf("%d",p->num);
	  printf("/n");
	  return 0;
}