题目描述
给定两个多项式P(x)与Q(x),通过链表实现它们的加法。
输入
有若干组,每组有2个多项式。每组输入时先输入第1个多项式,再输入第2个多项式。每组用若干对整数表示,依序每两个相邻的整数表示多项式的一项,分别是它的系数和幂。当输入的幂为负数时,表示一个多项式的结束。一个多项式中各项的次序是随机的。
输出
对每组中两个多项式,先输出“Case #:”,其中“#”是测试数据序号。接着在下面三行上分别输出这两多项式,以及这两多项式的和。要求按降幂排列输出多项式的各项,每一项用(a,n)对的形式,其中a是系数,n是幂。相邻两对之间无空格。系数为零的项不输出。对零多项式,只输出0。
样例输入
-1 2 3 -1 1 2 2 -1
-2 2 4 4 3 -1 2 2 6 1 5 -1
样例输出
Case 1:
(-1,2)
(1,2)
0
Case 2:
(4,4)(-2,2)
(2,2)(6,1)
(4,4)(6,1)
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
int n, k, s1[1000], s2[1000], num1, num2, k1[100], k2[100];
int s3[1000], num3, k3[1000];
int i, j, flag, sum = 0;
while (cin >> n >> k) {
sum++;
cout << "Case " << sum << ":" << endl;
memset(s1, 0, sizeof(s1));
memset(s2, 0, sizeof(s2));
memset(s3, 0, sizeof(s3));
num1=-1;
num2=-1;
num3=-1;
s1[k] += n;
s3[k] += n;
k1[++num1] = k;
k3[++num3] = k;
for (i = 1; i < 1000; ++i) {
cin >> n >> k;
if (k < 0) {
break;
}
s1[k] += n;
s3[k] += n;
k1[++num1] = k;
k3[++num3] = k;
}
sort(k1, k1 + num1+1);
for (j = 0; j < 1000; ++j) {
cin >> n >> k;
if (k < 0) {
break;
}
s2[k] += n;
s3[k] += n;
k2[++num2] = k;
k3[++num3] = k;
}
sort(k2, k2 + num2+1);
sort(k3, k3 + num3+1);
flag = 0;
for (int x = num1; x >= 0; --x) {
if (s1[k1[x]] == 0)
continue;
else if (x == num1) {
cout << "(" << s1[k1[x]] << "," << k1[x] << ")";
flag = 1;
}
else if (k1[x] != k1[x+1]) {
cout << "(" << s1[k1[x]] << "," << k1[x] << ")";
flag = 1;
}
}
if (flag == 0) {
cout << 0;
}
cout << endl;
flag = 0;
for (int x = num2; x >= 0; --x) {
if (s2[k2[x]] == 0)
continue;
else if (x == num2) {
cout << "(" << s2[k2[x]] << "," << k2[x] << ")";
flag = 1;
}
else if (k2[x] != k2[x+1]) {
cout << "(" << s2[k2[x]] << "," << k2[x] << ")";
flag = 1;
}
}
if (flag == 0) {
cout << 0;
}
cout << endl;
flag = 0;
for (int x = num3; x >= 0; --x) {
if (s3[k3[x]] == 0)
continue;
else if (x == num3) {
cout << "(" << s3[k3[x]] << "," << k3[x] << ")";
flag = 1;
}
else if (k3[x] != k3[x+1]) {
cout << "(" << s3[k3[x]] << "," << k3[x] << ")";
flag = 1;
}
}
if (flag == 0) {
cout << 0;
}
cout << endl;
}
return 0;
}
这题目我没用链表,直接用数组来写的,,但是程序好长啊!!一时半会也不知道如何改进,先写一篇博客做个记录。逻辑用的就是最普通的。