代码库显示多项式

最新推荐文章于 2024-08-24 02:50:32 发布

skyfisherman

最新推荐文章于 2024-08-24 02:50:32 发布

阅读量601

点赞数

分类专栏：代码发布

本文链接：https://blog.csdn.net/skyfisherman/article/details/17734299

版权

代码发布专栏收录该内容

20 篇文章 0 订阅

订阅专栏

这篇博客探讨了如何利用编程技术展示多项式，详细介绍了相关代码和方法，旨在帮助读者理解如何在代码环境中清晰地呈现复杂的数学表达式。

摘要由CSDN通过智能技术生成

显示多项式

# include <iostream>
# include <vector>
# include <algorithm>
# include <cmath>

using namespace std;

void output_poly(double a,int n,bool first) {

	if(fabs(a) < 1e-8) {
		if(first) cout << 0;
		return;
	}

	if (!first) {
		if(a>0) cout << "+ ";
	}

	if(a==-1) cout << "- ";
	
	if(fabs(a) == 1) {
		if(n == 0) cout << 1;
	}
	else {
		if(a<0) cout << "- ";
		cout << fabs(a);
	}
	
	if(n > 1)
		cout << "x^" << n;
	else if(n == 1) 
		cout << 'x';
	
	cout << ' ';
}
	

void output(vector<double> a,string s="f") {
	cout << s << "(x) = ";
	int n = a.size() - 1;

	if(n < 0) {cout << 0 << endl; return;}
	for(int i=0; i<=n; i++)
		output_poly(a[i], n-i, !i);
	cout << endl;
}

vector<double> mod(vector<double> a,vector<double> b){
	vector<double> res;
	if(!b.size()) return res;

	int del = a.size() - b.size();
	vector<double>::iterator p, pa, pb;
	double rate;
	
	p = a.begin();
	for(int i=0; i<=del; i++, p++) {
		res.push_back(rate = a[i] / b[0]);

		for(pa = p, pb = b.begin(); pb!=b.end(); pb++, pa++)
			*pa -= rate * *pb;
	}
	
	while(a.size() && fabs(*a.begin()) <= 1e-8)
		a.erase(a.begin());
	return a;
}

vector<double> gcd(vector<double> a,vector<double> b) {
	if(!b.size()) return a;
	return gcd(b, mod(a,b));
}

int main() {
	int n, m, t;
	vector<double> a, b;

	while(cin >> n) {
		a.clear();
		for(int i=n; i>=0; i--) {
			cin >> t;
			a.push_back(t);
		}
		output(a);
	}
	return 0;
}

End