Pagini recente » Cod sursa (job #1106364) | Cod sursa (job #640053) | Cod sursa (job #2681380) | Rating Tomoiaga Mihai (mtom.dot) | Cod sursa (job #1119757)
#include<cstdio>
using namespace std;
const int nmax = 105;
int n,i,j,k,a[nmax][nmax];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) scanf("%d",&a[i][j]);
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(k!=i && k!=j && i!=j && a[i][k] && a[k][j] && (a[i][k]+a[k][j]<a[i][j] || !a[i][j]))
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++,printf("\n"))
for(j=1;j<=n;j++) printf("%d ",a[i][j]);
return 0;
}