1002. A+B for Polynomials (25)

深碍√TFBOYSˉ_ 2022-06-18 08:56 113阅读 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 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**

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<stdio.h>
    #include<math.h>
    #include<string.h>
    int main()
    {
        int i,j,n,m,k,t,p,s;
        double a[10001],l,f;
        while(scanf("%d",&n)!=EOF)
            {
                p=0;
                s=0;
                memset(a,0,sizeof(a));
            for(i=0;i<n;i++)
            {
                scanf("%d",&m);
                if(p<m)
                    p=m;
                scanf("%lf",&f);
                a[m]+=f;
            }
            scanf("%d",&k);
            for(i=0;i<k;i++)
            {
                scanf("%d",&t);
                if(p<t)
                    p=t;
                scanf("%lf",&l);
                    a[t]+=l;
            }
    
            for(i=p;i>=0;i--)
            {
                if(fabs(a[i])>1e-6)
                   {
                    s++;
                   }
            }
            printf("%d",s);
            for(i=p;i>=0;i--)
            {
                if(fabs(a[i])>1e-6)
                {
                    printf(" %d %.1lf",i,a[i]);
                }
            }
            printf("\n");
            }
        return 0;
    }