Polynomial& Polynomial::multiply_term(int c, unsigned k){
assert (c != 0);      // can't multiply by 0
  for (Term *p = terms; p != 0; p = p->next) {
    p->coef = p->coef * c;   // multiply coef's together
    p->exp = p->exp + k;    // add exp's together
  }
return *this;
}

static Term *find_term(Term *terms, unsigned k){
  Term *prev = 0;
  Term *curr = terms;
  while (curr != 0 && curr->exp < k) {
    prev = curr;
    curr = curr->next;
  }
  return prev;
}

struct Term {
  int coef;       // coefficient (never zero)
  unsigned exp;   // exponent
  Term *next;
};