Cod sursa(job #1035029)

Utilizator SeekHunt1334Septimiu Bodica SeekHunt1334 Data 18 noiembrie 2013 11:46:38
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define DMAX 103
#define INF 0x3f3f3f3f

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

void Read();
void RoyFloyd();
void Write();


int G[DMAX][DMAX];
int C[DMAX][DMAX];
int n;

int main()
{
    Read();
    RoyFloyd();
    Write();


    fin.close();
    fout.close();
    return 0;
}

void RoyFloyd()
{
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                if ( G[i][j] >  G[i][k] + G[k][j] )
                    G[i][j] = G[i][k] + G[k][j];

}

void Write()
{
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            fout << G[i][j] << ' ';
        fout << '\n';
    }
}

void Read()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
        {
            fin >> G[i][j];
            if ( i != j && G[i][j] == 0 )
                G[i][j] = INF;
        }
}