Pagini recente » Cod sursa (job #375941) | Borderou de evaluare (job #3192119) | Cod sursa (job #699669) | Cod sursa (job #3192117) | Cod sursa (job #3353071)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int nmax = 100;
int n;
int r[nmax + 5][nmax + 5];
int main()
{
fin>>n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fin>>r[i][j];
for (int k = 1 ; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (i == j) continue;
if (r[i][k] && r[k][j]) {
if (!r[i][j])
r[i][j] = r[i][k] + r[k][j];
else
r[i][j] = min(r[i][j], r[i][k] + r[k][j]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
fout<<r[i][j]<<' ';
fout<<'\n';
}
}