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

题解

#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
struct node{
	int exp;
	double cof;
}polyA[1001];
double ans[2001];
int main() {
	int m, n, tempexp, num = 0;
	double tempcof;
	cin >> m;
	for (int i = 0; i < m; i++) {
		cin >> polyA[i].exp >> polyA[i].cof;
	}
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> tempexp >> tempcof;
		for (int j = 0; j < m; j++) {
			ans[tempexp+polyA[j].exp] += (tempcof*polyA[j].cof);
		}
	}
	for (int i = 0; i < 2001; i++) {
		if (ans[i] != 0.0)
			num++;
	}
	cout << num;
	for (int i = 2000; i >= 0; i--) {
		if (ans[i] != 0.0)
			printf(" %d %.1f", i, ans[i]);
	}
	return 0;
}

//我采用的是存一个多项式，边读另一个多项式边运算
//如果第一个多项式采用数组的话，后面的运算量将会十分巨大