Cod sursa(job #2505615)

Utilizator casuneanu.stefanstefan casuneanu casuneanu.stefan Data 7 decembrie 2019 09:33:06
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>

using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n, m, i, x, y, cost, d[110][110], j,k ;
int main()
{
    fin>>n;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            fin>>d[i][j];

    for (k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (j=1; j<=n; j++)
                if (d[i][k] && d[k][j] && i!=j)
                    if (d[i][j]>d[i][k]+d[k][j] || d[i][j]==0)
                        d[i][j]=d[i][k]+d[k][j];
    for (i=1; i<=n; i++, fout<<'\n')
        for (j=1; j<=n; j++)
            fout<<d[i][j]<<' ';
    return 0;
}