1002 A+B for Polynomials (25分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:400 ms
内存限制:64 MB
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 sum 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 to 1 decimal place.
Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output:
3 2 1.5 1 2.9 0 3.2
题意:
合并多项式,给出A、B两个多项式(包括多项式个数K,多项式指数n,多项式系数an),输出合并后的多项式包括(k,n,an),系数保留一位小数
思路:
利用哈希表解此题,最后遍历哈希表中元素不为零的项即可,我用vector容器记录了哪几项不为零。
参考代码:
#include <cstdio>
#include <vector>
using namespace std;
const int maxn=1001;
double hashtable[maxn]={0};
int main() {
int k,n,count=0;
double a;
for(int i=0;i<2;i++){
scanf("%d",&k);
for(int j=0;j<k;j++){
scanf("%d%lf",&n,&a);
hashtable[n]+=a;
}
}
vector<int> v;
for(int i=maxn-1;i>=0;i--){
if(hashtable[i]!=0)
v.push_back(i);
}
printf("%d",v.size());
for(int i=0;i<v.size();i++)
printf(" %d %.1f",v[i],hashtable[v[i]]);
printf("\n");
return 0;
}
如有错误,欢迎指正