Pagini recente » Cod sursa (job #517281) | Cod sursa (job #3226897) | Cod sursa (job #1412200) | Clasamentul arhivei de probleme | Cod sursa (job #820962)
Cod sursa(job #820962)
#include<cstdio>
using namespace std;
int k,i,n,m,j,nr;
double s,a[308][308],x[308];
int main()
{
freopen("gauss.in","r",stdin);
freopen("gauss.out","w",stdout);
scanf("%d",&n);
scanf("%d",&m);
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
scanf("%lf",&a[i][j]);
for(i=1;i<=n;i++)
{
/*if(a[i][i]==0)
{
printf("Imposibil\n");
return 0;
}*/
for(j=m+1;j>=i;j--)
a[i][j]=(double)a[i][j]/a[i][i];
for(k=i+1;k<=n;k++)
{
for(j=m+1;j>=i;j--)
a[k][j]=(double)a[k][j]-a[k][i]*a[i][j];
}
}
for(j=1;j<=m;j++)
if(a[n][j]==0) nr++;
/*if(nr!=m-1)
{
printf("Imposibil\n");
return 0;
}*/
x[n]=(double)a[n][m+1];
for(i=n-1;i>=1;i--)
{
s=0;
for(j=i+1;j<=m;j++)
s=s+a[i][j]*x[j];
x[i]=a[i][m+1]-s;
}
for(i=1;i<=m;i++)
printf("%.6lf ",x[i]);
return 0;
}