This time, you are supposed to find A+B where A and B are two polynomials.
Input
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 ... NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10,0 <= NK < ... < N2 < N1 <=1000.
Output
For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.
Sample Input2 1 2.4 0 3.2 2 2 1.5 1 0.5Sample Output
3 2 1.5 1 2.9 0 3.2
题目大意:输入多项式A和B 求和,输入格式 K N1 aN1 N2 aN2 ... NK aNK K为该多项式项数、N1、aN1分别为该项幂次和系数。
思路:
构建以数列p[n],用以存储幂次和系数,n为多项式的幂次,p[n]为该项的系数, 数组类型定义为double;
代码如下:
#include <cstdio>
int main()
{
int K, n, count = 0;
double an;
double p[1005] = {};
scanf ("%d", &K);
for (int i = 0; i < K; i++)
{
scanf ("%d%lf", &n, &an);
p[n] += an; // 下标存储幂次,该下标表示的元素存储系数; 用+=确保同样幂次的数据不会被覆盖;
}
scanf ("%d", &K);
for (int i = 0; i < K; i++)
{
scanf ("%d%lf", &n, &an);
p[n] += an;
}
for (int i = 0; i < 1005; i++)
{
if (p[i] != 0)
count++; //统计非零项的项数;
}
printf ("%d", count);
for (int i = 1005 - 1; i >= 0; i--)
{
if (p[i] != 0)
printf (" %d %.1f", i, p[i]); //总结各类型的输出空格的方式;
}
return 0;
}