PAT 甲级 1009. Product of Polynomials

原题传送门

• stack和pair的使用

#include <iostream>
#include <string.h>
#include <stack>
using namespace std;
const int MAX = 2001;
double input[MAX];
double result[MAX];

int main(int argc, const char * argv[]) {
    memset(input, 0, sizeof(input));
    memset(result, 0, sizeof(result));
    int N;
    int exponent;
    double coefficient;
    cin >> N;
    for(int i = 0; i < N; ++i) {
        cin >> exponent >> coefficient;
        input[exponent] = coefficient;
    }
    cin >> N;
    for(int i = 0; i < N; ++i) {
        cin >> exponent >> coefficient;
        for(int j = 0; j < MAX; ++j) {
            if(input[j] != 0) {
                exponent += j;
                result[exponent] += input[j] * coefficient;
                exponent -= j;
            }
        }
    }
    stack<pair<int, double>> st;
    for(int i = 0; i < MAX; ++i) {
        if(result[i] != 0)
            st.push(make_pair(i, result[i]));
    }
    cout << st.size();
    while (!st.empty()) {
        auto j = st.top();
        if(j.second != 0.0)
            printf(" %d %.1f", j.first, j.second);
        st.pop();
    }
    cout << endl;

    return 0;
}

附原题：

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 product 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 up to 1 decimal place.

• Sample Input
  2 1 2.4 0 3.2
  2 2 1.5 1 0.5
• Sample Output
  3 3 3.6 2 6.0 1 1.6