Pagini recente » Cod sursa (job #2315111) | Cod sursa (job #899046) | Cod sursa (job #1677184) | Cod sursa (job #1410039) | Cod sursa (job #902911)
Cod sursa(job #902911)
#include <fstream>
#include <iomanip>
#include <cstdlib>
using namespace std;
#define EPS 0.0000001
fstream f("gauss.in", ios::in), g("gauss.out", ios::out);
float a[303][303],X[303];
int m,n;
void solve();
void cauta(int);
void schimba(int,int);
void redu(int,int,float);
void imparte(int,float);
bool nonz ();
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m+1;j++)
f>>a[i][j];
solve();
for(int i=1;i<=m;i++)
{
g<<fixed<<setprecision (8)<<X[i]<<" ";
}
return 0;
}
void solve()
{
for(int i=1,j=1;i<=n && j<=m;j++,i++)
{
if (a[i][j]==0)
cauta(j);
if(a[i][j]!=0)
{
imparte(i,a[i][i]);
for(int j=i+1;j<=n;j++)
{
float d=a[j][i];
redu(i,j,d);
}
}
else
j--;
}
for(int i = n; i>0; --i)
for(int j = 1; j <= m+1; ++j)
if(a[i][j]>EPS || a[i][j]<-EPS)
{
if(j == m+1)
{
g<<"Imposibil"<<endl;
exit(0);
}
X[j] = a[i][m+1];
for(int k = j+1; k <= m; ++k)
X[j] -= X[k] * a[i][k];
break;
}
}
void cauta(int m)
{
int i=m+1;
while(a[i][m]==0 && i<=n)
i++;
if (i<=n)
schimba(m,i);
}
void schimba(int m,int i)
{
int aux;
for(int j=1;j<=m+1;j++)
{
aux=a[m][j];
a[m][j]=a[i][j];
a[i][j]=aux;
}
}
void redu(int i, int j, float d)
{
for(int k=i;k<=m+1;k++)
{
a[j][k]=a[j][k]-a[i][k]*d;
}
}
void imparte(int i, float d)
{
for(int k=i;k<=m+1;k++)
a[i][k]/=d;
}
bool nonz()
{
bool bo=true;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m && bo==true;j++)
if (a[i][j]!=0)
bo=false;
if (bo==true && a[i][(int)m+1]!=0)
return false;
}
return true;
}