1002 A+B for Polynomials-CSDN博客

本文链接：https://blog.csdn.net/HappniessWord/article/details/89159549

本文介绍了一种解决多项式加法问题的算法实现，通过输入两个多项式的非零项系数和指数，输出它们的和。算法使用了直接暴力求解的方法，适用于指数范围在0到1000之间的多项式。

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

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

反正指数最大也就1000，直接暴力。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define N 1010

using namespace std;

int main()
{
    int n,x;
    double ans[N],y;
    while(~scanf("%d",&n)){
        int sum=0;
        memset(ans,0,sizeof(ans));
        for(int i=0;i<n;i++){
            scanf("%d %lf",&x,&y);
            ans[x]+=y;
        }
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d %lf",&x,&y);
            ans[x]+=y;
        }
        for(int i=0;i<N;i++){
            if(ans[i]>0)
                sum++;
        }
        printf("%d",sum);
        for(int i=N-1;i>=0;i--)
            if(ans[i]>0)
                printf(" %d %.1lf",i,ans[i]);
        printf("\n");
    }
    return 0;
}