Pagini recente » Cod sursa (job #2939424) | Cod sursa (job #1890341) | Cod sursa (job #1791001) | Cod sursa (job #2583198) | Cod sursa (job #782105)
Cod sursa(job #782105)
#include<iostream>
#include<cstdio>
using namespace std;
int a[105][105],n,i,j;
void roy_floyd()
{
int i, j, k;
for(k=1;k<=n;++k)
for (i=1;i<=n;++i)
for (j=1;j<=n;++j)
if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
}
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]);
roy_floyd();
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
printf("%d ",a[i][j]);
printf("\n");
}
printf("\n");
return 0;
}