Cod sursa(job #1351460)
Utilizator | Data | 21 februarie 2015 11:03:00 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<cstdio>
#define NMAX 120
using namespace std;
int v[NMAX][NMAX];
int main() {
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int n;
int i,j,k;
scanf("%d",&n);
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
scanf("%d",&v[i][j]);
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
for(k=1; k<=n; ++k)
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");
}
}