Cod sursa(job #949376)

Utilizator RadEmanuelRad Emanuel RadEmanuel Data 13 mai 2013 17:00:40
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<fstream>
#define DMAX 101
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,j,k,n,t[DMAX][DMAX];

int main()
{
    fin>>n;
    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            fin>>t[i][j];
    for(k=1;k<=n;++k)
        for(i=1;i<=n;++i)
            for(j=1;j<=n;++j)
                if(t[i][k] && t[k][j] && i!=j && (t[i][j]>t[i][k]+t[k][j] || !t[i][j]))
                    t[i][j]=t[i][k]+t[k][j];
    for(i=1;i<=n;++i)
    {
        for(j=1;j<=n;++j)
            fout<<t[i][j]<<" ";
        fout<<'\n';
    }
    return 0;
}