Cod sursa(job #1115806)

Utilizator vlad.rusu11Rusu Vlad vlad.rusu11 Data 22 februarie 2014 01:33:25
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
#define NMax 101
using namespace std;

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

    int a[NMax][NMax], n, i, j, k;

    fin >> n;

    for(i=1 ; i<=n ; ++i)
        for(j=1 ; j<=n ; ++j)
            fin >> a[i][j];
    fin.close();

    for(k=1 ; k<=n ; ++k)
        for(i=1 ; i<=n ; ++i)
            for(j=1 ; j<=n ; ++j)
                if(a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j]) && i!=j)
                    a[i][j] = a[i][k] + a[k][j];

    for(i=1 ; i<=n ; ++i)
    {
        for(j=1 ; j<=n ; ++j)
            fout << a[i][j] << ' ';
        fout << '\n';
    }

    fout.close();
    return 0;
}