PAT A1009 Product of Polynomials(25)

课本AC代码

#include <cstdio>
struct Poly {
    int exp;//指数
    double cof;
} poly[1001];//第一个多项式

double ans[2001];//存放结果
int main() {
    #ifdef ONLINE_JUDGE
    #else
        freopen("1.txt", "r", stdin);
    #endif // ONLINE_JUDGE
    int n, m, number = 0;
    scanf("%d", &n);//第一个多项式中非零系数的项数
    for(int i = 0; i < n; i++) {
        scanf("%d %lf", &poly[i].exp, &poly[i].cof);//第一个多项式的指数和系数
    }
    scanf("%d", &m);//第二个多项式中非零系数的项数
    for(int i = 0; i < n; i++) {
        int exp;
        double cof;
        scanf("%d%lf", &exp, &cof); //第二个多项式的指数和系数
        for(int j = 0; j < n; j++) {//与第一个多项式中的每一项相乘
            ans[exp + poly[j].exp] += (cof * poly[i].cof);
        }
    }
    for(int i = 0; i <= 2000; i++) {
        if(ans[i] != 0.0) number++; //累计非零系数的项数
    }
    printf("%d", number);
    for(int i = 2000; i >= 0; i--) { //输出
        if(ans[i] != 0.0) {
            printf(" %d %.1f", i, ans[i]);
        }
    }
    return 0;
}

自己代码,调试还总是出错

#include <cstdio>
#include <algorithm>
const int max_n = 2100;

using namespace std;

double p1[max_n][2] = {0.0}, product[max_n] = {0.0};
int main() {
    #ifdef ONLINE_JUDGE
    #else
        freopen("1.txt", "r", stdin);
    #endif // ONLINE_JUDGE
    int n1 = 0, n2 = 0, big = 0;
    scanf("%d", &n1);
    for(int i = 0; i < n1; i++) {
        int cof;
        double exp;
        scanf("%d %1f", &cof, &exp);//p1[i][0]:系数, p1[i][1]:指数
        p1[cof] += exp;
    }
    /*for(int i = 0; i < n1; i++) {
        printf("1:  %d  %1f  \n\n", p2[i], p1[i]);//p1[i][0]:系数, p1[i][1]:指数
    }
    scanf("%d", &n2);
    for(int i = 0; i < n2; i++) {
        int cof;
        double exp;
        scanf("%d %1f", &cof, &exp);//p2[i][0]:系数, p2[i][1]:指数
        for(int j = 0; j < n1; j++) {
            for(int i = 0; i < 1010; i++) {
            product[exp +
    }
    /*for(int i = 0; i < n1; i++) {
        printf("2:  %d  %1f  \n\n", p4[i], p3[i]);//p1[i][0]:系数, p1[i][1]:指数
    }
    for(int i = 0; i < n2; i++) {
        for(int j = 0; i < n1; j++) {
            p5[p2[i] + p4[i]] += (p1[i] * p3[i]);
        }
    }
    int num = 0;
    for(int i = 0; i <= max_n; i++) {
        if(p5[i] != 0.0) num++;
    }
    printf("%d", num);
    for(int i = max_n; i > 0; i--) {
        if(p5[i] != 0.0) {
            printf(" %d %1f", i, p5[i]);
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/isChenJY/p/11240756.html