PAT A1002 菜逼刷题

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

排版有点乱，也不想管

分析

1.多项式加法，输入/输出依次是 项数 ，次数，值
eg：2 1 2.4 0 3.2 =2.4x^1 +3.2
2 2 1.5 1 0.5 =1.5x^2+0.5x
2.利用散列即可，也比较简单

#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
struct Polynomials {
	int num;
	double a[1010] = { 0 };
};
int main() {
	int n, t;
	double x;
	Polynomials t1;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> t >> x;
		t1.a[t] += x;
	}
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> t >> x;
		t1.a[t] += x;
	}
	int count=0;//记录系数
	for (int i = 0; i <= 1000; i++) {
		if (t1.a[i] != 0) {
			++count;
		}
	}
	t1.num = count;
	if (count == 0) {
		printf("0\n");
	}
	else {
		printf("%d ", count);
		for (int i = 1000; i >= 0; i--) {
			if (t1.a[i] != 0) {
				printf("%d %.1f", i, t1.a[i]);
				if (--count != 0){
					printf(" ");
				}
				else printf("\n");
			}
		}
	}

	//system("pause");
	return 0;
}