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
一个多项式相加的模拟题,只需要对数组相同指数项进行相加即可
代码如下:
#include <iostream>
#include <cstdio>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cctype>
#include <cstring>
#include <cmath>
#include <set>
#include <sstream>
using namespace std;
//思路:数组下标当作指数,数组值当作系数
double num[1005]={0};
int main()
{
int k1,k2;
scanf("%d",&k1); //第一个多项式的项数
int zs; //指数
double xs; //系数
for(int i=0;i<k1;i++){
scanf("%d%lf",&zs,&xs);
num[zs]+=xs;
}
scanf("%d",&k2); //第二个多项式的项数
for(int i=0;i<k2;i++){
scanf("%d%lf",&zs,&xs);
num[zs]+=xs;
}
int cnt=0;
for(int i=1004;i>=0;i--){ //再次遍历,找到非0元素,个数为最后多项式的项数
if(num[i]!=0){
cnt++;
}
}
printf("%d",cnt);
for(int i=1004;i>=0;i--){
if(num[i]!=0){
printf(" %d %.1f",i,num[i]);
}
}
return 0;
}