行列式计算器源代码（Determinant calculator source code）.docVIP

行列式计算器源代码（Determinant calculator source code） # include stdio, h H # include math.h # include stdlib. H # include time. H # include limits. H # include assert. H # include stddef. H # include ctype. H # define HLS double / / for the value of the determinant Typedef struct hanglieshi { Int high; / / / determinant height Int weight; / / determinant width HLS * p; / / pointing to the determinant of storage HLS value; / / the determinant value HLS * tri; / / used to point to the lower triangular determinant HLS * follow; / / record the accompanying matrix } hanglieshi; HLS * great (int high, int weight) { HLS * p; P = calloc (high * weight, sizeof (HLS)); Return the p; } Int save (HLS * a, int high, int weight) / / sv is the storage array { Int w = 0; Char d; Int the key; While weight (w) { The scanf ( % d % c , key, d); * (a + high * weight + w) = key; W++; } Return 0; } HLS * countsave (int high, int weight) / / total storage function returns the stored value { HLS * p; P = great (high, weight); Int h = 0, w = weight; While (h (high) { Printf ( please enter the % d line data, separated by Spaces: , h + 1); Save (p, h, w); H++; } Return the p; } Int printfsave (HLS * p, int high, int weight) / / output determinant { Int h = 0, w = 0; While (h (high) { While weight (w) { Printf ( % 5 d , (int) (* (p + w + h * weight))); / / to be improved here, GAIJIN outputs an integer W++; } H++; W = 0; Putchar ( \ n ); } Return 0; } Int printfdoublesave (HLS * p, int high, int weight) / / output determinant { Int h = 0, w = 0; While (h (high) { While weight (w) { Printf ( % 10.5 lf, (* (p + w + h * weight))); / / to improve, GAIJIN output involves small Numbers, such as the trig determinant W++; } H++; W = 0; Putchar ( \ n ); } Return 0; } Void change (HLS * p, int weight) { Int h, w, key; Printf ( please enter you want to change the number of the line number, enter the car to confirm: ); The scanf ( % d , h); Printf ( please enter the number you want to change