c解线性方程组（C solving linear equations）.docVIP

c解线性方程组（C solving linear equations） C language for solving linear equations * according to the rules of the input coefficient of linear equations (each N+1 value, according to the order of input N coefficient, the last one is constant, separated by spaces) The output, the coefficient determinant of the equations and its value, the final output equations. / * * / integer data processing #include stdio.h #include stdlib.h #define N 4 / / row (column) number of determinant Typedef struct node { Int data; / / storage element value. Int x; / / transverse coordinate storage elements Int y; / / longitudinal coordinate storage elements } array; Int sum; / / global variables, storing the value of determinant Void Create (int H[][N], int X[]); / / to construct a set of linear equations Void PrintH (const int H[][N] const, int X[]); / / output determinant Void Solve (const int H[][N], array S[], int i, int NiXu); / / the recursive determinant value Bool Judge (const array S[], int line, int len); / / judge ordinate elements whether repeat determinant Int main (void) { Array SL[N]; / / storage stack, each product term determinant elements (factor) Int H[N][N], CH[N][N]; / / storage coefficient determinant Int B[N]; / / constant storage Int D; / / storage coefficient determinant Float X[N]; / / storage equations Int, I, J, k; Create (H, B); / / a structural determinant PrintH (H, B); / / output determinant Sum = 0; Solve (H, SL, 0, 0); / / the recursive determinant value D = sum; Printf (D =%d\n, D); / / output value of determinant coefficient For (k=0; kN; k++) { For (i=0; iN; i++) / / replication determinant { For (j=0; jN; j++) CH[i][j] = H[i][j]; CH[i][k] = B[i]; / / the first column k elements D with constant coefficient determinant equations instead of the right end } Sum = 0; Solve (CH, SL, 0, 0); / / the recursive determinant value Printf (D%d =%d\n, k+1, sum); / / the output value of determinant X[k] = sum*1.0 / (D*1.0); } For (i=0; iN; i++) Printf (X%d =%f\n, i+1, X[i]