Pagini recente » Cod sursa (job #868944) | Cod sursa (job #181648) | Cod sursa (job #1915184) | Cod sursa (job #2117316) | Cod sursa (job #1818994)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int dist[101][101];
int main()
{
fin >> n;
for (int i=1; i <= n; i++)
for (int j=1; j <= n; j++)
fin << dist[i][j];
for (int k=1; k <= n; k++)
for (int i=1; i <= n; i++)
for (int j=1; j <= n; j++)
if (dist[i][k] && dist[k][j] && (dist[i][j] > dist[i][k] + dist[k][j] || !dist[i][j]) && i != j) dist[i][j] = dist[i][k] + dist[k][j];
for (int i=1; i <= n; i++) {
for (int j=1; j <= n; j++)
fout << dist[i][j] << ' ';
fout << '\n';
}
return 0;
}