PAT 1002 A+B for Polynomials [模拟] [多项式求和]

最新推荐文章于 2023-09-09 10:00:18 发布

DayDreammerⅠ

最新推荐文章于 2023-09-09 10:00:18 发布

阅读量107

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/Time504/article/details/86590496

版权

PAT 专栏收录该内容

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

我的代码：

#include<stdio.h>

int main()
{
	int a,x,i,j; 
	double m,n[1005]={};
	for(j=0;j<2;j++)
	{
		scanf("%d",&a);
	    for(i=0;i<a;i++)
	    {
	   	    scanf("%d%lf",&x,&m); 
		    n[x] += m; //相同项数(n[x])的系数(m)进行合并 
	    }
	}
	int num = 0;
	//项数的范围是[0,1000] 
	for(i=1000;i>=0;i--)
		if(n[i]) num++; //遍历系数不为零的项 
	printf("%d",num);
	for(i=1000;i>=0;i--)
	    if(n[i])  printf(" %d %.1f",i,n[i]);	
}