/* ==================================
?*
?*??Copyright?(C)?Bill?Hsu?
?*??? http://hi.baidu.com/probill
?*??2009-12-11
?********************************** */
#include?? < iostream >
#include?? < vector >
#include?? < math.h >
using ??? namespace ??std;

typedef?vector?? < float > ??s_line;? // ?用來表示一行
s_line?line;

typedef?vector?? < s_line > ??s_matrix;? // ?用來表示一個(gè)矩陣
s_matrix?matrix;
s_matrix?mat;
int ??nSize;? // ?矩陣維數(shù)
int ??nSign;? // ?標(biāo)記行列式正負(fù)
void ??outprint(s_matrix? & ??_mat);
void ??printstep(s_matrix? & ??_mat);
int ??step? = ? 0 ?;
void ??line_add(s_matrix? & ??_mat,? int ??a,? int ??b,? float ??k? = ? 1.0f ?)? // ?第b行乘k加到第a行
{
int ??size? = ?_mat[? 0 ?].size();

for ?(? int ??i? = ? 0 ?;i? < ?size;? ++ ?i)
{
_mat[a][i]? += ?_mat[b][i]? * ?k;

}? // ?end?for
}



void ??work1(s_matrix? & ??_mat)? // ?主計(jì)算函數(shù)
{

for ?(? int ??i? = ? 1 ?;i? < ?nSize;? ++ ?i)
{

if ?(fabs(_mat[i? - ? 1 ?][i? - ? 1 ?])? < ? 0.000001 )
{
int ??mm;
for ?(mm? = ?i;mm? < ?nSize;? ++ ?mm)
{
if ?(fabs(_mat[mm? - ? 1 ?][i? - ? 1 ?])? > ? 0.000001 ?)?? break ?;
}? // ?end?for
line_add(_mat,i? - ? 1 ?,mm? - ? 1 ?);
}? // ?end?if

for ?(? int ??j? = ?i;j? < ?nSize;? ++ ?j)
{
line_add(_mat,j,i? - ? 1 ?,? - ?_mat[j][i? - ? 1 ?]? / ?_mat[i? - ? 1 ?][i? - ? 1 ?]);

}? // ?end?for?j
printstep(_mat);
}? // ?end?for?i

}


void ??work2(s_matrix? & ??_mat)? // ?第二部計(jì)算
{
for ?(? int ??i? = ?nSize? - ? 2 ?;i? >= ? 0 ?;? -- ?i)
{
for ?(? int ??j? = ?i;j? >= ? 0 ?;? -- ?j)
{
line_add(_mat,j,i? + ? 1 ?,? - ?_mat[j][i? + ? 1 ?]? / ?_mat[i? + ? 1 ?][i? + ? 1 ?]);
}
printstep(_mat);
}

}


void ??makeunit(s_matrix? & ??_mat)? // ?單位化
{

mat.clear();

for ?(? int ??i? = ? 0 ?;i? < ?nSize;? ++ ?i)
{
line.clear();
for ?(? int ??j? = ? 0 ?;j? < ?nSize? * ? 2 ?;? ++ ?j)
{
float ??tmp? = ?_mat[i][j]? / ?_mat[i][i];
if ?(fabs(tmp)? < ? 0.000001 ?)?tmp? = ? 0 ?;
line.push_back(tmp);
}
mat.push_back(line);
// ?cout<<endl;
}
_mat? = ?mat;
}

void ??printstep(s_matrix? & ??_mat)? // ?顯示求的過程
{
cout? << ? " ?第?? " ? <<++ ?step? << ? " ?步? " ? << ?endl;
for ?(? int ??i? = ? 0 ?;i? < ?nSize;? ++ ?i)
{

for ??(? int ??j? = ? 0 ?;j? < ? 2 ? * ?nSize;? ++ ?j)
{
if ?(fabs(_mat[i][j])? < ? 0.000001 )?_mat[i][j]? = ? 0 ?;
cout? << ?_mat[i][j]? << ? " ??? " ?;
if ?(j? == ?nSize? - ? 1 ?)cout?? << ? " ??|?? " ?;
}
cout? << ?endl;
}
cout? << ?endl;

}

void ??outprint(s_matrix? & ??_mat)? // ?輸出函數(shù)
{
for ?(? int ??i? = ? 0 ?;i? < ?nSize;? ++ ?i)
{

for ??(? int ??j? = ?nSize;j? < ? 2 ? * ?nSize;? ++ ?j)
{
cout? << ?_mat[i][j]? << ? " ??? " ?;
}
cout? << ?endl;
}


}

int ??main()
{
step? = ? 0 ?;
matrix.clear();
line.clear();
cout? << ? " ?*********矩陣?求逆*********? " ? << ?endl;
cout? << ? " ?*********Bill??Hsu*********? " ? << ?endl;
cout? << ? " ?http://hi.baidu.com/probill? " ? << ?endl? << ?endl;

cout? << ? " ?請(qǐng)輸入矩陣維數(shù)(輸入0退出)：? " ?;?
cin? >> ?nSize;
if ?(nSize? <= ? 0 ?)?? return ??? 0 ?;
for ?(? int ??i? = ? 0 ?;i? < ?nSize;? ++ ?i)
{
line.clear();?
cout? << ? " ?輸入第? " ? << ?i? + ? 1 ? << ? " ??行:?? " ? << ?endl;
for ??(? int ??j? = ? 0 ?;j? < ?nSize;? ++ ?j)?
{
float ??tmp;
cin? >> ?tmp;
line.push_back(tmp);?? // ?壓入一個(gè)數(shù)到某行
}

for ??(? int ??j? = ? 0 ?;j? < ?nSize;? ++ ?j)?
{
if ?(i? == ?j)?line.push_back(? 1.0f ?);
else ??line.push_back(? 0.0f ?);
}


matrix.push_back(line);?? // ?壓入一行到矩陣
}

cout?? << ?endl;
work1(matrix);
work2(matrix);
makeunit(matrix);
cout? << ?endl? << ? " ?########################? " ? << ?endl
<< ? " ?求逆結(jié)果：? " ? << ?endl;
outprint(matrix);
cout? << ? " ?########################? " ? << ?endl;

main();


return ??? 0 ?;????
}