Pagini recente » Cod sursa (job #1128613) | Cod sursa (job #1765684) | Cod sursa (job #2771291) | Cod sursa (job #1585796) | Cod sursa (job #3124421)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int N = 101;
const int oo = 1e9 + 5;
int n, adj[N][N];
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
fin >> adj[i][j];
if (!adj[i][j] && i != j)
adj[i][j] = oo;
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (adj[i][j] > adj[i][k] + adj[k][j])
adj[i][j] = adj[i][k] + adj[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
if (adj[i][j] == oo)
fout << 0 << ' ';
else
fout << adj[i][j] << ' ';
fout << '\n';
}
return 0;
}