Pagini recente » Cod sursa (job #3155782) | Cod sursa (job #1404383) | Cod sursa (job #568299) | Cod sursa (job #975405) | Cod sursa (job #608705)
Cod sursa(job #608705)
#include <fstream>
#include <string>
#include <iostream>
#include <iomanip>
using namespace std;
const int maxn=305;
const double EPS=0.000001;
int i,j,x,k,u,N,M;
double imp;
double A[maxn][maxn],aux[maxn],X[maxn];
int p[maxn];
ifstream fin("gauss.in");
ofstream fout("gauss.out");
int main() {
fin >> N >> M;
for(i=1;i<=N;i++)
for(j=1;j<=M+1;j++)
fin >> A[i][j];
i=1; j=1;
while(i<=N && j<=M) {
for(x=i;x<=N && A[x][j]>-EPS && A[x][j]<EPS;x++);
if(x<=N) {
memcpy(aux,A[i],sizeof(A[i]));
memcpy(A[i],A[x],sizeof(A[i]));
memcpy(A[x],aux,sizeof(A[i]));
for(k=j+1;k<=M+1;k++)
A[i][k]=A[i][k]/A[i][j];
A[i][j]=1;
for(u=i+1;u<=N;u++) {
for(k=j+1;k<=M+1;k++)
A[u][k]-=A[i][k]*A[u][j];
A[u][j]=0;
}
i++;
}
j++;
}
for(i=N;i;i--)
for(j=1;j<=M+1;j++)
if(A[i][j]>EPS || A[i][j]<-EPS) {
if(j==M+1) {
fout << "Imposibil";
return 0;
}
X[i]=A[i][M+1];
for(k=j+1;k<=M;k++) X[i]-=A[i][k]*X[k];
break;
}
for(i=1;i<=M;i++)
fout << setprecision(9) << X[i] << ' ';
}