Pagini recente » Cod sursa (job #2832971) | Istoria paginii runda/abvcf/clasament | Cod sursa (job #2395406) | Cod sursa (job #3134701) | Cod sursa (job #2489885)
#include <fstream>
#define INF 1000000
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, m, x, y, c, M[105][105];
void roy_floyd()
{
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (M[i][j] > M[i][k] + M[k][j])
M[i][j] = M[i][k] + M[k][j];
for(i=1;i<=n;i++)
{
for (j = 1;j<=n;j++)
{
if (M[i][j] == INF) fout << 0 << ' ';
else fout << M[i][j] << ' ';
}
fout << '\n';
}
}
int main()
{
int i, j;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
{
fin >> M[i][j];
if (!M[i][j] && i != j) M[i][j] = INF;
}
roy_floyd();
return 0;
}