PAT 1002. A+B for Polynomials (25)

范星月  [编辑资料]  [登出]

---

• 主页
• 题目集
  • 基本信息
  • 题目列表
  • 提交列表
  • 排名
• 帮助

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

---

提交代

码

题意：

给出n,n个项的指数与系数

给出m,m个项的指数与系数

将多项式求和，

按照指数从大到小的顺序输出系数不为0的项，末尾不允许有空格

代码：

#include <iostream>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;

int main()
{
    int exp;
    double coe;
    double a[1010]={0};
    int m,n;
    int cnt=0;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>exp>>coe;
        a[exp]+=coe;
    }
    cin>>m;
    for(int i=0;i<m;i++)
    {
        cin>>exp>>coe;
        a[exp]+=coe;
    }
    for(int i=0;i<1010;i++)
    {
        if(a[i]!=0)
            cnt++;
    }
    cout<<cnt;
    for(int i=1009;i>=0;i--)
    {
        if(a[i]!=0)
            printf(" %d %.1lf",i,a[i]);
    }
    return 0;
}