Cod sursa(job #839175)

Utilizator repp4raduRadu-Andrei Szasz repp4radu Data 21 decembrie 2012 14:31:49
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.45 kb
#include <fstream>
#include <iomanip>

#define MAX 305
#define EPS 1e-6

using namespace std;

int N, M;
double A[MAX][MAX], X[MAX];

int main()
{
    ifstream in("gauss.in"); in>>N>>M;
    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= M + 1; j++)
            in>>A[i][j];
    in.close();
    int i = 1, j = 1, k;
    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(int l = 1; l <= M + 1; l++) swap(A[i][l], A[k][l]);
        for(int l = j + 1; l <= M + 1; l++) A[i][l] /= A[i][j];
        A[i][j] = 1;
        for(int u = i + 1; u <= N; u++)
        {
            for(int l = j + 1; l <= M + 1; l++) A[u][l] -= A[u][j] * A[i][l];
            A[u][j] = 0;
        }
        i++; j++;
    }
    ofstream out("gauss.out");
    for(int i = N; i; i--)
        for(int j = 1; j <= M + 1; j++)
            if(A[i][j] < -EPS || A[i][j] > EPS)
            {
                if(j == M + 1)
                {
                    out<<"Imposibil\n";
                    out.close(); return 0;
                }
                X[j] = A[i][M + 1];
                for(int k = j + 1; k <= M; k++)
                    X[j] -= X[k] * A[i][k];
                break;
            }
    for(int i = 1; i <= M; i++) out<<fixed<<setprecision(10)<<X[i]<<" ";
    out.close();
    return 0;
}