Pagini recente » Cod sursa (job #1343455) | Cod sursa (job #2419900) | Cod sursa (job #303868) | Cod sursa (job #523098) | Cod sursa (job #2188186)
#include <bits/stdc++.h>
using namespace std;
int n, d[105][105];
int main()
{
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
fin >> d[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if(i != j && d[i][k] && d[k][j] && (d[i][j] == 0 || d[i][j] > d[i][k]+d[k][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;
}