Cod sursa(job #1627029)
| Utilizator | Data | 3 martie 2016 13:40:52 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <stdio.h>
using namespace std;
int a[101][101],n,i,j,k;
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(i!=j && i!=k && j!=k)
{
if(a[i][j]>(a[i][k]+a[k][j]))
a[i][j]=(a[i][k]+a[k][j]);
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
