Pagini recente » Cod sursa (job #992323) | Cod sursa (job #1251537) | Cod sursa (job #2547388) | Cod sursa (job #371602) | Cod sursa (job #3274140)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, D[101][101];
int main()
{
int i, j, k;
f >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
f >> D[i][j];
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i != j && D[i][k] && D[k][j] && (D[i][k] + D[k][j] < D[i][j] || !D[i][j])) D[i][j] = D[i][k] + D[k][j];
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
g << D[i][j] << ' ';
g << '\n';
}
f.close();
g.close();
return 0;
}