Pagini recente » Cod sursa (job #2094040) | Cod sursa (job #2091662) | Cod sursa (job #2750500) | Cod sursa (job #2554412) | Cod sursa (job #795704)
Cod sursa(job #795704)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define INF 0x3f3f3f3f
int a[101][101];
int n;
void RoyFloyd();
int main()
{
fin >> n;
for( int i = 1; i <= n; ++i )
for( int j = 1; j <= n; ++j )
{
fin >> a[i][j];
if( a[i][j] == 0 && i != j )
a[i][j] = INF;
}
RoyFloyd();
for( int i = 1; i <= n; ++i )
{
for( int j = 1; j <= n; ++j )
if( a[i][j] != 0 )
fout << a[i][j] << ' ';
else
fout << '0' << ' ';
fout << '\n';
}
fin.close();
fout.close();
return 0;
}
void RoyFloyd()
{
for( int k = 1; k <= n; ++k )
for( int i = 1; i <= n; ++i )
for( int j = 1; j<= n; ++j )
if( a[i][j] > a[i][k] + a[k][j] )
a[i][j] = a[i][k] + a[k][j];
}