PAT 1002. A+B for Polynomials (25)(多项式加法)(待修改)

原创 2016年08月31日 10:47:00

题目

1002. A+B for Polynomials (25)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 <= 100 <= 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<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<iomanip>
using namespace std;
bool cmp(int a,int b){
    return a>b;
}

int main(int argc, char *argv[])
{
    ios_base::sync_with_stdio(false);
    double num[1001]={0};
    bool visited[1001] = {false};
    int k1;
    cin >> k1;
    int base;double eco;
    vector<int> v;
    while (k1--) {
        cin >> base >> eco;
        num[base] += eco;
        if (!visited[base]) {
            v.push_back(base);
            visited[base] = true;
        }
    }
    cin >> k1;
    while (k1--) {
        cin >> base >> eco;
        num[base] += eco;
        if (!visited[base]) {
            v.push_back(base);
            visited[base] = true;
        }
    }
    cout<< v.size();
    sort(v.begin(),v.end(),cmp);
    for (int i = 0; i < v.size(); ++i) {
        cout<<" "<< v[i] << " " << fixed << setprecision(1) <<num[v[i]];
    }
    cout << endl;
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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...

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---A1002. A+B for Polynomials (25)

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

PAT甲级 1002. A+B for Polynomials (25)

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

PAT_A 1002 A+B for Polynomials(25)

Pat1002 A+B for Polynomials(25) This time, you are supposed to find A+B where A and B are two po...

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

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

PAT甲级真题及训练集(3)--1002. A+B for Polynomials (25)

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

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

题目:http://pat.zju.edu.cn/contests/pat-a-practise/1002 分析:给出俩个多项式的指数和系数,没有给出基数,只要将指数相同的多项式进行系数相加即可。输出...

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

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

PAT甲级练习1002. A+B for Polynomials (25)

1002. A+B for Polynomials (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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