1002 A+B for Polynomials (附测试点3456的坑)
题目:1002 A+B for Polynomials
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 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 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:
1 2 | 2 1 2.4 0 3.2 2 2 1.5 1 0.5 |
Sample Output:
1 | 3 2 1.5 1 2.9 0 3.2 |
思路:
1、使用map
2、注意当底数为0的项不需要输出,当两个多项式相加结果为0时,直接输出0就好了。
测试样例:
1 2 | 1 0 3.2 1 0 - 3.2 |
输出:
1 | 0 |
代码:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | #include<stdio.h> #include<iostream> #include<iomanip> #include<ios> #include<map> using namespace std; int main(){ map< int , double > m; map< int , double >::reverse_iterator it; int k = 2 ,n,e,count = 0 ; double c; for ( int i = 0 ; i < k; i++){ cin>>n; for ( int j = 0 ; j < n; j++){ cin>>e>>c; m[e] += c; } } for (it = m.rbegin(); it != m.rend(); it++){ if (it->second == 0 ){ continue ; } count++; } cout<<count; for (it = m.rbegin(); it != m.rend(); it++){ if (it->second == 0 ){ continue ; } cout<< " " <<it->first<< " " ; cout<<fixed<<setprecision( 1 )<<it->second; } return 0 ; } |
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 使用C#创建一个MCP客户端
· ollama系列1:轻松3步本地部署deepseek,普通电脑可用
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· 按钮权限的设计及实现