Pagini recente » Cod sursa (job #1211844) | Cod sursa (job #1039741) | Cod sursa (job #2169700) | Cod sursa (job #1326151) | Cod sursa (job #1005082)
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, d[1010][1010];
fin >> n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
fin >> d[i][j];
for (int k = 0; k < n; ++k)
for (int u = 0; u < n; ++u)
for (int v = 0; v < n; ++v)
if (u != v && d[u][k] != 0 && d[k][v] != 0 &&
(d[u][v] == 0 || d[u][v] > d[u][k] + d[k][v]))
d[u][v] = d[u][k] + d[k][v];
for (int u = 0; u < n; ++u) {
for (int v = 0; v < n; ++v)
fout << d[u][v] << ' ';
fout << '\n';
}
return 0;
}