Cod sursa(job #1621482)

Utilizator teodoramusatoiuTeodora Musatoiu teodoramusatoiu Data 29 februarie 2016 19:22:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <iostream>
#include <fstream>
#define inf 1000000000

using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");

/*void drum(int x,int y)
{
    if(x!=y)
        drum(x,pred[x][y]);
    out<<y<<" ";
}*/

int main()
{
    int i,j,k,n,d[105][105];
    in>>n;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        {
            in>>d[i][j];
            if(d[i][j]==0 and i!=j)
                d[i][j]=inf;
        }
    //0diag princ infinit nu muchie
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(d[i][k]+d[k][j]<d[i][j])
                    d[i][j]=d[i][k]+d[k][j];
    //pred[i][j]=pred[k][j];-refacerea drumului-penultimul drum de cost minim de la i la j
    //afisare
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            if(d[i][j]==inf)
                d[i][j]=0;
            out<<d[i][j]<<" ";
        }
        out<<'\n';
    }
    return 0;
}