Pagini recente » Cod sursa (job #411129) | Cod sursa (job #1524325) | Cod sursa (job #2127918) | Cod sursa (job #1052372) | Cod sursa (job #739985)
Cod sursa(job #739985)
#include<fstream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m;
double A[310][310],sol[310];
double EPS=0.0000001;
void Citire()
{
int i,j;
ifstream fin("gauss.in");
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
fin>>A[i][j];
fin.close();
}
void Eliminarea_Gaussiana()
{
int i,j,k,p;
i=j=1;
while(i<=n && j<=m)
{
for(k=i;k<=n;k++)
{
if(A[k][j]>EPS || A[k][j]<-EPS)
break;
}
if(k==n+1)
{
j++;
continue;
}
if(k!=i)
{
for(p=1;p<=m+1;p++)
swap(A[i][p],A[k][p]);
}
for(k=j+1;k<=m+1;k++)
A[i][k]/=A[i][j];
A[i][j]=1.0;
for(k=i+1;k<=n;k++)
{
for(p=j+1;p<=m+1;p++)
A[k][p]-=A[k][j]*A[i][p];
A[k][j]=0.0;
}
i++;
j++;
}
}
void Determinare_Necunoscute()
{
freopen("gauss.out","w",stdout);
int i,j,k;
bool gasit;
for(i=n;i>0;i--)
{
gasit=false;
for(j=1;j<=m && !gasit;j++)
{
if(A[i][j]>EPS || A[i][j]<-EPS)
{
gasit=true;
sol[j]=A[i][m+1];
for(k=j+1;k<=m;k++)
sol[j]-=sol[k]*A[i][k];
}
}
if(!gasit && (A[i][m+1]>EPS || A[i][m+1]<-EPS))
{
printf("Imposibil\n");
return;
}
}
for(i=1;i<=m;i++)
printf("%.8lf ",sol[i]);
printf("\n");
}
int main()
{
Citire();
Eliminarea_Gaussiana();
Determinare_Necunoscute();
return 0;
}