1511: 蓝桥杯算法提高VIP-复数求和——Ccp

解题思路:

注意事项:

参考代码:

#include<stdlib.h>

struct Num{

int rnum;

int vnum;

struct Num*next;

};

int main(){

struct Num*head;

int n,i;

int rsum=0,vsum=0;

scanf("%d",&n);

head=(struct Num*)malloc(sizeof(struct Num));

for(i=0;i<n;i++){

scanf("%d %d",&head->rnum,&head->vnum);

rsum=rsum+head->rnum;

vsum=vsum+head->vnum;

head->next=(struct Num*)malloc(sizeof(struct Num));

head=head->next;

}

head->next=NULL;

printf("%d+%di",rsum,vsum);

}