PAT (Advanced Level) Practice 1002 A+B for Polynomials （25 分）

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{N}_1{a}_{N_1}{a}_2{a}_{N_2}...N_K{a}_{N_K}$
where $K$ is the number of nonzero terms in the polynomial, $N_i$and $a_{N_i}(i=1,2,\cdots ,K)$ are the exponents and coefficients, respectively. It is given that $1\le K\le 10，0\le N_K<\cdots <N_2<N_1\le 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

My code

#include <stdio.h>
#include <stdlib.h>

void printarray(double *a, int n)
{
    for (int i = 0; i < n; i++){
        printf("%.1f ", a[i]);
    }
    printf("\n");
}

int main(void)
{
    double a[21], b[21];
    
    scanf("%lf", &a[0]);
    for (int i=1; i <=2*a[0]; i++){
        scanf("%lf", &a[i]);
    }
    
    scanf("%lf", &b[0]);
    for (int i=1; i <=2*b[0]; i++){
        scanf("%lf", &b[i]);
    }
    
    int ina, inb;
    ina = inb = 1;
    
    double c[50];
    int inc = 1;
    c[0] = a[0]+b[0];
    
    int s=0;
    
    while (ina <= 2*a[0] && inb <= 2*b[0]){
        if (a[ina]>b[inb]){
            c[inc] = a[ina];
            c[inc+1] = a[ina+1];
            ina = ina+2;
            inc = inc+2;
            s++;
        }
        else if (a[ina]<b[inb]){
            c[inc] = b[inb];
            c[inc+1] = b[inb+1];
            inb = inb+2;
            inc = inc+2;
            s++;
        }
        else{
            if ((a[ina+1] + b[inb+1])!=0){
                c[inc] = a[ina];
                c[inc+1] = a[ina+1] + b[inb+1];
                inc = inc+2;
                ina = ina+2;
                inb = inb+2;
                s++;
            }
            else{
                ina = ina+2;
                inb = inb+2;
            }
        }
    }
        
    while (ina <= 2*a[0]){
        c[inc] = a[ina];
        c[inc+1] = a[ina+1];
        ina = ina+2;
        inc = inc+2;
        s++;
    }
    
    while (inb <= 2*b[0]){
        c[inc] = b[inb];
        c[inc+1] = b[inb+1];
        inb = inb+2;
        inc = inc+2;
        s++;
    }
    
    if(s==0){
        printf("0");
        return 0;
    }
    
    printf("%d ", s);
    for (int i=1; i < inc; i++){
        if (i%2==0){
            printf("%.1f", c[i]);
        }
        else printf("%.0f", c[i]);
        if (i<inc-1) printf(" ");
    }
    return 0;
}