蓝桥杯算法提高VIP-复数求和

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

struct num {

int f;

int v;

struct num* next;

}n;

struct num* p,* q, *t,* head;

int main(void)

{

head = NULL;

int i,m,ff=0,vv=0;

scanf("%d", &m);

for (i = 1; i <= m; i++)

{

p = (struct num*)malloc(sizeof(struct num));

scanf("%d %d",&p->f,&p->v);

p->next = NULL;

if (head == NULL)

head = p;

else

q->next = p;

q = p;

}

t = head;

for (i = 1; i <= m; i++)

{

ff += t->f;

vv += t->v;

t = t->next;

}

printf("%d%+di",ff,vv );

while (head->next != NULL)

{

free(head);

head = head->next;

}

return 0;

}