PAT日志 1002

最新推荐文章于 2021-01-29 11:50:25 发布

doublefloatint

最新推荐文章于 2021-01-29 11:50:25 发布

阅读量169

点赞数

分类专栏： PAT日志文章标签： PAT 1002

本文链接：https://blog.csdn.net/doublefloatint/article/details/85916294

版权

PAT日志专栏收录该内容

44 篇文章 0 订阅

订阅专栏

顽强的小白

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₁ aN₁ N₂ aN₂ … where K is the number of nonzero terms in the polynomial, N_i and aN_i(i=1,2,⋯) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N_K<⋯<N₂<N₁≤10000.

Output Specification:
For each test case you should output the sum of Aand 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 <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn=1005;
int main(){
 double A[maxn],B[maxn];
 fill(A,A+maxn,0);    //用fill函数初始化一下 
 fill(B,B+maxn,0);
 int k1,k2,ex;
 double co;
 scanf("%d",&k1);
 for(int i=0;i<k1;++i) {
  scanf("%d %lf",&ex,&co);
  A[ex]=co;
 }
 scanf("%d",&k2);
 for(int i=0;i<k2;++i) {
  scanf("%d %lf",&ex,&co);
  B[ex]=co;
 }
 int cnt=0;
 for(int i=0;i<maxn;++i){
  A[i]+=B[i];
  if(A[i]!=0) ++cnt; 
 }
 printf("%d",cnt);
 for(int i=maxn-1;i>=0;--i){
  if(A[i]!=0) printf(" %d %.1lf",i,A[i]);
 }
}