Cod sursa(job #2806873)

Utilizator andrei_laurentiuRadu Andrei-Laurentiu andrei_laurentiu Data 23 noiembrie 2021 09:29:31
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>
#define nmax 105

using namespace std;

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

int a[nmax][nmax];

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

        for(i = 1; i <= n; ++i)
        {
            for(j = 1; j <= n; ++j)
            {
                for(int k = 1; k <= n; ++k)
                {
                    if(i != j && a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][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';
    }
    return 0;
}