# 1009. Product of Polynomials (25)

400 ms

65536 kB

16000 B

Standard

CHEN, Yue

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<vector>
#include <sstream>
#include<cmath>
#include<iomanip>
#include<iostream>
#include <ctype.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;

int main()
{
int n, m;
float numa[1001] = {0.0};//存放A中的各项信息，下标是指数，数组的值是对应的系数
float numb[1001] = {0.0};
float product[2005] = {0.0};//存入乘积的结果

cin >> n;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
cin >> numa[temp];
}

cin >> m;
for (int i = 0; i < m; i++)
{
int temp;
cin >> temp;
cin >> numb[temp];
}

for (int i = 0; i <1001; i++)//i，j的取值尤其注意，一开始没考虑周全，导致两个测试用例出错
{
for (int j = 0; j <1001; j++)
{
float coeff = numa[i] * numb[j];
int exp = i + j;
product[exp] = product[exp]+ coeff;//注意这里的逻辑不要写错了
}
}

int count = 0;
float t = 0.05;
for (int i = 0; i < 2005; i++)//特别注意取值范围
{
if (abs(product[i])>=t)//这里要特别注意，四舍五入后为0的项，也不能显示，并且要加绝对值才能通过最后一个测试用例，但是我其实不是很明白，他们都是大于0的数，为何要加绝对值，但是不加真的就是通不过第一个测试用例，减5分
count++;
}
cout << count;

for (int i = 2004; i >=0; i--)//特别注意取值范围
{
if (abs(product[i])>= t)
{
cout << " " << i << " " << setiosflags(ios::fixed) << setprecision(1) << product[i];
}
}

return 0;
}

• 本文已收录于以下专栏：

## PAT甲级真题及训练集(4)--1009. Product of Polynomials (25)

1009. Product of Polynomials (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 ...

## PAT A1009. Product of Polynomials (25)

This time, you are supposed to find A*B where A and B are two polynomials. Input Specification: ...
• jolivan
• 2017年02月03日 20:53
• 109

## 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...

## PAT 1009. Product of Polynomials (25)

This time, you are supposed to find A*B where A and B are two polynomials. Input Specification: Ea...

## PAT1009Product of Polynomials (25)

This time, you are supposed to find A*B where A and B are two polynomials.Input Specification: Each ...

## (PAT)1009. Product of Polynomials (25)

#include #include #include #include #include #include #include using namespace std; class Pol { pu...

## 1009. Product of Polynomials (25)

1009. Product of Polynomials (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B ...

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

• Line290
• 2016年10月21日 21:40
• 127

举报原因： 您举报文章：1009. Product of Polynomials (25) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)