[PAT Advanced Level] 1002 A+B for Polynomials

[PAT Advanced Level] 1002 A+B for Polynomials

题目

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{N}_1{a}_{N_2}...N_K{a}_{N_K}$
where K is the number of nonzero terms in the polynomial, $N_i$ and $a_{N_i}$ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that $1\le K\le 10,0\le N_K<...<N_2<N_1\le 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.

多项式的形式，计算a+b的值，第一位为多项式的项数，然后两个为一单位，第一个为幂次数，第二个为系数。

示例

输入：
2 1 2.4 0 3.2
2 2 1.5 1 0.5

输出：
3 2 1.5 1 2.9 0 3.2

题解

将a，b的多项式的幂次数和对应的系数，以数组c的形式存储，下标为幂次数，对应存储的值为系数，相同的幂次数，累加即可，幂次数以0-1000升序存储。最后输出时，应注意从1000-0降序输出。

#include <iostream>
using namespace std;
int main()
{
    float c[1001]={0};
    int m,n,t;
    float num;
    scanf("%d",&m);
    for(int i=0;i<m;i++)
    {
        scanf("%d%f",&t,&num);
        c[t]+=num;
    }
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d%f",&t,&num);
        c[t]+=num;
}
    int cnt=0;
    for(int i=0;i<1001;i++)
    {
        if(c[i]!=0)cnt++;
}
    printf("%d",cnt);
    for(int i=1000;i>=0;i--)
    {
        if(c[i]!=0.0)
            printf(" %d %.1f",i,c[i]);
}
    return 0;
}

参考

1002. A+B for Polynomials (25)-PAT甲级真题 柳婼 .