Cod sursa(job #1146602)
| Utilizator | Data | 19 martie 2014 09:44:44 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
using namespace std;
int i,j,k,a[1001][1001],n;
FILE *f=fopen("royfloyd.in","r");
FILE *g=fopen("royfloyd.out","w");
int main()
{
fscanf(f,"%d",n);
for(i=1;i<=n;++i)
for(j=1;i<=n;++j)
fscanf(f,"%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 && a[k][j] && a[i][k] && (a[i][j]>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){
fprintf(g,"%d ",a[i][j]);}
fprintf(g," \n ");}
return 0;
}
