Pagini recente » Cod sursa (job #1513417) | Cod sursa (job #1115986) | Cod sursa (job #377471) | Cod sursa (job #649795) | Cod sursa (job #1688198)
#include <fstream>
#include <iomanip>
using namespace std;
ifstream fin ("gauss.in");
ofstream fout ("gauss.out");
const double EPS = 0.000000001;
int n, m;
double S[310], V[310][310];
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i ++)
{
for (int j = 1; j <= m + 1; j ++)
{
fin >> V[i][j];
}
}
int i = 1, j = 1, k;
while (i <= n && j <= m)
{
for (k = i; k <= n; k ++) /// Verifica unde gasesc un element pe coloana j diferit de zero
{
if (V[k][j] > EPS || V[k][j] < -EPS)
{
break;
}
}
if (k == n + 1)
{
j ++;
continue;
}
if (k != i)
{
for (int c = 1; c <= m + 1; c ++)
{
swap(V[i][c], V[k][c]);
}
}
for (k = j + 1; k <= m + 1; k ++) V[i][k] /= V[i][j];
V[i][j] = 1;
for (int l = i + 1; l <= n; l ++)
{
for (int c = j + 1; c <= m + 1; c ++)
{
V[l][c] -= V[i][c] * V[l][j];
}
V[l][j] = 0;
}
i ++;
j ++;
}
for (int i = n; i >= 1; i --)
{
for (int j = 1; j <= m + 1; j ++)
{
if (V[i][j] > EPS || V[i][j] < -EPS)
{
if (j == m + 1)
{
fout << "Imposibil\n";
fout.close();
return 0;
}
S[j] = V[i][m + 1];
for (int k = j + 1; k <= m; k ++)
{
S[j] -= S[k] * V[i][k];
}
break;
}
}
}
for (int i = 1; i <= m; i ++) fout << fixed << setprecision(9) << S[i] << ' ';
fout.close();
return 0;
}