Pagini recente » Cod sursa (job #2934599) | Cod sursa (job #2740001) | Cod sursa (job #1335522) | Cod sursa (job #1419592) | Cod sursa (job #1378778)
#include <fstream>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int N;
int X[101][101], D[101][101];
int main()
{
is >> N;
for ( int i = 1; i <= N; ++i )
for ( int j = 1; j <= N; ++j )
is >> 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][j] > D[i][k] + D[k][j] || !D[i][j]) && D[i][k] && D[k][j] && 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 )
os << D[i][j] << " ";
os << '\n';
}
is.close();
os.close();
}