Pagini recente » Cod sursa (job #1767950) | Cod sursa (job #908122) | Cod sursa (job #2767312) | Cod sursa (job #2266481) | Cod sursa (job #407188)
Cod sursa(job #407188)
#include<stdio.h>
#define Nmax 105
int N,a[Nmax][Nmax];
void solve()
{
for(int k=1;k<=N;++k)
for(int i=1;i<=N;++i)
for(int j=1;j<=N;++j)
if (i!=j && (!a[i][j] || a[i][j] > a[i][k]+a[k][j]) && a[i][k] && a[k][j])
a[i][j] = a[i][k] + a[k][j];
for(int i=1;i<=N;++i)
{
for(int j=1;j<=N;++j)
printf("%d ",a[i][j]);
printf("\n");
}
}
void cit();
int main()
{
cit();
solve();
return 0;
}
void cit()
{
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]);
}