Cod sursa(job #874543)

Utilizator shuleavSulea Vlad shuleav Data 8 februarie 2013 19:06:34
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>

using namespace std;

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

int n,m[250][250],i,j;

void drum(int i, int j)
{
    int k=1, gasit=0;
    while((k<=n) && !gasit)
    {
        if(i!=k && j!=k && m[i][j]==m[i][k]+m[k][j])
        {
            drum(i,k);
            drum(k,j);
            gasit=1;
        }
        k++;
    }
//    if(!gasit) cout << j << " ";
}

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

int main()
{
    f >> n;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            f >> m[i][j];

    length();

    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
            g << m[i][j] << " ";
            g << '\n';
            }

    f.close();
    g.close();

    return 0;
}