Pagini recente » Cod sursa (job #2205899) | Cod sursa (job #2577636) | Cod sursa (job #2254632) | Cod sursa (job #2300063) | Cod sursa (job #1221721)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAXNM = 105;
int a[MAXNM][MAXNM];
int n;
void RoyFloyd();
int main()
{
int i, j;
fin >> n;
for ( i = 1; i <= n; i++ )
for ( j = 1; j <= n; j++ )
fin >> a[i][j];
RoyFloyd();
for ( i = 1; i <= n; i++ )
{
for ( j = 1; j <= n; j++ )
fout << a[i][j] << ' ';
fout << '\n';
}
fin.close();
fout.close();
return 0;
}
void RoyFloyd()
{
int i, j, k;
for ( k = 1; k <= n; k++ )
for ( i = 1; i <= n; i++ )
for ( j = 1; j <= n; j++ )
if ( ( a[i][j] > a[i][k] + a[k][j] ) || ( a[i][j] == 0 && i != j ) )
a[i][j] = a[i][k] + a[k][j];
}