Cod sursa(job #3289167)

Utilizator Cristian_NegoitaCristian Negoita Cristian_Negoita Data 25 martie 2025 22:30:02
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 105, INF = 1e9;
int a[NMAX][NMAX], n;

void roy_floyd()
{
    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]);
}

signed main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> a[i][j], a[i][j] = (a[i][j] == 0 ? INF : a[i][j]);
    roy_floyd();
    for(int i = 1; i <= n; i++, fout << "\n")
        for(int j = 1; j <= n; j++)
            fout << (i == j ? 0 : a[i][j]) << " ";

    return 0;
}