# 【PAT甲级】1002 A+B for Polynomials (25分)

1002 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 N​1​​ a​N​1​​​​ N​2​​ a​N​2​​​​ ... N​K​​ a​N​K​​​​

where K is the number of nonzero terms in the polynomial, N​i​​ and a​N​i​​​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N​K​​<⋯<N​2​​<N​1​​≤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`

# 三个个坑

## 一个是 不能==0 判断 double （其实可以 哈哈）但是 我用 abs（num-0）<0.005 不对 还是精度太小 if( abs(num[i]) >= 1e-15 )

```#include<iostream>
#include<set>
using namespace std;
double num[10005];
int main(){
int n;
set<int>s;
cin>>n;
for(int i=0;i<n;i++){
int a ;
double b;
cin>>a>>b;
num[a]+=b;
}
cin>>n;
for(int i=0;i<n;i++){
int a ;
double b;
cin>>a>>b;
num[a]+=b;
}
int count=0;
for(int i=0;i<10005;i++){
if(num[i]!=0){
count++;
}
}
cout<<count;
for(int i=10000;i>=0;i--){
if(num[i]!=0){
printf(" %d %0.1f", i, num[i]);
//cout<<" "<<i<<" "<<num[i];
}
}
return 0;

} ```

```#include<stdio.h>
const int max_n = 1111;
double a[max_n] = {};
int main(){

int k, n, count = 0;
double e;
scanf("%d", &k);
for(int i = 0; i < k; i ++){
scanf("%d%lf", &n, &e);
a[n] = e;
}

scanf("%d", &k);//这里k只是为了存储，所以这儿k是可以重复存放值。
for(int i = 0; i < k; i ++){
scanf("%d%lf", &n, &e);
a[n] += e;//这儿其实就是有相同的就相加，没有相同的就不想加
}

for(int i = 0; i < max_n; i ++){
if(a[i] != 0){
count ++;
}
}
printf("%d", count);
for(int i = max_n - 1; i >=0; i --){
if(a[i] != 0) printf(" %d %.1f", i, a[i]);
}
return 0;
}```

0 条评论

• ### 1045 快速排序 (25 分)

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

• ### 1089 狼人杀-简单版 (20 分)

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

• ### 1062 最简分数 (20 分)

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。 ...

• ### HDU 4786Fibonacci Tree(最小生成树)

Problem Description 　　Coach Pang is interested in Fibonacci numbers while Un...

• ### 【HDU 4305】Lightning（生成树计数）

There are N robots standing on the ground (Don't know why. Don't know how).

• ### 数码管问题（c++实现）

描述：液晶数码管用七笔阿拉数字表示的十个数字，把横和竖的一 个短划都称为一笔，即７有３笔，８有７笔等。对于十个数字一种排列，要做到  两相邻数字都可以由...

• ### 2017.10.2解题报告

预计分数：60+0+30=90 实际分数：60+0+0=60 T1：https://www.luogu.org/problem/show?pid=T...

• ### HPU personal-training 2

A - Kefa and Park 题意：就是一棵树，然后本人的家在根上，餐厅在叶子节点上。然后在前往叶子结点的餐厅的时候，途中的结点上有猫，而这个人特别怕...