This time, you are supposed to find A+B where A and B are two polynomials.
Input Specification:
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 Specification:
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 Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output:
3 2 1.5 1 2.9 0 3.2
- 多项式的存储不一定要用结构体,一种更简便的方法是把多项式存储在数组中,其中,数组下标为指数,数组内容为系数。
- pat有关多项式的题目可能会故意设置系数为零这种测试数据,如果系数为零,这一项不能算作多项式中的一项。
#include<cstdio>
using namespace std;
double Poly[1010];//多项式数组
int main()
{
int K1;
scanf("%d", &K1);
int ex;
double co;
for(int i = 1; i <= K1; i++)
{
scanf("%d%lf", &ex, &co);
Poly[ex] += co;
}
int K2;
scanf("%d", &K2);
for(int j = 1; j <= K2; j++)
{
scanf("%d%lf", &ex, &co);
Poly[ex] += co;//两个多项式相加过程
}
int Count = 0;
for(int n = 0; n < 1010; n++)
{
if(Poly[n] != 0)
Count++;//统计多项式项数
}
printf("%d", Count);
for(int m = 1009; m >= 0; m--)
{
if(Poly[m] != 0)
printf(" %d %.1f", m, Poly[m]);//倒序输出
}
return 0;
}