Cod sursa(job #1130217)

Utilizator curajAndrei George curaj Data 28 februarie 2014 11:55:02
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <cstdio>
using namespace std;

#define NMax 101

int n;
int M[NMax][NMax];

void royfloyd()
{
    int i,j,k;
    for(k=1;k<=n;k++) for(i=1;i<=n;i++) for(j=1;j<=n;j++)
        if(M[i][k] && M[k][j] && i!=j && (M[i][j]>M[i][k]+M[k][j] || !M[i][j]))
            M[i][j]=M[i][k]+M[k][j];
}

int main()
{
    FILE *f,*g;
    f=fopen("royfloyd.in","rt");
    g=fopen("royfloyd.out","wt");

    int i,j;
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++) for(j=1;j<=n;j++) fscanf(f,"%d",&M[i][j]);
    fclose(f);

    royfloyd();

    for(i=1;i<=n;i++) {for(j=1;j<=n;j++) fprintf(g,"%d ",M[i][j]); fprintf(g,"\n");}

    fclose(g);
    return 0;
}