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
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
#include <iostream>
using namespace std;
const int LEN = 1010;
double a[LEN], b[LEN], sum[LEN*2];
void input(double arr[]){
int n;
cin >> n;
while( n-- ){
int top;
double base;
cin >> top >> base;
arr[top] = base;
}
}
int main() {
input(a);
input(b);
for(int i = 0; i < LEN; i++ ){
for(int j = 0; j < LEN; j++ ){
sum[j + i] += a[j] * b[i];
}
}
int cnt = 0;
for(int i = 0; i < LEN * 2 ; i++ ){
if(sum[i])
cnt ++;
}
cout << cnt;
for(int i = LEN*2 - 1; i >= 0 ; i--){
if(sum[i])
printf(" %d %.1lf", i, sum[i]);
}
return 0;
}
总结
1. 手动模拟多项式乘法即可得出解题思路。和加法一样,把所有过程计算后,最后输出需要的数据即可。
2. 最后的for范围从LEN*2开始会导致PAT部分错误,这里应该是平台的问题,改成2000以内的数都能通过pat。理论上i比2000大都是可以通过的。