Cod sursa(job #1197643)
Utilizator | Data | 13 iunie 2014 08:45:58 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <cstdio>
using namespace std;
int a[109][109],i,j,k,n;
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(a[i][k]+a[k][j]<a[i][j])
{
a[i][j]=a[i][k]+a[k][j];
}
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(j<n)
printf("%d ",a[i][j]);
else printf("%d\n",a[i][j]);
return 0;
}