Pagini recente » Cod sursa (job #650493) | Cod sursa (job #2855978) | Cod sursa (job #881984) | Cod sursa (job #600619) | Cod sursa (job #2778023)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[103][103];
int main() {
fin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fin >> a[i][j];
}
}
fin.close();
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(i != j && a[i][k] && a[k][j] && (!a[i][j] || a[i][j] > a[i][k] + a[k][j])) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fout << a[i][j] << " ";
}
fout << "\n";
}
fout.close();
return 0;
}