Pagini recente » Cod sursa (job #1395394) | Cod sursa (job #2373452) | Cod sursa (job #195734) | Cod sursa (job #195796) | Cod sursa (job #3302998)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
long long n, d[101][101];
int main()
{
f >> n;
for( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
f >> 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( d[i][k] != 0 or d[k][j] != 0 or d[i][j] != 0 )
if( d[i][k] + d[k][j] < d[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 ++)
{
g << d[i][j] << ' ';
}
g << '\n';
}
return 0;
}