1002. A+B for Polynomials (25)

最新推荐文章于 2022-03-23 20:57:34 发布

Star1996

最新推荐文章于 2022-03-23 20:57:34 发布

阅读量360

点赞数

分类专栏： PAT甲级刷题记录

本文链接：https://blog.csdn.net/Star1996/article/details/70234095

版权

PAT甲级刷题记录专栏收录该内容

19 篇文章 0 订阅

订阅专栏

1002. A+B for Polynomials (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

This time, you are supposed to find A+B where A and B are two polynomials.

Input

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < ... < N2 < N1 <=1000.

Output

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

/*
多项式的加法，系统不为零的个数的输出，接下来是指数，系数的输出。
个人问题：nonzero的判断条件写成了大于零。 
*/ 
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
  int k1,k2;
  float sum[1005];
  int max=0;
  memset(sum,0,sizeof(sum)); 
  cin>>k1;
  while(k1--)
  {
    int nk;
    float ank;
    cin>>nk>>ank;
    sum[nk]+=ank;
    if(nk>max)
      max=nk;
  }
  cin>>k2;
  while(k2--)
  {
    int nk;
    float ank;
    cin>>nk>>ank;
    sum[nk]+=ank;
    if(nk>max)
      max=nk;
  }
  int nonzero=0;
  for(int i=0;i<=max;i++)
  {
    if(sum[i]!=0)nonzero++;
  }
  cout<<nonzero;
  for(int i=max;i>=0;i--)
  {
    if(sum[i]!=0)
    {
      cout<<" "<<i<<" ";
      printf("%.1f",sum[i]);
    }
  }
  cout<<endl;
  return 0;
}