Pagini recente » Cod sursa (job #2046422) | Cod sursa (job #1873932) | Cod sursa (job #2196975) | Cod sursa (job #1797420) | Cod sursa (job #2578317)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define INF 100000000
int n, d[101][101], i, j, k, ok;
int main()
{
fin >> n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++) {
fin >> d[i][j];
if (d[i][j]==0) d[i][j] = INF;
}
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (d[i][k]!=INF && d[k][j]!=INF)
if (d[i][j]>d[i][k]+d[k][j]) d[i][j] = d[i][k]+d[k][j];
for (i=1;i<=n;i++) {
for (j=1;j<=n;j++)
if (i==j || d[i][j]==INF) fout << 0 << " ";
else fout << d[i][j] << " ";
fout << '\n';
}
return 0;
}