Pagini recente » Cod sursa (job #2978614) | Cod sursa (job #1207724) | Cod sursa (job #1123338) | Cod sursa (job #3204677) | Cod sursa (job #1608302)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[110][110], i, j, k;
int main()
{
f >> n;
for( i = 1; i <= n ; i ++ )
for( j = 1; j <= n; j ++ )
f >> a[i][j];
for( i = 1; i <= n; i ++ )
for( j = 1; j <= n; j ++ )
for( k = 1; k <= n; k ++ )
if( i != j )
if( (a[i][k] && a[k][j]) && ( a[i][k] + a[k][j] < a[i][j] || !a[i][j] ) )
a[i][j] = a[i][k] + a[k][j];
for( i = 1; i <= n; i ++ )
{
for( j = 1; j <= n; j ++ )
g << a[i][j] <<" ";
g << '\n';
}
return 0;
}