Cod sursa(job #1565386)

Utilizator BugirosRobert Bugiros Data 10 ianuarie 2016 18:12:09
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include <fstream>
using namespace std;

const int MAXN = 105;

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

int dist[MAXN][MAXN];

int n;

void citire()
{
    in >> n;
    for (int i = 1;i <= n;++i)
        for (int j = 1;j <= n;++j)
            in >> dist[i][j];
}

void floydwarshall()
{
    for (int k = 1;k <= n;++k)
        for (int i = 1;i <= n;++i)
            for (int j = 1;j <= n;++j)
            {
                if(i == j)
                    continue;
                if(dist[i][k] == 0 || dist[k][j] == 0)
                    continue;
                if (dist[i][j] > dist[i][k] + dist[k][j] || dist[i][j] == 0)
                    dist[i][j] = dist[i][k] + dist[k][j];
            }
}

void afisare()
{
    for (int i = 1;i <= n;++i)
    {
        for (int j = 1;j <= n;++j)
            out << dist[i][j] << ' ';
        out << '\n';
    }
}

int main()
{
    citire();
    floydwarshall();
    afisare();
    return 0;
}