Pagini recente » Cod sursa (job #3252706) | Cod sursa (job #1700349) | Cod sursa (job #1772234) | Cod sursa (job #818638) | Cod sursa (job #3139663)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, dist[105][105];
const int inf = 1e9;
void RoyFloyd() {
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (dist[i][j] > dist[i][k] + dist[k][j])
dist[i][j] = dist[i][k] + dist[k][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (dist[i][j] == inf && i != j)
dist[i][j] = 0;
}
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
fin >> dist[i][j];
if (i != j && dist[i][j] == 0)
dist[i][j] = inf;
}
RoyFloyd();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
fout << dist[i][j] << " ";
fout << "\n";
}
return 0;
}