Pagini recente » Cod sursa (job #2519597) | Cod sursa (job #968608) | Cod sursa (job #1286256) | Cod sursa (job #66952) | Cod sursa (job #1420676)
#include <cstdio>
FILE* in=fopen("gauss.in","r");
FILE* out=fopen("gauss.out","w");
const int Q=308;
int n,m;
int v[Q][Q];
int sel[Q];
int main()
{
fscanf(in,"%d%d",&n,&m);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m+1; j++)
{
fscanf(in,"%d",&v[i][j]);
}
}
int kept;
for(int k=1; k<=m; k++)
{
int f;
for(f=1; f<=n; f++)
{
if(sel[f]==0 && v[f][k]!=0)
{
sel[f]=1;
for(int i=1; i<=n; i++)
{
if(f==i)
continue;
kept=v[i][k];
for(int j=1; j<=m+1; j++)
{
v[i][j]=v[i][j]*v[f][k]-v[f][j]*kept;
}
}
break;
}
}
}
for(int j=1; j<=m; j++)
{
int act=0;
for(int i=1; i<=n; i++)
{
if(v[i][j]!=0)
act++;
}
if(act>=2)
{
fprintf(out,"Imposibil");
return 0;
}
}
for(int j=1; j<=m; j++)
{
for(int i=1; i<=n; i++)
{
if(v[i][j]!=0)
fprintf(out,"%.8lf ",(double)v[i][m+1]/v[i][j]);
}
}
return 0;
}