【PAT甲级】1009. Product of Polynomials (25)

最新推荐文章于 2021-07-28 16:26:15 发布

lambsnow

最新推荐文章于 2021-07-28 16:26:15 发布

阅读量239

点赞数 1

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.csdn.net/lambsnow/article/details/52704343

版权

PAT 专栏收录该内容

78 篇文章 0 订阅

订阅专栏

#include <stdio.h>

int main(int argc, char *argv[]) {
    int k, n, i, j;
    double d;
    double a1[1001] = {0.0};
    double a[2001] = {0.0};
    scanf("%d", &k);
    for (i = 0; i < k; i++) {
        scanf("%d %lf", &n, &d);
        a1[n] = d;
    }
    scanf("%d", &k);
    for (i = 0; i < k; i++) {
        scanf("%d %lf", &n, &d);
        for (j = 0; j < 1001; j++) {
            if (a1[j] != 0 && d != 0.0) {
                a[j + n] += a1[j] * d;
            }
        }
    }
    int count = 0;
    for (i = 0; i < 2001; i++) {
        if (a[i] != 0.0)
            count++;
    }
    printf("%d", count);
    for (i = 2000; i >= 0; i--) {
        if (a[i] != 0.0)
            printf(" %d %.1f", i, a[i]);
    }
    printf("\n");

    return 0;
}