一元多项式加减乘除源代码（One dollar polynomial adds and subtracted the source code）.docVIP

一元多项式加减乘除源代码（One dollar polynomial adds and subtracted the source code） / / Polynomial_list / / function: input two polynomials (do not be in the ascending order, the program will automatically merge the same type and sort), and add and subtract multiplication and division operations # include stdio, h # include stdlib. H H # include math.h / / node definition Typedef struct PolyNode { Int exp. / / index Float coef. / / coefficient PolyNode * next; } PolyNode, * PolyList; / / function declaration PolyList CreatePolyList (); / / create a polynomial list and return a pointer Void DisplayPolyList (PolyList Poly real); / / display polynomial Void DestroyPolyList PolyList (L); / / release list of storage space Void MergePoly (PolyList Poly real); / / the polynomial and the same category Void SortPoly (PolyList Poly real); / / arrange the polynomial in ascending order PolyList PolyList PolyB, PolyList PolyB, PolyList PolyList PolyB / / polynomials, return and polynomial chain headers PolyList PolySub (PolyList polya, PolyList polyb); / / polynomials, return differential polynomial chain header pointer PolyList PolyA, PolyList PolyB. / / polynomials, the results are returned by PolyC PolyList PolyDivide (PolyList PolyA, PolyList PolyB); / / polynomials, the results are stored in PolyC, separated by nodes with coefficients of 0 / / function implementation / / create a polynomial list and return a pointer PolyList CreatePolyList () { Rear PolyNode * s, * and * head; Int e; / / index Float c; / / coefficient Int n = 1; / / counter Head = (PolyNode *) malloc (sizeof (PolyNode)); Rear = head; / / the coefficient and exponent of the input polynomial, if the input coefficient is 0 Printf ( please enter the coefficients and indexes of the first % d terms of the polynomials (separated by commas) : , n+ +); Scanf ( % f, % d , c, e); While (fabs (c) 1 e - 6) {s = (PolyNode *) malloc (PolyNode); S - exp = e; S - coef = c; Rear - next = s; Rear = s; Printf ( please enter th