# PAT_A1002 A+B for Polynomials

5 篇文章 0 订阅

## PAT学习笔记之A1002 A+B for 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 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.

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>
using namespace std;

int main() {
double s={},d;
int i,j,k,n,sum=0;
for(i=0;i<2;i++){
if(scanf("%d",&k)){};
for(j=0;j<k;j++){
if(scanf("%d%lf",&n,&d)){};
s[n]+=d;
}
}
for(i=0;i<1001;i++){
if(s[i]!=0){
sum++;
}
}
printf("%d",sum);
for(i=1000;i>=0;i--){
if(s[i]!=0){
printf(" %d %.1f",i,s[i]);
}
}
return 0;
}

08-11 49  04-27 3万+
02-23 43
02-13 92
06-27 167
09-10 195
07-31 60
01-26 164
02-01 854
08-12 70
09-11 16
03-20 431
09-27 65
01-13 11
09-11 196
04-12 52
02-15 902
10-14 155 点击重新获取   扫码支付  余额充值