Cod sursa(job #3202414)

Utilizator Costi2mFulina Costin Costi2m Data 11 februarie 2024 15:06:28
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>

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

int A[101][101], n, m, iMin, Min = 1000000, inf = 1000000;

int main()
{
    int x, y, L;
    fin >> n;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            fin >> A[i][j];
        }
    }
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(A[i][j] > A[i][k] + A[k][j]) A[i][j] = A[i][k] + A[k][j];
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++) fout << A[i][j] << " ";
        fout << endl;
    }
    return 0;
}