1002 A+B for Polynomials (25分)

最新推荐文章于 2021-02-08 01:03:19 发布

KrissLong

最新推荐文章于 2021-02-08 01:03:19 发布

阅读量98

点赞数

分类专栏： PAT刷题之路文章标签：算法

本文链接：https://blog.csdn.net/KrissLong/article/details/108112400

版权

PAT刷题之路专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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 a n d a N i (i = 1, 2, \dots, K)$ are the exponents and coefficients, respectively. It is given that $1 \leq K \leq 10 ， 0 \leq N K < \dots < N 2 < N 1 \leq 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 <stdio.h>
#include <stdlib.h>
const int maxn=1001;
int main(){
   double p[1001]={ 0 };
   int k;
   scanf("%d",&k);
   for(int i=0;i<k;i++){
      int n;double a;
      scanf("%d %lf",&n,&a);
      p[n]+=a;
   }
   scanf("%d",&k);
   for(int i=0;i<k;i++){
      int n;double a;
      scanf("%d %lf",&n,&a);
      p[n]+=a;
   }
   int cnt=0;
   for(int i=0;i<maxn;i++){
      if(p[i]!=0){
         cnt++;
      }
   }
   printf("%d",cnt);
   for(int i=maxn-1;i>=0;i--){
      if(p[i]!=0){
         printf(" %d %.1f",i,p[i]);
      }
   }
   putchar('\n');
   return 0;
}