PAT Advanced Level 1002:A+B for Polynomials

最新推荐文章于 2024-09-04 16:56:47 发布

原创最新推荐文章于 2024-09-04 16:56:47 发布 · 541 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

9 篇文章

订阅专栏

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

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
    freopen("input.txt","r",stdin);
    int i=2,f,j,k[20],N,c=0;//c代表k的值
    float p[1001],A;
    memset(p,0,sizeof(p));
    while(i--){
        scanf("%d",&f);
        while(f--){
            scanf("%d%f",&N,&A);
            for(j=0;j<c;j++){
                if(k[j]==N)
                break;
            }
            if(j==c)
            k[c++]=N;
            p[N]+=A;
        }
    }
    sort(k,k+c);
    N=c;
    for(i=c-1;i>=0;i--){
        if(p[k[i]]==0)
        N--;   
    }
    printf("%d",N);

    for(i=c-1;i>=0;i--){
        if(p[k[i]]!=0)
        printf(" %d %.1f",k[i],p[k[i]]);
    }
    return 0;
}