1009 Product of Polynomials (25 分)

1. 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 N ​1 ​​ a
   ​N ​1 ​​ ​​ N ​2 ​​ a ​N ​2 ​​ ​​ … N ​K ​​ a ​N ​K ​​ ​​
   where K is the number of nonzero terms in the polynomial, N ​i ​​
   and a ​N ​i ​​ ​​ (i=1,2,⋯,K) are the exponents and coefficients,
   respectively. It is given that 1≤K≤10, 0≤N ​K ​​ <⋯<N ​2 ​​ <N ​1 ​​
   ≤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 Out
   3 3 3.6 2 6.0 1 1.6

第一个测试点总是不过，卡在了double类型的运算上，double和int类型运算时容易出现误差，（输入完成A，B后再进行两个for循环的运算），需要同类型运算（输入B时就开始运算）。

#include<bits/stdc++.h>
using namespace std;
struct date
{
    double x;
    int y;
} a[1010],b[1010];
double c[2010];
int main()
{
    int i,j,n,m;
    scanf("%d",&n);
    for(i=1; i<=n; i++)
    {
        scanf("%d %lf",&a[i].y,&a[i].x);
    }
    scanf("%d",&m);
     memset(c,0,sizeof(c));
    for(i=1; i<=m; i++)
    {
        scanf("%d %lf",&b[i].y,&b[i].x);
        for(j=1;j<=n;j++)
        {
            c[b[i].y+a[j].y]+=a[j].x*b[i].x;
        }
    }
    int num=0;
    for(i=0;i<=2000;i++)
    {
        if(c[i]!=0.0)
            num++;
    }
    printf("%d",num);
    for(i=2000;i>=0;i--)
    {
        if(c[i]!=0)
            printf(" %d %.1lf",i,c[i]);
    }
    return 0;
}