1002 A+B for Polynomials (25 分)

最新推荐文章于 2020-12-08 08:06:53 发布

chen_zan_yu_

最新推荐文章于 2020-12-08 08:06:53 发布

阅读量415

点赞数

分类专栏： PAT (甲级) Practice

本文链接：https://blog.csdn.net/chen_zan_yu_/article/details/102065579

版权

PAT (甲级) Practice 专栏收录该内容

121 篇文章 1 订阅

订阅专栏

1002 A+B for Polynomials (25 分)

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

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 <iostream>
#include<stdio.h>
using namespace std;
const int maxn=1001;
double a[maxn]= {0};
int main()
{
    int k,n;
    double x;
    int sum=0;
    scanf("%d",&k);
    for(int i=0; i<k; i++)
    {
        scanf("%d%lf",&n,&x);
        a[n]+=x;
    }
    scanf("%d",&k);
    for(int i=0; i<k; i++)
    {
        scanf("%d%lf",&n,&x);
        a[n]+=x;
    }
    for(int i=1000; i>=0; i--)
    {
        if(a[i]!=0)
            sum++;
    }
    printf("%d",sum);
    for(int i=1000; i>=0; i--)
    {
        if(a[i]!=0)
        {
            printf(" %d %.1lf",i,a[i]);
        }
    }
    printf("\n");
    return 0;
}