1009

最新推荐文章于 2021-02-09 21:30:18 发布

比锅

最新推荐文章于 2021-02-09 21:30:18 发布

阅读量135

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/czh1075208140/article/details/79529847

版权

PAT 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

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 product 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 up to 1 decimal place.
Sample Input

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output

3 3 3.6 2 6.0 1 1.6

#include <stdio.h>

int main()
{
    float poly[1001]={0.0};
    float res[2001]={0.0};
    int i;
    int K,exp;
    float coe;
    scanf("%d", &K);
    for(i=0;i<K;i++)
    {
        scanf("%d %f", &exp, &coe);
        poly[exp] = coe;
    }
    scanf("%d", &K);
    for(i=0;i<K;i++)
    {
        scanf("%d %f", &exp, &coe);
        int j;
        for(j=0;j<1001;j++)
        {
            if(poly[j] != 0.0)
            {
                res[j+exp] += poly[j] * coe;
            }
        }
    }
    int num = 0;
    for(i=0;i<2001;i++)
    {
        if(res[i] != 0.0)
            num++;
    }
    printf("%d", num);
    for(i=2000;i>=0;i--)
    {
        if(res[i] != 0.0)
            printf(" %d %.1f", i, res[i]);
    }
    return 0;
}