PAT (Advanced Level) Practise 1009 Product of Polynomials

1009. Product of Polynomials (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 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 Specification:

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.

Sample Input

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output

3 3 3.6 2 6.0 1 1.6

题意：多项式相乘

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>

using namespace std;

int n,x,sum,m;
double a[10000],b[10000],c[10000];

int main()
{
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&x);
        scanf("%lf",&a[x]);
    }
    scanf("%d",&m);
    for(int i=0; i<m; i++)
    {
        scanf("%d",&x);
        scanf("%lf",&b[x]);
    }
    memset(c,0,sizeof c);
    for(int i=0; i<1001; i++)
    {
        for(int j=0; j<1001; j++)
            c[i+j]+=a[i]*b[j];
    }
    for(int i=0; i<2001; i++)
        if(c[i]!=0) sum++;
    printf("%d",sum);
    for(int i=2000;i>=0;i--)
        if(c[i]!=0) printf(" %d %.1lf",i,c[i]);
    printf("\n");
    return 0;
}