1002 A+B for Polynomials (25 point(s)) - C语言 PAT 甲级

最新推荐文章于 2020-12-12 22:22:45 发布

有三只土豆

最新推荐文章于 2020-12-12 22:22:45 发布

阅读量247

点赞数

分类专栏： PAT 甲级文章标签： PAT 甲级 C

本文链接：https://blog.csdn.net/huaxuewan/article/details/99896929

版权

PAT 甲级专栏收录该内容

155 篇文章 3 订阅

订阅专栏

1002 A+B for Polynomials (25 point(s))

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₁ a_N₁ N₂ a_N₂ … 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,⋯,K) are the exponents and coefficients, respectively. It is given that 1 ≤ K ≤ 10，0 ≤ N_K < ⋯ < N₂ < N₁ ≤ 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 (gcc)

#include <stdio.h>

int main()
{
        double exs[1001] = {0.0};
        double co;
        int k, i, j, ex;

        for (i = 0; i < 2; i++) {
                scanf("%d", &k);
                for (j = 0; j < k; j++) {
                        scanf("%d %lf", &ex, &co);
                        exs[ex] += co;
                }
        }

        for (i = 0, j = 0; i < 1001; i++)
                if (exs[i] != 0)
                        j++;
        printf("%d", j);
        for (i = 1000; i >= 0; i--)
                if (exs[i] != 0)
                        printf(" %d %.1f", i, exs[i]);
        return 0;
}