#include <iostream>
using namespace std;

struct Term {

  double cofe;
  int exp;
  Term* link;

  Term(double c , int e , Term* next = NULL) {
    cofe = c;
    exp = e;
    link = next;
  }

  Term() {
    cofe = 0;
    exp = 0;
    link = NULL;
  }

  Term* insertTerm(double c , int e) {

    link = new Term(c,e,link);
    return link;

  }

};

typedef Term* LinkPoly;
LinkPoly create();
LinkPoly addPlus(LinkPoly &L,LinkPoly &M);
void print(LinkPoly &W);

int main() {

  cout<<"创建两个多项式："<<endl;
  LinkPoly Lpoly = create();
  LinkPoly Mpoly = create();

  LinkPoly W = addPlus(Lpoly,Mpoly);
  print(W);
  return 0;
}

LinkPoly create() {

  LinkPoly p1,p2,head;
  head = NULL;//创建一个空表
  p1 = new Term;
  p2 = p1;
  cin>>p1 -> cofe>>p1 ->exp;

  while (p1 -> exp != -1) {
    if (head == NULL) {
      head = p1;
    }
    else {
      p2 -> link = p1;//将链表连接起来
    }
    p2 = p1;
    p1 = new Term;
    cin>>p1 -> cofe>>p1 -> exp;
  }

  p2 -> link = NULL;
  delete p1;
  return head;
}

void print(LinkPoly &W) {
  LinkPoly p;
  p = W;

  if (p == NULL) {
    cout << "链表是空表！" << endl;
  }

  else {

    while (p -> link != NULL) {
      cout<<"("<<p -> cofe<<","<<p -> exp<<")"<<" -> ";
      p = p -> link;
    }
    cout<<"("<<p -> cofe<<","<<p -> exp<<")"<<endl;

}

}

LinkPoly addPlus(LinkPoly &L,LinkPoly &M) {

  LinkPoly N = NULL;
  LinkPoly A = L;
  LinkPoly B = M;
  LinkPoly p;
  while (A -> link != NULL && B -> link != NULL) {

    if (A -> exp == B -> exp) {
      double temp = A -> cofe + B -> cofe;

      if (temp != 0) {
        N = N -> insertTerm(temp,A ->exp);
      }
    A = A -> link;
    B = B -> link;

    }
    else if (A -> exp < B ->exp) {
      N = N -> insertTerm(A ->cofe,A ->exp);
      A = A -> link;
    }
    else {
      N = N -> insertTerm(B ->cofe,B ->exp);
      B = B -> link;
    }
  }

  if (A != NULL) {
    p = A;
  }
  else p = B;

  while (p != NULL) {
    N = N -> insertTerm(p -> cofe ,p -> exp);
    p = p ->link;
  }

  return N;
}