这是我编的一个简易矩阵计算器,c++语言,非常容易理解的,你可以参考求行列式和逆部分#include <iostream>#include <iomanip>#include <conio.h>#include "windows.h"#include <string>using namespace std;void gotoxy(int x,int y) // 列x: 0~79 行y: 0~24 { handle hconsole=getstdhandle(std_output_handle); coord coordscreen={x,y}; setconsolecursorposition(hconsole,coordscreen); return; } void setcolor(unsigned short forecolor,unsigned short backcolor) // 0--黑 1--暗蓝 2--暗绿 3--暗青 4--暗红 5--暗紫 6--蟹黄 7--暗白 // 8--灰 9--亮蓝 10-亮绿 11-亮青 12-亮红 13-亮紫 14-黄 15-亮白{ handle hcon = getstdhandle(std_output_handle); setconsoletextattribute(hcon,(forecolor % 16)|(backcolor % 16 * 16));};int main(){ void plu(); void sub(); void amo(); void mul(); void ran(); void ord(); char sel='1'; while(sel != '0') { int i; system("cls"); // 清屏 setcolor(15,0); // 下面显示黑底亮青字 gotoxy(8,1); cout<<"┌───────────────────────────┐"; for(i=2;i<20;i++) {gotoxy(8,i);cout<<"│";gotoxy(64,i);cout<<"│";} setcolor(15,6); // 下面显示红底白字 gotoxy(10,3); cout<<" "; gotoxy(10,4); cout<<" 简 易 矩 阵 计 算 器 "; gotoxy(10,5); cout<<" "; setcolor(15,0); // 下面显示黑底亮青字 gotoxy(10,7); cout<<" 1 ---- 矩阵加法 2 ---- 矩阵减法 "; gotoxy(10,9); cout<<" 3 ---- 矩阵数乘 4 ---- 矩阵乘法 "; gotoxy(10,11); cout<<" 5 ---- 矩阵行列式 6 ---- 矩阵的逆 "; gotoxy(10,13); cout<<" 0 ---- 退出 "; gotoxy(10,15); cout<<" 请选择(0--6):"; gotoxy(8,20); cout<<"└───────────────────────────┘"; do { gotoxy(28,15); sel=getche( );} while ( sel!='1' && sel!='2' && sel!='3' && sel!='4' && sel!='5' && sel!='6'&& sel!='0'); switch(sel) { case '1':plu(); break; case '2':sub(); break; case '3':amo(); break; case '4':mul(); break; case '5':ran(); break; case '6':ord(); break; case '0': break; } } system("cls"); gotoxy(25,10); cout<<"谢 谢 使 用 系 统 !"<<endl; return 0;}void plu()//加法{ char l; system("cls"); // 清屏 setcolor(14,0); // 下面用黑底黄字int a,b,i,j;gotoxy(0,0);cout<<">>>>>> 矩阵加法 ";gotoxy(0,2);cout<<"请输入矩阵的行数:";cin>>a;cout<<endl; cout<<"请输入矩阵的列数:"; cin>>b; cout<<endl;double m[10][10],n[10][10];cout<<"请输入第一个矩阵:"<<endl;for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+20,2*i+6); cin>>m[i][j];}cout<<endl<<endl<<"请输入第二个矩阵:"<<endl;for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+20,2*a+2*i+7);cin>>n[i][j];} cout<<endl<<">>>>>>>"<<endl<<"矩阵加法结果为:";for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+20,4*a+2*i+8);cout<<m[i][j]+n[i][j];} gotoxy(0,6*a+9);cout<<">>>>>>>>按任意键退出:";l=getche();}void sub()//减法{ char l; system("cls"); // 清屏 setcolor(14,0); // 下面用黑底黄字int a,b,i,j;gotoxy(0,0);cout<<">>>>>矩阵减法";gotoxy(0,2);cout<<"请输入矩阵的行数:";cin>>a;cout<<endl; cout<<"请输入矩阵的列数:"; cin>>b; cout<<endl;double m[10][10],n[10][10];cout<<"请输入第一个矩阵:"<<endl;for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+20,2*i+6); cin>>m[i][j];}cout<<endl<<endl<<"请输入第二个矩阵:"<<endl;for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+20,2*a+2*i+7);cin>>n[i][j];} cout<<endl<<">>>>>>>"<<endl<<"矩阵减法结果为:";for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+20,4*a+2*i+8);cout<<m[i][j]-n[i][j];} gotoxy(0,6*a+9);cout<<">>>>>>>>按任意键退出:";l=getche();}void amo()//数乘{ char h; system("cls"); // 清屏 setcolor(14,0); // 下面用黑底黄字int a,b,i,j;gotoxy(0,0);cout<<">>>>>>矩阵数乘";gotoxy(0,2);cout<<"请输入矩阵的行数:";cin>>a;cout<<endl; cout<<"请输入矩阵的列数:"; cin>>b; cout<<endl;double m[10][10],c;cout<<"请输入矩阵:"<<endl;for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+20,2*i+6);cin>>m[i][j];} cout<<endl<<"请输入与矩阵相乘的实数:";cin>>c; cout<<endl<<endl<<"矩阵数乘结果为:";for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(8*j+20,2*a+2*i+9);cout<<m[i][j]*c;} gotoxy(0,4*a+12);cout<<">>>>>>>按任意键退出:";h=getche();}void mul()//乘法{ char k; system("cls"); // 清屏 setcolor(14,0); // 下面用黑底黄字int a,b,c,i,j,q;gotoxy(0,0);cout<<">>>>>>矩阵乘法";gotoxy(0,2);cout<<"请输入第一个矩阵的行数:";cin>>a;cout<<endl<<"请输入第一个矩阵的列数:"; cin>>b;cout<<endl<<"则第二个矩阵的行数也为:"<<b; cout<<endl<<endl<<"请输入第二个矩阵的列数:"; cin>>c; cout<<endl;double m[10][10],n[10][10],p[10][10]={0};cout<<"请输入第一个矩阵:"<<endl;for(i=0;i<a;i++) for(j=0;j<b;j++) {gotoxy(6*j+18,2*i+10); cin>>m[i][j];}cout<<endl<<endl<<"请输入第二个矩阵:";for(i=0;i<b;i++) for(j=0;j<c;j++) {gotoxy(6*j+18,2*a+2*i+11);cin>>n[i][j];} cout<<endl<<">>>>>>>"<<endl<<"矩阵相乘结果为: ";for(i=0;i<a;i++) for(j=0;j<c;j++) for(q=0;q<b;q++) p[i][j]=p[i][j]+m[i][q]*n[q][j];for(i=0;i<a;i++) for(j=0;j<c;j++) {gotoxy(10*j+18,2*a+2*b+2*i+12);cout<<p[i][j];}gotoxy(16,2*a+2*b+2*i+15);cout<<">>>>>>>按任意键退出:";k=getche();}//===================================================行列式float fun(int n1,float a1[10][10]);void ran(){ system("cls"); // 清屏 setcolor(15,0); // 下面用黑底黄字char k;int n,i,j;cout<<">>>>>矩阵行列式"<<endl<<endl<<"请输入矩阵阶数: ";cin>>n;cout<<endl<<"请输入矩阵:"<<endl;float a[10][10];for(i=0;i<n;i++)for(j=0;j<n;j++){gotoxy(6*j+12,2*i+4);cin>>a[i][j];}cout<<endl<<"行列式为: "<<fun(n,a)<<endl<<endl;cout<<">>>>>>按任意键退出:";k=getche();}float fun(int n1,float a1[10][10])//求行列式的递归函数{int i_1,j_1,c;//c为数组b的行 float b[10][10];int p=0,q=0;float sum=0;if(n1==1) return a1[0][0];for(i_1=0;i_1<n1;i_1++){for(c=0;c<n1-1;c++){if(c<i_1) p=0;else p=1;for(j_1=0;j_1<n1-1;j_1++){b[c][j_1]=a1[c+p][j_1+1];}}if(i_1%2==0)q=1;else q=(-1);sum=sum+a1[i_1][0]*q*fun(n1-1,b);}return sum;}//================================================================void ord(){char g;system("cls"); // 清屏 setcolor(15,0); // 下面用黑底黄字int i,j,n;gotoxy(0,0);cout<<">>>>>矩阵的逆";gotoxy(0,2);cout<<"请输入矩阵的阶数:";cin>>n;cout<<endl; cout<<"请输入矩阵:";float l[10][10],m[10][10],p;for(i=0;i<n;i++) for(j=0;j<n;j++) {gotoxy(4*j+12,2*i+4); cin>>l[i][j];} if(fun(n,l)==0) cout<<endl<<"该矩阵无逆!!!"<<endl;else{p=fun(n,l); cout<<endl<<"矩阵的逆为: "; for(i=0;i<n;i++)for(j=0;j<n;j++){{float f[10][10]; int r,w,e,d;//e为数组f的行数 for(int j_1=0,e=0;j_1<n-1,e<n-1;j_1++,e++) for(int i_1=0,d=0;i_1<n-1,d<n-1;i_1++,d++) {if(e<i) r=0;else r=1; if(d<j) w=0;else w=1; f[i_1][j_1]=l[i_1+w][j_1+r];}; if((i+j)%2==0) m[i][j]=fun(n-1,f)/p; else m[i][j]=-fun(n-1,f)/p; }; gotoxy(9*j+12,2*n+2*i+4);cout<<m[i][j];};}; cout<<endl<<endl<<">>>>>>按任意键退出:";g=getche();} 20210311