Cod sursa(job #3192657)
Utilizator | Obreja Rares raresO | Data | 13 ianuarie 2024 09:35:54 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.92 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int mat[101][101];
int main()
{
f >> n;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
f >> mat[i][j];
}
}
for (int k = 1; k <= n; ++k)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (mat[i][j] && mat[i][k] && mat[k][j])
{
if (mat[i][k] + mat[k][j] < mat[i][j])
{
mat[i][j] = mat[i][k] + mat[k][j];
}
}
}
}
}
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
g << mat[i][j] << ' ';
}
g << '\n';
}
return 0;
}