Pagini recente » Cod sursa (job #586257) | Cod sursa (job #107036) | Cod sursa (job #1023906) | Cod sursa (job #1512047) | Cod sursa (job #1193648)
#include <fstream>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int n, c[101][101];
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][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;
}