Cod sursa(job #1358088)

Utilizator rogoz.bogdanRogoz Bogdan rogoz.bogdan Data 24 februarie 2015 12:48:00
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
#define MX 101
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[MX][MX]/*, a[MX][MX]*/;

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

    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][k]+a[k][j] < a[i][j]))
                {
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }

    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            fout<<a[i][j]<<' ';
        }
        fout<<'\n';
    }

    fin.close(); fout.close();
    return 0;
}