Pagini recente » Cod sursa (job #3351187) | Cod sursa (job #826664) | Cod sursa (job #1781449) | Cod sursa (job #2348541) | Cod sursa (job #3336831)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n, d[101][101];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
fin >> d[i][j];
///Floyd Warshall
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] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != j)
d[i][j] = d[i][k] + d[k][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
fout << d[i][j] << ' ';
fout << '\n';
}
return 0;
}