Pagini recente » Cod sursa (job #1395451) | Cod sursa (job #1426693) | Cod sursa (job #2790874) | Cod sursa (job #753115) | Cod sursa (job #2668733)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int g[101][101];
int main()
{
int n; fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j) {
fin >> g[i][j];
if(g[i][j] == 0 && i != j)
g[i][j] = 1001;
}
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
for(int i = 1; i <= n; ++i, fout << "\n")
for(int j = 1; j <= n; ++j)
if(g[i][j] == 1001 && i != j)
fout << '0 ';
else
fout << g[i][j] << " ";
return 0;
}