1002. A+B for Polynomials (25)

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 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

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的情况。

Code:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
using namespace std;
int main()
{
    int i;
    float pol[1100];
    for(i=0;i<1100;++i)
        pol[i]=0.0;
    int k,temp1;
    float temp2;
    cin>>k;
    for(i=0;i<k;++i)
    {
        cin>>temp1;
        cin>>pol[temp1];
    }
    int cnt=k;
    cin>>k;
    for(i=0;i<k;++i)
    {
        cin>>temp1>>temp2;
        if(pol[temp1]==0.0)
        {
            ++cnt;
            pol[temp1]=temp2;
        }
        else
            pol[temp1]+=temp2;
        if(pol[temp1]==0.0)//如果相加后系数为0,总个数减一
            --cnt;
    }
    cout<<cnt;
    for(i=1099;i>=0;--i)
    {
        if(pol[i]!=0.0)
            printf(" %d %.1f",i,pol[i]);
    }
    return 0;
}

打个小广告

欢迎加入我的知识星球「基你太美」,我会在星球中分享 AucFrame 框架、大厂面经、AndroidUtilCode 更详尽的说明…一切我所了解的知识,你可以通过支付进入我的星球「基你太美」进行体验,加入后优先观看星球中精华的部分,如果觉得星球的内容对自身没有收益,你可以自行申请退款退出星球,也没必要加我好友;如果你已确定要留在我的星球,可以通过扫描如下二维码(备注:基你太美+你的星球昵称)加我个人微信,方便我后续拉你进群(PS:进得越早价格越便宜)。

我的二维码