Cod sursa(job #1358159)

Utilizator LucacelRazvanLucacel Razvan LucacelRazvan Data 24 februarie 2015 13:44:12
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <iostream>
#include <fstream>
#define Dmax 1000001
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,mat[110][110],D[110][110];

void Citire()
{
    int i,j;
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++) fin>>mat[i][j];
}

void Init()
{
    int i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        if(i!=j)
            if(mat[i][j]!=0) D[i][j]=mat[i][j];
                else D[i][j]=Dmax;
}

void Path()
{
    Init();
    int i,j,k;
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(D[i][j]>D[i][k]+D[k][j] && D[i][k]>0 && D[k][j]>0 )
                    D[i][j]=D[i][k]+D[k][j];
}

void Afis()
{
    int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            fout<<D[i][j]<<" ";
        }
        fout<<'\n';
    }
}
int main()
{
    Citire();
    Path();
    Afis();
    return 0;
}