Cod sursa(job #941366)

Utilizator DarianDarian Sastre Darian Data 18 aprilie 2013 17:11:08
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int INF = 1000000000;

int a[101][101],n,i,j;

void citire()
{
    in>>n;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
        {
            in>>a[i][j];
            if(i!=j && a[i][j]==0)
                a[i][j] = INF;
        }
}

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

int main()
{
    citire();
    lungime_drumuri();
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=n; j++)
            if(a[i][j]!=INF) out<<a[i][j]<<' ';
            else out<<"0 ";
        out<<"\n";
    }
}