Cod sursa(job #1616081)

Utilizator llalexandruLungu Alexandru Ioan llalexandru Data 27 februarie 2016 09:38:29
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n, i, j, k;
int M[101][101];

int main()
{
    fin>>n;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            fin>>M[i][j];

    for (k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (j=1; j<=n; j++)
            {
                if (M[i][j]>M[i][k]+M[k][j])
                    M[i][j]=M[i][k]+M[k][j];
                if (M[j][i]>M[j][k]+M[k][i])
                    M[j][i]=M[j][k]+M[k][i];
            }

    for (i=1; i<=n; i++)
    {
        for (j=1; j<=n; j++)
        {
            fout<<M[i][j]<<" ";
        }
        fout<<'\n';
    }
    return 0;
}