Pagini recente » Cod sursa (job #1380089) | Cod sursa (job #346144) | Cod sursa (job #513325) | Cod sursa (job #1120016) | Cod sursa (job #3349623)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101];
const int INF = 10000;
int main(){
int n;
fin >> n;
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++) {
fin >> a[i][j];
if(a[i][j] == 0) a[i][j] = INF;
}
}
for(int k = 1; k<=n; k++){
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
if(i != k && a[i][j] != INF) a[i][j] = min(a[i][k] + a[k][j], a[i][j]);
}
}
}
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
if(a[i][j] == INF) a[i][j] = 0;
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}