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 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.

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<cstdio>
int main(){
    int a,b,temp;//两个多项式的系数以及临时指数 
    double c,aaa[1001]={0},ans[2001]={0};
    scanf("%d",&a);
    for(int i=0;i<a;i++){
        scanf("%d %lf",&temp,&c);//输入各项指数以及对应的系数 
        aaa[temp]=c;
    }
    scanf("%d",&b);
    for(int i=0;i<b;i++){
        scanf("%d %lf",&temp,&c);//输入各项指数以及对应的系数 
        for(int ii=0;ii<1001;ii++)ans[ii+temp]+=aaa[ii]*c;//分别乘以先前每一项 
    }
    int ans1=0;
    for(int i=0;i<2001;i++)if(ans[i]!=0)ans1++;
    printf("%d",ans1);
    for(int i=2000;i>=0;i--)if(ans[i]!=0)printf(" %d %.1f",i,ans[i]);
    return 0;
}