一元多项式的乘法与加法运算

设计函数分别求两个一元多项式的乘积与和。

输入格式:

输入分2行，每行分别先给出多项式非零项的个数，再以指数递降方式输入一个多项式非零项系数和指数（绝对值均为不超过1000的整数）。数字间以空格分隔。

输出格式:

输出分2行，分别以指数递降方式输出乘积多项式以及和多项式非零项的系数和指数。数字间以空格分隔，但结尾不能有多余空格。零多项式应输出0 0。

输入样例:

4 3 4 -5 2  6 1  -2 0
3 5 20  -7 4  3 1

输出样例:

15 24 -25 22 30 21 -10 20 -21 8 35 6 -33 5 14 4 -15 3 18 2 -6 1
5 20 -4 4 -5 2 9 1 -2 0

#include<iostream>

using namespace std;
typedef struct p {
	int a;//系数
	int b;//指数
	struct p* next;
}linklist;
int main(void)
{
	int i, j;
	cin >> i;
	int n = 0;
	linklist* y, * p, * g;
	y = new linklist;
	g = y;
	for (n = 0; n < i; n++)
	{
		linklist* m = new linklist;
		cin >> m->a >> m->b;
		g->next = m;
		g = m;

	}
	g->next = NULL;
	cin >> j;
	linklist* y2, * p1, * g1, * gg;
	y2 = new linklist;
	g1 = y2;

	for (n = 0; n < j; n++)
	{
		linklist* m = new linklist;
		cin >> m->a >> m->b;
		g1->next = m;
		g1 = m;

	}
	g1->next = NULL;
	//求多项式的加法已经生成了带头节点的两个链表y与y2
	linklist* print1;
	linklist* zhi3, * zhi4, * g2, * y33, * cheng, * p2;
	y33 = new linklist;
	zhi3 = y->next;
	zhi4 = y2->next;
	g2 = y33;
	y33->next = NULL;
	p2 = y33->next;
	while (zhi3)
	{
		zhi4 = y2->next;
		while (zhi4)
		{
			g2 = y33;
			p2 = y33->next;
			cheng = new linklist;
			cheng->a = zhi3->a * zhi4->a;
			cheng->b = zhi3->b + zhi4->b;
			while (p2 && p2->b > cheng->b)
			{
				g2 = p2;
				p2 = p2->next;
			}
			if (!p2)
			{
				g2->next = cheng;
				cheng->next = NULL;

			}
			if (p2 && p2->b == cheng->b)
			{
				p2->a = p2->a + cheng->a;
			}
			if (p2 && p2->b < cheng->b)
			{
				g2->next = cheng;
				cheng->next = p2;
			}
			zhi4 = zhi4->next;
		}
		zhi3 = zhi3->next;
	}
	linklist* print;
	for (print = y33->next; print; print = print->next)
	{
		cout << print->a << ' ' << print->b << ' ';
	}
	cout << endl;
	//下面进行的是多项式的乘法
		//乘法感觉就是从一个链表的第一项开始乘后一个链表的每一个数，保存在另外一个链表中，从另外的一个链表中来找到有没有相同的指数，有就加，没有就插入按从大到小的进行
	linklist* zhi1, * zhi2, * y3, * g11, * yt;
	y3 = new linklist;
	y3->next = NULL;
	g11 = y3;
	zhi1 = y->next;
	zhi2 = y2->next;
	while (zhi1 && zhi2)
	{
		if (zhi1->b == zhi2->b)
		{
			yt = new linklist;
			yt->next = NULL;
			yt->a = zhi1->a + zhi2->a;
			yt->b = zhi1->b;
			if (yt->a == 0)
			{
				zhi1 = zhi1->next;
				zhi2 = zhi2->next;
			}
			else
			{
				g11->next = yt;
				g11 = yt;
				zhi1 = zhi1->next;
				zhi2 = zhi2->next;
			}

		}
		else if (zhi1->b > zhi2->b)
		{
			g11->next = zhi1;
			g11 = zhi1;
			zhi1 = zhi1->next;
		}
		else
		{
			g11->next = zhi2;
			g11 = zhi2;
			zhi2 = zhi2->next;
		}
	}
	if (zhi1) g11->next = zhi1;
	if (zhi2) g11->next = zhi2;

	for (print1 = y3->next; print1; print1 = print1->next)
	{
		cout << print1->a << ' ' << print1->b << ' ';
	}
	cout << endl;

}

部分对？？？？？？？？？？？？？？？？？