Pagini recente » Cod sursa (job #1970299) | Cod sursa (job #2111165) | Cod sursa (job #808556) | Cod sursa (job #1162239) | Cod sursa (job #2229962)
#include <fstream>
#define Nmax 105
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[Nmax][Nmax], m, x, y, val;
void read()
{
f >> n;
for ( int i = 1; i <= n; i ++ )
for ( int j = 1; j <= n; j ++ )
f >> a[i][j];
}
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][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[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;
}