Pagini recente » Cod sursa (job #1952370) | Cod sursa (job #2142813) | Cod sursa (job #362875) | Cod sursa (job #2817977) | Cod sursa (job #1238174)
#include <fstream>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int n, c[102][102];
int main()
{
is >> n;
for ( int i = 1; i <= n; i++ )
for ( int j = 1; j <= n; j++ )
is >> c[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 && c[i][k] + c[k][j] < c[i][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;
}