题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805509540921344
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
:题意 多项式相乘,即指数相加,系数相乘,数组a、b的下标分别存两个多项式的指数,数组的值用来存储系数
注意多项式乘积→指数相加之后范围是2000,ans数组范围要大于2000.
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int n,m;
double a[1011],b[1011];
double ans[2022];
memset(ans,0,sizeof(ans));
int x;
double xi;
cin>>n;
for(int i=0;i<n;i++){
cin>>x>>xi;
a[x]=xi;
}
cin>>m;
for(int i=0;i<m;i++){
cin>>x>>xi;
b[x]=xi;
}
for(int i=0;i<1001;i++){
for(int j=0;j<1001;j++){
if(a[i]!=0||b[j]!=0){
ans[i+j]+=a[i]*b[j];
}
}
}
int cnt=0;
for(int i=0;i<2001;i++){
if(ans[i]!=0){
cnt++;
}
}
cout<<cnt;
for(int i=2000;i>=0;i--){
if(ans[i]!=0){
printf(" %d %.1lf",i,ans[i]);
}
}
cout<<endl;
return 0;
}