Cod sursa(job #820987)

Utilizator geniucosOncescu Costin geniucos Data 21 noiembrie 2012 15:16:19
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.46 kb
#include<cstdio>
using namespace std;
int lj,k,i,n,m,j,nr;
double eps,s,a[308][308],x[308],b[308][308];
double mod(double x)
{
    if(x<0) return -x;
    return x;
}
void schimb(int i,int j)
{
    int k;
    double aux;
    for(k=1;k<=m+1;k++)
    {
        aux=a[i][k];
        a[i][k]=a[j][k];
        a[j][k]=aux;
    }
}
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]);
        b[i][j]=a[i][j];
    }
//lj
lj=1;
for(i=1;i<=n;i++)
{
    j=1;
    while(a[i][j]==0&&j<=m) j++;
    if(j==m+1)
    {
        lj++;
        continue;
    }
    if(j!=i) schimb(j,i);
    for(j=m+1;j>lj;j--)
        a[i][j]=(double)a[i][j]/a[i][lj];
    a[i][lj]=1;
    for(k=i+1;k<=n;k++)
    {
        for(j=m+1;j>lj;j--)
            a[k][j]=(double)a[k][j]-a[k][lj]*a[i][j];
        a[k][lj]=0;
    }
    lj++;
}
for(j=1;j<=m;j++)
    if(a[n][j]==0) nr++;
/*if(nr!=m-1)
{
    printf("Imposibil\n");
    return 0;
}*/
eps=0.000001;
for(i=n;i>=1;i--)
{
    nr=0;
    for(j=1;j<=m+1;j++)
        if(a[i][j]>-eps&&a[i][j]<eps) nr++;
    if(nr==m)
    {
        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("%.8lf ",x[i]);
return 0;
}