Pagini recente » Cod sursa (job #1394848) | Cod sursa (job #1609502) | Cod sursa (job #235586) | Cod sursa (job #2108650) | Cod sursa (job #2279833)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector<vector<int>> D(100, vector<int>(100));
const int inf = 9999999;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++){
fin >> D[i][j];
if (i != j && D[i][j] == 0)
D[i][j] = inf;
}
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
D[i][j] = min(D[i][k] + D[k][j], D[i][j]);
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++)
if (D[i][j] != inf)
fout << D[i][j] << ' ';
else
fout << 0 << ' ';
fout << '\n';
}
return 0;
}