[PTA] 7-2 一元多项式的乘法与加法运算

题目详情
题目分析：

• 这一题细节比较多

#include <cstdio>
int a, b, index, value, q[2222], w[2222], e[4444], r[2222], flag, minn = 0x3f3f3, minnn = 0x3f3f3;
int main(){
    scanf("%d", &a);
    for (int i = 0; i < a; i++)
    {
        scanf("%d%d", &value, &index);
        q[index + 1000] = value;
    }
    scanf("%d", &b);
    for (int i = 0; i < b; i++)
    {
        scanf("%d%d", &value, &index);
        w[index + 1000] = value;
    }

    for (int i = 0; i < 2001; i++) 
        for (int j = 0; j < 2001; j++){
            e[i + j] += q[i] * w[j];
            if (e[i + j])
                minn = i + j < minn ? i + j : minn;
        }

    for (auto i = 0; i < 2001; i++){
        r[i] += q[i] + w[i];
        if (r[i])
            minnn = i < minnn ? i : minnn;
    }

    if (a){
    for (int i = 4000; i >= 0; i--)
        if (e[i]){
            if (i == minn)
                printf("%d %d\n", e[i], i - 2000);
            else
                printf("%d %d ", e[i], i - 2000);
        }

    }
    else
        printf("0 0\n");

    for (int i = 2000; i >= 0; i--)
        if (r[i]){
            flag = 1;
            if (i == minnn)
                printf("%d %d", r[i], i - 1000);
            else
                printf("%d %d ", r[i], i - 1000);
        }
    if (!flag)
        printf("0 0");
}