1009 Product of Polynomials (25分)

最新推荐文章于 2020-06-07 16:20:19 发布

Crush_f

最新推荐文章于 2020-06-07 16:20:19 发布

阅读量98

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/qq_43307196/article/details/104116285

版权

在这里插入图片描述

#include<stdio.h>
int main(){
    int m, n, cnt = 0;
    float c[2010] = {0};
    scanf("%d", &m);
    float a[2 * m];
    for(int i = 0; i < 2 * m; i = i + 2){
        scanf("%f %f", &a[i], &a[i + 1]);
    }
    scanf("%d", &n);
    float b[2 * n];
    for(int i = 0; i < 2 * n; i = i + 2){
        scanf("%f %f", &b[i], &b[i + 1]);
    }
    for(int i = 0; i < 2 * m; i = i + 2){
        for(int j = 0; j < 2 * n; j = j + 2){
            float k, e;
            k = a[i + 1] * b[j + 1];
            e = a[i] + b[j];
            c[(int)e] += k;
        }
    }
    for(int i = 0; i < 2010; i ++){
        if(c[i] != 0) cnt++;
    }
    printf("%d", cnt);
    for(int i = 2009; i >= 0; i--){
        if(c[i] != 0) printf(" %d %.1f", i, c[i]);
    }
    return 0;
}