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 Input2 1 2.4 0 3.2 2 2 1.5 1 0.5Sample Output
3 3 3.6 2 6.0 1 1.6
思路:项相乘,指数相加,系数相乘,指数作索引保存系数,每一项相乘得到的系数加到索引下。注意相乘后系数可能会达到2000.
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
struct poly{
double coe;
int exp;
};
int main()
{
int n;
cin>>n;
vector<poly> a;
double ans[2001] = {0};
poly p;
while(n--){
cin>>p.exp>>p.coe;
a.push_back(p);
}
cin>>n;
while(n--){
cin>>p.exp>>p.coe;
for(auto i:a)
ans[i.exp+p.exp] += p.coe * i.coe;
}
int cnt = 0;
for(int i = 2000;i>=0;--i){
if(ans[i]!=0)
++cnt;
}
cout<<cnt;
for(int i = 2000;i>=0;--i){
if(ans[i]!=0)
cout<<' '<<i<<' '<<fixed<<setprecision(1)<<ans[i];
}
return 0;
}