1009. Product of Polynomials (25)

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

两层for水一水

#include<bits/stdc++.h>
using namespace std;
const int maxn =1010;
double a[maxn],b[maxn],c[maxn*2];
int n,m,t; int t1;double t2;
int main()
{
   scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d%lf",&t1,&t2);
        a[t1]=t2;
    }
   scanf("%d",&m);
   for(int i=0;i<m;i++){
        scanf("%d%lf",&t1,&t2);
        b[t1]=t2;
    }
    for(int i=0;i<=1000;i++){
        for(int j=0;j<=1000;j++){
            int temp=i+j;
            double temp1=a[i]*b[j];
            c[temp]+=temp1;
        }
    }
    for(int i=0;i<2*maxn;i++)if(c[i]!=0)t++;
    printf("%d",t);
    for(int i=2*maxn-1;i>=0;i--)if(c[i]!=0)printf(" %d %.1lf",i,c[i]);
    printf("\n");
    return 0;
}