PAT甲级 1009
题目 Product of Polynomials
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.
解析
将两个多项式相乘
源码
https://github.com/vlluvia/pat
代码
#include<bits/stdc++.h>
#define INF 1<<30
using namespace std;
double res[2005] = {0};
map<int, double> a;
void pat1009() {
int t , nk, sum=0;
double ank;
cin >> t;
for (int i = 0; i < t; ++i) {
cin >> nk >> ank;
a[nk] = ank;
}
cin >> t;
for (int i = 0; i < t; ++i) {
cin >> nk >> ank;
for(auto s : a){
int k = s.first + nk;
if(res[k] == 0) sum++;
res[k] += (ank * s.second);
if(res[k] == 0) sum--;
}
}
printf("%d", sum);
for (int j = 2001; j >= 0 ; --j) {
if(res[j] != 0){
printf(" %d %.1lf", j, res[j]);
}
}
}
int main() {
pat1009();
return 0;
}