1002 A+B for Polynomials （25 分）

最新推荐文章于 2020-02-10 20:07:00 发布

原创最新推荐文章于 2020-02-10 20:07:00 发布 · 795 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

PAT甲级真题练习专栏收录该内容

165 篇文章

订阅专栏

本文介绍了一种解决多项式加法问题的算法实现，输入两个多项式的非零项系数和指数，输出它们的和。算法首先初始化多项式，然后读取输入的多项式信息，通过比较指数大小进行相加操作，最后输出结果。

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

C：

/*
 @Date    : 2017-11-26 18:07:18
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://www.patest.cn/contests/pat-a-practise/1002
 */

#include <stdio.h>

#define MAXK 10

typedef struct PNODE Poly;
struct PNODE
{
    double c;
    int e;
};

void Initialize(Poly P[])
{
    int i;
    for (i = 0; i < MAXK; i++)
    {
        P[i].e = -1;
        P[i].c = -1;
    }
    return;
}

void ReadPoly(Poly P[])
{
    int K;
    scanf("%d", &K);
    int i;
    for (i = 0; i < K; i++)
    {
        scanf("%d %lf", &P[i].e, &P[i].c);
    }
    return;
}

int Add(Poly Sum[], Poly P1[], Poly P2[])
{
    int i, p1, p2;
    p1 = p2 = 0;
    int e;
    double c;
    for (i = 0; p1 < MAXK && p2 < MAXK && P1[p1].e != -1 && P2[p2].e != -1;)
    {
        if (P1[p1].e > P2[p2].e)
        {
            e = P1[p1].e;
            c = P1[p1].c;
            p1++;
        }
        else if (P2[p2].e > P1[p1].e)
        {
            e = P2[p2].e;
            c = P2[p2].c;
            p2++;
        }
        else
        {
            e = P1[p1].e;
            c = P1[p1].c + P2[p2].c;
            p1++;
            p2++;
        }
        if (c)
        {
            Sum[i].c = c;
            Sum[i].e = e;
            i++;
        }
    }
    while (p1 < MAXK && P1[p1].e != -1)
    {
        Sum[i].c = P1[p1].c;
        Sum[i].e = P1[p1].e;
        p1++;
        i++;
    }
    while (p2 < MAXK && P2[p2].e != -1)
    {
        Sum[i].c = P2[p2].c;
        Sum[i].e = P2[p2].e;
        p2++;
        i++;
    }
    return i;
}

void PrintPoly(Poly P[], int n)
{
    printf("%d", n);
    int i;
    // int output = 0;
    for (i = 0; i < n; i++)
    {
        printf(" %d %.1f", P[i].e, P[i].c);
        // if (!output)
        // {
        //     output = 1;
        // }
    }
    // if (!output)
    // {
    //     printf("0 0");
    // }
    putchar('\n');
    return;
}

int main()
{
    Poly P1[MAXK], P2[MAXK];
    Initialize(P1);
    Initialize(P2);
    ReadPoly(P1);
    ReadPoly(P2);
    Poly Sum[2*MAXK];
    Initialize(Sum);
    int n;
    n = Add(Sum, P1, P2);
    PrintPoly(Sum, n);
    return 0;
}