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

【题目链接】

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 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (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

题意分析：

两个多项式加法，然后按指数项从高到低分别输出“指数 系数”。

提交代码：

 1 #include <stdio.h>
 2 #include <string.h>
 3 
 4 int main(void)
 5 {
 6     float a[10000+1];
 7     float b[10000+1];
 8     int i, cnt;
 9     int K, Nk;
10     float aNk;
11 
12     memset(a, 0, sizeof(a));
13     memset(b, 0, sizeof(b));
14 
15     scanf("%d", &K);
16     for(i = 0; i < K; i++)
17     {
18         scanf("%d %f", &Nk, &aNk);
19         a[Nk] = aNk;
20     }
21     scanf("%d", &K);
22     for(i = 0; i < K; i++)
23     {
24         scanf("%d %f", &Nk, &aNk);
25         b[Nk] = aNk;
26     }
27 
28     cnt = 0;
29     for(i = 0; i < sizeof(a)/sizeof(a[0]); i++)
30     {
31         a[i] = a[i] + b[i];
32         if(a[i] != 0.0)
33             cnt++;
34     }
35 
36     printf("%d", cnt);
37     for(i = sizeof(a)/sizeof(a[0]) - 1; i >= 0; i--)
38     {
39         if(a[i] != 0)
40             printf(" %d %.1f", i, a[i]);
41     }
42 
43     return 0;
44 }

 

转载于:https://www.cnblogs.com/utank/p/4775790.html