Pagini recente » Cod sursa (job #1520551) | Cod sursa (job #2054783) | Monitorul de evaluare | Atasamentele paginii simulare_oji2020_31_10_2019 | Cod sursa (job #330816)
Cod sursa(job #330816)
#include <iostream>
using namespace std;
int n,a[101][101];
int main(){
freopen("royfloyd.in", "r", stdin);
scanf("%d", &n);
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++){
scanf("%d ", &a[i][j]);
if (i!=j && a[i][j]==0) a[i][j]=32000;
}
fclose(stdin);
for (int k=1; k<=n; k++){
for(int i=1; i<=n; i++){
for (int j=1; j<=n; j++){
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
}
}
freopen("royfloyd.out", "w", stdout);
for (int i=1; i<=n; i++){
for (int j=1; j<=n; j++){
printf("%d ", a[i][j]);
}
printf("\n");
}
fclose(stdout);
return 0;
}