题目:
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.2 2 2 1.5 1 0.5Sample Output
3 2 1.5 1 2.9 0 3.2
#include<cstdio> using namespace std; int main() { int k1, k2, i, a, num=0; double c[1005] = {0}, b; scanf ("%d", &k1); for (i=0; i<k1; i++) { scanf ("%d %lf", &a, &b); c[a] += b; } scanf ("%d", &k2); for (i=0; i<k2; i++) { scanf ("%d %lf", &a, &b); c[a] += b; } for (i=0; i<1005; i++) { if (c[i] != 0) num++; } printf ("%d", num); if (num != 0) printf (" "); for (i=1000; i>=0; i--) { if (c[i] != 0 && num > 1) { printf ("%d %.1lf ", i, c[i]); num--; } else if (c[i] != 0 && num == 1) printf ("%d %.1lf", i, c[i]); } return 0; }