Cod sursa(job #1649674)

Utilizator tudormaximTudor Maxim tudormaxim Data 11 martie 2016 14:33:19
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include <fstream>
using namespace std;

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

const int nmax = 105;
const int oo = (1<<30);
int a[nmax][nmax], n;

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

int main()
{
    ios_base::sync_with_stdio(false);
    int i, j;
    fin >> n;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        {
            fin >> a[i][j];
            if(a[i][j]==0) a[i][j]=oo;
        }

    roy_floyd();
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            if(a[i][j]==oo) a[i][j]=0;
            fout << a[i][j] << " ";
        }

        fout << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}