题目链接
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.
#include <iostream>
using namespace std;
int main()
{
int n,m;
float ploy[1005];
for(int i=0;i<1005;i++)
ploy[i]=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int e;
float c;
cin>>e>>c;
ploy[e]+=c;
}
scanf("%d",&m);
for(int i=0;i<m;i++)
{
int e;
float c;
cin>>e>>c;
ploy[e]+=c;
}
int num=0;
for(int i=0;i<1005;i++)
if(ploy[i]!=0)
num++;
printf("%d",num);
for(int i=1004;i>=0;i--)
if(ploy[i]!=0)
printf(" %d %.1f",i,ploy[i]);
return 0;
}
- polynomials: 多项式
- exponents: 指数,幂
- coefficients: 系数