蓝桥杯 ALGO-107 9-7链表数据求和操作（链表）

#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cstring>
using namespace std;

#define MAX 10

struct Node
{
double a;
double b;
Node *next;
};

int main()
{
freopen("in.txt", "r", stdin);
int i = 0;
Node *p;
Node *q = p;
p = q = (Node*)malloc(sizeof(Node));
for (i = 0; i < MAX; i++)
{
Node *node;
node = (Node*)malloc(sizeof(Node));
cin >> node->a >> node->b;
q->next = node;
q = node;
}
q->next = NULL;

double m = 0, n = 0;
for (p = p->next; p != NULL; p = p->next)
{
m = p->a + m;
n = p->b + n;
}
cout << m << "+" << n << "i";
return 0;
}