Cod sursa(job #1370481)

Utilizator DarianCDarian Craciun DarianC Data 3 martie 2015 14:56:34
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>
#define nmax 101
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,A[nmax][nmax];
int main()
{
    int i,j,k;
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
             fin>>A[i][j];

    //Roy-Floyd
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(i!=j && A[i][k] && A[k][j] && ( A[i][j]>A[i][k]+A[k][j]) || !A[i][j]) A[i][j]=A[i][k]+A[k][j];
    // Afisare
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            fout<<A[i][j]<<' ';
        fout<<'\n';
    }

    fin.close();
    fout.close();
    return 0;
}