Pagini recente » Cod sursa (job #68016) | Cod sursa (job #237275) | Cod sursa (job #3131319) | Cod sursa (job #2062965) | Cod sursa (job #3231974)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int graf[101][101], n;
int main() {
fin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fin >> graf[i][j];
}
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if(i != j){
if(graf[i][k] && graf[k][j]){
int candidat = graf[i][k] + graf[k][j];
graf[i][j] = min(graf[i][j], candidat);
}
}
}
}
}
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
fout << graf[i][j] << ' ';
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}