Cod sursa(job #1856525)

Utilizator razvanlgu31Razvan Lungu razvanlgu31 Data 25 ianuarie 2017 00:03:59
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>

using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[270][270],n,m,i,c,j,k,x,y;
int main()
{
    fin>>n;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            fin>>d[i][j];
        }
    }
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(i != j && j != k && i != k && d[i][k] && d[k][j] && (d[i][j] == 0 || d[i][j] > d[i][k] + d[k][j]) )
                    d[i][j]=d[i][k]+d[k][j];
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {

                fout<<d[i][j]<<" ";
        }
        fout<<'\n';
    }
    return 0;
}