Pagini recente » Cod sursa (job #228833) | Cod sursa (job #2305526) | Cod sursa (job #2894698) | Cod sursa (job #1797889) | Cod sursa (job #3270795)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int v[1005][1005];
int main()
{
int n;
in >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
in >> v[i][j];
for(int k = 1; k <= n; k ++)
{
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= n; j ++)
{
if(v[i][k] && v[k][j])
v[i][j] = min(v[i][j], v[i][k] + v[k][j]);
}
}
}
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= n; j ++)
out << v[i][j] << " ";
out << '\n';
}
return 0;
}