Cod sursa(job #1489979)

Utilizator DoraBenzoVelicu Teodora DoraBenzo Data 22 septembrie 2015 15:38:17
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream f("royfloyd.in");
ofstream o("royfloyd.out");

int n, a[1001][1001];

void cititre()
{
    f >> n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            f >> a[i][j];
}

void alg()
{
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
                for(int j=1; j<=n; j++)
                    if (a[i][k] && a[k][j] && a[i][j] > a[i][k] + a[k][j] && i != j)
                        a[i][j] = a[i][k] + a[k][j];
}

void afisare()
{
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            o<<a[i][j]<<" ";
        o<<"\n";
    }
}

int main()
{
    cititre();
    alg();
    afisare();
    return 0;
}