pat1009. Product of Polynomials (25)

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

注意指数相加 数组扩大到2000 和前面多项式a+b有点相同

#include<stdio.h>
#include<string.h>
int main()
{
    int n1,n2,a;
    double ans[2010],b,in[1010];
    memset(ans,0,sizeof(ans));
    memset(in,0,sizeof(in));
    scanf("%d",&n1);
    for(int i=1;i<=n1;i++)
        {
            scanf("%d",&a);
            scanf("%lf",&in[a]);
        }
    scanf("%d",&n2);
    for(int i=1;i<=n2;i++)
    {
        scanf("%d%lf",&a,&b);
        for(int j=0;j<1002;j++)
        {
            if(in[j]!=0)
                {
                    ans[j+a]+=in[j]*b;
                }
        }
    }
    int sum=0;
    for(int i=0;i<2001;i++)
    {
        if(ans[i]!=0) sum++;
    }
    if(sum>0) printf("%d",sum);
    else
        printf("0");
    for(int i=2001;i>=0;i--)
        if(ans[i]!=0)
             printf(" %d %.1lf",i,ans[i]);
    printf("\n");
    return 0;
}