Pagini recente » Cod sursa (job #595810) | Cod sursa (job #1113803) | Cod sursa (job #3143459) | Cod sursa (job #24182) | Cod sursa (job #1193916)
#include <fstream>
#define MAX_N 105
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int v[MAX_N][MAX_N], n;
void read ()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
f >> v[i][j];
f.close();
}
void RF ()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (v[i][k] && v[k][j] && (v[i][j] > v[i][k] + v[k][j] || !v[i][j]) && i != j)
v[i][j] = v[i][k] + v[k][j];
}
void write ()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << v[i][j] << " ";
g << "\n";
}
}
int main ()
{
read ();
RF ();
write ();
f.close();
g.close();
return 0;
}