Pagini recente » Cod sursa (job #2198660) | Cod sursa (job #1573209) | Cod sursa (job #2467385) | Cod sursa (job #1928285) | Cod sursa (job #1365123)
#include <vector>
#include <fstream>
using namespace std;
fstream fin("royfloyd.in", ios::in);
fstream fout("royfloyd.out", ios::out);
int n, x;
int graph[105][105];
int main()
{
fin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
fin >> x,
graph[i][j] = x;
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (graph[i][k] && graph[k][j] && (i != j && !graph[i][j] || graph[i][j] > graph[i][k] + graph[k][j]))
graph[i][j] = graph[i][k] + graph[k][j];
for (int i = 0; i < n; i++, fout << endl)
for (int j = 0; j < n; j++)
fout << graph[i][j] << " ";
fin.close();
fout.close();
return 0;
}