1002. A+B for Polynomials

最新推荐文章于 2022-03-23 20:57:34 发布

天生就蠢

最新推荐文章于 2022-03-23 20:57:34 发布

阅读量408

点赞数

分类专栏： PAT Advanced Level

本文链接：https://blog.csdn.net/always_regret/article/details/38240133

版权

PAT Advanced Level 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

1002. A+B for Polynomials (25)

时间限制

400 ms

内存限制

32000 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

CPP

#include <iostream>
#include <cstdio>

using namespace std;
float arr[1001];
int main(int argc,char*argv[]){
    for(int i=0;i<1001;++i) arr[i] = 0;
    for(int j=0;j<2;++j){
        int k;
        scanf("%d",&k);
        for(int i=0;i<k;++i){
            int N;
            float a;
            scanf("%d %f",&N,&a);
            arr[N] += a;
        }
    }
    int sum = 0;
    for(int i=1000;i>=0;--i){
        if(arr[i]!=0) ++sum;
    }
    printf("%d",sum);
    for(int i=1000;i>=0;--i){
         if(arr[i]!=0) printf(" %d %.1f",i,arr[i]);
    }
    return 0;
}