c链表

#include<stdio.h>

struct Node

{

int shi;

int xu;

struct Node *next;

};

struct Node *createList(int n)

{

struct Node *headNode=(struct Node *)malloc(sizeof(struct Node));

if(headNode==NULL)

printf("error"),exit(0);

headNode->shi=0;

headNode->xu=0;

headNode->next=NULL; 

struct Node *p=headNode;

while(n>0)

{

struct Node *newNode=(struct Node *)malloc(sizeof(struct Node));

if(newNode==NULL)

printf("error"),exit(0);

headNode->next=newNode;

scanf("%d %d",&newNode->shi,&newNode->xu);

newNode->next=NULL;

headNode=headNode->next;

n--;

}

return p;

}

int main()

{

int n,sum1=0,sum2=0;

    struct Node *p;

    scanf("%d",&n);

    p=createList(n);

    while(NULL!=p)

    {

    sum1+=p->shi;

    sum2+=p->xu;

    p=p->next;

    }

    printf("%d+%di",sum1,sum2);

    return 0;

}