Pagini recente » Cod sursa (job #2672686) | Cod sursa (job #2506408) | Cod sursa (job #2513307) | Cod sursa (job #475438) | Cod sursa (job #1205603)
#include <iostream>
#include <stdio.h>
using namespace std;
int p[101][101],n;
void RoyFloyd(){
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if( i != k && k != j && i != j )
if( p[i][j] > p[i][k] + p[k][j])
p[i][j] = p[i][k] + p[k][j];
}
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",&p[i][j]);
if(p[i][j] == 0)
p[i][j] = 1001;
}
RoyFloyd();
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
p[i][j] = p[i][j] == 1001 ? 0 : p[i][j];
printf("%d ",p[i][j]);
}
printf("\n");
}
return 0;
}