1009 Product of Polynomials-白红宇

1009 Product of Polynomials

阅读量：4881 次

发布时间：2019-06-11

本文共 1831 字，大约阅读时间需要 6 分钟。

1009 Product of Polynomials （25 分）

This time, you are supposed to find

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

where

Output Specification:

For each test case you should output the product of

Sample Input:

2 1 2.4 0 3.22 2 1.5 1 0.5

Sample Output:

3 3 3.6 2 6.0 1 1.6 坑点： 　　多个项的系数相加可能为0，如果系数为0则不应该进行输出。 代码如下：

#include
        
         #include
         
          #include
          
           #include
           #include
            
             using namespace std;struct Cmpoperator{    bool operator()(int key1,int key2)    {        return key1>key2;    }};int main(){    map
             
               A; map
              
                B; int k=0; cin>>k; int exponents; double coefficients; for(int i=0; i
               
                >exponents>>coefficients; if(A.find(exponents)!=A.end()) { A[exponents]+=coefficients; } else { A[exponents]=coefficients; } } int k2; cin>>k2; for(int i=0; i
                
                 >exponents>>coefficients; map
                 
                  ::iterator iter=A.begin(); while(iter!=A.end()) { int first=iter->first+exponents; double second=iter->second*coefficients; if(B.find(first)!=B.end()) { B[first]+=second; } else { B[first]=second; } if(B[first]==0) B.erase(first); iter++; } } cout<
                  
                   ::iterator iter = B.begin(); while(iter!=B.end()) { cout<<" "<
                   
                    first<<" "; printf("%.1f",iter->second); iter++; } return 0;}