列主元消元法

最新推荐文章于 2024-05-20 23:52:50 发布

alasnot

最新推荐文章于 2024-05-20 23:52:50 发布

阅读量101

点赞数

文章标签： c++ 算法 c语言

本文链接：https://blog.csdn.net/m0_53541401/article/details/128268665

版权

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include"a.h";
#include"b.h";
#include"c.h";
#define filename "data.txt"
double **matrix;
double* b;
int n;
int fileread() {
	FILE* file = fopen(filename, "r");
	fscanf(file, "%d", &n);
	b = new double[n];
	matrix = new double* [n];
	for (int i = 0; i < n; i++)matrix[i] = new double[n];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++)
			fscanf(file, "%lf", &matrix[i][j]);
		fscanf(file, "%lf", &b[i]);
	}
	fclose(file);
	return 0;
}
int show() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n-1; j++)
			printf("%5.2lf x%-2d+", matrix[i][j],j+1);
		printf("%5.2lf x%-2d", matrix[i][n-1], n);
		printf("=%5.2lf\n", b[i]);
	}
	return 0;
}
inline void swap(double &a, double &b) { a = a + b; b = a - b; a = a - b; }
int process() {
	double first;
	bool notZero=true;
	for (int i = 0; i < n; i++) {
		while (!matrix[i][i]&&notZero) {
			notZero = false;
			for (int j = i + 1; j < n; j++) {
				if (matrix[j][i]) {
					notZero = true;
					for (int k = 0; k < n; k++)swap(matrix[i][k], matrix[j][k]);
					swap(b[i], b[j]);
					break;
				}
			}
		}
		if (!notZero) {
			printf("无解\n");
			exit(0);
		}
		first = matrix[i][i];
		for (int j = 0; j < n; j++)matrix[i][j] /= first;
		b[i] /= first;
		for (int j = 0; j < n; j++) {
			if (j != i) {
				first = matrix[j][i];
				for (int k = 0; k < n; k++) {
					matrix[j][k] -= first * matrix[i][k];
				}
				b[j] -= first * b[i];
			}
		}
	}
	return 0;
}
int result() {
	for (int i = 0; i < n; i++) {
		printf("x%-2d = %5.2lf\n", i + 1, b[i]);
	}
	return 0;
}
int main(void) {
	fileread();
	show();
	process();
	result();
	return 0;
}