Cod sursa(job #3253539)

Utilizator AndreiNicolaescuEric Paturan AndreiNicolaescu Data 3 noiembrie 2024 11:09:56
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <fstream>

using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int INF = 0x3F3F3F3F;
const int Nmax = 101;
int a[Nmax][Nmax], n;
void roy()
{
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
int main()
{
    cin >> n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            cin >> a[i][j];
            if(i != j && a[i][j] == 0)
                a[i][j] = INF;
        }

    roy();

    for(int i=1; i<=n; i++,cout << '\n')
        for(int j=1; j<=n; j++)
            if(a[i][j] == INF)
                cout << "0";
            else
                cout << a[i][j] << " ";
    return 0;
}