原题链接:http://pat.zju.edu.cn/contests/pat-a-practise/1009
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.5Sample Output
3 3 3.6 2 6.0 1 1.6
#include <stdio.h>
#include <vector>
using namespace std;
struct Term
{
int exp;
double coe;
};
const int N = 2001;
const double zero = 0.0000001;
int main()
{
vector<Term> first;
vector<Term> second;
double result[N] = {0};
int k1, k2;
int num = 0;
scanf("%d", &k1);
for(int i=0; i<k1; ++i)
{
Term term;
scanf("%d %lf", &term.exp, &term.coe);
first.push_back(term);
}
scanf("%d", &k2);
for(int i=0; i<k2; ++i)
{
Term term;
scanf("%d %lf", &term.exp, &term.coe);
second.push_back(term);
}
for(int i=0; i<k1; ++i)
{
Term term1 = first[i];
for(int j=0; j<k2; ++j)
{
Term term2 = second[j];
int exp = term1.exp +term2.exp;
result[exp] += term1.coe * term2.coe;
}
}
for(int i=0; i<N; ++i)
{
if(result[i] > zero || result[i] < -zero)
{
++num;
}
}
printf("%d", num);
for(int i=N-1; i>=0; --i)
{
if(result[i] > zero || result[i] < -zero)
{
printf(" %d %0.1lf", i, result[i]);
}
}
printf("\n");
first.clear();
second.clear();
return 0;
}