PAT(A-LEVEL) 1002. A+B for Polynomials

原创 2017年01月03日 00:13:23

1002. A+B for Polynomials

This time, you are supposed to find A+B where A and B are two polynomials.

Input

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

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<cstdio>
#define MAX 1001
using namespace std;

int main()
{
    int k,n;
    int count=0;    //记录有多少个系数不为0的项 
    float a[MAX]={0.0},b[MAX]={0.0},c[MAX]={0.0};

    //分别读入第一行与第二行 
    scanf("%d",&k);
    for(int i=0;i<k;i++){
        scanf("%d",&n);
        scanf("%f",&a[n]);
    } 
    scanf("%d",&k);
    for(int i=0;i<k;i++){
        scanf("%d",&n);
        scanf("%f",&b[n]);
    } 

    for(int i=0;i<MAX;i++){
        c[i]=a[i]+b[i];
        if(c[i]!=0) count++; 
    } 

    printf("%d",count);
    for(int i=MAX-1;i>=0;i--){
        if(c[i]!=0) printf(" %d %.1f",i,c[i]);
    }
    return 0;
} 
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

PAT (Advanced Level) Practise —— 1002. A+B for Polynomials

http://pat.zju.edu.cn/contests/pat-a-practise/1002 This time, you are supposed to find A+B wher...

【PAT Advanced Level】1002. A+B for Polynomials (25)

思路:先将两个多项式存入到两个数组中,再利用归并排序的方法合并两个多项式。 注意:遇到相加后系数为0的项要舍弃,项的数目也不能+1。 改进:写到一半发现项的指数给定了范围[0...1000],那么可以...
  • gzxcyy
  • gzxcyy
  • 2013年09月29日 15:44
  • 587

浙大 PAT Advanced level 1002. A+B for Polynomials

This time, you are supposed to find A+B where A and B are two polynomials. Input Each input file c...

Pat(Advanced Level)Practice--1002(A+B For Polynomials)

Pat1002 代码 #include #define N 1001 int main(int argc,char *argv[]) { int exp1[N],exp2[N],exp3[N]...

编程题目:PAT(Advanced Level) Practice 1002. A+B for Polynomials (25)

1002. A+B for Polynomials (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16...

1002. A+B for Polynomials (25)——PAT (Advanced Level) Practise

题目信息: 1002. A+B for Polynomials (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题...

PAT—1002. A+B for Polynomials

This time, you are supposed to find A+B where A and B are two polynomials. Input Each...

PAT 1002. A+B for Polynomials (25)

This time, you are supposed to find A+B where A and B are two polynomials. Input Each input fi...
  • xsloop
  • xsloop
  • 2015年03月11日 13:50
  • 187

[PAT-甲级]1002.A+B for Polynomials

1002. A+B for Polynomials (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Stan...

PAT A1002 A+B for Polynomials (25)

题目地址:https://www.patest.cn/contests/pat-a-practise/1002题目描述:This time, you are supposed to find A+B ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PAT(A-LEVEL) 1002. A+B for Polynomials
举报原因:
原因补充:

(最多只允许输入30个字)