对如下多项式编写类定义：a0+a1x+a2x2+…+anxn其中，n为多项式的次数。完成如下功能：（1） 可存储任意大的多项式（提示：可用动态数组实现）。（2）

#include<iostream>
#include<vector>
#include<math.h>

using namespace std;


class polynomial {
public:
	polynomial(int n) :vec(n + 1, 0) { count++; }

	polynomial() {
		count++;
		int n;
		printf("请输入多项式长度！\n");
		cin >> n;

		vec.resize(n);
		printf("请输入各项系数！\n");
		for (int i = 0; i < n; i++) {
			cin >> vec[i];
		}
	}

	~polynomial() {
		count--;
		vector<float>().swap(vec);
	}

	polynomial(const polynomial& other) : vec(other.vec) { count++; };

	void output() {

		for (int i = (int)vec.size() - 1; i >= 0; i--) {
			if (vec[i] != 0) {
				if (i == vec.size() - 1) {
					if (vec[i] < 0 && vec[i] != -1)
						cout  << vec[i] << "x^" << i;
					else if (vec[i] == -1)
						cout << "-x^" << i;
					else if (vec[i] > 0 && vec[i] != 1)
						cout << vec[i] << "x^" << i;
					else cout << "x^" << i;
				}
				else {
					if (vec[i] < 0 && vec[i] != -1)
						cout  << vec[i] << "x^" << i;
					else if (vec[i] == -1)
						cout << "-x^" << i;
					else if (vec[i] > 0 && vec[i] != 1)
						cout << "+" << vec[i] << "x^" << i;
					else cout << "+x^" << i;

				}
			}
			
		}
		cout << "\n";
	}

	double evaluate(double x) const {
		double result = 0;
		for (int i = vec.size() - 1; i >= 0; i--) {
			result += vec[i] * pow(x, i);
		}
		cout << result << endl;
		return result;
	}

	void out() {

		cout << count << endl;

	}
	polynomial operator+(polynomial& other) const {
		int max_degree = max(vec.size(), other.vec.size());
		polynomial result(max_degree - 1);
		for (int i = 0; i < max_degree; i++) {
			if (i < vec.size()) {
				result.vec[i] += vec[i];
			}
			if (i < other.vec.size()) {
				result.vec[i] += other.vec[i];
			}
		}
		return result;
	}

	polynomial operator-(polynomial& other) const {
		int max_degree = max(vec.size(), other.vec.size());
		polynomial result(max_degree - 1);
		for (int i = 0; i < max_degree; i++) {
			if (i < vec.size()) {
				result.vec[i] += vec[i];
			}
			if (i < other.vec.size()) {
				result.vec[i] -= other.vec[i];
			}
		}
		return result;
	}


	polynomial& operator=(polynomial& other) {
		if (this == &other) {
			return *this;
		}
		vec = other.vec;
		return *this;
	}



	polynomial operator*(const polynomial& other) const {
		int degree = vec.size() + other.vec.size() - 2;
		polynomial result(degree);
		for (int i = 0; i < vec.size(); i++) {
			for (int j = 0; j < other.vec.size(); j++) {
				result.vec[i + j] += vec[i] * other.vec[j];
			}
		}
		return result;
	}



private:
	vector<float> vec;
	static int count;
};

int polynomial::count = 0;
int main() {
	
	polynomial p1;
	cout << "第一个多项式为：";
	p1.output();
	cout << "当x为2时第一个多项式值为：";
	p1.evaluate(2);
	polynomial p2;
	cout << "第二个多项式为：";
	p2.output();
	polynomial p3 = p1 + p2;
	polynomial p4 = p1 - p2;
	polynomial p5 = p1 * p2;
	polynomial p6(p1);
	cout << "第一个多项式加第二个多项式为：";
	p3.output();
	cout << "第一个多项式减第二个多项式为：";
	p4.output();
	cout << "第一个多项式乘第二个多项式为：";
	p5.output();
	cout << "拷贝构造第一个多项式：";
	p6.output();
	p1.out();
}