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
本题思路:用vector<pair < int,double>>来存储两行数据,遍历两组数据模拟乘法过程。
AC代码
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
typedef pair<int,double> PII;
int a,b;
vector<PII> ans1,ans2;
double ans[2020];
int res;
int main()
{
cin >> a;
int t;
double num;
for(int i=0;i<a;i++)
{
cin >> t >> num;
ans1.push_back({t,num});
}
cin >> b;
for(int i=0;i<b;i++)
{
cin >> t >> num;
ans2.push_back({t,num});
}
for(int i=0;i<ans1.size();i++)
{
for(int j=0;j<ans2.size();j++)
{
int p=ans1[i].first+ans2[j].first;
if(fabs(ans[p])<1e-6) res++;
ans[p]+=(double)ans1[i].second*ans2[j].second;
if(fabs(ans[p])<1e-6)
res--;
}
}
cout << res;
for(int i=2020;i>=0;i--)
{
if(fabs(ans[i])>1e-6)
printf(" %d %.1lf",i,ans[i]);
}
return 0;
}