Cod sursa(job #2317065)
Utilizator | Name Surname Username01 | Data | 12 ianuarie 2019 18:53:26 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <cstdio>
using namespace std;
FILE *f,*g;
int a[102][102];
int main()
{
f=fopen("royfloyd.in","r");
g=fopen("royfloyd.out","w");
int n;
fscanf(f,"%d",&n);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
fscanf(f,"%d",&a[i][j]);
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if((a[i][j]>a[i][k]+a[k][j] && a[i][k] && a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
fprintf(g,"%d ",a[i][j]);
fprintf(g,"\n");
}
fclose(f);
fclose(g);
return 0;
}