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

只有20分有点问题

#include<iostream>
#include<fstream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
using namespace std;
void Sum( map<int, double> m1,  map<int, double> m2)
{
	map<int, double> m3;
	for (map<int, double>::iterator it = m1.begin(); it != m1.end(); ++it) {
		for (map<int, double>::iterator it1 = m2.begin(); it1 != m2.end(); ++it1) {
			map<int, double>::iterator it3 = m3.find(it->first + it1->first);
			if(it3==m3.end())
			m3.insert(make_pair(it->first + it1->first, it->second *it1->second));
			else {
				m3[it->first + it1->first] += it->second *it1->second;
			}
		}
	}
	cout << m3.size();
	for (map<int, double>::reverse_iterator it = m3.rbegin(); it != m3.rend(); ++it) {
		printf(" %d %.1f", it->first, it->second);
	}
}
int main()
{
	ifstream inFile("C:\\Users\\DELL\\Desktop\\in.txt");
	map<int, double> m1, m2;
	int exponents;
	double coefficients;
	int N;
	inFile >> N;
	while (N--) {
		inFile >> exponents >> coefficients;
		m1.insert(make_pair(exponents, coefficients));
	}
	inFile >> N;
	while (N--) {
		inFile >> exponents >> coefficients;
		m2.insert(make_pair(exponents, coefficients));
	}
	Sum(m1, m2);
	inFile.close();
	system("pause");
	return 0;
}