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

#include<bits/stdc++.h>
using namespace std;
struct X {
	int xs;//系数
	int zs;//指数
}a[100], b[100], x[1000], j[200];//x[]数组是乘法结果j[]数组是加法结果
bool cmp(X q, X w) {
	return q.zs > w.zs;
}//排序指数降序
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i].xs >> a[i].zs;
	}
	int m;
	cin >> m;
	for (int i = 0; i < m; i++) {
		cin >> b[i].xs >> b[i].zs;
	}
	int i=0;
	int r = n, l = m;//将项数赋值给r，l
	int t = 0;
	int p;
	for (int j = 0; j < r; j++) {
		for (int k = 0; k < l; k++) {
			p = t;
			while (--p >= 0) {
				if (x[p].zs == a[j].zs + b[k].zs) {
					x[p].xs += a[j].xs * b[k].xs;
					break;//向前寻找指数一样的项进行合并
				}
			}
			if (p < 0)//无法合并直接进入数组
			{
				x[t].xs = a[j].xs * b[k].xs;
				x[t].zs = a[j].zs + b[k].zs;
				t++;
			}
		}
	}
	sort(x, x + t, cmp);//指数降序排列
	int aa = 0;
	int jj=0,jjj=0;
	while (x[jj].xs != 0) {
		cout << x[jj].xs << " " << x[jj].zs; aa++; jj++; jjj++;
		if (jjj != 0) {
			break;
		}
	}//while循环为了输出第一个前面无空格非零项，因为格式要求最后无多余空格，所以将每项间的空格放置下一项的开头
	for (int j = jj; j < t; j++) {
		if (x[j].xs != 0) { cout <<" "<< x[j].xs << " " << x[j].zs ; aa++; }
	}
	/*if (x[t - 1].xs != 0) { cout << x[t - 1].xs << " " << x[t - 1].zs; aa++; }*/
	if (aa == 0) {
		cout << "0" << " " << "0";
	}//判断是否全部都消掉
	aa = 0;
	cout << "\n";
	while (n > 0 || m > 0) {
		if (n <= 0) {//a[]数组全加减完了，b[]直接全部进入数组j[]
			j[i].xs = b[l - m].xs, j[i].zs = b[l - m].zs, m -= 1;
			i++;
		}
		if (m <= 0) {//b[]数组全加减完了
			j[i].xs = a[r - n].xs, j[i].zs = a[r - n].zs, n -= 1;
			i++;
		}
		if (n > 0 && m > 0) {
			if (a[r - n].zs == b[l - m].zs) {
				j[i].zs = a[r - n].zs, j[i].xs = a[r - n].xs + b[l - m].xs;
				i++, m--, n--;
				
			}
			if (a[r - n].zs > b[l - m].zs) {
				j[i].zs = a[r - n].zs, j[i].xs = a[r - n].xs;
				i++, n--;
				
			}
			if (a[r - n].zs < b[l - m].zs) {
				j[i].zs = b[l - m].zs, j[i].xs = b[l - m].xs;
				i++, m--;
				
			}
		}
	}
	int kk = 0,kkk=0;
	while (j[kk].xs != 0) {
		cout << j[kk].xs << " " << j[kk].zs; aa++; kkk++; kk++;
		if (kkk != 0) { break; }
	}
	for (int k = kk; k < i ;k++) {
		if (j[k].xs != 0) { cout <<" " << j[k].xs << " " << j[k].zs ; aa++; }
	}
	if (aa == 0) {
		cout << "0" << " " << "0";
	}
}

难点：1格式2乘法项和项的合并