A1009 Product of Polynomials（两个多项式相乘）

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

3 3 3.6 2 6.0 1 1.6

题目：

 给出两个多项式，求两个多项式的乘积。

注意：

1. 答案的数组至少会取得2000，所以要开到2001.
2. 没必要开两个数组，读完两个多项式之后再处理，读完一个多项式，对于第二个边读边处理。
3. 段错误：越界错误

#include <cstdio>

struct Poly{
  int exp;
  double cof;
}poly[1001];

double ans[2001] = {};

int main(){
  int n, m, number = 0;
  scanf("%d", &n);
  for(int i = 0; i < n; i++){
    scanf("%d %lf", &poly[i].exp, &poly[i].cof);
  }
  scanf("%d", &m);
  for(int i = 0; i < m; i++){
    int exp;
    double cof;
    scanf("%d %lf", &exp, &cof);
    for(int j = 0; j < n; j++){
      ans[exp + poly[j].exp] += (cof * poly[j].cof);
    }
  }
  for(int i = 0; i <= 2000; i++)
    if(ans[i] != 0)
      number++;
  printf("%d",number);
  for(int i = 2000; i >= 0; i--)    //注意此处为i--,若为++会发生越界
    if(ans[i] != 0)
      printf(" %d %.1f", i, ans[i]);
  return 0;
}