Cod sursa(job #1860424)

Utilizator GinguIonutGinguIonut GinguIonut Data 28 ianuarie 2017 00:46:22
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>

#define nMax 101

using namespace std;

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

int n;
int a[nMax][nMax];

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fin>>a[i][j];
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || (a[i][j]==0))&& i!=j)
                    a[i][j]=a[i][k]+a[k][j];
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            fout<<a[i][j]<<" ";
        fout<<'\n';
    }
}