輸入兩個多項式，計算它們的加、減及乘法， 將計算結果輸出到屏幕上。
1） 輸入：從鍵盤分兩行分別輸入兩個多項式數據，每個多項式輸入格式如下：
n a1 m1 a2 m2 a3 m3 . .. ai mi.... an mn
其中n為多項式系數為非零的項數，ai為系數，mi為指數, 它們都是整數，該輸入數據所表達的多項式意義為(其中符號^表示冪次)：
a1x^m1 + a2x^m2 + a3x^m3 + ...... + an x^mn
2）輸出：先輸出參與運算的兩個多項式， 然后輸出它們的運算結果，格式為：
要求：多項式輸出時從冪次數高到低的順序逐項輸出，若任何一項的系數是0的話，請不要輸出，除非所有的系數為0，則輸出0。
函數接口定義：
void print_polynomial(polynomial *head);
本函數完成一個多項式的輸出。題目要求的功能以及本函數具體涉及到多項式鏈表的創建以及多項式加、減和乘法運算所需的功能模塊請在本函數實現之前一並自行完成，並將代碼插入在合適的位置。
裁判測試程序樣例：
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct node
{
int coef; /* 系數 */
int exp; /* 指數 */
struct node *next;
} polynomial;
/* 提示：遞交的答案將會自動插入此處 */
int main(void)
{
polynomial *polyA,*polyB;
polyA=create_polynomial(); /* 其中函數create_polynomial()用於讀入並創建多項式A的鏈表，請自行實現 */
polyB=create_polynomial(); /* 讀入並創建多項式B的鏈表 */
printf("A=");
print_polynomial(polyA); /* 輸出多項式A */
printf("B=");
print_polynomial(polyB); /* 輸出多項式B */
printf("A+B=");
print_polynomial(add_polynomial(polyA,polyB) );
/* 輸出多項式加A+B 的結果, 其中函數add_polynomial(polyA,polyB)將返回A+B的多項式，請自行實現*/
printf("A-B=");
print_polynomial(subtract_polynomial(polyA,polyB) );
/* 輸出多項式減A-B 的結果，其中函數subtract_polynomial(polyA,polyB)返回A-B的多項式，請自行實現*/
printf("A*B=");
print_polynomial(multiply_polynomial(polyA,polyB));
/* 輸出多項式乘A*B 的結果，其中函數multiply_polynomial(polyA,polyB)返回A*B的多項式，請自行實現 */
return 0;
/* 請在這里填寫答案 */
}
輸入樣例：
在這里給出一組輸入。例如：
3 1 2 3 4 5 6
3 1 2 3 4 5 6
輸出樣例：
在這里給出相應的輸出。例如(其中 x 是小寫字母)：
A=5x^6 +3x^4 +x^2
B=5x^6 +3x^4 +x^2
A+B=10x^6 +6x^4 +2x^2
A-B=0
A*B=25x^12 +30x^10 +19x^8 +6x^6 +x^4
有點坑的題目 卡了半天樣例（機考寫完的時候老師問我是不是搞錯題意，然而並不是...這題真就要把函數全寫了，並不是只寫個輸出函數）
輸入要排序！！！我這里直接每次輸入一個插入一次鏈表，也可以輸入后鏈表排序， x^1 要輸出成x，ax^0 要寫成a，格式挺麻煩.... 當時太懶了用數組偷懶被老師錘了..... ⑧說了，我也覺得輸出函數寫得丑,因為看不下去然后改得好看些然后wa了就不想改了..
polynomial *create_polynomial()
{
int n;
scanf("%d", &n);
polynomial *head, *p, *t;
head = (polynomial *)malloc(sizeof(polynomial));
head->next = NULL;
/*輸入排序*/
for (int i = 0; i < n; i++)
{
int coef, exp;
polynomial *cah;
scanf("%d%d", &coef, &exp);
t = head;
for (; t->next != NULL; t = t->next)
{
if (t->next->exp < exp)
{
cah = (polynomial *)malloc(sizeof(polynomial));
cah->coef = coef;
cah->exp = exp;
cah->next = t->next;
t->next = cah;
break;
}
else if (t->next->exp == exp)
{
t->next->coef += coef;
break;
}
}
if (!t->next)
{
cah = (polynomial *)malloc(sizeof(polynomial));
cah->coef = coef;
cah->exp = exp;
t->next = cah;
cah->next = NULL;
}
}
return head;
}
void print_polynomial(polynomial *head)
{
polynomial *p;
int flag = 0;
for (p = head->next; p != NULL; p = p->next)
{
if (!flag && p->coef != 0)
{
flag = 1;
if (p->coef > 0)
{
if (p->exp == 0)
printf("%d", p->coef);
else
{
p->coef == 1 ? printf("x") : printf("%dx", p->coef);
p->exp == 1 ? printf("") : printf("^%d", p->exp);
}
}
else
{
if (p->exp == 0)
printf("%d", p->coef);
else
{
p->coef == -1 ? printf("-x") : printf("%dx", p->coef);
p->exp == 1 ? printf("") : printf("^%d", p->exp);
}
}
}
else if (flag && p->coef != 0)
{
if (p->coef > 0)
{
if (p->exp == 0)
printf("+%d", p->coef);
else
{
p->coef == 1 ? printf("+x") : printf("+%dx", p->coef);
p->exp == 1 ? printf("") : printf("^%d", p->exp);
}
}
else
{
if (p->exp == 0)
printf("%d", p->coef);
else
{
p->coef == -1 ? printf("-x") : printf("%dx", p->coef);
p->exp == 1 ? printf("") : printf("^%d", p->exp);
}
}
}
}
if (!flag)
printf("0");
printf("\n");
}
polynomial *add_polynomial(polynomial *a, polynomial *b)
{
polynomial *head, *p, *tail = NULL;
head = (polynomial *)malloc(sizeof(polynomial));
polynomial *a1 = a->next, *b1 = b->next;
head->next = NULL;
tail = head;
while (a1 && b1)
{
p = (polynomial *)malloc(sizeof(polynomial));
p->next = NULL;
if (a1->exp > b1->exp)
{
p->coef = a1->coef;
p->exp = a1->exp;
tail->next = p;
tail = p;
a1 = a1->next;
}
else if (a1->exp < b1->exp)
{
p->coef = b1->coef;
p->exp = b1->exp;
tail->next = p;
tail = p;
b1 = b1->next;
}
else
{
p->coef = a1->coef + b1->coef;
p->exp = b1->exp;
tail->next = p;
tail = p;
a1 = a1->next;
b1 = b1->next;
}
}
while (a1)
{
p = (polynomial *)malloc(sizeof(polynomial));
p->next = NULL;
p->coef = a1->coef;
p->exp = a1->exp;
tail->next = p;
tail = p;
a1 = a1->next;
}
while (b1)
{
p = (polynomial *)malloc(sizeof(polynomial));
p->next = NULL;
p->coef = b1->coef;
p->exp = b1->exp;
tail->next = p;
tail = p;
b1 = b1->next;
}
return head;
}
polynomial *subtract_polynomial(polynomial *a, polynomial *b)
{
polynomial *head, *p, *tail = NULL;
head = (polynomial *)malloc(sizeof(polynomial));
polynomial *a1 = a->next, *b1 = b->next;
head->next = NULL;
tail = head;
while (a1 && b1)
{
p = (polynomial *)malloc(sizeof(polynomial));
p->next = NULL;
if (a1->exp > b1->exp)
{
p->coef = a1->coef;
p->exp = a1->exp;
tail->next = p;
tail = p;
a1 = a1->next;
}
else if (a1->exp < b1->exp)
{
p->coef = -b1->coef;
p->exp = b1->exp;
tail->next = p;
tail = p;
b1 = b1->next;
}
else
{
p->coef = a1->coef - b1->coef;
p->exp = b1->exp;
tail->next = p;
tail = p;
a1 = a1->next;
b1 = b1->next;
}
}
while (a1)
{
p = (polynomial *)malloc(sizeof(polynomial));
p->next = NULL;
p->coef = a1->coef;
p->exp = a1->exp;
tail->next = p;
tail = p;
a1 = a1->next;
}
while (b1)
{
p = (polynomial *)malloc(sizeof(polynomial));
p->next = NULL;
p->coef = -b1->coef;
p->exp = b1->exp;
tail->next = p;
tail = p;
b1 = b1->next;
}
return head;
}
polynomial *multiply_polynomial(polynomial *a, polynomial *b)
{
polynomial *head, *p1, *tail;
head = (polynomial *)malloc(sizeof(polynomial));
head->next = NULL;
tail = head;
polynomial *p, *q, *t, *cah;
for (p = a->next; p != NULL; p = p->next)
for (q = b->next; q != NULL; q = q->next)
{
int coef = p->coef * q->coef;
int exp = p->exp + q->exp;
for (t = head; t->next != NULL; t = t->next)
{
if (t->next->exp < exp)
{
cah = (polynomial *)malloc(sizeof(polynomial));
cah->coef = coef;
cah->exp = exp;
cah->next = t->next;
t->next = cah;
break;
}
else if (t->next->exp == exp)
{
t->next->coef += coef;
break;
}
}
if (!t->next)
{
cah = (polynomial *)malloc(sizeof(polynomial));
cah->coef = coef;
cah->exp = exp;
t->next = cah;
cah->next = NULL;
}
}
return head;
}