PAT甲级 1002 A+B for Polynomials

最新推荐文章于 2024-09-11 15:28:58 发布

つ、hooligan

最新推荐文章于 2024-09-11 15:28:58 发布

阅读量134

点赞数

分类专栏： PAT真题文章标签： c++ c语言

本文链接：https://blog.csdn.net/weixin_43434472/article/details/104066859

版权

PAT真题专栏收录该内容

11 篇文章 0 订阅

订阅专栏

PAT甲级 1002 A+B for Polynomials

题目描述

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₁ a_N1 N₂ a_N2 … N_K a_NK
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 ≤ N_K <⋯<N₂ <N₁ ≤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 N1, N2,n;
	float p[1001],a;
	cin >> N1;
	int i;
	for(i=0;i<=1000;i++)
		p[i]=0;
	for (i = 0; i < N1; i++) {
		cin >> n >> a;
		p[n]+=a;
	}
	cin >> N2;
	for (i = 0; i < N2; i++) {
		cin >> n >> a;
		p[n]+=a;
	}
	int count=0;
	for (i = 0; i<=1000; i++){
		if(p[i]!=0)
			count++;
	}
	cout<<count;
	for(i=1000;i>=0;i--)
		if(p[i]!=0)
			printf(" %d %.1f",i,p[i]);
	return 0;
}