Cod sursa(job #957124)

Utilizator radu33Nesiu Radu radu33 Data 4 iunie 2013 16:06:33
Problema Algoritmul lui Gauss Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.75 kb
#include<fstream>
#define NMAX 305
#define PREC 0.0000001
using namespace std;
 struct matrice{
 double col[NMAX];}A[NMAX],AUX;
 int N,M;
 double sol[NMAX];
 
ifstream f("gauss.in");
ofstream g("gauss.out");
 
void citire()
{
 int i,j;
 f>>N>>M;
 for(i=1;i<=N;i++)
  for(j=1;j<=M+1;j++)
	  f>>A[i].col[j];
 f.close();
}


void gauss()
 {int i,j,k,l;
 for(i=1,j=1,k;i<=N&&j<=M;i++,j++)
	 {
		 for(k=i;k<=N;k++)
            if(A[k].col[j]<-PREC || A[k].col[j]>PREC)
                break;
        if(k>N)
        {
            --i;
            continue;
        }
        if(k!=i)
        {
            AUX=A[i];
            A[i]=A[k];
            A[k]=AUX;
        }
        
		
		
		for(k=j+1;k<=M+1;k++)
		{A[i].col[k]/=A[i].col[j];
		A[i].col[j]=1;
		}//impartim linia la A[i][j]si apoi A[i][j]=1
 
		//acuma scadem din celelalte linii
		for(k=i+1;k<=N;k++)
		{	for(l=j+1;l<=M+1;l++)
				A[k].col[l]-=A[k].col[j]*A[i].col[l];
			A[k].col[j]=0;
		}
 
 
     }
}
 

bool solutie()
{for(int i=N;i;i--)
        for(int j=1;j<=M+1;j++)
            if(A[i].col[j]<-PREC || A[i].col[j]>PREC)
            {
                if(j==M+1)
                    return 0;
                sol[j]=A[i].col[M+1];//prima variabila gasita...ultima linie
                for(int k=j+1;k<=M;k++)
                    sol[j]-=sol[k]*A[i].col[k];//restul de variabile
                break;
            }
    return 1;
}



void afisare()
{
    if(solutie())
        for(int i=1;i<=M;i++)
        {
            g.precision(7);
            g<<fixed<<sol[i]<<' ';//intrebari legate de precision si fixed
        }
    else
        g<<"Imposibil\n";
    g.close();
}

int main()
{citire();
gauss();
afisare();


return 0;
}