Cod sursa(job #1809353)

Utilizator Tudor_CandeaCandea Tudor Tudor_Candea Data 18 noiembrie 2016 21:01:15
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout("royfloyd.out");

int n, nod[101][101], veri[101][101];

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

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

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

    return 0;
}