Pagini recente » Cod sursa (job #2638247) | Cod sursa (job #1329686) | Cod sursa (job #1699841) | Cod sursa (job #2358566) | Cod sursa (job #2556852)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n, i, j, k;
int a[105][105];
int main(){
fin >> n;
for (i=1; i<=n; i++){
for (j=1; j<=n; j++){
fin >> a[i][j];
if (a[i][j] == 0 && i != j){
a[i][j] = INT_MAX;
}
}
}
for (k=1; k<=n; k++){
for (i=1; i<=n; i++){
for (j=1; j<=n; j++){
a[i][j] = min (a[i][k] + a[k][j], a[i][j]);
}
}
}
for (i=1; i<=n; i++){
for (j=1; j<=n; j++){
fout << a[i][j] << " ";
}
fout << "\n";
}
return 0;
}
//recapitulare