Pagini recente » Cod sursa (job #87182) | Cod sursa (job #1378011) | Cod sursa (job #3195357) | Cod sursa (job #1516904) | Cod sursa (job #2182310)
#include <fstream>
#define Nmax 105
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[Nmax][Nmax];
void read()
{
f >> n ;
for ( int i = 1 ; i <= n ; i ++ )
for ( int j = 1 ; j <= n ; j ++ )
f >> a[i][j];
}
bool ok(int k, int i, int j)
{
if ( a[i][k] == 0 || a[k][j] == 0 || i == j )
return false;
if ( a[i][j] == 0 || a[i][k] + a[k][j] < a[i][j] )
return true;
return false;
}
void RoyFloyd()
{
for ( int k = 1 ; k <= n ; k ++ )
for ( int i = 1 ; i <= n ; i ++ )
for ( int j = 1 ; j <= n ; j ++ )
if (ok(k,i,j))
a[i][j]=a[i][k]+a[k][j];
}
void print()
{
for ( int i = 1 ; i <= n ; i ++ )
{
for ( int j = 1 ; j <= n ; j ++ )
g << a[i][j] << " ";
g <<'\n';
}
}
int main()
{
read();
RoyFloyd();
print();
return 0;
}