Pagini recente » Cod sursa (job #1733875) | Cod sursa (job #2269337) | Cod sursa (job #303486) | Cod sursa (job #1631180) | Cod sursa (job #3129904)
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main() {
int n, a[101][101];
fin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fin>> a[i][j];
}
}
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j =1; j <= n; j++) {
if(a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j] || !a[i][j]) && i != 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 << endl;
}
return 0;
}