1585: 蓝桥杯算法训练VIP-链表数据求和操作——Ccp

解题思路:

注意事项:

参考代码:

#include<stdlib.h>

#define len sizeof(struct num)

struct num{

int rnum;

int vnum;

struct num*next;

};

int main(){

struct num*head;

int i,rsum=0,vsum=0;

head=(struct num*)malloc(len);

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

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

rsum=rsum+head->rnum;

vsum=vsum+head->vnum;

head->next=(struct num*)malloc(len);

head=head->next;

} 

head->next=NULL;

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

}