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 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 Input2 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>
using namespace std;
double num[1005] = {0.0};
int nnum[1005] = {0};
double num1[2010] = {0.0};
int main(){
int m, n, index, i = 0;
double ss;
cin>>m;
int g = m;
while(m--){
cin>>index>>ss;
num[index] += ss;
nnum[m] = index;
}
cin>>n;
while(n--){
cin>>index>>ss;
for(int j = 0; j < g; j++){
int k = nnum[j] + index;
num1[k] += ss * num[nnum[j]];
if(i < k)
i = k;
}
}
int jl = 0;
for(int j = i; j >= 0; j--){
if(num1[j] != 0.0)
jl++;
}
cout<<jl;
for(int j = i; j >= 0; j--){
if(num1[j] != 0.0){
printf(" %d %.1f", j, num1[j]);
}
}
return 0;
}