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
参考代码:
#include<cstdio>
const int MAXN = 1001;
double p[MAXN];
int main(int argc, char const *argv[])
{
int k,n,count=0;
double a;
scanf("%d",&k);
for (int i = 0; i < k; ++i)
{
scanf("%d%lf", &n, &a);
p[n] += a;
}
scanf("%d",&k);
for (int i = 0; i < k; ++i)
{
scanf("%d%lf", &n, &a);
p[n] +=a;
}
for (int i = 0; i < MAXN; ++i)
{
if(p[i] != 0) count++;//如果在每次输入的时候,就进行count++,要考虑正负抵消的情况
}
printf("%d", count);
for (int i = MAXN-1; i >= 0; --i)
{
if(p[i] != 0){
if(count != 0) printf(" ");
printf("%d %.1f", i, p[i]);//题目的输入输出都是系数的非零项数
count--;
}
}
printf("\n");
return 0;
}