1002 A+B for Polynomials

1002 A+B for 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 N​1​​ a​N​1​​​​ N​2​​ a​N​2​​​​ ... N​K​​ a​N​K​​​​

where K is the number of nonzero terms in the polynomial, N​i​​ and a​N​i​​​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N​K​​<⋯<N​2​​<N​1​​≤1000.

Output Specification:

For each test case you should output the sum 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 to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:

3 2 1.5 1 2.9 0 3.2

题目思路：

给出两个多项式，两个多项式之和。多项式相加的法则是相同指数的项，系数相加。也就是求每个项的系数和。思路与某个数字出现的次数相同。使用数组进行存储，数组的下标代表指数，相应的值代表系数之和。

满分代码：

#include<iostream>

using namespace std;

int main(){
	int fir, sec, N;
	float a;
	float v[1001] = {0};
	cin >> fir;
	for(int i=0; i<fir; i++){
		cin >> N;
		cin >> a;
		v[N] += a;
	}
	cin >> sec;
	for(int i=0; i<sec; i++){
		cin >> N;
		cin >> a;
		v[N] += a;
	}
	int sum = 0;
	for(int i=0; i<1001; i++){
		if(v[i])
		sum++;
	}
	cout << sum;
	for(int i=1000;i>=0; i--){
		if(v[i]){
			cout << ' ' << i;
			printf(" %.1f" ,v[i]);
		}
	}
} 

题记：

//polynomial 多项式 
//exponents 指数
//coefficients 系数 
//respectively 分别 
//decimal 十进制 

//注意输出的格式，最后是否有空格？