Cod sursa(job #1922400)

Utilizator AurelGabrielAurel Gabriel AurelGabriel Data 10 martie 2017 17:19:13
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <iostream>
#include <fstream>
#include <cstring>
#include <limits.h>

using namespace std;

long int n;
long int a[100][100];
long int dist[100][100];

#define INF LONG_MAX

void floyd()
{
    memcpy(dist, a, sizeof(a));

    for(long int k = 0; k < n; k++)
        for(long int i = 0; i < n; i++)
            for(long int j = 0; j < n; j++)
                if(dist[i][k] + dist[k][j] < dist[i][j])
                    dist[i][j] = dist[i][k] + dist[k][j];
}

int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");

    f >> n;
    for(long int i = 0; i < n; i++)
        for(long int j = 0; j < n; j++)
        {
            f >> a[i][j];
            if(a[i][j] == 0 && i!=j)
                a[i][j] = INF;
        }

    floyd();

    for(long int i = 0; i < n; i++)
    {
        for(long int j = 0; j < n; j++)
            if(dist[i][j] == INF)
                g << 0 << ' ';
            else
                g << dist[i][j] << ' ';
        g << '\n';
    }

    return 0;
}