Pagini recente » Cod sursa (job #659477) | Cod sursa (job #1182677) | Cod sursa (job #419649) | Cod sursa (job #1068267) | Cod sursa (job #2698354)
#include <iostream>
#include <fstream>
using namespace std;
#define MAX_N 105
#define INF 1005
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i, j, k, v[MAX_N][MAX_N], n;
f >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (i == j)
v[i][j] = 0;
else
v[i][j] = INF;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
f >> v[i][j];
}
}
for (k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (v[i][j] > v[i][k] + v[k][j])
v[i][j] = v[i][k] + v[k][j];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
if (v[i][j] == INF)
g << 0 << ' ';
else
g << v[i][j] << ' ';
g << '\n';
}
return 0;
}