Pagini recente » Cod sursa (job #1348162) | Cod sursa (job #549691) | Cod sursa (job #1588559) | Cod sursa (job #1704709) | Cod sursa (job #3270955)
#include <bits/stdc++.h>
using namespace std;
int v[1005][1005];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
f >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <=n ; j++)
{
f >> 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][j] > v[i][k] + v[k][j] && i != j)
v[i][j] = v[i][k] + v[k][j];
else 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++)
{
g << v[i][j] << " ";
}
g << '\n';
}
return 0;
}