Pagini recente » Cod sursa (job #60428) | Viata de dupa olimpiade (III) - Startup | Cod sursa (job #2077358) | Cod sursa (job #534258) | Cod sursa (job #1712829)
#include<cstdio>
#define MAXN 310
#define EPS 0.0000001
using namespace std;
double a[MAXN][MAXN],v[MAXN];
int main(){
freopen("gauss.in","r",stdin);
freopen("gauss.out","w",stdout);
int n,m,i,j,k,p,q;
double temp;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
scanf("%lf",&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(p=1;p<=m+1;p++){
temp=a[i][p];
a[i][p]=a[k][p];
a[k][p]=temp;
}
for(p=j+1;p<=m+1;p++)
a[i][p]/=a[i][j];
a[i][j]=1;
for(p=i+1;p<=n;p++){
for(q=j+1;q<=m+1;q++)
a[p][q]=a[p][q]-a[p][j]*a[i][q];
a[p][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){
printf("imposibil");
return 0;
}
v[j]=a[i][m+1];
for(k=j+1;k<=m;k++)
v[j]=v[j]-v[k]*a[i][k];
break;
}
for(i=1;i<=m;i++)
printf("%.8f ",v[i]);
return 0;
}