Cod sursa(job #1041824)

Utilizator mikeshadowIon Complot mikeshadow Data 26 noiembrie 2013 10:49:28
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.19 kb
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <string>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)

#define INF 1000001

using namespace std;

#define TEST
#ifndef TEST
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
#else
ifstream fin ("input.txt");
ofstream fout ("output.txt");
#endif

#define MAXN 200

int n;

int a[MAXN][MAXN];

void Floyd()
{
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            if (a[i][j]==0)
                a[i][j]=INF;
    for (int i=0; i<n; i++)
        a[i][i]=0;
    for (int k=0; k<n; k++)
        for (int i=0; i<n; i++)
            for (int j=0; j<n; j++)
                if ((i==j) || (k==i) || (k==j)) continue;
                else  a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}

int main()
{
    fin>>n;

    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            fin>>a[i][j];

    Floyd();

    for (int i=0; i<n; i++)
    {
        for (int j=0; j<n; j++)
            if (a[i][j]!=INF)
            fout<<a[i][j]<<' ';
            else fout<<"0 ";
        fout<<'\n';
    }

    return 0;
}