Cod sursa(job #1657960)
Utilizator | Bajenaru Catalin catalin9898 | Data | 20 martie 2016 22:12:30 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <cstdio>
using namespace std;
int main()
{ freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int n,i,j,k,v[111][111];
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&(v[i][j]));
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v[i][j]>v[i][k]+v[k][j])v[i][j]=v[i][k]+v[k][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{printf("%d ",(v[i][j]));}
printf("\n");
}
}