Cod sursa(job #1603878)

Utilizator ClaudiuHHiticas Claudiu ClaudiuH Data 17 februarie 2016 20:05:35
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
///Roy
#include <iostream>
#include <fstream>
using namespace std;

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

const int inf = 0x3f3f3f3f;
int n, a[105][105];

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

int main()
{
    fin>>n;
    for(int i=1;i<=n;++i)
    for(int j=1;j<=n;++j)
    {
        fin>>a[i][j];
        if(a[i][j] == 0)
            a[i][j] = inf;
    }

    roy();

    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=n;++j)
        if(a[i][i] != inf)
            fout<<a[i][j]<<" ";
        else
            fout<<0<<" ";
        fout<<endl;
    }
    fin.close();
    fout.close();

    return 0;
}