Pagini recente » Cod sursa (job #2259354) | Cod sursa (job #2180535) | Cod sursa (job #1879762) | Cod sursa (job #2576990) | Cod sursa (job #1564596)
#include <cstdio>
#define NMax 105
using namespace std;
int a[NMax][NMax];
int n;
void floyd(){
for(int nod = 1; nod <= n; nod++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if((a[i][j] > a[i][nod] + a[nod][j] || !a[i][j]) && a[i][nod] != 0 && a[nod][j] != 0 && i != j){
a[i][j] = a[i][nod] + a[nod][j];
}
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
printf("%d ",a[i][j]);
}
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
scanf("%d",&a[i][j]);
}
}
floyd();
return 0;
}