Pagini recente » Cod sursa (job #2806778) | Cod sursa (job #2373027) | Cod sursa (job #2302923) | Cod sursa (job #496125) | Cod sursa (job #3129902)
#include <bits/stdc++.h>
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] = 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;
}