Cod sursa(job #2159664)

Utilizator IustinPetrariuIustinian Petrariu IustinPetrariu Data 11 martie 2018 09:07:29
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.93 kb
#include <iostream>
#include <fstream>
#define nmax 101

using namespace std;

int matrice[nmax][nmax],n;
void read()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    int i,j;
    scanf("%d",&n);
    for(int i =1 ; i <= n ; i++)
        for(int j =1 ; j <= n ; j++)
            scanf("%d",&matrice[i][j]);

}
void roy_floyd()
{
    int i,j,k;
    for(int k =1 ; k <= n ; k++)
        for(int i =1; i <= n ; i++)
            for(int j = 1; j <= n ; j ++)
                if(matrice[i][k] && matrice[k][j] && (matrice[i][j] > matrice[i][k]+matrice[k][j]) || !matrice[i][j] && i !=j)
                 matrice[i][j]=matrice[i][k]+matrice[k][j];
}
void write()
{
    for(int i =1 ; i <= n ; i++)
    {
        for(int j =1 ; j <= n ; j++)
            printf("%d ",matrice[i][j]);
        printf("\n");
    }
}
int main()
{
    read();
    roy_floyd();
    write();

    return 0;
}