PAT 甲级 1002 A+B for Polynomials
https://pintia.cn/problem-sets/994805342720868352/problems/994805526272000000
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 (,) are the exponents and coefficients, respectively. It is given that 1,0.
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
代码:
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 35 36 37 38 39 40 41 42 | #include <bits/stdc++.h> using namespace std; double a[1010], b[1010]; int A, B; double sum[1010]; int main() { scanf ( "%d" , &A); for ( int i = 1; i <= A; i ++) { int x; scanf ( "%d" , &x); scanf ( "%lf" , &a[x]); } scanf ( "%d" , &B); for ( int i = 1; i <= B; i ++) { int y; scanf ( "%d" , &y); scanf ( "%lf" , &b[y]); } int cnt = 0; for ( int i = 0; i <= 1000; i ++) { if (a[i] && b[i]) sum[i] = a[i] + b[i]; else if (a[i]) sum[i] = a[i]; else if (b[i]) sum[i] = b[i]; } for ( int i = 0; i <= 1000; i ++) { if (sum[i]) cnt ++; } printf ( "%d" , cnt); for ( int i = 1000; i >= 0; i --) { if (sum[i]) printf ( " %d %.1lf" , i, sum[i]); } printf ( "\n" ); return 0; } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步