Cod sursa(job #1915908)

Utilizator tidehyonBosoi Bogdan tidehyon Data 8 martie 2017 23:04:16
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int n, G[105][105];

void RoyFloyd()
{
    short i, j, k;
    for(k = 1; k <= n; k++)
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                if(G[i][k] && G[k][j] && ( G[i][j] > G[i][k] + G[k][j] || !G[i][j]) && i != j )
                    G[i][j] = G[i][k] + G[k][j];
}

void citire()
{
    fin >> n;
    short i, j;
    for(i = 1; i <= n; i++)
        for(j = 1; j <= n; j++)
            fin >> G[i][j];
}

void Afisare()
{
    short i, j;
    for(i = 1; i <= n; fout <<'\n' ,i++)
        for(j = 1; j <= n; fout << G[i][j++]<< " ");
}

int main()
{
    citire();
    RoyFloyd();
    Afisare();
    fin.close();
    fout.close();
    return 0;
}