Cod sursa(job #1346532)

Utilizator rares96cheseliRares Cheseli rares96cheseli Data 18 februarie 2015 12:27:52
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
#include <algorithm>
using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int N, a[105][105];

int main()
{
    f>>N;
    for (int i=1; i<=N; ++i)
        for (int j=1; j<=N; ++j)
                f>>a[i][j], a[i][j]=(a[i][j]==0)*(1<<30);

    for (int k=1; k<=N; ++k)
        for (int i=1; i<=N; ++i)
            for (int j=1; j<=N; ++j)
                if (i!=j && a[i][k]*a[k][j])
                    a[i][j]=min(a[i][j], a[i][k]+a[k][j]);

    for (int i=1; i<=N; ++i && g<<'\n')
        for (int j=1; j<=N; ++j)
            g<<a[i][j]<<' ';
    return 0;
}