Pagini recente » Cod sursa (job #1058534) | Cod sursa (job #2941554) | Cod sursa (job #2754185) | Cod sursa (job #2666676) | Cod sursa (job #1380094)
#include <fstream>
#include <vector>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int a[102][102];
int c[102][102];
int n;
int main()
{
is >> n;
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ )
{
is >> a[i][j];
c[i][j] = a[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 && a[i][k] && a[k][j] && c[i][j] > c[i][k] + c[k][j] )
c[i][j] = c[i][k] + c[k][j];
for ( int i = 1; i <= n; i++ )
{
for ( int j = 1; j <= n; j++ )
os << c[i][j] << ' ';
os << '\n';
}
is.close();
os.close();
return 0;
}