Pagini recente » Cod sursa (job #2301249) | Cod sursa (job #167024) | Cod sursa (job #2713752) | Cod sursa (job #2216701) | Cod sursa (job #2776252)
#include<fstream>
#include<iomanip>
using namespace std;
ifstream F("gauss.in");
ofstream G("gauss.out");
#define E 0.001
int n,m,i,j,k,l,a[302][302];
double a[302][302],x[302],y;
int main ()
{
F>>n>>m;
for(i=1;i<=n;++i)
for(j=1;j<=m+1;++j)
F>>a[i][j];
for(j=1;j<=m;++j) {
for(i=j;i<=n;++i)
if(a[i][j]>E||a[i][j]<-E)
break;
if(i>n)
continue;
if(i!=j)
for(k=1;k<=m+1;++k)
y=a[i][k],a[i][k]=a[j][k],a[j][k]=y;
for(k=j+1;k<=m+1;++k)
a[j][k]/=a[j][j];
for(a[j][j]=1,k=j+1;k<=n;a[k][j]=0,++k)
for(l=j+1;l<=m+1;++l)
a[k][l]-=a[j][l]*a[k][j];
}
for(i=n;i;--i)
for(j=1;j<=m+1;++j)
if(a[i][j]>E||a[i][j]<-E) {
if(j==m+1) {
printf("Imposibil");
return 0;
}
for(x[j]=a[i][m+1],k=j+1;k<=m;++k)
x[j]-=x[k]*a[i][k];
break;
}
G<<setprecision(9)<<fixed;
for(i=1;i<=m;++i)
G<<x[i]<<" ";
return 0;
}