Pagini recente » Cod sursa (job #2959554) | Cod sursa (job #551292) | Cod sursa (job #1963239) | Cod sursa (job #801430) | Cod sursa (job #1166566)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 1000000000;
int n, i, j, k;
int dist[101][101];
int main() {
fin >> n;
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++) {
fin >> dist[i][j];
if((dist[i][j] == 0) && (i != j)) {
dist[i][j] = INF;
}
}
}
for(k = 0; k < n; k++) {
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++) {
if (dist[i][j] > dist[i][k] + dist[k][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++) {
if(dist[i][j] == INF) {
fout << "0 ";
}else {
fout << dist[i][j] << ' ';
}
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}