Cod sursa(job #1413944)

Utilizator Kira96Denis Mita Kira96 Data 2 aprilie 2015 11:12:33
Problema Algoritmul lui Gauss Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 2.14 kb
/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#define f cin
#define g cout
#include<queue>
#define INF 0x3f3f3f3f
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define eps 1.e-9
#define BUFMAX 10100100
#define N 330
#define BM 100100
#define mod 1000000007
#define inf (1<<30)
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("gauss.in");
ofstream g("gauss.out");
int z(double x)
{
    if(x>-eps&&x<eps)
        return 1;
    return 0;
}
double x[N],a[N][N];
int n,m;
int main ()
{
    f>>n>>m;
    FOR(i,1,n)
    FOR(j,1,m+1)
    f>>a[i][j];
    FOR(i,1,n)
    {
        int p=0;
        FOR(j,i,n)
        if(!z(a[j][i]))
        {
            p=j;
            break;
        }
        if(!p)
            continue;
        FOR(j,i,m+1)
        swap(a[i][j],a[p][j]);
        double x=a[i][i];
        FOR(j,i+1,m+1)
        a[i][j]/=x;
        a[i][i]=1;
        FOR(j,1,n)
        if(i!=j)
        {
            FOR(k,i+1,m+1)
            a[j][k]-=a[i][k]*a[j][i];
            a[j][i]=0;
        }
    }
    FOR(i,1,n)
    {
        int j=1;
        for(;j<=m+1;++j)
            if(!z(a[i][j]))
                break;
        if(j==m+1)
        {
            g<<"Imposibil";
            return 0;
        }
        x[j]=a[i][m+1]/a[i][j];
    }
    FOR(i,1,n)
    g<<fixed<<setprecision(12)<<x[i]<<" ";
    return 0;
}