题目:
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
解题思路:
这道题可以用两个结构体数组保存输入的多项式,然后进行指数相加,系数相乘的运算,并合并同类项后保存在一个数组里,相加后的指数作为数组下标,系数作为对应下标的值。
需要注意的是:
1、系数为0的情况不输出;
2、输出格式要注意,系数保留小数点后一位;
3、运算后保存的数组需是所输入多项式的两倍的内存空间(这点是我太粗心没考虑到,导致后面两个测试点过不去。。。)
代码如下:
#include<stdio.h>
#include<iomanip>
#include<iostream>
using namespace std;
typedef struct poly{
int exp;
double cof;
};
struct poly a[1001], b[1001];
double N[2002];
int main() {
int m, count = 0;
int K1, K2, K3 = 0;
cin >> K1;
for (int i = 0; i < K1; i++) {
cin >> a[i].exp >> a[i].cof;
}
cin >> K2;
for (int i = 0; i < K2; i++) {
cin >> b[i].exp >> b[i].cof;
}
for(int i=0;i<K1;i++)
for (int j = 0; j < K2; j++) {
N[a[i].exp + b[j].exp] += a[i].cof * b[j].cof;
}
for (int i = 0; i < 2002; i++) {
if (N[i] != 0) //除去系数为0的情况
count++;
}
cout << count;
for (int i = 2002; i >= 0; i--)
if(N[i]!=0)
cout << " " << i << " " << setiosflags(ios::fixed) << setprecision(1) << N[i];
}