if(max<=1e-5) //三角矩阵的对角元等于0则无解 { cout<<\"no inverse array\\n\" exit(0) } if(line!=i) { swap(p,i,line) swap(q,i,line) } for (k=0 k<N k++) -if (maxlt; = 1e-5) / / triangular matrix diagonal yuan equals 0 (coutlt