PAT 甲级 1009.Product of Polynomials（25）

原文：

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 thPe 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<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main(){
    int k,cnt=0;
    cin>>k;
    double e[1001]={0},output[2001]={0};
    for(int i=0;i<k;i++){
        int a;
        double b;
        cin>>a>>b;
        e[a]=b;
    }
    cin>>k;
    for(int i=0;i<k;i++){
        int a;
        double b;
        cin>>a>>b;
        for(int j=0;j<1000;j++){
            output[a+j]+=e[j]*b;
        }
    }
    for(int i=0;i<2001;i++){
        if(output[i]!=0){
            cnt++;
        }
    }
    cout<<cnt;
    for(int i=2000;i>=0;i--){
        if(output[i]!=0){
            printf(" %d %.1f",i,output[i]);
        }
    }
    return 0;
}

这段代码后面三个测试案例都显示答案错误

---

找到问题了，j应该小于1001，给我写成了小于1000，泪流满面，我是**

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main(){
    int k,cnt=0;
    cin>>k;
    double e[1001]={0},output[2001]={0};
    for(int i=0;i<k;i++){
        int a;
        double b;
        cin>>a>>b;
        e[a]=b;
    }
    cin>>k;
    for(int i=0;i<k;i++){
        int a;
        double b;
        cin>>a>>b;
        for(int j=0;j<1001;j++){
            output[a+j]+=e[j]*b;
        }
    }
    for(int i=0;i<2001;i++){
        if(output[i]!=0){
            cnt++;
        }
    }
    cout<<cnt;
    for(int i=2000;i>=0;i--){
        if(output[i]!=0){
            printf(" %d %.1f",i,output[i]);
        }
    }
    return 0;
}