PAT 1002. A+B for Polynomials (25)
来源:互联网 发布:手机号码拦截软件 编辑:程序博客网 时间:2024/06/03 20:52
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 <= 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 Input2 1 2.4 0 3.22 2 1.5 1 0.5Sample Output
3 2 1.5 1 2.9 0 3.2
#include<iostream>#include<cstdio>#include<map>using namespace std;map<int,double> a;int main(){ for(int i=0;i<2;i++) { int n; scanf("%d",&n); for(int j=0;j<n;j++) { int x; double y; scanf("%d %lf",&x,&y); a[x]+=y; } } map<int,double>::reverse_iterator it; int k=0; for(it=a.rbegin();it!=a.rend();it++) { if(it->second>1e-6||it->second<-1e-6) k++; } printf("%d",k); for(it=a.rbegin();it!=a.rend();it++) { if(it->second>1e-6||it->second<-1e-6) printf(" %d %.1lf",it->first,it->second); } printf("\n"); return 0;}
0 0
- 【PAT】1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- [PAT]1002. A+B for Polynomials (25)
- pat 1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- [PAT]1002. A+B for Polynomials(25)
- PAT 1002. A+B for Polynomials (25)
- pat 1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- PAT----1002. A+B for Polynomials (25)
- PAT 1002. A+B for Polynomials (25)
- PAT:1002. A+B for Polynomials (25)
- 【PAT】1002. A+B for Polynomials(25)
- C++实现二叉查找树
- [BZOJ2539][Ctsc2000]丘比特的烦恼(KM+计算几何)
- java学习之:复写equals方法
- 其他类型转化为json
- 基础排序算法-快速排序
- PAT 1002. A+B for Polynomials (25)
- leetcode404: Sum of Left Leaves
- 初级-(练习用)挑7
- (DUP!) ping现象
- python numpy array 与matrix 乘方
- Going Deeper with Convolutions学习笔记
- java学习之:Iterable与Iterator的区别
- STL中map,multimap,set,multiset,unordered_map,unordered_multimap,unordered_set,unordered_multiset的实现方
- 数据库范式