Cod sursa(job #1721319)
| Utilizator | Data | 25 iunie 2016 12:08:55 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <cstdio>
using namespace std;
int i,j,k,n,a[105][105];
void rf()
{
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]);
rf();
for (i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}
