Product of Polynomials(PATA-1009)

题面

This time, you are supposed to find A×B where A and B are two polynomials.

输入

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.

输出

For each test case you should output the product 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 up to 1 decimal place.

样例输入

12 1 2.4 0 3.2
22 2 1.5 1 0.5

样例输出

13 3 3.6 2 6.0 1 1.6

提示

无

思路

类似【题解】PATA-1002 A+B for Polynomials，修改一下。水题。

代码

 1#define Sg(u) ((u)>eps?1:((u)<-eps?-1:0))
 2#define Abs(u) (Sg(u)>=0?(u):-(u))
 3#define Ze(u) (!Sg(u))
 4#define Eq(u,v) (Ze((u)-(v)))
 5const double eps = 1e-6;
 6double a[2005], b[2005];
 7
 8int main()
 9{
10    int an; scanf("%d", &an);
11    for(int i=0; i<an; i++){
12        int n; scanf("%d", &n);
13        scanf("%lf", &b[n]);
14    }
15
16    int bn; scanf("%d", &bn);
17    for(int i=0; i<bn; i++){
18        int n; double x;
19        scanf("%d %lf", &n, &x);
20        for(int j=0; j<=2000; j++)
21            if(Sg(b[j]))
22                a[n+j] += x * b[j];
23    }
24
25    int ans = 0;
26    for(int i=2000; i>=0; i--){
27        if(Sg(a[i]))
28            ans++;
29    }
30    printf("%d", ans);
31
32    for(int i=2000; i>=0; i--){
33        if(Sg(a[i]))
34            printf(" %d %.1lf", i, a[i]);
35    }
36    printf("\n");
37
38    return 0;
39}