Cod sursa(job #1922365)

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

using namespace std;

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

#define INF INT_MAX

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

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

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

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

    floyd();

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

    return 0;
}