1002. A+B for Polynomials

最新推荐文章于 2023-01-07 06:30:00 发布

nabatl

最新推荐文章于 2023-01-07 06:30:00 发布

阅读量103

点赞数

分类专栏：模拟多项式

本文链接：https://blog.csdn.net/qq_42167059/article/details/99680567

版权

模拟同时被 2 个专栏收录

3 篇文章 0 订阅

订阅专栏

多项式

2 篇文章 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 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

注意格式的输出，printf(" %d %.1f",i,a[i]); 精确到小数点后一位输出；C语言接收float类型的变量格式为: printf("%f",i); 接收double类型的变量为printf（“%lf”，i）；

/*
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;
float a[1001];
int count=0;
int main()
{
  	int N,M;
  	int zhishu;
  	float xishu;
  	scanf("%d",&N);
  	for(int i=0;i<N;i++)
  	{
  		scanf("%d %f",&zhishu,&xishu);
  		a[zhishu]+=xishu;
	}
	scanf("%d",&M);
	for(int i=0;i<M;i++)
	{
		scanf("%d %f",&zhishu,&xishu);
  		a[zhishu]+=xishu;
	}
	for(int i=0;i<1001;i++)
	{
		if(a[i]!=0) count++;
	}
	printf("%d",count);
	for(int i=1000;i>=0;i--)
	{
		if(a[i]!=0.0)
		{
			printf(" %d %.1f",i,a[i]); 
		}
	}
}