1002. A+B for Polynomials (25)

最新推荐文章于 2021-09-07 12:21:13 发布

Uncle_Sugar

最新推荐文章于 2021-09-07 12:21:13 发布

阅读量352

点赞数

分类专栏： PAT甲级文章标签：编程 PAT 基础

本文链接：https://blog.csdn.net/sinat_29278271/article/details/48002967

版权

PAT甲级专栏收录该内容

37 篇文章 1 订阅

订阅专栏

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

说白了就是一个归并，只要注意系数为0的时候不要输出就好了

# include <cstdio>
# include <iostream>
using namespace std;
# define Size 10001

struct Node
{
    double a;
    int n;
    Node(){}
    void Set(int N,double A){a=A,n=N;}
    void Read()
    {
        scanf("%d%lf",&n,&a);
    }
    void Print()
    {
        printf(" %d %.1f",n,a);
    }
};
struct NodeArray
{
    Node *Array;
    int End,Lenth;
    NodeArray(int n = Size):End(0),Lenth(Size)
    {
        Array = new Node[Size];
    }
    void Add()
    {
        Array[End++].Read();
    }
    void Add(double a,int n)
    {
        Array[End++].Set(n,a);
    }
    void PrintArray()
    {
        printf("%d",End);
        for (int i=0;i<End;i++)
            Array[i].Print();
        cout << endl;
    }
};
int main()
{
    NodeArray a1,a2,ans;
    int k;
    cin >> k;
    while (k--)
        a1.Add();
    //cout << "here" << endl;
    cin >> k;
    while (k--)
        a2.Add();
    int i=0,j=0;
    //a1.PrintArray();
    //a2.PrintArray();
    while (i<a1.End&&j<a2.End)
    {
        Node& s1 = a1.Array[i];
        Node& s2 = a2.Array[j];
        if (s1.n>s2.n)
            ans.Add(s1.a,s1.n),i++;
        else if (s1.n<s2.n)
            ans.Add(s2.a,s2.n),j++;
        else
            {
            if ((s2.a+s1.a)>1e-2)
                ans.Add(s2.a+s1.a,s1.n);
            i++,j++;
            }
    }
    while (i<a1.End)
    {
         Node& s1 = a1.Array[i];
         ans.Add(s1.a,s1.n),i++;
    }
    while (j<a2.End)
    {
         Node& s2 = a2.Array[j];
         ans.Add(s2.a,s2.n),j++;
    }
    ans.PrintArray();
    return 0;
}