Pagini recente » Cod sursa (job #455774) | Cod sursa (job #3240104) | Cod sursa (job #3165222) | Cod sursa (job #1711903) | Cod sursa (job #3127357)
#include <iostream>
#include <fstream>
using namespace std;
using llx = long long;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define NMAX 100
int m[NMAX+1][NMAX+1];
int main()
{
int n, i, j, k;
fin >> n;
for (i = 1; i<=n; i++)
for (j = 1; j<=n; j++)
fin >> m[i][j];
for (k = 1; k<=n; k++)
for (i = 1; i<=n; i++)
for (j = 1; j<=n; j++)
if (i != j && m[i][k] > 0 && m[k][j] > 0 && (m[i][j] == 0 || m[i][j] > m[i][k] + m[k][j]))
m[i][j] = m[i][k] + m[k][j];
for (i = 1; i<=n; i++, fout << '\n')
for (j = 1; j<=n; j++)
fout << m[i][j] << ' ';
return 0;
}