PAT (Advanced Level) Practise 1002. A+B for Polynomials (25)

1002. A+B for Polynomials (25)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 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 <iostream>

using namespace std;

int main()
{
int n,i,count=0;
int e;
double c,s[1050]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %lf",&e,&c);
s[e]+=c;
}
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %lf",&e,&c);
s[e]+=c;
}
for(i=1020;i>=0;i--)
if(s[i]!=0)
count++;
printf("%d",count);
for(i=1020;i>=0;i--)
{
if(s[i]!=0)
printf(" %d %.1lf",i,s[i]);
}
system("pause");
return 0;
}