Pagini recente » Cod sursa (job #2830481) | Profil Djok | Cod sursa (job #2084479) | Cod sursa (job #584524) | Cod sursa (job #2867861)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, dist[110][110];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
fin >> dist[i][j];
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][k] && dist[j][k])
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
fout << dist[i][j] << ' ';
}
fout << '\n';
}
return 0;
}