PATA 1002 A+B for Polynomials (25分)

PATA 1002 A+B for Polynomials (25分)

题目描述：This time, you are supposed to find A+B where A and B are two polynomials.

---

输入格式：

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…

输出格式：

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.

输入样例：

2 1 2.4 0 3.2
2 2 1.5 1 0.5

输出样例：

3 2 1.5 1 2.9 0 3.2

题意：多项式对应的项相加
思路：记录每个项再对应相加，简单题。
注意输入的&和输出对应的数据类型%lf！

代码：

#include <iostream>
using namespace std;
int main(){
	int a,b;
	double pol[1001]={0};
	scanf("%d",&a);
	for(int i=0;i<a;i++){
		int num;
		double k;
		scanf("%d %lf",&num,&k);
		pol[num] = k; 
	}
/*	for(int i=0;i<1001;i++){
		printf("pol[%d] = %lf\n",i,pol[i]);
	} */
	scanf("%d",&b);
	for(int i=0;i<b;i++){
		int num;
		double k;
		scanf("%d %lf",&num,&k); 
		pol[num] += k; 
	}
	int n;//记录不为0 
	for(int i=0;i<1001;i++){		
		if(pol[i]!=0){
			n++;
		}
	}
	printf("%d",n);
	for(int i=1000;i>=0;i--){
		if(pol[i]!=0){
			printf(" %d %.1lf",i,pol[i]);
		}
	}	
	return 0;
} 

GOGOGOGO！
Love Joyee forever!今天红薯，麻辣烫烤鸡翅！