1002. A+B for Polynomials

最新推荐文章于 2022-08-10 19:42:18 发布

heroacool

最新推荐文章于 2022-08-10 19:42:18 发布

阅读量535

点赞数

CC 4.0 BY-SA版权

文章标签： PAT

本文链接：https://blog.youkuaiyun.com/heroacool/article/details/48939077

本文详细阐述了如何通过直接声明系数数组实现多项式的相加运算，并提供了输入输出示例和解题思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

解题思路：
1，用空间换取时间，直接声明coef[1001]存储系数，但是这样的话coef是一个稀疏的结构。
2，这个题的本意应该是考擦链表。

#include <iostream>
#include <string>
using namespace std;


int main(){

    double coef[1001] = { 0 };
    int k1, k2;
    cin >> k1; 

    int e;
    double c;
    for (int i = 0; i < k1; i++){
        cin >> e >> c;
        coef[e] += c;
    }

    cin >> k2;
    for (int i = 0; i < k2; i++){
        cin >> e >> c;
        coef[e] += c;

    }


    int counter = 0;
    for (int i = 1000; i >= 0; i--){
        if (coef[i] != 0)
            counter++;
    }
    cout << counter;

    for (int i = 1000; i >= 0; i--){
        if (coef[i] != 0){
            printf(" %d %.1lf", i, coef[i]);
        }
    }



}