Pagini recente » Cod sursa (job #2456250) | Profil tudorfrent1 | Cod sursa (job #1726845) | Cod sursa (job #2529866) | Cod sursa (job #1173529)
#include <fstream>
#include <iomanip>
#define eps 0.0000001
using namespace std;
double sol[305],tmp,a[305][305];
int n,m,i,j,k,l;
int main() {
ifstream f("gauss.in");
ofstream g("gauss.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
f>>a[i][j];
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(l=1;l<=m+1;l++) {
tmp=a[i][l];
a[i][l]=a[k][l];
a[k][l]=tmp;
}
for(l=j+1;l<=m+1;l++)
a[i][l]/=a[i][j];
a[i][j]=1;
for(k=i+1;k<=n;k++) {
for(l=j+1;l<=m+1;l++)
a[k][l]-=a[k][j]*a[i][l];
a[k][j]=0;
}
i++;j++;
}
for(i=n;i>=1;i--)
for(j=1;j<=m+1;j++)
if(a[i][j]<-eps || a[i][j]>eps) {
if(j==m+1) {
g<<"Imposibil\n";
return 0;
}
sol[j]=a[i][m+1];
for(k=j+1;k<=m;k++)
sol[j]-=sol[k]*a[i][k];
break;
}
g<<setprecision(8)<<fixed;
for(i=1;i<=m;i++)
g<<sol[i]<<" ";
return 0;
}