Pagini recente » Cod sursa (job #647695) | Cod sursa (job #1408926) | Cod sursa (job #1417579) | Cod sursa (job #2599692) | Cod sursa (job #2971299)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 104;
const int INF = 10000004;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int d[NMAX][NMAX];
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
d[i][j] = INF;
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
int a;
fin >> a;
if (a != 0)
{
d[i][j] = a;
}
}
}
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (d[i][k] < INF && d[k][j] < INF)
{
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (d[i][j] == INF || i == j)
{
d[i][j] = 0;
}
fout << d[i][j] << ' ';
}
fout << '\n';
}
return 0;
}