[C++] 1009 Product of Polynomials (25分)

最新推荐文章于 2022-02-20 15:19:12 发布

知勉

最新推荐文章于 2022-02-20 15:19:12 发布

阅读量169

点赞数

分类专栏：手撕算法 # PAT甲级

本文链接：https://blog.csdn.net/qq_41332284/article/details/105405741

版权

手撕算法同时被 2 个专栏收录

77 篇文章 0 订阅

订阅专栏

PAT甲级

9 篇文章 0 订阅

订阅专栏

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

这道题着实花费了点力气，各种打补丁，不过通过这道题进一步了解了map的使用方法，也不失为一件好事。

#include <iostream>
#include <vector>
#include <map>
using namespace std;
struct node{
	double coe;
	int exp;
};
int main() {
    int n, m;
    map<int, double> mapp;
	scanf("%d", &n);
	vector<node> vn(n);
    for (int i = 0; i < n; i++) 
    	scanf("%d %lf", &vn[i].exp, &vn[i].coe);
	scanf("%d", &m);
	int e;
	double c;
	for (int i = 0; i < m; i++) {
		scanf("%d %lf", &e, &c);
		for (int j = 0; j < n; j++) {
			int t = vn[j].exp + e;
			mapp[t] += (c * vn[j].coe);		//map不必先判断是否存在 
			if (mapp[t] == 0) mapp.erase(t); 
		}
	}	
	printf("%d", mapp.size());
	for (auto it = mapp.rbegin(); it != mapp.rend(); it++) {		//map的遍历，rbegin/begin 
			printf(" %d %.1lf", it->first, it->second); 
	}
    return 0;
}