PAT A1002. A+b for Polynomials__pat

1002. A+b for polynomials ()Time limit MS
Memory Limit 65536 KB
Code length limit 16000 B
Standard author CHEN, Yue

This is 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 Coeffi Cients, 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 is NO extra spaces at the "End of". You are 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 #include <stdio.h>


int main () {
Double num[1001] = {
0.0
};
int K1, K2, M, I, Count;
Double N;
scanf ("%d", &K1);
for (i = 0; i < K1 i + +) {
scanf ("%d", &m);
scanf ("%lf", &n);
NUM[M] + = n;
}
scanf ("%d", &K2);
for (i = 0; i < K2 i + +) {
scanf ("%d", &m);
scanf ("%lf", &n);
NUM[M] + = n;
}
for (i = 1000, count = 0; I >= 0; I-) {
if (Num[i]!= 0) {
Count + +;
}
}
if (count = = 0) {
printf ("0");
} else {
printf ("%d", count);
}
for (i = 1000 i >= 0; I-) {
if (Num[i]!= 0) {
printf ("%d%.1f", I, num[i]);
Count--;
if (count!= 0) {
printf ("");
}
}
}
return 0;
}3.2