1002. A+B for Polynomials

最新推荐文章于 2023-03-16 22:47:48 发布

无知的渣渣

最新推荐文章于 2023-03-16 22:47:48 发布

阅读量1.7k

点赞数

分类专栏： PAT（甲级）文章标签： c语言 pat

本文链接：https://blog.csdn.net/dengkuomin/article/details/61418468

版权

PAT（甲级）专栏收录该内容

8 篇文章 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

解题思路：题目很简单，大意就是多项式相加，给你两个多项式的指数和系数，要你算出相加的结果

代码如下：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int n,m,x,b[1001];
    double y,a[1001]={0};///a数组下标相当于指数值
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d %lf",&x,&y);
        a[x]=y;
    }
    scanf("%d",&m);
    for(int i=0;i<m;i++)
    {
        scanf("%d %lf",&x,&y);
        a[x]+=y;
    }
    int t=0;
    for(int i=0;i<1001;i++)
        if(a[i]) b[t++]=i;
    printf("%d",t);
    for(int i=t-1;i>=0;i--)
        printf(" %d %.1lf",b[i],a[b[i]]);
    printf("\n");
    //printf("%d %.1lf\n",b[0],a[b[0]]);
    return 0;
}