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.5Sample Output
3 3 3.6 2 6.0 1 1.6
题目的意思是多项式乘法 样例是(2.4*x^1+3.2*x^0)*(1.5*x^2+0.5*x^1)=(3.6*x^3+6.0*x^2+1.6*x^1)
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<vector> using namespace std; struct node { int k; double a; }a[15],b[15]; double s[10004]; int main() { int n,m; memset(s,0,sizeof(s)); scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d%lf",&a[i].k,&a[i].a); } scanf("%d",&m); for(int i=0;i<m;i++) { scanf("%d%lf",&b[i].k,&b[i].a); } for(int i=0;i<n;i++) for(int j=0;j<m;j++) { s[a[i].k+b[j].k]+=a[i].a*b[j].a; } int cnt=0; for(int i=0;i<=a[0].k+b[0].k;i++) if(s[i]!=0) cnt++; printf("%d",cnt); for(int i=a[0].k+b[0].k;i>=0;i--) { if(s[i]!=0) printf(" %d %.1f",i,s[i]); } printf("\n"); return 0; }