1009. Product of Polynomials (25)

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 <iostream>
#include <iomanip>
using namespace std;
double coefficient[2001][3]; //输入的指数最高是1000，相乘指数最高为2000
void Product(){
  for(int i = 0; i < 1001; i++){
    if(coefficient[i][0]){
      for(int j = 0; j < 1001; j++){
        if(coefficient[j][1]){
          coefficient[i+j][2] = coefficient[i+j][2] + coefficient[i][0] * coefficient[j][1];
        }
      }
    }
  }
}
int count_tearms(){
  int num_teams = 0;
  for(int i = 0; i < 2001; i++){
    if(coefficient[i][2])
      num_teams++;
  }
  return num_teams;
}
void output(int num_teams){
  cout << num_teams;
  for(int i = 2000; i >= 0; i--){
    if(coefficient[i][2]){
      cout << " " << i;
      cout << fixed << setprecision(1);
      cout << " " << coefficient[i][2];
    }
  }
  cout << endl;
}
int main(){
  int k1, k2;
  cin >> k1;
  for(int i = 0; i < k1; i++){
    int N;
    double ak;
    cin >> N >> ak;
    coefficient[N][0] = ak;
  }
  cin >> k2;
  for(int i = 0; i < k2; i++){
    int N;
    double ak;
    cin >> N >> ak;
    coefficient[N][1] = ak;
  }
  Product();
  int num_terms = count_tearms();
  output(num_terms);
  return 0;
}