Pagini recente » Cod sursa (job #2444449) | Cod sursa (job #924735) | Cod sursa (job #2778727) | Cod sursa (job #3225026) | Cod sursa (job #3276763)
#include <iostream>
#include <fstream>
#include <vector>
#include <climits> // For INT_MAX
using namespace std;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
vector<vector<int>> D(n + 1, vector<int>(n + 1));
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fin >> D[i][j];
if(i != j && D[i][j] == 0) {
D[i][j] = 1e9;
}
}
}
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(D[i][k] != 1e9 && D[k][j] != 1e9)
D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(D[i][j] == 1e9) fout << 0 << ' ';
else fout << D[i][j] << ' ';
}
fout << endl;
}
return 0;
}