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

题意，简单题，求两个多项式相乘，看了晴神的书以后发现可以优化，结构体只要一个数组，然后一个结果的double数组

ac：#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>


using namespace std;


struct Poly{
double coef;
int expo;
}poly1[11],poly2[11],ans[100];


int map[2005];   //检测expo是否出现过 出现的下标 
bool cmp(Poly p1,Poly p2){
if(p1.expo>p2.expo) return true;
return false;
}
int main(){
int k1,k2;
//freopen("D:\\input.txt","r",stdin);
memset(map,-1,sizeof(map));
cin>>k1;


for(int i=0;i<k1;i++){
cin>>poly1[i].expo>>poly1[i].coef;
}

cin>>k2;
for(int i=0;i<k2;i++){
cin>>poly2[i].expo>>poly2[i].coef;
}
Poly temp; int m=0;
for(int i=0;i<k1;i++){
for(int j=0;j<k2;j++){
temp.coef=poly1[i].coef*poly2[j].coef;
temp.expo=poly1[i].expo+poly2[j].expo;

if(map[temp.expo]==-1){
map[temp.expo]=m;
ans[m].coef=temp.coef;
ans[m].expo=temp.expo;
m++;
}
else{
int index=map[temp.expo];
ans[index].coef+=temp.coef;
}
}
}
    
sort(ans,ans+m,cmp);
int cnt=0;
for(int i=0;i<m;i++){
if(ans[i].coef!=0) cnt++;
}
printf("%d",cnt);
for(int i=0;i<m;i++){
if(ans[i].coef!=0.0){
printf(" %d %.1lf",ans[i].expo,ans[i].coef);
}
}


}