Problem #
Source: PAT {target="_blank"}
Description #
This time, you are supposed to find where and 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:
where is the number of nonzero terms in the polynomial, and are the exponents and coefficients, respectively. It is given that .
Output Specification #
For each test case you should output the product of and 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.5Sample Output #
3 3 3.6 2 6.0 1 1.6Solution #
Code #
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int k1, k2;
map<int, float> p1, p2;
map<int, float, greater<int> > res;
scanf("%d", &k1);
for (int i= 0; i< k1; i++) {
int e;
float c;
scanf("%d %f", &e, &c);
p1.insert(make_pair(e, c));
}
scanf("%d", &k2);
for (int i= 0; i< k2; i++) {
int e;
float c;
scanf("%d %f", &e, &c);
p2.insert(make_pair(e, c));
}
map<int, float>::iterator iter1;
map<int, float>::iterator iter2;
for (iter1= p1.begin(); iter1!= p1.end(); iter1++) {
for (iter2= p2.begin(); iter2!= p2.end(); iter2++) {
int ep;
float cof;
ep= iter1->first+ iter2->first;
cof= iter1->second* iter2->second;
map<int, float>::iterator ifind;
ifind= res.find(ep);
if (ifind== res.end()) {
res.insert(make_pair(ep, cof));
} else {
ifind->second+= cof;
}
}
}
int count= 0;
map<int, float>::iterator it;
for (it= res.begin(); it!= res.end(); it++) {
if (it->second!= 0) count++;
}
printf("%d ", count);
for (it= res.begin(); it!= res.end(); it++) {
if (it->second!= 0) {
if (it== res.begin()) {
printf("%d %.1f", it->first, it->second);
} else {
printf(" %d %.1f", it->first, it->second);
}
}
}
}
